YES Proof: This system is quasi-decreasing. By \cite{O02}, p. 214, Proposition 7.2.50. This system is of type 3 or smaller. This system is deterministic. System R transformed to U(R). Call external tool: ttt2 - trs 30 Input: ?1(b, x) -> a f(x) -> ?1(x, x) a -> b a -> c DP Processor: DPs: ?1#(b(),x) -> a#() f#(x) -> ?1#(x,x) TRS: ?1(b(),x) -> a() f(x) -> ?1(x,x) a() -> b() a() -> c() TDG Processor: DPs: ?1#(b(),x) -> a#() f#(x) -> ?1#(x,x) TRS: ?1(b(),x) -> a() f(x) -> ?1(x,x) a() -> b() a() -> c() graph: f#(x) -> ?1#(x,x) -> ?1#(b(),x) -> a#() SCC Processor: #sccs: 0 #rules: 0 #arcs: 1/4