/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(b(x1))) -> b(a(x1)) b(a(a(x1))) -> a(a(a(b(x1)))) a(c(x1)) -> c(b(x1)) Proof: String Reversal Processor: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) DP Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> b#(a(a(a(x1)))) c#(a(x1)) -> c#(x1) c#(a(x1)) -> b#(c(x1)) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) TDG Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> b#(a(a(a(x1)))) c#(a(x1)) -> c#(x1) c#(a(x1)) -> b#(c(x1)) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) graph: c#(a(x1)) -> c#(x1) -> c#(a(x1)) -> b#(c(x1)) c#(a(x1)) -> c#(x1) -> c#(a(x1)) -> c#(x1) c#(a(x1)) -> b#(c(x1)) -> b#(a(a(x1))) -> a#(b(x1)) c#(a(x1)) -> b#(c(x1)) -> b#(a(a(x1))) -> b#(x1) a#(a(b(x1))) -> a#(a(a(x1))) -> a#(a(b(x1))) -> b#(a(a(a(x1)))) a#(a(b(x1))) -> a#(a(a(x1))) -> a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> a#(a(a(x1))) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(a(x1))) -> a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> b#(a(a(a(x1)))) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> b#(a(a(a(x1)))) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> b#(a(a(a(x1)))) -> b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> b#(a(a(a(x1)))) -> b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) -> a#(a(b(x1))) -> b#(a(a(a(x1)))) b#(a(a(x1))) -> a#(b(x1)) -> a#(a(b(x1))) -> a#(a(a(x1))) b#(a(a(x1))) -> a#(b(x1)) -> a#(a(b(x1))) -> a#(a(x1)) b#(a(a(x1))) -> a#(b(x1)) -> a#(a(b(x1))) -> a#(x1) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> a#(b(x1)) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> b#(x1) SCC Processor: #sccs: 2 #rules: 7 #arcs: 24/64 DPs: c#(a(x1)) -> c#(x1) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) Usable Rule Processor: DPs: c#(a(x1)) -> c#(x1) TRS: Arctic Interpretation Processor: dimension: 4 usable rules: interpretation: [c#](x0) = [0 -& -& -&]x0, [1 0 0 0] [0] [0 0 0 0] [0] [a](x0) = [1 0 0 0]x0 + [0] [0 0 0 0] [0] orientation: c#(a(x1)) = [1 0 0 0]x1 + [0] >= [0 -& -& -&]x1 = c#(x1) problem: DPs: TRS: Qed DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> b#(a(a(a(x1)))) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) Usable Rule Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> b#(a(a(a(x1)))) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) Arctic Interpretation Processor: dimension: 1 usable rules: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) interpretation: [a#](x0) = 12x0, [b#](x0) = 15x0, [a](x0) = x0, [b](x0) = 3x0 orientation: b#(a(a(x1))) = 15x1 >= 15x1 = b#(x1) b#(a(a(x1))) = 15x1 >= 15x1 = a#(b(x1)) a#(a(b(x1))) = 15x1 >= 12x1 = a#(x1) a#(a(b(x1))) = 15x1 >= 12x1 = a#(a(x1)) a#(a(b(x1))) = 15x1 >= 12x1 = a#(a(a(x1))) a#(a(b(x1))) = 15x1 >= 15x1 = b#(a(a(a(x1)))) b(a(a(x1))) = 3x1 >= 3x1 = a(b(x1)) a(a(b(x1))) = 3x1 >= 3x1 = b(a(a(a(x1)))) problem: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> b#(a(a(a(x1)))) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) Restore Modifier: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> b#(a(a(a(x1)))) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) EDG Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> b#(a(a(a(x1)))) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) graph: a#(a(b(x1))) -> b#(a(a(a(x1)))) -> b#(a(a(x1))) -> b#(x1) a#(a(b(x1))) -> b#(a(a(a(x1)))) -> b#(a(a(x1))) -> a#(b(x1)) b#(a(a(x1))) -> a#(b(x1)) -> a#(a(b(x1))) -> b#(a(a(a(x1)))) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> a#(b(x1)) Usable Rule Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> b#(a(a(a(x1)))) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) Matrix Interpretation Processor: dim=1 usable rules: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) interpretation: [a#](x0) = x0 + 5, [b#](x0) = 1/2x0 + 3, [a](x0) = x0 + 4, [b](x0) = 1/2x0 + 3/2 orientation: b#(a(a(x1))) = 1/2x1 + 7 >= 1/2x1 + 3 = b#(x1) b#(a(a(x1))) = 1/2x1 + 7 >= 1/2x1 + 13/2 = a#(b(x1)) a#(a(b(x1))) = 1/2x1 + 21/2 >= 1/2x1 + 9 = b#(a(a(a(x1)))) b(a(a(x1))) = 1/2x1 + 11/2 >= 1/2x1 + 11/2 = a(b(x1)) a(a(b(x1))) = 1/2x1 + 19/2 >= 1/2x1 + 15/2 = b(a(a(a(x1)))) problem: DPs: TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) Qed