/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: __(__(X,Y),Z) -> __(X,__(Y,Z)) __(X,nil()) -> X __(nil(),X) -> X U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n__nil()) -> tt() isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(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) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) 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] = 4, [e] = 0, [a] = 0, [n__u] = 0, [n__o] = 0, [n__i] = 4, [n__e] = 0, [n__a] = 0, [isNePal](x0) = x0, [isQid](x0) = x0, [n____](x0, x1) = 4x0 + x1, [n__nil] = 2, [U81](x0) = 4x0, [U72](x0) = x0, [isPal](x0) = 4x0, [U71](x0, x1) = x0 + 4x1, [U61](x0) = x0, [U52](x0) = x0, [U51](x0, x1) = 2x0 + x1, [U42](x0) = x0, [isNeList](x0) = x0, [U41](x0, x1) = x0 + x1, [U31](x0) = x0, [U22](x0) = x0, [isList](x0) = x0, [activate](x0) = x0, [U21](x0, x1) = 4x0 + x1, [U11](x0) = x0, [tt] = 0, [nil] = 2, [__](x0, x1) = 4x0 + x1 orientation: __(__(X,Y),Z) = 16X + 4Y + Z >= 4X + 4Y + Z = __(X,__(Y,Z)) __(X,nil()) = 4X + 2 >= X = X __(nil(),X) = X + 8 >= X = X U11(tt()) = 0 >= 0 = tt() U21(tt(),V2) = V2 >= V2 = U22(isList(activate(V2))) U22(tt()) = 0 >= 0 = tt() U31(tt()) = 0 >= 0 = tt() U41(tt(),V2) = V2 >= V2 = U42(isNeList(activate(V2))) U42(tt()) = 0 >= 0 = tt() U51(tt(),V2) = V2 >= V2 = U52(isList(activate(V2))) U52(tt()) = 0 >= 0 = tt() U61(tt()) = 0 >= 0 = tt() U71(tt(),P) = 4P >= 4P = U72(isPal(activate(P))) U72(tt()) = 0 >= 0 = tt() U81(tt()) = 0 >= 0 = tt() isList(V) = V >= V = U11(isNeList(activate(V))) isList(n__nil()) = 2 >= 0 = tt() isList(n____(V1,V2)) = 4V1 + V2 >= 4V1 + V2 = U21(isList(activate(V1)),activate(V2)) isNeList(V) = V >= V = U31(isQid(activate(V))) isNeList(n____(V1,V2)) = 4V1 + V2 >= V1 + V2 = U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) = 4V1 + V2 >= 2V1 + V2 = U51(isNeList(activate(V1)),activate(V2)) isNePal(V) = V >= V = U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) = 5I + 4P >= I + 4P = U71(isQid(activate(I)),activate(P)) isPal(V) = 4V >= 4V = U81(isNePal(activate(V))) isPal(n__nil()) = 8 >= 0 = tt() isQid(n__a()) = 0 >= 0 = tt() isQid(n__e()) = 0 >= 0 = tt() isQid(n__i()) = 4 >= 0 = tt() isQid(n__o()) = 0 >= 0 = tt() isQid(n__u()) = 0 >= 0 = tt() nil() = 2 >= 2 = n__nil() __(X1,X2) = 4X1 + X2 >= 4X1 + X2 = n____(X1,X2) a() = 0 >= 0 = n__a() e() = 0 >= 0 = n__e() i() = 4 >= 4 = n__i() o() = 0 >= 0 = n__o() u() = 0 >= 0 = n__u() activate(n__nil()) = 2 >= 2 = nil() activate(n____(X1,X2)) = 4X1 + X2 >= 4X1 + X2 = __(activate(X1),activate(X2)) activate(n__a()) = 0 >= 0 = a() activate(n__e()) = 0 >= 0 = e() activate(n__i()) = 4 >= 4 = 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)) U11(tt()) -> tt() U21(tt(),V2) -> U22(isList(activate(V2))) U22(tt()) -> tt() U31(tt()) -> tt() U41(tt(),V2) -> U42(isNeList(activate(V2))) U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U52(tt()) -> tt() U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) U72(tt()) -> tt() U81(tt()) -> tt() isList(V) -> U11(isNeList(activate(V))) isList(n____(V1,V2)) -> U21(isList(activate(V1)),activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) -> U51(isNeList(activate(V1)),activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) -> U71(isQid(activate(I)),activate(P)) isPal(V) -> U81(isNePal(activate(V))) isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) 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] = 6, [i] = 0, [e] = 4, [a] = 4, [n__u] = 4, [n__o] = 6, [n__i] = 0, [n__e] = 4, [n__a] = 4, [isNePal](x0) = 2x0 + 2, [isQid](x0) = x0, [n____](x0, x1) = 2x0 + x1 + 5, [n__nil] = 0, [U81](x0) = x0 + 1, [U72](x0) = 2x0, [isPal](x0) = 2x0 + 3, [U71](x0, x1) = x0 + 4x1 + 2, [U61](x0) = x0, [U52](x0) = x0 + 7, [U51](x0, x1) = 2x0 + x1, [U42](x0) = x0, [isNeList](x0) = x0, [U41](x0, x1) = x0 + x1 + 4, [U31](x0) = x0, [U22](x0) = x0, [isList](x0) = x0 + 1, [activate](x0) = x0, [U21](x0, x1) = 2x0 + x1, [U11](x0) = x0, [tt] = 4, [nil] = 0, [__](x0, x1) = 2x0 + x1 + 5 orientation: __(__(X,Y),Z) = 4X + 2Y + Z + 15 >= 2X + 2Y + Z + 10 = __(X,__(Y,Z)) U11(tt()) = 4 >= 4 = tt() U21(tt(),V2) = V2 + 8 >= V2 + 1 = U22(isList(activate(V2))) U22(tt()) = 4 >= 4 = tt() U31(tt()) = 4 >= 4 = tt() U41(tt(),V2) = V2 + 8 >= V2 = U42(isNeList(activate(V2))) U42(tt()) = 4 >= 4 = tt() U51(tt(),V2) = V2 + 8 >= V2 + 8 = U52(isList(activate(V2))) U52(tt()) = 11 >= 4 = tt() U61(tt()) = 4 >= 4 = tt() U71(tt(),P) = 4P + 6 >= 4P + 6 = U72(isPal(activate(P))) U72(tt()) = 8 >= 4 = tt() U81(tt()) = 5 >= 4 = tt() isList(V) = V + 1 >= V = U11(isNeList(activate(V))) isList(n____(V1,V2)) = 2V1 + V2 + 6 >= 2V1 + V2 + 2 = U21(isList(activate(V1)),activate(V2)) isNeList(V) = V >= V = U31(isQid(activate(V))) isNeList(n____(V1,V2)) = 2V1 + V2 + 5 >= V1 + V2 + 5 = U41(isList(activate(V1)),activate(V2)) isNeList(n____(V1,V2)) = 2V1 + V2 + 5 >= 2V1 + V2 = U51(isNeList(activate(V1)),activate(V2)) isNePal(V) = 2V + 2 >= V = U61(isQid(activate(V))) isNePal(n____(I,n____(P,I))) = 6I + 4P + 22 >= I + 4P + 2 = U71(isQid(activate(I)),activate(P)) isPal(V) = 2V + 3 >= 2V + 3 = U81(isNePal(activate(V))) isQid(n__a()) = 4 >= 4 = tt() isQid(n__e()) = 4 >= 4 = tt() isQid(n__o()) = 6 >= 4 = tt() isQid(n__u()) = 4 >= 4 = tt() nil() = 0 >= 0 = n__nil() __(X1,X2) = 2X1 + X2 + 5 >= 2X1 + X2 + 5 = n____(X1,X2) a() = 4 >= 4 = n__a() e() = 4 >= 4 = n__e() i() = 0 >= 0 = n__i() o() = 6 >= 6 = n__o() u() = 4 >= 4 = n__u() activate(n__nil()) = 0 >= 0 = nil() activate(n____(X1,X2)) = 2X1 + X2 + 5 >= 2X1 + X2 + 5 = __(activate(X1),activate(X2)) activate(n__a()) = 4 >= 4 = a() activate(n__e()) = 4 >= 4 = e() activate(n__i()) = 0 >= 0 = i() activate(n__o()) = 6 >= 6 = o() activate(n__u()) = 4 >= 4 = u() activate(X) = X >= X = X problem: U11(tt()) -> tt() U22(tt()) -> tt() U31(tt()) -> tt() U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U61(tt()) -> tt() U71(tt(),P) -> U72(isPal(activate(P))) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1,V2)) -> U41(isList(activate(V1)),activate(V2)) isPal(V) -> U81(isNePal(activate(V))) isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) 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] = 6, [i] = 0, [e] = 1, [a] = 4, [n__u] = 4, [n__o] = 6, [n__i] = 0, [n__e] = 1, [n__a] = 4, [isNePal](x0) = x0, [isQid](x0) = x0 + 1, [n____](x0, x1) = x0 + x1 + 4, [n__nil] = 0, [U81](x0) = x0, [U72](x0) = 4x0, [isPal](x0) = x0, [U71](x0, x1) = 4x0 + 4x1, [U61](x0) = 4x0 + 4, [U52](x0) = 2x0, [U51](x0, x1) = 2x0 + 3x1 + 6, [U42](x0) = 4x0, [isNeList](x0) = x0 + 1, [U41](x0, x1) = x0 + x1 + 1, [U31](x0) = x0, [U22](x0) = 2x0, [isList](x0) = x0 + 3, [activate](x0) = x0, [U11](x0) = 4x0 + 7, [tt] = 0, [nil] = 0, [__](x0, x1) = x0 + x1 + 4 orientation: U11(tt()) = 7 >= 0 = tt() U22(tt()) = 0 >= 0 = tt() U31(tt()) = 0 >= 0 = tt() U42(tt()) = 0 >= 0 = tt() U51(tt(),V2) = 3V2 + 6 >= 2V2 + 6 = U52(isList(activate(V2))) U61(tt()) = 4 >= 0 = tt() U71(tt(),P) = 4P >= 4P = U72(isPal(activate(P))) isNeList(V) = V + 1 >= V + 1 = U31(isQid(activate(V))) isNeList(n____(V1,V2)) = V1 + V2 + 5 >= V1 + V2 + 4 = U41(isList(activate(V1)),activate(V2)) isPal(V) = V >= V = U81(isNePal(activate(V))) isQid(n__a()) = 5 >= 0 = tt() isQid(n__e()) = 2 >= 0 = tt() isQid(n__u()) = 5 >= 0 = tt() nil() = 0 >= 0 = n__nil() __(X1,X2) = X1 + X2 + 4 >= X1 + X2 + 4 = n____(X1,X2) a() = 4 >= 4 = n__a() e() = 1 >= 1 = n__e() i() = 0 >= 0 = n__i() o() = 6 >= 6 = n__o() u() = 4 >= 4 = n__u() activate(n__nil()) = 0 >= 0 = nil() activate(n____(X1,X2)) = X1 + X2 + 4 >= X1 + X2 + 4 = __(activate(X1),activate(X2)) activate(n__a()) = 4 >= 4 = a() activate(n__e()) = 1 >= 1 = e() activate(n__i()) = 0 >= 0 = i() activate(n__o()) = 6 >= 6 = o() activate(n__u()) = 4 >= 4 = u() activate(X) = X >= X = X problem: U22(tt()) -> tt() U31(tt()) -> tt() U42(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U71(tt(),P) -> U72(isPal(activate(P))) isNeList(V) -> U31(isQid(activate(V))) isPal(V) -> U81(isNePal(activate(V))) nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) 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] = 4, [i] = 0, [e] = 0, [a] = 0, [n__u] = 0, [n__o] = 4, [n__i] = 0, [n__e] = 0, [n__a] = 0, [isNePal](x0) = x0, [isQid](x0) = x0, [n____](x0, x1) = 4x0 + 2x1, [n__nil] = 4, [U81](x0) = x0, [U72](x0) = 4x0 + 6, [isPal](x0) = x0, [U71](x0, x1) = 4x0 + 4x1 + 6, [U52](x0) = x0 + 2, [U51](x0, x1) = 4x0 + 4x1 + 2, [U42](x0) = 2x0 + 1, [isNeList](x0) = x0 + 2, [U31](x0) = x0, [U22](x0) = 2x0 + 1, [isList](x0) = 4x0, [activate](x0) = x0, [tt] = 0, [nil] = 4, [__](x0, x1) = 4x0 + 2x1 orientation: U22(tt()) = 1 >= 0 = tt() U31(tt()) = 0 >= 0 = tt() U42(tt()) = 1 >= 0 = tt() U51(tt(),V2) = 4V2 + 2 >= 4V2 + 2 = U52(isList(activate(V2))) U71(tt(),P) = 4P + 6 >= 4P + 6 = U72(isPal(activate(P))) isNeList(V) = V + 2 >= V = U31(isQid(activate(V))) isPal(V) = V >= V = U81(isNePal(activate(V))) nil() = 4 >= 4 = n__nil() __(X1,X2) = 4X1 + 2X2 >= 4X1 + 2X2 = n____(X1,X2) a() = 0 >= 0 = n__a() e() = 0 >= 0 = n__e() i() = 0 >= 0 = n__i() o() = 4 >= 4 = n__o() u() = 0 >= 0 = n__u() activate(n__nil()) = 4 >= 4 = nil() activate(n____(X1,X2)) = 4X1 + 2X2 >= 4X1 + 2X2 = __(activate(X1),activate(X2)) activate(n__a()) = 0 >= 0 = a() activate(n__e()) = 0 >= 0 = e() activate(n__i()) = 0 >= 0 = i() activate(n__o()) = 4 >= 4 = o() activate(n__u()) = 0 >= 0 = u() activate(X) = X >= X = X problem: U31(tt()) -> tt() U51(tt(),V2) -> U52(isList(activate(V2))) U71(tt(),P) -> U72(isPal(activate(P))) isPal(V) -> U81(isNePal(activate(V))) nil() -> n__nil() __(X1,X2) -> n____(X1,X2) a() -> n__a() e() -> n__e() i() -> n__i() o() -> n__o() u() -> n__u() activate(n__nil()) -> nil() activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) 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] = 5, [i] = 4, [e] = 4, [a] = 4, [n__u] = 4, [n__o] = 4, [n__i] = 2, [n__e] = 2, [n__a] = 2, [isNePal](x0) = x0 + 1, [n____](x0, x1) = x0 + x1 + 5, [n__nil] = 4, [U81](x0) = x0, [U72](x0) = x0 + 7, [isPal](x0) = 2x0 + 1, [U71](x0, x1) = 3x0 + 4x1, [U52](x0) = x0, [U51](x0, x1) = x0 + 6x1 + 2, [U31](x0) = 5x0, [isList](x0) = 2x0, [activate](x0) = 2x0, [tt] = 4, [nil] = 5, [__](x0, x1) = x0 + x1 + 6 orientation: U31(tt()) = 20 >= 4 = tt() U51(tt(),V2) = 6V2 + 6 >= 4V2 = U52(isList(activate(V2))) U71(tt(),P) = 4P + 12 >= 4P + 8 = U72(isPal(activate(P))) isPal(V) = 2V + 1 >= 2V + 1 = U81(isNePal(activate(V))) nil() = 5 >= 4 = n__nil() __(X1,X2) = X1 + X2 + 6 >= X1 + X2 + 5 = n____(X1,X2) a() = 4 >= 2 = n__a() e() = 4 >= 2 = n__e() i() = 4 >= 2 = n__i() o() = 5 >= 4 = n__o() u() = 4 >= 4 = n__u() activate(n__nil()) = 8 >= 5 = nil() activate(n____(X1,X2)) = 2X1 + 2X2 + 10 >= 2X1 + 2X2 + 6 = __(activate(X1),activate(X2)) activate(n__a()) = 4 >= 4 = a() activate(n__e()) = 4 >= 4 = e() activate(n__i()) = 4 >= 4 = i() activate(n__o()) = 8 >= 5 = o() activate(n__u()) = 8 >= 4 = u() activate(X) = 2X >= X = X problem: isPal(V) -> U81(isNePal(activate(V))) u() -> n__u() activate(n__a()) -> a() activate(n__e()) -> e() activate(n__i()) -> i() activate(X) -> X Matrix Interpretation Processor: dim=3 interpretation: [0] [u] = [0] [0], [0] [i] = [0] [0], [0] [e] = [0] [0], [0] [a] = [0] [0], [0] [n__u] = [0] [0], [1] [n__i] = [0] [0], [1] [n__e] = [0] [0], [1] [n__a] = [0] [0], [1 0 0] [isNePal](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [U81](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [isPal](x0) = [0 0 0]x0 [0 0 0] , [activate](x0) = x0 orientation: [1 0 0] [1 0 0] isPal(V) = [0 0 0]V >= [0 0 0]V = U81(isNePal(activate(V))) [0 0 0] [0 0 0] [0] [0] u() = [0] >= [0] = n__u() [0] [0] [1] [0] activate(n__a()) = [0] >= [0] = a() [0] [0] [1] [0] activate(n__e()) = [0] >= [0] = e() [0] [0] [1] [0] activate(n__i()) = [0] >= [0] = i() [0] [0] activate(X) = X >= X = X problem: isPal(V) -> U81(isNePal(activate(V))) u() -> n__u() activate(X) -> X Matrix Interpretation Processor: dim=3 interpretation: [1] [u] = [0] [0], [0] [n__u] = [0] [0], [1 0 0] [0] [isNePal](x0) = [0 0 0]x0 + [0] [0 1 0] [1], [1 0 0] [U81](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [0] [isPal](x0) = [0 0 0]x0 + [0] [0 0 0] [1], [activate](x0) = x0 orientation: [1 0 0] [0] [1 0 0] isPal(V) = [0 0 0]V + [0] >= [0 0 0]V = U81(isNePal(activate(V))) [0 0 0] [1] [0 0 0] [1] [0] u() = [0] >= [0] = n__u() [0] [0] activate(X) = X >= X = X problem: isPal(V) -> U81(isNePal(activate(V))) activate(X) -> X Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [isNePal](x0) = [0 0 1]x0 [0 0 0] , [1 1 0] [U81](x0) = [0 0 0]x0 [0 0 0] , [1 1 1] [1] [isPal](x0) = [0 0 0]x0 + [1] [0 0 0] [1], [activate](x0) = x0 orientation: [1 1 1] [1] [1 0 1] isPal(V) = [0 0 0]V + [1] >= [0 0 0]V = U81(isNePal(activate(V))) [0 0 0] [1] [0 0 0] activate(X) = X >= X = X problem: activate(X) -> X Matrix Interpretation Processor: dim=3 interpretation: [1] [activate](x0) = x0 + [0] [0] orientation: [1] activate(X) = X + [0] >= X = X [0] problem: Qed