/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: f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) g(s(f(x))) -> g(f(x)) Proof: Matrix Interpretation Processor: dim=1 interpretation: [g](x0) = x0 + 6, [f](x0) = x0 + 4, [c](x0, x1) = x0 + x1 + 7, [s](x0) = x0 + 1 orientation: f(c(s(x),y)) = x + y + 12 >= x + y + 12 = f(c(x,s(y))) g(c(x,s(y))) = x + y + 14 >= x + y + 14 = g(c(s(x),y)) g(s(f(x))) = x + 11 >= x + 10 = g(f(x)) problem: f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1] [g](x0) = [0 0 0]x0 + [0] [0 0 0] [0], [1 0 1] [f](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [1 0 0] [c](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 1 0] [0 0 0] , [1 0 0] [0] [s](x0) = [0 1 0]x0 + [1] [0 0 0] [0] orientation: [1 1 0] [1 0 0] [1] [1 1 0] [1 0 0] f(c(s(x),y)) = [0 0 0]x + [0 0 0]y + [0] >= [0 0 0]x + [0 0 0]y = f(c(x,s(y))) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [1 0 0] [1 0 0] [1] [1 0 0] [1 0 0] [1] g(c(x,s(y))) = [0 0 0]x + [0 0 0]y + [0] >= [0 0 0]x + [0 0 0]y + [0] = g(c(s(x),y)) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] problem: g(c(x,s(y))) -> g(c(s(x),y)) Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [g](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [1 0 1] [c](x0, x1) = [0 1 0]x0 + [0 0 0]x1 [0 0 0] [0 1 0] , [1 0 0] [0] [s](x0) = [0 0 0]x0 + [1] [0 1 1] [0] orientation: [1 0 0] [1 1 1] [1] [1 0 0] [1 1 1] g(c(x,s(y))) = [0 0 0]x + [0 0 0]y + [0] >= [0 0 0]x + [0 0 0]y = g(c(s(x),y)) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] problem: Qed