/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X and(tt(),X) -> activate(X) isList(V) -> isNeList(activate(V)) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2))) isNeList(V) -> isQid(activate(V)) isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2))) isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2))) isNePal(V) -> isQid(activate(V)) isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P))) isPal(V) -> isNePal(activate(V)) isPal(n__nil()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) isList(X) -> n__isList(X) isNeList(X) -> n__isNeList(X) isPal(X) -> n__isPal(X) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(X1,X2) activate(n__isList(X)) -> isList(X) activate(n__isNeList(X)) -> isNeList(X) activate(n__isPal(X)) -> isPal(X) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Proof: Matrix Interpretation Processor: dim=1 interpretation: [u] = 0, [o] = 0, [i] = 2, [e] = 4, [a] = 0, [n__u] = 0, [n__o] = 0, [n__i] = 2, [n__e] = 4, [n__a] = 0, [isPal](x0) = x0 + 4, [n__isPal](x0) = x0 + 4, [isNePal](x0) = x0 + 3, [n__isNeList](x0) = 4x0, [isQid](x0) = x0, [n__isList](x0) = 4x0 + 1, [n____](x0, x1) = x0 + x1 + 1, [n__nil] = 1, [isNeList](x0) = 4x0, [isList](x0) = 4x0 + 1, [activate](x0) = x0, [and](x0, x1) = x0 + x1 + 1, [tt] = 0, [nil] = 1, [__](x0, x1) = x0 + x1 + 1 orientation: __(__(X,Y),Z) = X + Y + Z + 2 >= X + Y + Z + 2 = __(X,__(Y,Z)) __(X,nil()) = X + 2 >= X = X __(nil(),X) = X + 2 >= X = X and(tt(),X) = X + 1 >= X = activate(X) isList(V) = 4V + 1 >= 4V = isNeList(activate(V)) isList(n__nil()) = 5 >= 0 = tt() isList(n____(V1,V2)) = 4V1 + 4V2 + 5 >= 4V1 + 4V2 + 3 = and(isList(activate(V1)),n__isList(activate(V2))) isNeList(V) = 4V >= V = isQid(activate(V)) isNeList(n____(V1,V2)) = 4V1 + 4V2 + 4 >= 4V1 + 4V2 + 2 = and(isList(activate(V1)),n__isNeList(activate(V2))) isNeList(n____(V1,V2)) = 4V1 + 4V2 + 4 >= 4V1 + 4V2 + 2 = and(isNeList(activate(V1)),n__isList(activate(V2))) isNePal(V) = V + 3 >= V = isQid(activate(V)) isNePal(n____(I,__(P,I))) = 2I + P + 5 >= I + P + 5 = and(isQid(activate(I)),n__isPal(activate(P))) isPal(V) = V + 4 >= V + 3 = isNePal(activate(V)) isPal(n__nil()) = 5 >= 0 = tt() isQid(n__a()) = 0 >= 0 = tt() isQid(n__e()) = 4 >= 0 = tt() isQid(n__i()) = 2 >= 0 = tt() isQid(n__o()) = 0 >= 0 = tt() isQid(n__u()) = 0 >= 0 = tt() nil() = 1 >= 1 = n__nil() __(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = n____(X1,X2) isList(X) = 4X + 1 >= 4X + 1 = n__isList(X) isNeList(X) = 4X >= 4X = n__isNeList(X) isPal(X) = X + 4 >= X + 4 = n__isPal(X) a() = 0 >= 0 = n__a() e() = 4 >= 4 = n__e() i() = 2 >= 2 = n__i() o() = 0 >= 0 = n__o() u() = 0 >= 0 = n__u() activate(n__nil()) = 1 >= 1 = nil() activate(n____(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = __(X1,X2) activate(n__isList(X)) = 4X + 1 >= 4X + 1 = isList(X) activate(n__isNeList(X)) = 4X >= 4X = isNeList(X) activate(n__isPal(X)) = X + 4 >= X + 4 = isPal(X) activate(n__a()) = 0 >= 0 = a() activate(n__e()) = 4 >= 4 = e() activate(n__i()) = 2 >= 2 = i() activate(n__o()) = 0 >= 0 = o() activate(n__u()) = 0 >= 0 = u() activate(X) = X >= X = X problem: __(__(X,Y),Z) -> __(X,__(Y,Z)) isNeList(V) -> isQid(activate(V)) isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P))) isQid(n__a()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) isList(X) -> n__isList(X) isNeList(X) -> n__isNeList(X) isPal(X) -> n__isPal(X) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(X1,X2) activate(n__isList(X)) -> isList(X) activate(n__isNeList(X)) -> isNeList(X) activate(n__isPal(X)) -> isPal(X) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Matrix Interpretation Processor: dim=1 interpretation: [u] = 0, [o] = 0, [i] = 0, [e] = 0, [a] = 2, [n__u] = 0, [n__o] = 0, [n__i] = 0, [n__e] = 0, [n__a] = 2, [isPal](x0) = 2x0, [n__isPal](x0) = 2x0, [isNePal](x0) = x0, [n__isNeList](x0) = 2x0, [isQid](x0) = 2x0, [n__isList](x0) = x0, [n____](x0, x1) = 2x0 + x1, [n__nil] = 1, [isNeList](x0) = 2x0, [isList](x0) = x0, [activate](x0) = x0, [and](x0, x1) = x0 + x1, [tt] = 0, [nil] = 1, [__](x0, x1) = 2x0 + x1 orientation: __(__(X,Y),Z) = 4X + 2Y + Z >= 2X + 2Y + Z = __(X,__(Y,Z)) isNeList(V) = 2V >= 2V = isQid(activate(V)) isNePal(n____(I,__(P,I))) = 3I + 2P >= 2I + 2P = and(isQid(activate(I)),n__isPal(activate(P))) isQid(n__a()) = 4 >= 0 = tt() isQid(n__o()) = 0 >= 0 = tt() isQid(n__u()) = 0 >= 0 = tt() nil() = 1 >= 1 = n__nil() __(X1,X2) = 2X1 + X2 >= 2X1 + X2 = n____(X1,X2) isList(X) = X >= X = n__isList(X) isNeList(X) = 2X >= 2X = n__isNeList(X) isPal(X) = 2X >= 2X = n__isPal(X) a() = 2 >= 2 = n__a() e() = 0 >= 0 = n__e() i() = 0 >= 0 = n__i() o() = 0 >= 0 = n__o() u() = 0 >= 0 = n__u() activate(n__nil()) = 1 >= 1 = nil() activate(n____(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = __(X1,X2) activate(n__isList(X)) = X >= X = isList(X) activate(n__isNeList(X)) = 2X >= 2X = isNeList(X) activate(n__isPal(X)) = 2X >= 2X = isPal(X) activate(n__a()) = 2 >= 2 = a() activate(n__e()) = 0 >= 0 = e() activate(n__i()) = 0 >= 0 = i() activate(n__o()) = 0 >= 0 = o() activate(n__u()) = 0 >= 0 = u() activate(X) = X >= X = X problem: __(__(X,Y),Z) -> __(X,__(Y,Z)) isNeList(V) -> isQid(activate(V)) isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P))) isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) isList(X) -> n__isList(X) isNeList(X) -> n__isNeList(X) isPal(X) -> n__isPal(X) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(X1,X2) activate(n__isList(X)) -> isList(X) activate(n__isNeList(X)) -> isNeList(X) activate(n__isPal(X)) -> isPal(X) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Matrix Interpretation Processor: dim=1 interpretation: [u] = 4, [o] = 0, [i] = 0, [e] = 0, [a] = 0, [n__u] = 4, [n__o] = 0, [n__i] = 0, [n__e] = 0, [n__a] = 0, [isPal](x0) = x0 + 1, [n__isPal](x0) = x0 + 1, [isNePal](x0) = 4x0 + 6, [n__isNeList](x0) = x0, [isQid](x0) = x0, [n__isList](x0) = x0 + 2, [n____](x0, x1) = x0 + x1, [n__nil] = 0, [isNeList](x0) = x0, [isList](x0) = x0 + 2, [activate](x0) = x0, [and](x0, x1) = x0 + 4x1 + 2, [tt] = 0, [nil] = 0, [__](x0, x1) = x0 + x1 orientation: __(__(X,Y),Z) = X + Y + Z >= X + Y + Z = __(X,__(Y,Z)) isNeList(V) = V >= V = isQid(activate(V)) isNePal(n____(I,__(P,I))) = 8I + 4P + 6 >= I + 4P + 6 = and(isQid(activate(I)),n__isPal(activate(P))) isQid(n__o()) = 0 >= 0 = tt() isQid(n__u()) = 4 >= 0 = tt() nil() = 0 >= 0 = n__nil() __(X1,X2) = X1 + X2 >= X1 + X2 = n____(X1,X2) isList(X) = X + 2 >= X + 2 = n__isList(X) isNeList(X) = X >= X = n__isNeList(X) isPal(X) = X + 1 >= X + 1 = n__isPal(X) a() = 0 >= 0 = n__a() e() = 0 >= 0 = n__e() i() = 0 >= 0 = n__i() o() = 0 >= 0 = n__o() u() = 4 >= 4 = n__u() activate(n__nil()) = 0 >= 0 = nil() activate(n____(X1,X2)) = X1 + X2 >= X1 + X2 = __(X1,X2) activate(n__isList(X)) = X + 2 >= X + 2 = isList(X) activate(n__isNeList(X)) = X >= X = isNeList(X) activate(n__isPal(X)) = X + 1 >= X + 1 = isPal(X) activate(n__a()) = 0 >= 0 = a() activate(n__e()) = 0 >= 0 = e() activate(n__i()) = 0 >= 0 = i() activate(n__o()) = 0 >= 0 = o() activate(n__u()) = 4 >= 4 = u() activate(X) = X >= X = X problem: __(__(X,Y),Z) -> __(X,__(Y,Z)) isNeList(V) -> isQid(activate(V)) isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P))) isQid(n__o()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) isList(X) -> n__isList(X) isNeList(X) -> n__isNeList(X) isPal(X) -> n__isPal(X) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(X1,X2) activate(n__isList(X)) -> isList(X) activate(n__isNeList(X)) -> isNeList(X) activate(n__isPal(X)) -> isPal(X) activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(n__o()) -> o() activate(n__u()) -> u() activate(X) -> X Matrix Interpretation Processor: dim=1 interpretation: [u] = 0, [o] = 5, [i] = 0, [e] = 0, [a] = 1, [n__u] = 0, [n__o] = 5, [n__i] = 0, [n__e] = 0, [n__a] = 1, [isPal](x0) = x0, [n__isPal](x0) = x0, [isNePal](x0) = 6x0 + 4, [n__isNeList](x0) = 3x0 + 4, [isQid](x0) = 2x0 + 5, [n__isList](x0) = 2x0, [n____](x0, x1) = 4x0 + x1 + 2, [n__nil] = 0, [isNeList](x0) = 6x0 + 5, [isList](x0) = 2x0, [activate](x0) = 2x0, [and](x0, x1) = 5x0 + 4x1 + 3, [tt] = 0, [nil] = 0, [__](x0, x1) = 4x0 + x1 + 2 orientation: __(__(X,Y),Z) = 16X + 4Y + Z + 10 >= 4X + 4Y + Z + 4 = __(X,__(Y,Z)) isNeList(V) = 6V + 5 >= 4V + 5 = isQid(activate(V)) isNePal(n____(I,__(P,I))) = 30I + 24P + 28 >= 20I + 8P + 28 = and(isQid(activate(I)),n__isPal(activate(P))) isQid(n__o()) = 15 >= 0 = tt() nil() = 0 >= 0 = n__nil() __(X1,X2) = 4X1 + X2 + 2 >= 4X1 + X2 + 2 = n____(X1,X2) isList(X) = 2X >= 2X = n__isList(X) isNeList(X) = 6X + 5 >= 3X + 4 = n__isNeList(X) isPal(X) = X >= X = n__isPal(X) a() = 1 >= 1 = n__a() e() = 0 >= 0 = n__e() i() = 0 >= 0 = n__i() o() = 5 >= 5 = n__o() u() = 0 >= 0 = n__u() activate(n__nil()) = 0 >= 0 = nil() activate(n____(X1,X2)) = 8X1 + 2X2 + 4 >= 4X1 + X2 + 2 = __(X1,X2) activate(n__isList(X)) = 4X >= 2X = isList(X) activate(n__isNeList(X)) = 6X + 8 >= 6X + 5 = isNeList(X) activate(n__isPal(X)) = 2X >= X = isPal(X) activate(n__a()) = 2 >= 1 = a() activate(n__e()) = 0 >= 0 = e() activate(n__i()) = 0 >= 0 = i() activate(n__o()) = 10 >= 5 = o() activate(n__u()) = 0 >= 0 = u() activate(X) = 2X >= X = X problem: isNeList(V) -> isQid(activate(V)) isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P))) nil() -> n__nil() __(X1,X2) -> n____(X1,X2) isList(X) -> n__isList(X) isPal(X) -> n__isPal(X) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n__isList(X)) -> isList(X) activate(n__isPal(X)) -> isPal(X) activate(n__e()) -> e() activate(n__i()) -> i() activate(n__u()) -> u() activate(X) -> X Matrix Interpretation Processor: dim=1 interpretation: [u] = 6, [o] = 0, [i] = 4, [e] = 7, [a] = 0, [n__u] = 4, [n__o] = 0, [n__i] = 4, [n__e] = 7, [n__a] = 0, [isPal](x0) = 3x0 + 1, [n__isPal](x0) = 3x0, [isNePal](x0) = 2x0 + 7, [isQid](x0) = x0 + 4, [n__isList](x0) = 4x0 + 2, [n____](x0, x1) = 4x0 + 2x1 + 2, [n__nil] = 0, [isNeList](x0) = 4x0 + 6, [isList](x0) = 4x0 + 4, [activate](x0) = 3x0 + 2, [and](x0, x1) = 3x0 + 2x1, [nil] = 2, [__](x0, x1) = 6x0 + 2x1 + 5 orientation: isNeList(V) = 4V + 6 >= 3V + 6 = isQid(activate(V)) isNePal(n____(I,__(P,I))) = 16I + 24P + 31 >= 9I + 18P + 30 = and(isQid(activate(I)),n__isPal(activate(P))) nil() = 2 >= 0 = n__nil() __(X1,X2) = 6X1 + 2X2 + 5 >= 4X1 + 2X2 + 2 = n____(X1,X2) isList(X) = 4X + 4 >= 4X + 2 = n__isList(X) isPal(X) = 3X + 1 >= 3X = n__isPal(X) a() = 0 >= 0 = n__a() e() = 7 >= 7 = n__e() i() = 4 >= 4 = n__i() o() = 0 >= 0 = n__o() u() = 6 >= 4 = n__u() activate(n__nil()) = 2 >= 2 = nil() activate(n__isList(X)) = 12X + 8 >= 4X + 4 = isList(X) activate(n__isPal(X)) = 9X + 2 >= 3X + 1 = isPal(X) activate(n__e()) = 23 >= 7 = e() activate(n__i()) = 14 >= 4 = i() activate(n__u()) = 14 >= 6 = u() activate(X) = 3X + 2 >= X = X problem: isNeList(V) -> isQid(activate(V)) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() activate(n__nil()) -> nil() Matrix Interpretation Processor: dim=3 interpretation: [0] [o] = [0] [0], [0] [i] = [0] [0], [0] [e] = [0] [0], [0] [a] = [0] [0], [0] [n__o] = [0] [0], [0] [n__i] = [0] [0], [0] [n__e] = [0] [0], [0] [n__a] = [0] [0], [1 1 0] [1] [isQid](x0) = [0 0 0]x0 + [0] [0 0 0] [0], [1] [n__nil] = [0] [0], [1 1 1] [1] [isNeList](x0) = [0 0 0]x0 + [0] [0 0 0] [0], [1 0 0] [activate](x0) = [0 1 1]x0 [0 0 0] , [0] [nil] = [0] [0] orientation: [1 1 1] [1] [1 1 1] [1] isNeList(V) = [0 0 0]V + [0] >= [0 0 0]V + [0] = isQid(activate(V)) [0 0 0] [0] [0 0 0] [0] [0] [0] a() = [0] >= [0] = n__a() [0] [0] [0] [0] e() = [0] >= [0] = n__e() [0] [0] [0] [0] i() = [0] >= [0] = n__i() [0] [0] [0] [0] o() = [0] >= [0] = n__o() [0] [0] [1] [0] activate(n__nil()) = [0] >= [0] = nil() [0] [0] problem: isNeList(V) -> isQid(activate(V)) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() Matrix Interpretation Processor: dim=3 interpretation: [1] [o] = [0] [0], [0] [i] = [0] [0], [0] [e] = [0] [0], [0] [a] = [0] [0], [0] [n__o] = [0] [0], [0] [n__i] = [0] [0], [0] [n__e] = [0] [0], [0] [n__a] = [0] [0], [1 0 0] [isQid](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [isNeList](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [activate](x0) = [0 0 0]x0 [0 0 0] orientation: [1 0 0] [1 0 0] isNeList(V) = [0 0 0]V >= [0 0 0]V = isQid(activate(V)) [0 0 0] [0 0 0] [0] [0] a() = [0] >= [0] = n__a() [0] [0] [0] [0] e() = [0] >= [0] = n__e() [0] [0] [0] [0] i() = [0] >= [0] = n__i() [0] [0] [1] [0] o() = [0] >= [0] = n__o() [0] [0] problem: isNeList(V) -> isQid(activate(V)) a() -> n__a() e() -> n__e() i() -> n__i() Matrix Interpretation Processor: dim=3 interpretation: [1] [i] = [0] [0], [0] [e] = [0] [0], [0] [a] = [0] [0], [0] [n__i] = [0] [0], [0] [n__e] = [0] [0], [0] [n__a] = [0] [0], [1 0 0] [1] [isQid](x0) = [0 0 0]x0 + [0] [0 0 0] [0], [1 0 0] [1] [isNeList](x0) = [0 0 0]x0 + [0] [0 0 0] [0], [1 0 0] [activate](x0) = [0 0 0]x0 [0 0 0] orientation: [1 0 0] [1] [1 0 0] [1] isNeList(V) = [0 0 0]V + [0] >= [0 0 0]V + [0] = isQid(activate(V)) [0 0 0] [0] [0 0 0] [0] [0] [0] a() = [0] >= [0] = n__a() [0] [0] [0] [0] e() = [0] >= [0] = n__e() [0] [0] [1] [0] i() = [0] >= [0] = n__i() [0] [0] problem: isNeList(V) -> isQid(activate(V)) a() -> n__a() e() -> n__e() Matrix Interpretation Processor: dim=3 interpretation: [1] [e] = [0] [0], [0] [a] = [0] [0], [0] [n__e] = [0] [0], [0] [n__a] = [0] [0], [1 0 0] [0] [isQid](x0) = [0 0 0]x0 + [1] [0 0 0] [0], [1 0 0] [0] [isNeList](x0) = [0 0 0]x0 + [1] [0 0 0] [0], [1 0 0] [activate](x0) = [0 0 0]x0 [0 0 0] orientation: [1 0 0] [0] [1 0 0] [0] isNeList(V) = [0 0 0]V + [1] >= [0 0 0]V + [1] = isQid(activate(V)) [0 0 0] [0] [0 0 0] [0] [0] [0] a() = [0] >= [0] = n__a() [0] [0] [1] [0] e() = [0] >= [0] = n__e() [0] [0] problem: isNeList(V) -> isQid(activate(V)) a() -> n__a() Matrix Interpretation Processor: dim=3 interpretation: [1] [a] = [0] [0], [0] [n__a] = [0] [0], [1 0 0] [isQid](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [isNeList](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [activate](x0) = [0 0 0]x0 [0 0 0] orientation: [1 0 0] [1 0 0] isNeList(V) = [0 0 0]V >= [0 0 0]V = isQid(activate(V)) [0 0 0] [0 0 0] [1] [0] a() = [0] >= [0] = n__a() [0] [0] problem: isNeList(V) -> isQid(activate(V)) Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [isQid](x0) = [0 0 0]x0 [0 0 0] , [1 0 1] [1] [isNeList](x0) = [0 0 0]x0 + [0] [0 0 0] [0], [1 0 0] [activate](x0) = [0 0 0]x0 [0 0 1] orientation: [1 0 1] [1] [1 0 1] isNeList(V) = [0 0 0]V + [0] >= [0 0 0]V = isQid(activate(V)) [0 0 0] [0] [0 0 0] problem: Qed