MAYBE Problem: f(a(),x) -> f(g(x),x) h(g(x)) -> h(a()) g(h(x)) -> g(x) h(h(x)) -> x Proof: DP Processor: DPs: f#(a(),x) -> g#(x) f#(a(),x) -> f#(g(x),x) h#(g(x)) -> h#(a()) g#(h(x)) -> g#(x) TRS: f(a(),x) -> f(g(x),x) h(g(x)) -> h(a()) g(h(x)) -> g(x) h(h(x)) -> x Usable Rule Processor: DPs: f#(a(),x) -> g#(x) f#(a(),x) -> f#(g(x),x) h#(g(x)) -> h#(a()) g#(h(x)) -> g#(x) TRS: f7(x,y) -> x f7(x,y) -> y g(h(x)) -> g(x) CDG Processor: DPs: f#(a(),x) -> g#(x) f#(a(),x) -> f#(g(x),x) h#(g(x)) -> h#(a()) g#(h(x)) -> g#(x) TRS: f7(x,y) -> x f7(x,y) -> y g(h(x)) -> g(x) graph: g#(h(x)) -> g#(x) -> g#(h(x)) -> g#(x) f#(a(),x) -> g#(x) -> g#(h(x)) -> g#(x) Restore Modifier: DPs: f#(a(),x) -> g#(x) f#(a(),x) -> f#(g(x),x) h#(g(x)) -> h#(a()) g#(h(x)) -> g#(x) TRS: f(a(),x) -> f(g(x),x) h(g(x)) -> h(a()) g(h(x)) -> g(x) h(h(x)) -> x SCC Processor: #sccs: 1 #rules: 1 #arcs: 2/16 DPs: g#(h(x)) -> g#(x) TRS: f(a(),x) -> f(g(x),x) h(g(x)) -> h(a()) g(h(x)) -> g(x) h(h(x)) -> x Open