YES(O(1), O(n^1)) 0.00/0.77 YES(O(1), O(n^1)) 0.00/0.78 0.00/0.78 0.00/0.78
0.00/0.78 0.00/0.780 CpxRelTRS0.00/0.78
↳1 CpxRelTrsToCDT (UPPER BOUND (ID))0.00/0.78
↳2 CdtProblem0.00/0.78
↳3 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))0.00/0.78
↳4 CdtProblem0.00/0.78
↳5 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))0.00/0.78
↳6 CdtProblem0.00/0.78
↳7 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.78
↳8 BOUNDS(O(1), O(1))0.00/0.78
a(C(x1, x2), y, z) → C(a(x1, y, z), a(x2, y, y)) 0.00/0.78
a(Z, y, z) → Z 0.00/0.78
eqZList(C(x1, x2), C(y1, y2)) → and(eqZList(x1, y1), eqZList(x2, y2)) 0.00/0.78
eqZList(C(x1, x2), Z) → False 0.00/0.78
eqZList(Z, C(y1, y2)) → False 0.00/0.78
eqZList(Z, Z) → True 0.00/0.78
second(C(x1, x2)) → x2 0.00/0.78
first(C(x1, x2)) → x1
and(False, False) → False 0.00/0.78
and(True, False) → False 0.00/0.78
and(False, True) → False 0.00/0.78
and(True, True) → True
Tuples:
and(False, False) → False 0.00/0.78
and(True, False) → False 0.00/0.78
and(False, True) → False 0.00/0.78
and(True, True) → True 0.00/0.78
a(C(z0, z1), z2, z3) → C(a(z0, z2, z3), a(z1, z2, z2)) 0.00/0.78
a(Z, z0, z1) → Z 0.00/0.78
eqZList(C(z0, z1), C(z2, z3)) → and(eqZList(z0, z2), eqZList(z1, z3)) 0.00/0.78
eqZList(C(z0, z1), Z) → False 0.00/0.78
eqZList(Z, C(z0, z1)) → False 0.00/0.78
eqZList(Z, Z) → True 0.00/0.78
second(C(z0, z1)) → z1 0.00/0.78
first(C(z0, z1)) → z0
S tuples:
A(C(z0, z1), z2, z3) → c4(A(z0, z2, z3), A(z1, z2, z2)) 0.00/0.78
EQZLIST(C(z0, z1), C(z2, z3)) → c6(AND(eqZList(z0, z2), eqZList(z1, z3)), EQZLIST(z0, z2), EQZLIST(z1, z3))
K tuples:none
A(C(z0, z1), z2, z3) → c4(A(z0, z2, z3), A(z1, z2, z2)) 0.00/0.78
EQZLIST(C(z0, z1), C(z2, z3)) → c6(AND(eqZList(z0, z2), eqZList(z1, z3)), EQZLIST(z0, z2), EQZLIST(z1, z3))
a, eqZList, second, first, and
A, EQZLIST
c4, c6
Tuples:
and(False, False) → False 0.00/0.78
and(True, False) → False 0.00/0.78
and(False, True) → False 0.00/0.78
and(True, True) → True 0.00/0.78
a(C(z0, z1), z2, z3) → C(a(z0, z2, z3), a(z1, z2, z2)) 0.00/0.78
a(Z, z0, z1) → Z 0.00/0.78
eqZList(C(z0, z1), C(z2, z3)) → and(eqZList(z0, z2), eqZList(z1, z3)) 0.00/0.78
eqZList(C(z0, z1), Z) → False 0.00/0.78
eqZList(Z, C(z0, z1)) → False 0.00/0.78
eqZList(Z, Z) → True 0.00/0.78
second(C(z0, z1)) → z1 0.00/0.78
first(C(z0, z1)) → z0
S tuples:
A(C(z0, z1), z2, z3) → c4(A(z0, z2, z3), A(z1, z2, z2)) 0.00/0.78
EQZLIST(C(z0, z1), C(z2, z3)) → c6(EQZLIST(z0, z2), EQZLIST(z1, z3))
K tuples:none
A(C(z0, z1), z2, z3) → c4(A(z0, z2, z3), A(z1, z2, z2)) 0.00/0.78
EQZLIST(C(z0, z1), C(z2, z3)) → c6(EQZLIST(z0, z2), EQZLIST(z1, z3))
a, eqZList, second, first, and
A, EQZLIST
c4, c6
We considered the (Usable) Rules:none
A(C(z0, z1), z2, z3) → c4(A(z0, z2, z3), A(z1, z2, z2)) 0.00/0.78
EQZLIST(C(z0, z1), C(z2, z3)) → c6(EQZLIST(z0, z2), EQZLIST(z1, z3))
The order we found is given by the following interpretation:
A(C(z0, z1), z2, z3) → c4(A(z0, z2, z3), A(z1, z2, z2)) 0.00/0.78
EQZLIST(C(z0, z1), C(z2, z3)) → c6(EQZLIST(z0, z2), EQZLIST(z1, z3))
POL(A(x1, x2, x3)) = [3] + [2]x1 0.00/0.78
POL(C(x1, x2)) = [2] + x1 + x2 0.00/0.78
POL(EQZLIST(x1, x2)) = [3]x1 0.00/0.78
POL(c4(x1, x2)) = x1 + x2 0.00/0.78
POL(c6(x1, x2)) = x1 + x2
Tuples:
and(False, False) → False 0.00/0.78
and(True, False) → False 0.00/0.78
and(False, True) → False 0.00/0.78
and(True, True) → True 0.00/0.78
a(C(z0, z1), z2, z3) → C(a(z0, z2, z3), a(z1, z2, z2)) 0.00/0.78
a(Z, z0, z1) → Z 0.00/0.78
eqZList(C(z0, z1), C(z2, z3)) → and(eqZList(z0, z2), eqZList(z1, z3)) 0.00/0.78
eqZList(C(z0, z1), Z) → False 0.00/0.78
eqZList(Z, C(z0, z1)) → False 0.00/0.78
eqZList(Z, Z) → True 0.00/0.78
second(C(z0, z1)) → z1 0.00/0.78
first(C(z0, z1)) → z0
S tuples:none
A(C(z0, z1), z2, z3) → c4(A(z0, z2, z3), A(z1, z2, z2)) 0.00/0.78
EQZLIST(C(z0, z1), C(z2, z3)) → c6(EQZLIST(z0, z2), EQZLIST(z1, z3))
Defined Rule Symbols:
A(C(z0, z1), z2, z3) → c4(A(z0, z2, z3), A(z1, z2, z2)) 0.00/0.78
EQZLIST(C(z0, z1), C(z2, z3)) → c6(EQZLIST(z0, z2), EQZLIST(z1, z3))
a, eqZList, second, first, and
A, EQZLIST
c4, c6