YES Problem: times(x,plus(y,1())) -> plus(times(x,plus(y,times(1(),0()))),x) times(x,1()) -> x plus(x,0()) -> x times(x,0()) -> 0() Proof: DP Processor: DPs: times#(x,plus(y,1())) -> times#(1(),0()) times#(x,plus(y,1())) -> plus#(y,times(1(),0())) times#(x,plus(y,1())) -> times#(x,plus(y,times(1(),0()))) times#(x,plus(y,1())) -> plus#(times(x,plus(y,times(1(),0()))),x) TRS: times(x,plus(y,1())) -> plus(times(x,plus(y,times(1(),0()))),x) times(x,1()) -> x plus(x,0()) -> x times(x,0()) -> 0() EDG Processor: DPs: times#(x,plus(y,1())) -> times#(1(),0()) times#(x,plus(y,1())) -> plus#(y,times(1(),0())) times#(x,plus(y,1())) -> times#(x,plus(y,times(1(),0()))) times#(x,plus(y,1())) -> plus#(times(x,plus(y,times(1(),0()))),x) TRS: times(x,plus(y,1())) -> plus(times(x,plus(y,times(1(),0()))),x) times(x,1()) -> x plus(x,0()) -> x times(x,0()) -> 0() graph: times#(x,plus(y,1())) -> times#(x,plus(y,times(1(),0()))) -> times#(x,plus(y,1())) -> times#(1(),0()) times#(x,plus(y,1())) -> times#(x,plus(y,times(1(),0()))) -> times#(x,plus(y,1())) -> plus#(y,times(1(),0())) times#(x,plus(y,1())) -> times#(x,plus(y,times(1(),0()))) -> times#(x,plus(y,1())) -> times#(x,plus(y,times(1(),0()))) times#(x,plus(y,1())) -> times#(x,plus(y,times(1(),0()))) -> times#(x,plus(y,1())) -> plus#(times(x,plus(y,times(1(),0()))),x) SCC Processor: #sccs: 1 #rules: 1 #arcs: 4/16 DPs: times#(x,plus(y,1())) -> times#(x,plus(y,times(1(),0()))) TRS: times(x,plus(y,1())) -> plus(times(x,plus(y,times(1(),0()))),x) times(x,1()) -> x plus(x,0()) -> x times(x,0()) -> 0() Usable Rule Processor: DPs: times#(x,plus(y,1())) -> times#(x,plus(y,times(1(),0()))) TRS: times(x,0()) -> 0() plus(x,0()) -> x Bounds Processor: bound: 2 enrichment: match automaton: final states: {7} transitions: 00() -> 6* 01() -> 6,12 times{#,1}(6,15) -> 7* plus1(6,14) -> 15* times1(13,12) -> 14* 11() -> 13* 02() -> 14* times{#,0}(6,6) -> 7* plus0(6,6) -> 6* 10() -> 6* times0(6,6) -> 6* 6 -> 15* problem: DPs: TRS: times(x,0()) -> 0() plus(x,0()) -> x Qed