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:
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
Q is empty.
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
The set Q is empty.
We have obtained the following QTRS:
b(a(a(x))) → b(a(b(x)))
a(b(x)) → b(b(a(x)))
a(c(b(x))) → b(a(a(c(c(x)))))
The set Q is empty.
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
b(a(a(x))) → b(a(b(x)))
a(b(x)) → b(b(a(x)))
a(c(b(x))) → b(a(a(c(c(x)))))
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
B(a(x1)) → B(b(x1))
B(a(x1)) → A(b(b(x1)))
A(a(b(x1))) → B(a(b(x1)))
B(c(a(x1))) → B(x1)
B(c(a(x1))) → A(a(b(x1)))
B(c(a(x1))) → A(b(x1))
B(a(x1)) → B(x1)
The TRS R consists of the following rules:
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(x1)) → B(b(x1))
B(a(x1)) → A(b(b(x1)))
A(a(b(x1))) → B(a(b(x1)))
B(c(a(x1))) → B(x1)
B(c(a(x1))) → A(a(b(x1)))
B(c(a(x1))) → A(b(x1))
B(a(x1)) → B(x1)
The TRS R consists of the following rules:
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(x1)) → A(b(b(x1))) at position [0] we obtained the following new rules:
B(a(a(x0))) → A(b(a(b(b(x0)))))
B(a(c(a(x0)))) → A(b(c(c(a(a(b(x0)))))))
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(x1)) → B(b(x1))
A(a(b(x1))) → B(a(b(x1)))
B(c(a(x1))) → B(x1)
B(a(c(a(x0)))) → A(b(c(c(a(a(b(x0)))))))
B(a(a(x0))) → A(b(a(b(b(x0)))))
B(c(a(x1))) → A(a(b(x1)))
B(c(a(x1))) → A(b(x1))
B(a(x1)) → B(x1)
The TRS R consists of the following rules:
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(x1)) → B(b(x1))
A(a(b(x1))) → B(a(b(x1)))
B(c(a(x1))) → B(x1)
B(a(a(x0))) → A(b(a(b(b(x0)))))
B(c(a(x1))) → A(a(b(x1)))
B(c(a(x1))) → A(b(x1))
B(a(x1)) → B(x1)
The TRS R consists of the following rules:
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(x1)) → B(b(x1)) at position [0] we obtained the following new rules:
B(a(a(x0))) → B(a(b(b(x0))))
B(a(c(a(x0)))) → B(c(c(a(a(b(x0))))))
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(x0))) → B(a(b(b(x0))))
A(a(b(x1))) → B(a(b(x1)))
B(c(a(x1))) → B(x1)
B(a(c(a(x0)))) → B(c(c(a(a(b(x0))))))
B(c(a(x1))) → A(a(b(x1)))
B(a(a(x0))) → A(b(a(b(b(x0)))))
B(c(a(x1))) → A(b(x1))
B(a(x1)) → B(x1)
The TRS R consists of the following rules:
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(x0))) → B(a(b(b(x0))))
A(a(b(x1))) → B(a(b(x1)))
B(c(a(x1))) → B(x1)
B(a(a(x0))) → A(b(a(b(b(x0)))))
B(c(a(x1))) → A(a(b(x1)))
B(c(a(x1))) → A(b(x1))
B(a(x1)) → B(x1)
The TRS R consists of the following rules:
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(c(a(x1))) → A(b(x1)) at position [0] we obtained the following new rules:
B(c(a(c(a(x0))))) → A(c(c(a(a(b(x0))))))
B(c(a(a(x0)))) → A(a(b(b(x0))))
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(c(a(c(a(x0))))) → A(c(c(a(a(b(x0))))))
B(a(a(x0))) → B(a(b(b(x0))))
B(c(a(a(x0)))) → A(a(b(b(x0))))
A(a(b(x1))) → B(a(b(x1)))
B(c(a(x1))) → B(x1)
B(c(a(x1))) → A(a(b(x1)))
B(a(a(x0))) → A(b(a(b(b(x0)))))
B(a(x1)) → B(x1)
The TRS R consists of the following rules:
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ SemLabProof
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(x0))) → B(a(b(b(x0))))
B(c(a(a(x0)))) → A(a(b(b(x0))))
A(a(b(x1))) → B(a(b(x1)))
B(c(a(x1))) → B(x1)
B(a(a(x0))) → A(b(a(b(b(x0)))))
B(c(a(x1))) → A(a(b(x1)))
B(a(x1)) → B(x1)
The TRS R consists of the following rules:
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We found the following model for the rules of the TRS R.
Interpretation over the domain with elements from 0 to 1.c: 1 + x0
B: 0
a: 0
A: 0
b: 0
By semantic labelling [33] we obtain the following labelled TRS:Q DP problem:
The TRS P consists of the following rules:
B.0(a.0(a.0(x0))) → A.0(b.0(a.0(b.0(b.0(x0)))))
A.0(a.0(b.1(x1))) → B.0(a.0(b.1(x1)))
B.1(c.0(a.1(x1))) → A.0(a.0(b.1(x1)))
A.0(a.0(b.0(x1))) → B.0(a.0(b.0(x1)))
B.1(c.0(a.0(a.1(x0)))) → A.0(a.0(b.0(b.1(x0))))
B.1(c.0(a.0(x1))) → A.0(a.0(b.0(x1)))
B.1(c.0(a.0(x1))) → B.0(x1)
B.0(a.0(a.1(x0))) → B.0(a.0(b.0(b.1(x0))))
B.1(c.0(a.0(a.0(x0)))) → A.0(a.0(b.0(b.0(x0))))
B.0(a.1(x1)) → B.1(x1)
B.1(c.0(a.1(x1))) → B.1(x1)
B.0(a.0(x1)) → B.0(x1)
B.0(a.0(a.1(x0))) → A.0(b.0(a.0(b.0(b.1(x0)))))
B.0(a.0(a.0(x0))) → B.0(a.0(b.0(b.0(x0))))
The TRS R consists of the following rules:
a.0(a.0(b.0(x1))) → b.0(a.0(b.0(x1)))
b.1(c.0(a.0(x1))) → c.1(c.0(a.0(a.0(b.0(x1)))))
b.0(a.1(x1)) → a.0(b.0(b.1(x1)))
a.0(a.0(b.1(x1))) → b.0(a.0(b.1(x1)))
b.1(c.0(a.1(x1))) → c.1(c.0(a.0(a.0(b.1(x1)))))
b.0(a.0(x1)) → a.0(b.0(b.0(x1)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ SemLabProof
↳ QDP
↳ UsableRulesReductionPairsProof
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B.0(a.0(a.0(x0))) → A.0(b.0(a.0(b.0(b.0(x0)))))
A.0(a.0(b.1(x1))) → B.0(a.0(b.1(x1)))
B.1(c.0(a.1(x1))) → A.0(a.0(b.1(x1)))
A.0(a.0(b.0(x1))) → B.0(a.0(b.0(x1)))
B.1(c.0(a.0(a.1(x0)))) → A.0(a.0(b.0(b.1(x0))))
B.1(c.0(a.0(x1))) → A.0(a.0(b.0(x1)))
B.1(c.0(a.0(x1))) → B.0(x1)
B.0(a.0(a.1(x0))) → B.0(a.0(b.0(b.1(x0))))
B.1(c.0(a.0(a.0(x0)))) → A.0(a.0(b.0(b.0(x0))))
B.0(a.1(x1)) → B.1(x1)
B.1(c.0(a.1(x1))) → B.1(x1)
B.0(a.0(x1)) → B.0(x1)
B.0(a.0(a.1(x0))) → A.0(b.0(a.0(b.0(b.1(x0)))))
B.0(a.0(a.0(x0))) → B.0(a.0(b.0(b.0(x0))))
The TRS R consists of the following rules:
a.0(a.0(b.0(x1))) → b.0(a.0(b.0(x1)))
b.1(c.0(a.0(x1))) → c.1(c.0(a.0(a.0(b.0(x1)))))
b.0(a.1(x1)) → a.0(b.0(b.1(x1)))
a.0(a.0(b.1(x1))) → b.0(a.0(b.1(x1)))
b.1(c.0(a.1(x1))) → c.1(c.0(a.0(a.0(b.1(x1)))))
b.0(a.0(x1)) → a.0(b.0(b.0(x1)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the usable rules with reduction pair processor [15] with a polynomial ordering [25], all dependency pairs and the corresponding usable rules [17] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.
The following dependency pairs can be deleted:
B.1(c.0(a.1(x1))) → A.0(a.0(b.1(x1)))
B.1(c.0(a.0(a.1(x0)))) → A.0(a.0(b.0(b.1(x0))))
B.1(c.0(a.0(x1))) → A.0(a.0(b.0(x1)))
B.1(c.0(a.0(x1))) → B.0(x1)
B.0(a.0(a.1(x0))) → B.0(a.0(b.0(b.1(x0))))
B.1(c.0(a.0(a.0(x0)))) → A.0(a.0(b.0(b.0(x0))))
B.0(a.1(x1)) → B.1(x1)
B.1(c.0(a.1(x1))) → B.1(x1)
B.0(a.0(a.1(x0))) → A.0(b.0(a.0(b.0(b.1(x0)))))
The following rules are removed from R:
b.0(a.1(x1)) → a.0(b.0(b.1(x1)))
b.1(c.0(a.1(x1))) → c.1(c.0(a.0(a.0(b.1(x1)))))
Used ordering: POLO with Polynomial interpretation [25]:
POL(A.0(x1)) = x1
POL(B.0(x1)) = x1
POL(B.1(x1)) = 1 + x1
POL(a.0(x1)) = x1
POL(a.1(x1)) = 1 + x1
POL(b.0(x1)) = x1
POL(b.1(x1)) = x1
POL(c.0(x1)) = 1 + x1
POL(c.1(x1)) = x1
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ SemLabProof
↳ QDP
↳ UsableRulesReductionPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B.0(a.0(a.0(x0))) → A.0(b.0(a.0(b.0(b.0(x0)))))
A.0(a.0(b.1(x1))) → B.0(a.0(b.1(x1)))
A.0(a.0(b.0(x1))) → B.0(a.0(b.0(x1)))
B.0(a.0(x1)) → B.0(x1)
B.0(a.0(a.0(x0))) → B.0(a.0(b.0(b.0(x0))))
The TRS R consists of the following rules:
a.0(a.0(b.0(x1))) → b.0(a.0(b.0(x1)))
a.0(a.0(b.1(x1))) → b.0(a.0(b.1(x1)))
b.0(a.0(x1)) → a.0(b.0(b.0(x1)))
b.1(c.0(a.0(x1))) → c.1(c.0(a.0(a.0(b.0(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ SemLabProof
↳ QDP
↳ UsableRulesReductionPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ RuleRemovalProof
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B.0(a.0(a.0(x0))) → A.0(b.0(a.0(b.0(b.0(x0)))))
A.0(a.0(b.0(x1))) → B.0(a.0(b.0(x1)))
B.0(a.0(x1)) → B.0(x1)
B.0(a.0(a.0(x0))) → B.0(a.0(b.0(b.0(x0))))
The TRS R consists of the following rules:
a.0(a.0(b.0(x1))) → b.0(a.0(b.0(x1)))
a.0(a.0(b.1(x1))) → b.0(a.0(b.1(x1)))
b.0(a.0(x1)) → a.0(b.0(b.0(x1)))
b.1(c.0(a.0(x1))) → c.1(c.0(a.0(a.0(b.0(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:
B.0(a.0(a.0(x0))) → A.0(b.0(a.0(b.0(b.0(x0)))))
B.0(a.0(x1)) → B.0(x1)
B.0(a.0(a.0(x0))) → B.0(a.0(b.0(b.0(x0))))
Strictly oriented rules of the TRS R:
a.0(a.0(b.0(x1))) → b.0(a.0(b.0(x1)))
a.0(a.0(b.1(x1))) → b.0(a.0(b.1(x1)))
Used ordering: POLO with Polynomial interpretation [25]:
POL(A.0(x1)) = x1
POL(B.0(x1)) = x1
POL(a.0(x1)) = 1 + x1
POL(b.0(x1)) = x1
POL(b.1(x1)) = 1 + x1
POL(c.0(x1)) = x1
POL(c.1(x1)) = x1
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ SemLabProof
↳ QDP
↳ UsableRulesReductionPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ RuleRemovalProof
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A.0(a.0(b.0(x1))) → B.0(a.0(b.0(x1)))
The TRS R consists of the following rules:
b.0(a.0(x1)) → a.0(b.0(b.0(x1)))
b.1(c.0(a.0(x1))) → c.1(c.0(a.0(a.0(b.0(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 1 less node.
We have reversed the following QTRS:
The set of rules R is
a(a(b(x1))) → b(a(b(x1)))
b(a(x1)) → a(b(b(x1)))
b(c(a(x1))) → c(c(a(a(b(x1)))))
The set Q is empty.
We have obtained the following QTRS:
b(a(a(x))) → b(a(b(x)))
a(b(x)) → b(b(a(x)))
a(c(b(x))) → b(a(a(c(c(x)))))
The set Q is empty.
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS
Q restricted rewrite system:
The TRS R consists of the following rules:
b(a(a(x))) → b(a(b(x)))
a(b(x)) → b(b(a(x)))
a(c(b(x))) → b(a(a(c(c(x)))))
Q is empty.