f(+(x, 0)) → f(x)
+(x, +(y, z)) → +(+(x, y), z)
↳ QTRS
↳ DependencyPairsProof
f(+(x, 0)) → f(x)
+(x, +(y, z)) → +(+(x, y), z)
+1(x, +(y, z)) → +1(x, y)
+1(x, +(y, z)) → +1(+(x, y), z)
F(+(x, 0)) → F(x)
f(+(x, 0)) → f(x)
+(x, +(y, z)) → +(+(x, y), z)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
+1(x, +(y, z)) → +1(x, y)
+1(x, +(y, z)) → +1(+(x, y), z)
F(+(x, 0)) → F(x)
f(+(x, 0)) → f(x)
+(x, +(y, z)) → +(+(x, y), z)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
+1(x, +(y, z)) → +1(x, y)
+1(x, +(y, z)) → +1(+(x, y), z)
f(+(x, 0)) → f(x)
+(x, +(y, z)) → +(+(x, y), z)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
+1(x, +(y, z)) → +1(x, y)
+1(x, +(y, z)) → +1(+(x, y), z)
The value of delta used in the strict ordering is 3.
POL(+1(x1, x2)) = x_2
POL(+(x1, x2)) = 3 + (2)x_1 + x_2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
f(+(x, 0)) → f(x)
+(x, +(y, z)) → +(+(x, y), z)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
F(+(x, 0)) → F(x)
f(+(x, 0)) → f(x)
+(x, +(y, z)) → +(+(x, y), z)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(+(x, 0)) → F(x)
The value of delta used in the strict ordering is 2.
POL(0) = 3
POL(F(x1)) = (2)x_1
POL(+(x1, x2)) = 1 + (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(+(x, 0)) → f(x)
+(x, +(y, z)) → +(+(x, y), z)