/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) p(s(x)) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) Proof: DP Processor: DPs: -#(s(x),s(y)) -> -#(x,y) f#(s(x),y) -> -#(y,s(x)) f#(s(x),y) -> p#(-(y,s(x))) f#(s(x),y) -> -#(s(x),y) f#(s(x),y) -> p#(-(s(x),y)) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) f#(x,s(y)) -> -#(s(y),x) f#(x,s(y)) -> p#(-(s(y),x)) f#(x,s(y)) -> -#(x,s(y)) f#(x,s(y)) -> p#(-(x,s(y))) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) TRS: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) p(s(x)) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) TDG Processor: DPs: -#(s(x),s(y)) -> -#(x,y) f#(s(x),y) -> -#(y,s(x)) f#(s(x),y) -> p#(-(y,s(x))) f#(s(x),y) -> -#(s(x),y) f#(s(x),y) -> p#(-(s(x),y)) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) f#(x,s(y)) -> -#(s(y),x) f#(x,s(y)) -> p#(-(s(y),x)) f#(x,s(y)) -> -#(x,s(y)) f#(x,s(y)) -> p#(-(x,s(y))) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) TRS: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) p(s(x)) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) graph: f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) -> f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) -> f#(x,s(y)) -> p#(-(x,s(y))) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) -> f#(x,s(y)) -> -#(x,s(y)) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) -> f#(x,s(y)) -> p#(-(s(y),x)) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) -> f#(x,s(y)) -> -#(s(y),x) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) -> f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) -> f#(s(x),y) -> p#(-(s(x),y)) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) -> f#(s(x),y) -> -#(s(x),y) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) -> f#(s(x),y) -> p#(-(y,s(x))) f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) -> f#(s(x),y) -> -#(y,s(x)) f#(s(x),y) -> -#(s(x),y) -> -#(s(x),s(y)) -> -#(x,y) f#(s(x),y) -> -#(y,s(x)) -> -#(s(x),s(y)) -> -#(x,y) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) -> f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) -> f#(x,s(y)) -> p#(-(x,s(y))) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) -> f#(x,s(y)) -> -#(x,s(y)) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) -> f#(x,s(y)) -> p#(-(s(y),x)) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) -> f#(x,s(y)) -> -#(s(y),x) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) -> f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) -> f#(s(x),y) -> p#(-(s(x),y)) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) -> f#(s(x),y) -> -#(s(x),y) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) -> f#(s(x),y) -> p#(-(y,s(x))) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) -> f#(s(x),y) -> -#(y,s(x)) f#(x,s(y)) -> -#(s(y),x) -> -#(s(x),s(y)) -> -#(x,y) f#(x,s(y)) -> -#(x,s(y)) -> -#(s(x),s(y)) -> -#(x,y) -#(s(x),s(y)) -> -#(x,y) -> -#(s(x),s(y)) -> -#(x,y) SCC Processor: #sccs: 2 #rules: 3 #arcs: 25/121 DPs: f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) TRS: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) p(s(x)) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) Usable Rule Processor: DPs: f#(s(x),y) -> f#(p(-(s(x),y)),p(-(y,s(x)))) f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) TRS: -(s(x),s(y)) -> -(x,y) -(x,0()) -> x p(s(x)) -> x Arctic Interpretation Processor: dimension: 1 usable rules: -(s(x),s(y)) -> -(x,y) -(x,0()) -> x p(s(x)) -> x interpretation: [-](x0, x1) = x0 + 8, [p](x0) = -4x0 + 0, [0] = 0, [f#](x0, x1) = -4x0 + 1, [s](x0) = 4x0 + 6 orientation: f#(s(x),y) = x + 2 >= -4x + 1 = f#(p(-(s(x),y)),p(-(y,s(x)))) f#(x,s(y)) = -4x + 1 >= -8x + 1 = f#(p(-(x,s(y))),p(-(s(y),x))) -(s(x),s(y)) = 4x + 8 >= x + 8 = -(x,y) -(x,0()) = x + 8 >= x = x p(s(x)) = x + 2 >= x = x problem: DPs: f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) TRS: -(s(x),s(y)) -> -(x,y) -(x,0()) -> x p(s(x)) -> x Restore Modifier: DPs: f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) TRS: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) p(s(x)) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) Usable Rule Processor: DPs: f#(x,s(y)) -> f#(p(-(x,s(y))),p(-(s(y),x))) TRS: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) p(s(x)) -> x Arctic Interpretation Processor: dimension: 1 usable rules: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) p(s(x)) -> x interpretation: [-](x0, x1) = 1x0 + x1 + -16, [p](x0) = -5x0 + 0, [0] = 2, [f#](x0, x1) = 2x0 + x1 + 0, [s](x0) = 5x0 + 3 orientation: f#(x,s(y)) = 2x + 5y + 3 >= -2x + 2y + 2 = f#(p(-(x,s(y))),p(-(s(y),x))) -(x,0()) = 1x + 2 >= x = x -(s(x),s(y)) = 6x + 5y + 4 >= 1x + y + -16 = -(x,y) p(s(x)) = x + 0 >= x = x problem: DPs: TRS: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) p(s(x)) -> x Qed DPs: -#(s(x),s(y)) -> -#(x,y) TRS: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) p(s(x)) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) Subterm Criterion Processor: simple projection: pi(-#) = 0 problem: DPs: TRS: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) p(s(x)) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) Qed