YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) QTRS Reverse [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 17 ms]
(4) QDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) QDP
(7) QDPOrderProof [EQUIVALENT, 54 ms]
(8) QDP
(9) DependencyGraphProof [EQUIVALENT, 0 ms]
(10) QDP
(11) QDPOrderProof [EQUIVALENT, 66 ms]
(12) QDP
(13) QDPOrderProof [EQUIVALENT, 60 ms]
(14) QDP
(15) PisEmptyProof [EQUIVALENT, 0 ms]
(16) YES


----------------------------------------

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   a(a(b(b(x1)))) -> b(b(c(c(a(a(x1))))))
   b(b(c(c(x1)))) -> c(c(b(b(b(b(x1))))))
   a(a(c(c(x1)))) -> c(c(a(a(b(b(x1))))))

Q is empty.

----------------------------------------

(1) QTRS Reverse (EQUIVALENT)
We applied the QTRS Reverse Processor [REVERSE].
----------------------------------------

(2)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))
   c(c(b(b(x1)))) -> b(b(b(b(c(c(x1))))))
   c(c(a(a(x1)))) -> b(b(a(a(c(c(x1))))))

Q is empty.

----------------------------------------

(3) DependencyPairsProof (EQUIVALENT)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
----------------------------------------

(4)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   B(b(a(a(x1)))) -> C(c(b(b(x1))))
   B(b(a(a(x1)))) -> C(b(b(x1)))
   B(b(a(a(x1)))) -> B(b(x1))
   B(b(a(a(x1)))) -> B(x1)
   C(c(b(b(x1)))) -> B(b(b(b(c(c(x1))))))
   C(c(b(b(x1)))) -> B(b(b(c(c(x1)))))
   C(c(b(b(x1)))) -> B(b(c(c(x1))))
   C(c(b(b(x1)))) -> B(c(c(x1)))
   C(c(b(b(x1)))) -> C(c(x1))
   C(c(b(b(x1)))) -> C(x1)
   C(c(a(a(x1)))) -> B(b(a(a(c(c(x1))))))
   C(c(a(a(x1)))) -> B(a(a(c(c(x1)))))
   C(c(a(a(x1)))) -> C(c(x1))
   C(c(a(a(x1)))) -> C(x1)

The TRS R consists of the following rules:

   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))
   c(c(b(b(x1)))) -> b(b(b(b(c(c(x1))))))
   c(c(a(a(x1)))) -> b(b(a(a(c(c(x1))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(5) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.
----------------------------------------

(6)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   C(c(b(b(x1)))) -> B(b(b(b(c(c(x1))))))
   B(b(a(a(x1)))) -> C(c(b(b(x1))))
   C(c(b(b(x1)))) -> B(b(b(c(c(x1)))))
   B(b(a(a(x1)))) -> B(b(x1))
   B(b(a(a(x1)))) -> B(x1)
   C(c(b(b(x1)))) -> B(b(c(c(x1))))
   C(c(b(b(x1)))) -> B(c(c(x1)))
   C(c(b(b(x1)))) -> C(c(x1))
   C(c(b(b(x1)))) -> C(x1)
   C(c(a(a(x1)))) -> B(b(a(a(c(c(x1))))))
   C(c(a(a(x1)))) -> C(c(x1))
   C(c(a(a(x1)))) -> C(x1)

The TRS R consists of the following rules:

   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))
   c(c(b(b(x1)))) -> b(b(b(b(c(c(x1))))))
   c(c(a(a(x1)))) -> b(b(a(a(c(c(x1))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(7) QDPOrderProof (EQUIVALENT)
We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.

   B(b(a(a(x1)))) -> C(c(b(b(x1))))
   B(b(a(a(x1)))) -> B(b(x1))
   B(b(a(a(x1)))) -> B(x1)
   C(c(a(a(x1)))) -> C(c(x1))
   C(c(a(a(x1)))) -> C(x1)
The remaining pairs can at least be oriented weakly.
Used ordering:  Polynomial interpretation [POLO]:

   POL(B(x_1)) = x_1
   POL(C(x_1)) = x_1
   POL(a(x_1)) = 1 + x_1
   POL(b(x_1)) = x_1
   POL(c(x_1)) = x_1

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

   c(c(b(b(x1)))) -> b(b(b(b(c(c(x1))))))
   c(c(a(a(x1)))) -> b(b(a(a(c(c(x1))))))
   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))


----------------------------------------

(8)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   C(c(b(b(x1)))) -> B(b(b(b(c(c(x1))))))
   C(c(b(b(x1)))) -> B(b(b(c(c(x1)))))
   C(c(b(b(x1)))) -> B(b(c(c(x1))))
   C(c(b(b(x1)))) -> B(c(c(x1)))
   C(c(b(b(x1)))) -> C(c(x1))
   C(c(b(b(x1)))) -> C(x1)
   C(c(a(a(x1)))) -> B(b(a(a(c(c(x1))))))

The TRS R consists of the following rules:

   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))
   c(c(b(b(x1)))) -> b(b(b(b(c(c(x1))))))
   c(c(a(a(x1)))) -> b(b(a(a(c(c(x1))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(9) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 5 less nodes.
----------------------------------------

(10)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   C(c(b(b(x1)))) -> C(x1)
   C(c(b(b(x1)))) -> C(c(x1))

The TRS R consists of the following rules:

   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))
   c(c(b(b(x1)))) -> b(b(b(b(c(c(x1))))))
   c(c(a(a(x1)))) -> b(b(a(a(c(c(x1))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(11) QDPOrderProof (EQUIVALENT)
We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.

   C(c(b(b(x1)))) -> C(x1)
The remaining pairs can at least be oriented weakly.
Used ordering:  Polynomial Order [NEGPOLO,POLO] with Interpretation:

POL( C_1(x_1) ) = max{0, 2x_1 - 2}
POL( c_1(x_1) ) = 2x_1 + 2
POL( b_1(x_1) ) = x_1
POL( a_1(x_1) ) = max{0, -2}

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

   c(c(b(b(x1)))) -> b(b(b(b(c(c(x1))))))
   c(c(a(a(x1)))) -> b(b(a(a(c(c(x1))))))
   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))


----------------------------------------

(12)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   C(c(b(b(x1)))) -> C(c(x1))

The TRS R consists of the following rules:

   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))
   c(c(b(b(x1)))) -> b(b(b(b(c(c(x1))))))
   c(c(a(a(x1)))) -> b(b(a(a(c(c(x1))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(13) QDPOrderProof (EQUIVALENT)
We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.

   C(c(b(b(x1)))) -> C(c(x1))
The remaining pairs can at least be oriented weakly.
Used ordering:  Polynomial Order [NEGPOLO,POLO] with Interpretation:

POL( C_1(x_1) ) = max{0, x_1 - 2}
POL( c_1(x_1) ) = 2x_1
POL( b_1(x_1) ) = x_1 + 1
POL( a_1(x_1) ) = 1

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

   c(c(b(b(x1)))) -> b(b(b(b(c(c(x1))))))
   c(c(a(a(x1)))) -> b(b(a(a(c(c(x1))))))
   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))


----------------------------------------

(14)
Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:

   b(b(a(a(x1)))) -> a(a(c(c(b(b(x1))))))
   c(c(b(b(x1)))) -> b(b(b(b(c(c(x1))))))
   c(c(a(a(x1)))) -> b(b(a(a(c(c(x1))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(15) PisEmptyProof (EQUIVALENT)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
----------------------------------------

(16)
YES