/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

(0) QTRS
(1) QTRSRRRProof [EQUIVALENT, 29 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 25 ms]
(4) QDP
(5) DependencyGraphProof [EQUIVALENT, 3 ms]
(6) AND
    (7) QDP
        (8) UsableRulesProof [EQUIVALENT, 0 ms]
        (9) QDP
        (10) DependencyGraphProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) UsableRulesProof [EQUIVALENT, 0 ms]
        (13) QDP
        (14) QDPOrderProof [EQUIVALENT, 6 ms]
        (15) QDP
        (16) PisEmptyProof [EQUIVALENT, 0 ms]
        (17) YES
    (18) QDP
        (19) QDPOrderProof [EQUIVALENT, 0 ms]
        (20) QDP
        (21) PisEmptyProof [EQUIVALENT, 0 ms]
        (22) YES


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

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

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

Q is empty.

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

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

   POL(a(x_1)) = 1 + x_1
   POL(b(x_1)) = x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

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




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

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

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

The TRS R consists of the following rules:

   a(b(b(a(x1)))) -> a(b(a(b(x1))))
   a(a(b(b(x1)))) -> b(b(a(a(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 2 SCCs.
----------------------------------------

(6)
Complex Obligation (AND)

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

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

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

The TRS R consists of the following rules:

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

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

(8) UsableRulesProof (EQUIVALENT)
We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R.
----------------------------------------

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

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

The TRS R consists of the following rules:

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

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

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

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

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

The TRS R consists of the following rules:

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

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

(12) UsableRulesProof (EQUIVALENT)
We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R.
----------------------------------------

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

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

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

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


The following pairs can be oriented strictly and are deleted.

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

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

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


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

(15)
Obligation:
Q DP problem:
P is empty.
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

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

(17)
YES

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

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

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

The TRS R consists of the following rules:

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

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

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


The following pairs can be oriented strictly and are deleted.

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

   POL(A(x_1)) = x_1
   POL(a(x_1)) = x_1
   POL(b(x_1)) = 1 + x_1

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

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


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

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

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

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

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

(22)
YES