/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__U11(tt()) -> a__U12(tt()) a__U12(tt()) -> tt() a__isNePal(__(I,__(P,I))) -> a__U11(tt()) mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil()) -> nil() mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) a__U11(X) -> U11(X) a__U12(X) -> U12(X) a__isNePal(X) -> isNePal(X) Proof: Matrix Interpretation Processor: dim=1 interpretation: [tt] = 0, [U11](x0) = x0, [a____](x0, x1) = x0 + x1, [nil] = 4, [a__U11](x0) = x0, [isNePal](x0) = x0, [__](x0, x1) = x0 + x1, [a__isNePal](x0) = x0, [U12](x0) = 2x0, [a__U12](x0) = 2x0, [mark](x0) = x0 orientation: a____(__(X,Y),Z) = X + Y + Z >= X + Y + Z = a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) = X + 4 >= X = mark(X) a____(nil(),X) = X + 4 >= X = mark(X) a__U11(tt()) = 0 >= 0 = a__U12(tt()) a__U12(tt()) = 0 >= 0 = tt() a__isNePal(__(I,__(P,I))) = 2I + P >= 0 = a__U11(tt()) mark(__(X1,X2)) = X1 + X2 >= X1 + X2 = a____(mark(X1),mark(X2)) mark(U11(X)) = X >= X = a__U11(mark(X)) mark(U12(X)) = 2X >= 2X = a__U12(mark(X)) mark(isNePal(X)) = X >= X = a__isNePal(mark(X)) mark(nil()) = 4 >= 4 = nil() mark(tt()) = 0 >= 0 = tt() a____(X1,X2) = X1 + X2 >= X1 + X2 = __(X1,X2) a__U11(X) = X >= X = U11(X) a__U12(X) = 2X >= 2X = U12(X) a__isNePal(X) = X >= X = isNePal(X) problem: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a__U11(tt()) -> a__U12(tt()) a__U12(tt()) -> tt() a__isNePal(__(I,__(P,I))) -> a__U11(tt()) mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil()) -> nil() mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) a__U11(X) -> U11(X) a__U12(X) -> U12(X) a__isNePal(X) -> isNePal(X) Matrix Interpretation Processor: dim=1 interpretation: [tt] = 0, [U11](x0) = 2x0 + 1, [a____](x0, x1) = 4x0 + x1, [nil] = 0, [a__U11](x0) = 2x0 + 1, [isNePal](x0) = x0 + 2, [__](x0, x1) = 4x0 + x1, [a__isNePal](x0) = x0 + 2, [U12](x0) = 2x0, [a__U12](x0) = 2x0, [mark](x0) = x0 orientation: a____(__(X,Y),Z) = 16X + 4Y + Z >= 4X + 4Y + Z = a____(mark(X),a____(mark(Y),mark(Z))) a__U11(tt()) = 1 >= 0 = a__U12(tt()) a__U12(tt()) = 0 >= 0 = tt() a__isNePal(__(I,__(P,I))) = 5I + 4P + 2 >= 1 = a__U11(tt()) mark(__(X1,X2)) = 4X1 + X2 >= 4X1 + X2 = a____(mark(X1),mark(X2)) mark(U11(X)) = 2X + 1 >= 2X + 1 = a__U11(mark(X)) mark(U12(X)) = 2X >= 2X = a__U12(mark(X)) mark(isNePal(X)) = X + 2 >= X + 2 = a__isNePal(mark(X)) mark(nil()) = 0 >= 0 = nil() mark(tt()) = 0 >= 0 = tt() a____(X1,X2) = 4X1 + X2 >= 4X1 + X2 = __(X1,X2) a__U11(X) = 2X + 1 >= 2X + 1 = U11(X) a__U12(X) = 2X >= 2X = U12(X) a__isNePal(X) = X + 2 >= X + 2 = isNePal(X) problem: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a__U12(tt()) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil()) -> nil() mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) a__U11(X) -> U11(X) a__U12(X) -> U12(X) a__isNePal(X) -> isNePal(X) Matrix Interpretation Processor: dim=1 interpretation: [tt] = 0, [U11](x0) = 4x0, [a____](x0, x1) = 4x0 + x1 + 4, [nil] = 0, [a__U11](x0) = 4x0, [isNePal](x0) = x0, [__](x0, x1) = 4x0 + x1 + 4, [a__isNePal](x0) = x0, [U12](x0) = 2x0 + 4, [a__U12](x0) = 2x0 + 4, [mark](x0) = x0 orientation: a____(__(X,Y),Z) = 16X + 4Y + Z + 20 >= 4X + 4Y + Z + 8 = a____(mark(X),a____(mark(Y),mark(Z))) a__U12(tt()) = 4 >= 0 = tt() mark(__(X1,X2)) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = a____(mark(X1),mark(X2)) mark(U11(X)) = 4X >= 4X = a__U11(mark(X)) mark(U12(X)) = 2X + 4 >= 2X + 4 = a__U12(mark(X)) mark(isNePal(X)) = X >= X = a__isNePal(mark(X)) mark(nil()) = 0 >= 0 = nil() mark(tt()) = 0 >= 0 = tt() a____(X1,X2) = 4X1 + X2 + 4 >= 4X1 + X2 + 4 = __(X1,X2) a__U11(X) = 4X >= 4X = U11(X) a__U12(X) = 2X + 4 >= 2X + 4 = U12(X) a__isNePal(X) = X >= X = isNePal(X) problem: mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil()) -> nil() mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) a__U11(X) -> U11(X) a__U12(X) -> U12(X) a__isNePal(X) -> isNePal(X) Matrix Interpretation Processor: dim=1 interpretation: [tt] = 0, [U11](x0) = 2x0, [a____](x0, x1) = x0 + 4x1, [nil] = 0, [a__U11](x0) = 2x0, [isNePal](x0) = 4x0 + 1, [__](x0, x1) = x0 + 4x1, [a__isNePal](x0) = 4x0 + 4, [U12](x0) = x0, [a__U12](x0) = x0, [mark](x0) = 4x0 orientation: mark(__(X1,X2)) = 4X1 + 16X2 >= 4X1 + 16X2 = a____(mark(X1),mark(X2)) mark(U11(X)) = 8X >= 8X = a__U11(mark(X)) mark(U12(X)) = 4X >= 4X = a__U12(mark(X)) mark(isNePal(X)) = 16X + 4 >= 16X + 4 = a__isNePal(mark(X)) mark(nil()) = 0 >= 0 = nil() mark(tt()) = 0 >= 0 = tt() a____(X1,X2) = X1 + 4X2 >= X1 + 4X2 = __(X1,X2) a__U11(X) = 2X >= 2X = U11(X) a__U12(X) = X >= X = U12(X) a__isNePal(X) = 4X + 4 >= 4X + 1 = isNePal(X) problem: mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil()) -> nil() mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) a__U11(X) -> U11(X) a__U12(X) -> U12(X) Matrix Interpretation Processor: dim=1 interpretation: [tt] = 0, [U11](x0) = 6x0, [a____](x0, x1) = 2x0 + 2x1, [nil] = 0, [a__U11](x0) = 6x0, [isNePal](x0) = x0 + 1, [__](x0, x1) = 2x0 + 2x1, [a__isNePal](x0) = x0 + 4, [U12](x0) = x0 + 1, [a__U12](x0) = x0 + 4, [mark](x0) = 4x0 orientation: mark(__(X1,X2)) = 8X1 + 8X2 >= 8X1 + 8X2 = a____(mark(X1),mark(X2)) mark(U11(X)) = 24X >= 24X = a__U11(mark(X)) mark(U12(X)) = 4X + 4 >= 4X + 4 = a__U12(mark(X)) mark(isNePal(X)) = 4X + 4 >= 4X + 4 = a__isNePal(mark(X)) mark(nil()) = 0 >= 0 = nil() mark(tt()) = 0 >= 0 = tt() a____(X1,X2) = 2X1 + 2X2 >= 2X1 + 2X2 = __(X1,X2) a__U11(X) = 6X >= 6X = U11(X) a__U12(X) = X + 4 >= X + 1 = U12(X) problem: mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil()) -> nil() mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) a__U11(X) -> U11(X) Matrix Interpretation Processor: dim=3 interpretation: [0] [tt] = [0] [0], [1 0 1] [0] [U11](x0) = [0 1 0]x0 + [1] [0 0 0] [0], [1 0 1] [0] [a____](x0, x1) = x0 + [0 1 0]x1 + [1] [0 0 0] [0], [0] [nil] = [0] [0], [1 0 1] [1] [a__U11](x0) = [0 1 0]x0 + [1] [0 0 0] [0], [1 1 0] [1] [isNePal](x0) = [0 0 0]x0 + [0] [0 0 0] [0], [1 0 0] [1 0 1] [0] [__](x0, x1) = [0 1 0]x0 + [0 1 0]x1 + [1] [0 0 0] [0 0 0] [0], [1 0 0] [a__isNePal](x0) = [0 0 0]x0 [0 0 0] , [1 1 0] [U12](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [a__U12](x0) = [0 0 0]x0 [0 0 0] , [1 1 0] [mark](x0) = [0 1 0]x0 [0 0 0] orientation: [1 1 0] [1 1 1] [1] [1 1 0] [1 1 0] [0] mark(__(X1,X2)) = [0 1 0]X1 + [0 1 0]X2 + [1] >= [0 1 0]X1 + [0 1 0]X2 + [1] = a____(mark(X1),mark(X2)) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 1 1] [1] [1 1 0] [1] mark(U11(X)) = [0 1 0]X + [1] >= [0 1 0]X + [1] = a__U11(mark(X)) [0 0 0] [0] [0 0 0] [0] [1 1 0] [1 1 0] mark(U12(X)) = [0 0 0]X >= [0 0 0]X = a__U12(mark(X)) [0 0 0] [0 0 0] [1 1 0] [1] [1 1 0] mark(isNePal(X)) = [0 0 0]X + [0] >= [0 0 0]X = a__isNePal(mark(X)) [0 0 0] [0] [0 0 0] [0] [0] mark(nil()) = [0] >= [0] = nil() [0] [0] [0] [0] mark(tt()) = [0] >= [0] = tt() [0] [0] [1 0 1] [0] [1 0 0] [1 0 1] [0] a____(X1,X2) = X1 + [0 1 0]X2 + [1] >= [0 1 0]X1 + [0 1 0]X2 + [1] = __(X1,X2) [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 1] [1] [1 0 1] [0] a__U11(X) = [0 1 0]X + [1] >= [0 1 0]X + [1] = U11(X) [0 0 0] [0] [0 0 0] [0] problem: mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(nil()) -> nil() mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) Matrix Interpretation Processor: dim=3 interpretation: [0] [tt] = [0] [0], [1 1 0] [1] [U11](x0) = [0 0 0]x0 + [0] [0 0 1] [0], [1 0 0] [1 0 0] [a____](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [0] [nil] = [1] [1], [1 0 0] [a__U11](x0) = [0 1 0]x0 [0 0 0] , [1 0 0] [1 0 0] [__](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [1 1 1] [U12](x0) = [0 0 0]x0 [1 1 0] , [1 0 0] [a__U12](x0) = [1 0 0]x0 [0 0 0] , [1 1 0] [mark](x0) = [0 0 1]x0 [0 1 0] orientation: [1 1 0] [1] [1 1 0] mark(U11(X)) = [0 0 1]X + [0] >= [0 0 1]X = a__U11(mark(X)) [0 0 0] [0] [0 0 0] [1 1 1] [1 1 0] mark(U12(X)) = [1 1 0]X >= [1 1 0]X = a__U12(mark(X)) [0 0 0] [0 0 0] [1] [0] mark(nil()) = [1] >= [1] = nil() [1] [1] [0] [0] mark(tt()) = [0] >= [0] = tt() [0] [0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] a____(X1,X2) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = __(X1,X2) [0 0 0] [0 0 0] [0 0 0] [0 0 0] problem: mark(U12(X)) -> a__U12(mark(X)) mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) Matrix Interpretation Processor: dim=3 interpretation: [0] [tt] = [0] [1], [1 0 0] [1 0 0] [a____](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [1 0 0] [1 0 0] [__](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [1 0 1] [1] [U12](x0) = [0 1 0]x0 + [0] [0 0 0] [0], [1 0 0] [a__U12](x0) = [0 1 0]x0 [0 0 0] , [1 0 1] [mark](x0) = [0 1 0]x0 [0 0 1] orientation: [1 0 1] [1] [1 0 1] mark(U12(X)) = [0 1 0]X + [0] >= [0 1 0]X = a__U12(mark(X)) [0 0 0] [0] [0 0 0] [1] [0] mark(tt()) = [0] >= [0] = tt() [1] [1] [1 0 0] [1 0 0] [1 0 0] [1 0 0] a____(X1,X2) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = __(X1,X2) [0 0 0] [0 0 0] [0 0 0] [0 0 0] problem: a____(X1,X2) -> __(X1,X2) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1 0 0] [1] [a____](x0, x1) = [0 0 0]x0 + [0 0 0]x1 + [0] [0 0 0] [0 0 1] [0], [1 0 0] [1 0 0] [__](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] orientation: [1 0 0] [1 0 0] [1] [1 0 0] [1 0 0] a____(X1,X2) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 = __(X1,X2) [0 0 0] [0 0 1] [0] [0 0 0] [0 0 0] problem: Qed