MAYBE Problem: a(x1) -> x1 a(b(x1)) -> c(b(b(x1))) b(x1) -> a(a(c(x1))) c(c(x1)) -> x1 Proof: DP Processor: DPs: a#(b(x1)) -> b#(b(x1)) a#(b(x1)) -> c#(b(b(x1))) b#(x1) -> c#(x1) b#(x1) -> a#(c(x1)) b#(x1) -> a#(a(c(x1))) TRS: a(x1) -> x1 a(b(x1)) -> c(b(b(x1))) b(x1) -> a(a(c(x1))) c(c(x1)) -> x1 TDG Processor: DPs: a#(b(x1)) -> b#(b(x1)) a#(b(x1)) -> c#(b(b(x1))) b#(x1) -> c#(x1) b#(x1) -> a#(c(x1)) b#(x1) -> a#(a(c(x1))) TRS: a(x1) -> x1 a(b(x1)) -> c(b(b(x1))) b(x1) -> a(a(c(x1))) c(c(x1)) -> x1 graph: b#(x1) -> a#(c(x1)) -> a#(b(x1)) -> c#(b(b(x1))) b#(x1) -> a#(c(x1)) -> a#(b(x1)) -> b#(b(x1)) b#(x1) -> a#(a(c(x1))) -> a#(b(x1)) -> c#(b(b(x1))) b#(x1) -> a#(a(c(x1))) -> a#(b(x1)) -> b#(b(x1)) a#(b(x1)) -> b#(b(x1)) -> b#(x1) -> a#(a(c(x1))) a#(b(x1)) -> b#(b(x1)) -> b#(x1) -> a#(c(x1)) a#(b(x1)) -> b#(b(x1)) -> b#(x1) -> c#(x1) SCC Processor: #sccs: 1 #rules: 3 #arcs: 7/25 DPs: b#(x1) -> a#(c(x1)) a#(b(x1)) -> b#(b(x1)) b#(x1) -> a#(a(c(x1))) TRS: a(x1) -> x1 a(b(x1)) -> c(b(b(x1))) b(x1) -> a(a(c(x1))) c(c(x1)) -> x1 Open