0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 AND
↳5 QDP
↳6 UsableRulesProof (⇔)
↳7 QDP
↳8 MRRProof (⇔)
↳9 QDP
↳10 UsableRulesProof (⇔)
↳11 QDP
↳12 QDPSizeChangeProof (⇔)
↳13 TRUE
↳14 QDP
↳15 MNOCProof (⇔)
↳16 QDP
↳17 UsableRulesProof (⇔)
↳18 QDP
↳19 QReductionProof (⇔)
↳20 QDP
↳21 QDPSizeChangeProof (⇔)
↳22 TRUE
↳23 QDP
↳24 UsableRulesProof (⇔)
↳25 QDP
↳26 QDPSizeChangeProof (⇔)
↳27 TRUE
↳28 QDP
↳29 MNOCProof (⇔)
↳30 QDP
↳31 UsableRulesProof (⇔)
↳32 QDP
↳33 QReductionProof (⇔)
↳34 QDP
↳35 QDPSizeChangeProof (⇔)
↳36 TRUE
0(#) → #
+(x, #) → x
+(#, x) → x
+(0(x), 0(y)) → 0(+(x, y))
+(0(x), 1(y)) → 1(+(x, y))
+(1(x), 0(y)) → 1(+(x, y))
+(1(x), 1(y)) → 0(+(+(x, y), 1(#)))
*(#, x) → #
*(0(x), y) → 0(*(x, y))
*(1(x), y) → +(0(*(x, y)), y)
sum(nil) → 0(#)
sum(cons(x, l)) → +(x, sum(l))
prod(nil) → 1(#)
prod(cons(x, l)) → *(x, prod(l))
+1(0(x), 0(y)) → 01(+(x, y))
+1(0(x), 0(y)) → +1(x, y)
+1(0(x), 1(y)) → +1(x, y)
+1(1(x), 0(y)) → +1(x, y)
+1(1(x), 1(y)) → 01(+(+(x, y), 1(#)))
+1(1(x), 1(y)) → +1(+(x, y), 1(#))
+1(1(x), 1(y)) → +1(x, y)
*1(0(x), y) → 01(*(x, y))
*1(0(x), y) → *1(x, y)
*1(1(x), y) → +1(0(*(x, y)), y)
*1(1(x), y) → 01(*(x, y))
*1(1(x), y) → *1(x, y)
SUM(nil) → 01(#)
SUM(cons(x, l)) → +1(x, sum(l))
SUM(cons(x, l)) → SUM(l)
PROD(cons(x, l)) → *1(x, prod(l))
PROD(cons(x, l)) → PROD(l)
0(#) → #
+(x, #) → x
+(#, x) → x
+(0(x), 0(y)) → 0(+(x, y))
+(0(x), 1(y)) → 1(+(x, y))
+(1(x), 0(y)) → 1(+(x, y))
+(1(x), 1(y)) → 0(+(+(x, y), 1(#)))
*(#, x) → #
*(0(x), y) → 0(*(x, y))
*(1(x), y) → +(0(*(x, y)), y)
sum(nil) → 0(#)
sum(cons(x, l)) → +(x, sum(l))
prod(nil) → 1(#)
prod(cons(x, l)) → *(x, prod(l))
+1(0(x), 1(y)) → +1(x, y)
+1(0(x), 0(y)) → +1(x, y)
+1(1(x), 0(y)) → +1(x, y)
+1(1(x), 1(y)) → +1(+(x, y), 1(#))
+1(1(x), 1(y)) → +1(x, y)
0(#) → #
+(x, #) → x
+(#, x) → x
+(0(x), 0(y)) → 0(+(x, y))
+(0(x), 1(y)) → 1(+(x, y))
+(1(x), 0(y)) → 1(+(x, y))
+(1(x), 1(y)) → 0(+(+(x, y), 1(#)))
*(#, x) → #
*(0(x), y) → 0(*(x, y))
*(1(x), y) → +(0(*(x, y)), y)
sum(nil) → 0(#)
sum(cons(x, l)) → +(x, sum(l))
prod(nil) → 1(#)
prod(cons(x, l)) → *(x, prod(l))
+1(0(x), 1(y)) → +1(x, y)
+1(0(x), 0(y)) → +1(x, y)
+1(1(x), 0(y)) → +1(x, y)
+1(1(x), 1(y)) → +1(+(x, y), 1(#))
+1(1(x), 1(y)) → +1(x, y)
+(x, #) → x
+(#, x) → x
+(0(x), 0(y)) → 0(+(x, y))
+(0(x), 1(y)) → 1(+(x, y))
+(1(x), 0(y)) → 1(+(x, y))
+(1(x), 1(y)) → 0(+(+(x, y), 1(#)))
0(#) → #
+1(0(x), 1(y)) → +1(x, y)
+1(1(x), 0(y)) → +1(x, y)
+1(1(x), 1(y)) → +1(+(x, y), 1(#))
+1(1(x), 1(y)) → +1(x, y)
+(1(x), 1(y)) → 0(+(+(x, y), 1(#)))
POL(#) = 0
POL(+(x1, x2)) = x1 + x2
POL(+1(x1, x2)) = x1 + x2
POL(0(x1)) = x1
POL(1(x1)) = 1 + x1
+1(0(x), 0(y)) → +1(x, y)
+(x, #) → x
+(#, x) → x
+(0(x), 0(y)) → 0(+(x, y))
+(0(x), 1(y)) → 1(+(x, y))
+(1(x), 0(y)) → 1(+(x, y))
0(#) → #
+1(0(x), 0(y)) → +1(x, y)
From the DPs we obtained the following set of size-change graphs:
SUM(cons(x, l)) → SUM(l)
0(#) → #
+(x, #) → x
+(#, x) → x
+(0(x), 0(y)) → 0(+(x, y))
+(0(x), 1(y)) → 1(+(x, y))
+(1(x), 0(y)) → 1(+(x, y))
+(1(x), 1(y)) → 0(+(+(x, y), 1(#)))
*(#, x) → #
*(0(x), y) → 0(*(x, y))
*(1(x), y) → +(0(*(x, y)), y)
sum(nil) → 0(#)
sum(cons(x, l)) → +(x, sum(l))
prod(nil) → 1(#)
prod(cons(x, l)) → *(x, prod(l))
SUM(cons(x, l)) → SUM(l)
0(#) → #
+(x, #) → x
+(#, x) → x
+(0(x), 0(y)) → 0(+(x, y))
+(0(x), 1(y)) → 1(+(x, y))
+(1(x), 0(y)) → 1(+(x, y))
+(1(x), 1(y)) → 0(+(+(x, y), 1(#)))
*(#, x) → #
*(0(x), y) → 0(*(x, y))
*(1(x), y) → +(0(*(x, y)), y)
sum(nil) → 0(#)
sum(cons(x, l)) → +(x, sum(l))
prod(nil) → 1(#)
prod(cons(x, l)) → *(x, prod(l))
0(#)
+(x0, #)
+(#, x0)
+(0(x0), 0(x1))
+(0(x0), 1(x1))
+(1(x0), 0(x1))
+(1(x0), 1(x1))
*(#, x0)
*(0(x0), x1)
*(1(x0), x1)
sum(nil)
sum(cons(x0, x1))
prod(nil)
prod(cons(x0, x1))
SUM(cons(x, l)) → SUM(l)
0(#)
+(x0, #)
+(#, x0)
+(0(x0), 0(x1))
+(0(x0), 1(x1))
+(1(x0), 0(x1))
+(1(x0), 1(x1))
*(#, x0)
*(0(x0), x1)
*(1(x0), x1)
sum(nil)
sum(cons(x0, x1))
prod(nil)
prod(cons(x0, x1))
0(#)
+(x0, #)
+(#, x0)
+(0(x0), 0(x1))
+(0(x0), 1(x1))
+(1(x0), 0(x1))
+(1(x0), 1(x1))
*(#, x0)
*(0(x0), x1)
*(1(x0), x1)
sum(nil)
sum(cons(x0, x1))
prod(nil)
prod(cons(x0, x1))
SUM(cons(x, l)) → SUM(l)
From the DPs we obtained the following set of size-change graphs:
*1(1(x), y) → *1(x, y)
*1(0(x), y) → *1(x, y)
0(#) → #
+(x, #) → x
+(#, x) → x
+(0(x), 0(y)) → 0(+(x, y))
+(0(x), 1(y)) → 1(+(x, y))
+(1(x), 0(y)) → 1(+(x, y))
+(1(x), 1(y)) → 0(+(+(x, y), 1(#)))
*(#, x) → #
*(0(x), y) → 0(*(x, y))
*(1(x), y) → +(0(*(x, y)), y)
sum(nil) → 0(#)
sum(cons(x, l)) → +(x, sum(l))
prod(nil) → 1(#)
prod(cons(x, l)) → *(x, prod(l))
*1(1(x), y) → *1(x, y)
*1(0(x), y) → *1(x, y)
From the DPs we obtained the following set of size-change graphs:
PROD(cons(x, l)) → PROD(l)
0(#) → #
+(x, #) → x
+(#, x) → x
+(0(x), 0(y)) → 0(+(x, y))
+(0(x), 1(y)) → 1(+(x, y))
+(1(x), 0(y)) → 1(+(x, y))
+(1(x), 1(y)) → 0(+(+(x, y), 1(#)))
*(#, x) → #
*(0(x), y) → 0(*(x, y))
*(1(x), y) → +(0(*(x, y)), y)
sum(nil) → 0(#)
sum(cons(x, l)) → +(x, sum(l))
prod(nil) → 1(#)
prod(cons(x, l)) → *(x, prod(l))
PROD(cons(x, l)) → PROD(l)
0(#) → #
+(x, #) → x
+(#, x) → x
+(0(x), 0(y)) → 0(+(x, y))
+(0(x), 1(y)) → 1(+(x, y))
+(1(x), 0(y)) → 1(+(x, y))
+(1(x), 1(y)) → 0(+(+(x, y), 1(#)))
*(#, x) → #
*(0(x), y) → 0(*(x, y))
*(1(x), y) → +(0(*(x, y)), y)
sum(nil) → 0(#)
sum(cons(x, l)) → +(x, sum(l))
prod(nil) → 1(#)
prod(cons(x, l)) → *(x, prod(l))
0(#)
+(x0, #)
+(#, x0)
+(0(x0), 0(x1))
+(0(x0), 1(x1))
+(1(x0), 0(x1))
+(1(x0), 1(x1))
*(#, x0)
*(0(x0), x1)
*(1(x0), x1)
sum(nil)
sum(cons(x0, x1))
prod(nil)
prod(cons(x0, x1))
PROD(cons(x, l)) → PROD(l)
0(#)
+(x0, #)
+(#, x0)
+(0(x0), 0(x1))
+(0(x0), 1(x1))
+(1(x0), 0(x1))
+(1(x0), 1(x1))
*(#, x0)
*(0(x0), x1)
*(1(x0), x1)
sum(nil)
sum(cons(x0, x1))
prod(nil)
prod(cons(x0, x1))
0(#)
+(x0, #)
+(#, x0)
+(0(x0), 0(x1))
+(0(x0), 1(x1))
+(1(x0), 0(x1))
+(1(x0), 1(x1))
*(#, x0)
*(0(x0), x1)
*(1(x0), x1)
sum(nil)
sum(cons(x0, x1))
prod(nil)
prod(cons(x0, x1))
PROD(cons(x, l)) → PROD(l)
From the DPs we obtained the following set of size-change graphs: