YES
proof of /export/starexec/sandbox/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) FlatCCProof [EQUIVALENT, 0 ms]
(2) QTRS
(3) RootLabelingProof [EQUIVALENT, 0 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 19 ms]
(6) QTRS
(7) QTRSRRRProof [EQUIVALENT, 2 ms]
(8) QTRS
(9) QTRSRRRProof [EQUIVALENT, 2 ms]
(10) QTRS
(11) RisEmptyProof [EQUIVALENT, 0 ms]
(12) YES


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

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

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

Q is empty.

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

(1) FlatCCProof (EQUIVALENT)
We used flat context closure [ROOTLAB]
As Q is empty the flat context closure was sound AND complete.

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

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

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

Q is empty.

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

(3) RootLabelingProof (EQUIVALENT)
We used plain root labeling [ROOTLAB] with the following heuristic:
LabelAll: All function symbols get labeled

As Q is empty the root labeling was sound AND complete.

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

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

   b_{c_1}(c_{b_1}(b_{b_1}(x1))) -> b_{b_1}(b_{b_1}(b_{b_1}(x1)))
   b_{c_1}(c_{b_1}(b_{c_1}(x1))) -> b_{b_1}(b_{b_1}(b_{c_1}(x1)))
   b_{b_1}(b_{b_1}(b_{b_1}(x1))) -> b_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{b_1}(x1)))))
   b_{b_1}(b_{b_1}(b_{c_1}(x1))) -> b_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(x1)))))
   c_{b_1}(b_{b_1}(b_{b_1}(x1))) -> c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{b_1}(x1)))))
   c_{b_1}(b_{b_1}(b_{c_1}(x1))) -> c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(x1)))))
   b_{c_1}(c_{b_1}(x1)) -> b_{b_1}(x1)
   b_{c_1}(c_{c_1}(x1)) -> b_{c_1}(x1)
   c_{c_1}(c_{b_1}(x1)) -> c_{b_1}(x1)
   c_{c_1}(c_{c_1}(x1)) -> c_{c_1}(x1)

Q is empty.

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

(5) QTRSRRRProof (EQUIVALENT)
Used ordering:
Polynomial interpretation [POLO]:

   POL(b_{b_1}(x_1)) = 1 + x_1
   POL(b_{c_1}(x_1)) = x_1
   POL(c_{b_1}(x_1)) = 2 + x_1
   POL(c_{c_1}(x_1)) = x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   b_{b_1}(b_{b_1}(b_{b_1}(x1))) -> b_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{b_1}(x1)))))
   b_{b_1}(b_{b_1}(b_{c_1}(x1))) -> b_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(x1)))))
   c_{b_1}(b_{b_1}(b_{b_1}(x1))) -> c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{b_1}(x1)))))
   c_{b_1}(b_{b_1}(b_{c_1}(x1))) -> c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(x1)))))
   b_{c_1}(c_{b_1}(x1)) -> b_{b_1}(x1)




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

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

   b_{c_1}(c_{b_1}(b_{b_1}(x1))) -> b_{b_1}(b_{b_1}(b_{b_1}(x1)))
   b_{c_1}(c_{b_1}(b_{c_1}(x1))) -> b_{b_1}(b_{b_1}(b_{c_1}(x1)))
   b_{c_1}(c_{c_1}(x1)) -> b_{c_1}(x1)
   c_{c_1}(c_{b_1}(x1)) -> c_{b_1}(x1)
   c_{c_1}(c_{c_1}(x1)) -> c_{c_1}(x1)

Q is empty.

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

(7) QTRSRRRProof (EQUIVALENT)
Used ordering:
Polynomial interpretation [POLO]:

   POL(b_{b_1}(x_1)) = x_1
   POL(b_{c_1}(x_1)) = x_1
   POL(c_{b_1}(x_1)) = 1 + x_1
   POL(c_{c_1}(x_1)) = x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   b_{c_1}(c_{b_1}(b_{b_1}(x1))) -> b_{b_1}(b_{b_1}(b_{b_1}(x1)))
   b_{c_1}(c_{b_1}(b_{c_1}(x1))) -> b_{b_1}(b_{b_1}(b_{c_1}(x1)))




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

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

   b_{c_1}(c_{c_1}(x1)) -> b_{c_1}(x1)
   c_{c_1}(c_{b_1}(x1)) -> c_{b_1}(x1)
   c_{c_1}(c_{c_1}(x1)) -> c_{c_1}(x1)

Q is empty.

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

(9) QTRSRRRProof (EQUIVALENT)
Used ordering:
Polynomial interpretation [POLO]:

   POL(b_{c_1}(x_1)) = x_1
   POL(c_{b_1}(x_1)) = x_1
   POL(c_{c_1}(x_1)) = 1 + x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   b_{c_1}(c_{c_1}(x1)) -> b_{c_1}(x1)
   c_{c_1}(c_{b_1}(x1)) -> c_{b_1}(x1)
   c_{c_1}(c_{c_1}(x1)) -> c_{c_1}(x1)




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

(10)
Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.

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

(11) RisEmptyProof (EQUIVALENT)
The TRS R is empty. Hence, termination is trivially proven.
----------------------------------------

(12)
YES