/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: a(x1) -> b(c(b(x1))) a(b(x1)) -> x1 c(c(b(x1))) -> a(c(c(x1))) Proof: DP Processor: DPs: a#(x1) -> c#(b(x1)) c#(c(b(x1))) -> c#(x1) c#(c(b(x1))) -> c#(c(x1)) c#(c(b(x1))) -> a#(c(c(x1))) TRS: a(x1) -> b(c(b(x1))) a(b(x1)) -> x1 c(c(b(x1))) -> a(c(c(x1))) TDG Processor: DPs: a#(x1) -> c#(b(x1)) c#(c(b(x1))) -> c#(x1) c#(c(b(x1))) -> c#(c(x1)) c#(c(b(x1))) -> a#(c(c(x1))) TRS: a(x1) -> b(c(b(x1))) a(b(x1)) -> x1 c(c(b(x1))) -> a(c(c(x1))) graph: c#(c(b(x1))) -> c#(c(x1)) -> c#(c(b(x1))) -> a#(c(c(x1))) c#(c(b(x1))) -> c#(c(x1)) -> c#(c(b(x1))) -> c#(c(x1)) c#(c(b(x1))) -> c#(c(x1)) -> c#(c(b(x1))) -> c#(x1) c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> a#(c(c(x1))) c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> c#(c(x1)) c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> c#(x1) c#(c(b(x1))) -> a#(c(c(x1))) -> a#(x1) -> c#(b(x1)) a#(x1) -> c#(b(x1)) -> c#(c(b(x1))) -> a#(c(c(x1))) a#(x1) -> c#(b(x1)) -> c#(c(b(x1))) -> c#(c(x1)) a#(x1) -> c#(b(x1)) -> c#(c(b(x1))) -> c#(x1) EDG Processor: DPs: a#(x1) -> c#(b(x1)) c#(c(b(x1))) -> c#(x1) c#(c(b(x1))) -> c#(c(x1)) c#(c(b(x1))) -> a#(c(c(x1))) TRS: a(x1) -> b(c(b(x1))) a(b(x1)) -> x1 c(c(b(x1))) -> a(c(c(x1))) graph: c#(c(b(x1))) -> c#(c(x1)) -> c#(c(b(x1))) -> c#(x1) c#(c(b(x1))) -> c#(c(x1)) -> c#(c(b(x1))) -> c#(c(x1)) c#(c(b(x1))) -> c#(c(x1)) -> c#(c(b(x1))) -> a#(c(c(x1))) c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> c#(x1) c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> c#(c(x1)) c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> a#(c(c(x1))) c#(c(b(x1))) -> a#(c(c(x1))) -> a#(x1) -> c#(b(x1)) SCC Processor: #sccs: 1 #rules: 2 #arcs: 7/16 DPs: c#(c(b(x1))) -> c#(c(x1)) c#(c(b(x1))) -> c#(x1) TRS: a(x1) -> b(c(b(x1))) a(b(x1)) -> x1 c(c(b(x1))) -> a(c(c(x1))) Arctic Interpretation Processor: dimension: 2 usable rules: a(x1) -> b(c(b(x1))) a(b(x1)) -> x1 c(c(b(x1))) -> a(c(c(x1))) interpretation: [c#](x0) = [-& 0 ]x0 + [0], [-& 0 ] [0] [c](x0) = [0 -&]x0 + [0], [2 0 ] [3] [b](x0) = [0 -&]x0 + [0], [2 0 ] [3] [a](x0) = [0 -&]x0 + [0] orientation: c#(c(b(x1))) = [2 0]x1 + [3] >= [0 -&]x1 + [0] = c#(c(x1)) c#(c(b(x1))) = [2 0]x1 + [3] >= [-& 0 ]x1 + [0] = c#(x1) [2 0 ] [3] [2 0 ] [3] a(x1) = [0 -&]x1 + [0] >= [0 -&]x1 + [0] = b(c(b(x1))) [4 2] [5] a(b(x1)) = [2 0]x1 + [3] >= x1 = x1 [2 0 ] [3] [2 0 ] [3] c(c(b(x1))) = [0 -&]x1 + [0] >= [0 -&]x1 + [0] = a(c(c(x1))) problem: DPs: c#(c(b(x1))) -> c#(x1) TRS: a(x1) -> b(c(b(x1))) a(b(x1)) -> x1 c(c(b(x1))) -> a(c(c(x1))) Restore Modifier: DPs: c#(c(b(x1))) -> c#(x1) TRS: a(x1) -> b(c(b(x1))) a(b(x1)) -> x1 c(c(b(x1))) -> a(c(c(x1))) EDG Processor: DPs: c#(c(b(x1))) -> c#(x1) TRS: a(x1) -> b(c(b(x1))) a(b(x1)) -> x1 c(c(b(x1))) -> a(c(c(x1))) graph: c#(c(b(x1))) -> c#(x1) -> c#(c(b(x1))) -> c#(x1) Usable Rule Processor: DPs: c#(c(b(x1))) -> c#(x1) TRS: Arctic Interpretation Processor: dimension: 3 usable rules: interpretation: [c#](x0) = [0 -& -&]x0, [0 -& 1 ] [0] [c](x0) = [-& -& 1 ]x0 + [0] [0 -& -&] [0], [0 -& 0 ] [0] [b](x0) = [1 1 1 ]x0 + [1] [1 0 -&] [1] orientation: c#(c(b(x1))) = [2 1 0]x1 + [2] >= [0 -& -&]x1 = c#(x1) problem: DPs: TRS: Qed