/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: a(a(x1)) -> x1 a(b(x1)) -> x1 b(b(a(x1))) -> a(b(a(b(b(x1))))) Proof: DP Processor: DPs: b#(b(a(x1))) -> b#(x1) b#(b(a(x1))) -> b#(b(x1)) b#(b(a(x1))) -> a#(b(b(x1))) b#(b(a(x1))) -> b#(a(b(b(x1)))) b#(b(a(x1))) -> a#(b(a(b(b(x1))))) TRS: a(a(x1)) -> x1 a(b(x1)) -> x1 b(b(a(x1))) -> a(b(a(b(b(x1))))) TDG Processor: DPs: b#(b(a(x1))) -> b#(x1) b#(b(a(x1))) -> b#(b(x1)) b#(b(a(x1))) -> a#(b(b(x1))) b#(b(a(x1))) -> b#(a(b(b(x1)))) b#(b(a(x1))) -> a#(b(a(b(b(x1))))) TRS: a(a(x1)) -> x1 a(b(x1)) -> x1 b(b(a(x1))) -> a(b(a(b(b(x1))))) graph: b#(b(a(x1))) -> b#(b(x1)) -> b#(b(a(x1))) -> a#(b(a(b(b(x1))))) b#(b(a(x1))) -> b#(b(x1)) -> b#(b(a(x1))) -> b#(a(b(b(x1)))) b#(b(a(x1))) -> b#(b(x1)) -> b#(b(a(x1))) -> a#(b(b(x1))) b#(b(a(x1))) -> b#(b(x1)) -> b#(b(a(x1))) -> b#(b(x1)) b#(b(a(x1))) -> b#(b(x1)) -> b#(b(a(x1))) -> b#(x1) b#(b(a(x1))) -> b#(a(b(b(x1)))) -> b#(b(a(x1))) -> a#(b(a(b(b(x1))))) b#(b(a(x1))) -> b#(a(b(b(x1)))) -> b#(b(a(x1))) -> b#(a(b(b(x1)))) b#(b(a(x1))) -> b#(a(b(b(x1)))) -> b#(b(a(x1))) -> a#(b(b(x1))) b#(b(a(x1))) -> b#(a(b(b(x1)))) -> b#(b(a(x1))) -> b#(b(x1)) b#(b(a(x1))) -> b#(a(b(b(x1)))) -> b#(b(a(x1))) -> b#(x1) b#(b(a(x1))) -> b#(x1) -> b#(b(a(x1))) -> a#(b(a(b(b(x1))))) b#(b(a(x1))) -> b#(x1) -> b#(b(a(x1))) -> b#(a(b(b(x1)))) b#(b(a(x1))) -> b#(x1) -> b#(b(a(x1))) -> a#(b(b(x1))) b#(b(a(x1))) -> b#(x1) -> b#(b(a(x1))) -> b#(b(x1)) b#(b(a(x1))) -> b#(x1) -> b#(b(a(x1))) -> b#(x1) SCC Processor: #sccs: 1 #rules: 3 #arcs: 15/25 DPs: b#(b(a(x1))) -> b#(b(x1)) b#(b(a(x1))) -> b#(x1) b#(b(a(x1))) -> b#(a(b(b(x1)))) TRS: a(a(x1)) -> x1 a(b(x1)) -> x1 b(b(a(x1))) -> a(b(a(b(b(x1))))) Arctic Interpretation Processor: dimension: 2 usable rules: a(a(x1)) -> x1 a(b(x1)) -> x1 b(b(a(x1))) -> a(b(a(b(b(x1))))) interpretation: [b#](x0) = [1 0]x0 + [0], [-& 0 ] [0] [b](x0) = [0 -&]x0 + [0], [-& 0 ] [0] [a](x0) = [0 1 ]x0 + [1] orientation: b#(b(a(x1))) = [1 2]x1 + [2] >= [0 1]x1 + [1] = b#(b(x1)) b#(b(a(x1))) = [1 2]x1 + [2] >= [1 0]x1 + [0] = b#(x1) b#(b(a(x1))) = [1 2]x1 + [2] >= [0 1]x1 + [1] = b#(a(b(b(x1)))) [0 1] [1] a(a(x1)) = [1 2]x1 + [2] >= x1 = x1 [0 -&] [0] a(b(x1)) = [1 0 ]x1 + [1] >= x1 = x1 [-& 0 ] [0] [-& 0 ] [0] b(b(a(x1))) = [0 1 ]x1 + [1] >= [0 1 ]x1 + [1] = a(b(a(b(b(x1))))) problem: DPs: b#(b(a(x1))) -> b#(x1) TRS: a(a(x1)) -> x1 a(b(x1)) -> x1 b(b(a(x1))) -> a(b(a(b(b(x1))))) Restore Modifier: DPs: b#(b(a(x1))) -> b#(x1) TRS: a(a(x1)) -> x1 a(b(x1)) -> x1 b(b(a(x1))) -> a(b(a(b(b(x1))))) EDG Processor: DPs: b#(b(a(x1))) -> b#(x1) TRS: a(a(x1)) -> x1 a(b(x1)) -> x1 b(b(a(x1))) -> a(b(a(b(b(x1))))) graph: b#(b(a(x1))) -> b#(x1) -> b#(b(a(x1))) -> b#(x1) Usable Rule Processor: DPs: b#(b(a(x1))) -> b#(x1) TRS: Arctic Interpretation Processor: dimension: 3 usable rules: interpretation: [b#](x0) = [0 -& -&]x0, [0 -& 1 ] [0] [b](x0) = [-& -& 1 ]x0 + [0] [0 -& -&] [0], [0 -& 0 ] [0] [a](x0) = [1 1 1 ]x0 + [1] [1 0 -&] [1] orientation: b#(b(a(x1))) = [2 1 0]x1 + [2] >= [0 -& -&]x1 = b#(x1) problem: DPs: TRS: Qed