/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(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) Proof: DP Processor: DPs: a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),x) a#(x,g()) -> a#(g(),a(f(),x)) a#(x,g()) -> a#(f(),a(g(),a(f(),x))) TRS: a(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) EDG Processor: DPs: a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),x) a#(x,g()) -> a#(g(),a(f(),x)) a#(x,g()) -> a#(f(),a(g(),a(f(),x))) TRS: a(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) graph: a#(f(),a(f(),x)) -> a#(x,g()) -> a#(x,g()) -> a#(f(),x) a#(f(),a(f(),x)) -> a#(x,g()) -> a#(x,g()) -> a#(g(),a(f(),x)) a#(f(),a(f(),x)) -> a#(x,g()) -> a#(x,g()) -> a#(f(),a(g(),a(f(),x))) a#(x,g()) -> a#(f(),a(g(),a(f(),x))) -> a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),x) -> a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),x) -> a#(x,g()) -> a#(f(),x) a#(x,g()) -> a#(f(),x) -> a#(x,g()) -> a#(g(),a(f(),x)) a#(x,g()) -> a#(f(),x) -> a#(x,g()) -> a#(f(),a(g(),a(f(),x))) SCC Processor: #sccs: 1 #rules: 3 #arcs: 8/16 DPs: a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),a(g(),a(f(),x))) a#(x,g()) -> a#(f(),x) TRS: a(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) Bounds Processor: bound: 1 enrichment: match automaton: final states: {10,9,8,4,1} transitions: a1(17,16) -> 18* a1(15,3) -> 16* a1(15,18) -> 9,6 f1() -> 15* g1() -> 17* a{#,1}(15,3) -> 1,8 a{#,1}(15,18) -> 1,8 f40() -> 3* a{#,0}(5,3) -> 1,8 a{#,0}(5,5) -> 1* a{#,0}(5,7) -> 1,4 a{#,0}(3,2) -> 1* g0() -> 2* f0() -> 5* a0(5,3) -> 6* a0(5,5) -> 6* a0(5,7) -> 9,10 a0(3,2) -> 9* a0(2,6) -> 7* 1 -> 8* 9 -> 6* problem: DPs: TRS: a(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) Qed