YES(O(1), O(1)) 0.00/0.55 YES(O(1), O(1)) 0.00/0.56 0.00/0.56 0.00/0.56
0.00/0.56 0.00/0.560 CpxTRS0.00/0.56
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))0.00/0.56
↳2 CdtProblem0.00/0.56
↳3 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))0.00/0.56
↳4 CdtProblem0.00/0.56
↳5 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID))0.00/0.56
↳6 CdtProblem0.00/0.56
↳7 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.56
↳8 BOUNDS(O(1), O(1))0.00/0.56
a__c → a__f(g(c)) 0.00/0.56
a__f(g(X)) → g(X) 0.00/0.56
mark(c) → a__c 0.00/0.56
mark(f(X)) → a__f(X) 0.00/0.56
mark(g(X)) → g(X) 0.00/0.56
a__c → c 0.00/0.56
a__f(X) → f(X)
Tuples:
a__c → a__f(g(c)) 0.00/0.56
a__c → c 0.00/0.56
a__f(g(z0)) → g(z0) 0.00/0.56
a__f(z0) → f(z0) 0.00/0.56
mark(c) → a__c 0.00/0.56
mark(f(z0)) → a__f(z0) 0.00/0.56
mark(g(z0)) → g(z0)
S tuples:
A__C → c1(A__F(g(c))) 0.00/0.56
MARK(c) → c5(A__C) 0.00/0.56
MARK(f(z0)) → c6(A__F(z0))
K tuples:none
A__C → c1(A__F(g(c))) 0.00/0.56
MARK(c) → c5(A__C) 0.00/0.56
MARK(f(z0)) → c6(A__F(z0))
a__c, a__f, mark
A__C, MARK
c1, c5, c6
Tuples:
a__c → a__f(g(c)) 0.00/0.56
a__c → c 0.00/0.56
a__f(g(z0)) → g(z0) 0.00/0.56
a__f(z0) → f(z0) 0.00/0.56
mark(c) → a__c 0.00/0.56
mark(f(z0)) → a__f(z0) 0.00/0.56
mark(g(z0)) → g(z0)
S tuples:
MARK(c) → c5(A__C) 0.00/0.56
A__C → c1 0.00/0.56
MARK(f(z0)) → c6
K tuples:none
MARK(c) → c5(A__C) 0.00/0.56
A__C → c1 0.00/0.56
MARK(f(z0)) → c6
a__c, a__f, mark
MARK, A__C
c5, c1, c6
MARK(f(z0)) → c6 0.00/0.56
A__C → c1 0.00/0.56
MARK(c) → c5(A__C)
Tuples:none
a__c → a__f(g(c)) 0.00/0.56
a__c → c 0.00/0.56
a__f(g(z0)) → g(z0) 0.00/0.56
a__f(z0) → f(z0) 0.00/0.56
mark(c) → a__c 0.00/0.56
mark(f(z0)) → a__f(z0) 0.00/0.56
mark(g(z0)) → g(z0)
a__c, a__f, mark