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