YES
Termination w.r.t. Q proof of ../tpdb/qualif/simple.trs
Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(a, f(b, c)) → f(f(a, b), c)
Q is empty.
↳ QTRS
↳ RRRPoloQTRSProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(a, f(b, c)) → f(f(a, b), c)
Q is empty.
The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:
f(a, f(b, c)) → f(f(a, b), c)
Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:
f(a, f(b, c)) → f(f(a, b), c)
Used ordering:
Polynomial interpretation [25]:
POL(a) = 0
POL(b) = 0
POL(c) = 2
POL(f(x1, x2)) = 2·x1 + 2·x2
↳ QTRS
↳ RRRPoloQTRSProof
↳ QTRS
↳ RisEmptyProof
Q restricted rewrite system:
R is empty.
Q is empty.
The TRS R is empty. Hence, termination is trivially proven.