/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


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

(0) QTRS
(1) QTRSRRRProof [EQUIVALENT, 40 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 3 ms]
(4) QDP
(5) QDPOrderProof [EQUIVALENT, 10 ms]
(6) QDP
(7) DependencyGraphProof [EQUIVALENT, 0 ms]
(8) TRUE


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

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

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

Q is empty.

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

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

   POL(a(x_1)) = 1 + x_1
   POL(b(x_1)) = 1 + x_1
   POL(c(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(x1) -> c(x1)




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

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

   a(x1) -> b(x1)
   a(b(x1)) -> b(c(a(x1)))
   c(b(x1)) -> a(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:

   A(b(x1)) -> C(a(x1))
   A(b(x1)) -> A(x1)
   C(b(x1)) -> A(x1)

The TRS R consists of the following rules:

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

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

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


The following pairs can be oriented strictly and are deleted.

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

   POL(A(x_1)) = 1 + x_1
   POL(C(x_1)) = 1 + x_1
   POL(a(x_1)) = 1 + x_1
   POL(b(x_1)) = 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:

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


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

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

   A(b(x1)) -> C(a(x1))

The TRS R consists of the following rules:

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

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

(7) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.
----------------------------------------

(8)
TRUE