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


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


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


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

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


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

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

   b(a(a(x1))) -> a(b(c(x1)))
   c(a(x1)) -> a(c(x1))
   b(c(a(x1))) -> a(b(c(x1)))
   c(b(x1)) -> d(x1)
   a(d(x1)) -> d(a(x1))
   d(x1) -> b(a(x1))
   L(a(a(x1))) -> L(a(b(c(x1))))
   c(R(x1)) -> c(b(R(x1)))

Q is empty.

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

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

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

   B(a(a(x1))) -> A(b(c(x1)))
   B(a(a(x1))) -> B(c(x1))
   B(a(a(x1))) -> C(x1)
   C(a(x1)) -> A(c(x1))
   C(a(x1)) -> C(x1)
   B(c(a(x1))) -> A(b(c(x1)))
   B(c(a(x1))) -> B(c(x1))
   B(c(a(x1))) -> C(x1)
   C(b(x1)) -> D(x1)
   A(d(x1)) -> D(a(x1))
   A(d(x1)) -> A(x1)
   D(x1) -> B(a(x1))
   D(x1) -> A(x1)
   L^1(a(a(x1))) -> L^1(a(b(c(x1))))
   L^1(a(a(x1))) -> A(b(c(x1)))
   L^1(a(a(x1))) -> B(c(x1))
   L^1(a(a(x1))) -> C(x1)
   C(R(x1)) -> C(b(R(x1)))
   C(R(x1)) -> B(R(x1))

The TRS R consists of the following rules:

   b(a(a(x1))) -> a(b(c(x1)))
   c(a(x1)) -> a(c(x1))
   b(c(a(x1))) -> a(b(c(x1)))
   c(b(x1)) -> d(x1)
   a(d(x1)) -> d(a(x1))
   d(x1) -> b(a(x1))
   L(a(a(x1))) -> L(a(b(c(x1))))
   c(R(x1)) -> c(b(R(x1)))

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

(3) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 4 less nodes.
----------------------------------------

(4)
Complex Obligation (AND)

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

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

   A(d(x1)) -> D(a(x1))
   D(x1) -> B(a(x1))
   B(a(a(x1))) -> A(b(c(x1)))
   A(d(x1)) -> A(x1)
   B(a(a(x1))) -> B(c(x1))
   B(a(a(x1))) -> C(x1)
   C(a(x1)) -> A(c(x1))
   C(a(x1)) -> C(x1)
   C(b(x1)) -> D(x1)
   D(x1) -> A(x1)
   C(R(x1)) -> C(b(R(x1)))
   B(c(a(x1))) -> A(b(c(x1)))
   B(c(a(x1))) -> B(c(x1))
   B(c(a(x1))) -> C(x1)

The TRS R consists of the following rules:

   b(a(a(x1))) -> a(b(c(x1)))
   c(a(x1)) -> a(c(x1))
   b(c(a(x1))) -> a(b(c(x1)))
   c(b(x1)) -> d(x1)
   a(d(x1)) -> d(a(x1))
   d(x1) -> b(a(x1))
   L(a(a(x1))) -> L(a(b(c(x1))))
   c(R(x1)) -> c(b(R(x1)))

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

(6) 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.
----------------------------------------

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

   A(d(x1)) -> D(a(x1))
   D(x1) -> B(a(x1))
   B(a(a(x1))) -> A(b(c(x1)))
   A(d(x1)) -> A(x1)
   B(a(a(x1))) -> B(c(x1))
   B(a(a(x1))) -> C(x1)
   C(a(x1)) -> A(c(x1))
   C(a(x1)) -> C(x1)
   C(b(x1)) -> D(x1)
   D(x1) -> A(x1)
   C(R(x1)) -> C(b(R(x1)))
   B(c(a(x1))) -> A(b(c(x1)))
   B(c(a(x1))) -> B(c(x1))
   B(c(a(x1))) -> C(x1)

The TRS R consists of the following rules:

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

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

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


The following pairs can be oriented strictly and are deleted.

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

   POL(A(x_1)) = 1 + x_1
   POL(B(x_1)) = x_1
   POL(C(x_1)) = 1 + x_1
   POL(D(x_1)) = 1 + x_1
   POL(R(x_1)) = 1 + x_1
   POL(a(x_1)) = 1 + x_1
   POL(b(x_1)) = x_1
   POL(c(x_1)) = 1 + x_1
   POL(d(x_1)) = 1 + x_1

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

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


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

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

   A(d(x1)) -> D(a(x1))
   D(x1) -> B(a(x1))
   B(a(a(x1))) -> A(b(c(x1)))
   C(a(x1)) -> A(c(x1))
   C(b(x1)) -> D(x1)
   D(x1) -> A(x1)
   C(R(x1)) -> C(b(R(x1)))
   B(c(a(x1))) -> A(b(c(x1)))

The TRS R consists of the following rules:

   c(a(x1)) -> a(c(x1))
   c(b(x1)) -> d(x1)
   c(R(x1)) -> c(b(R(x1)))
   a(d(x1)) -> d(a(x1))
   d(x1) -> b(a(x1))
   b(a(a(x1))) -> a(b(c(x1)))
   b(c(a(x1))) -> a(b(c(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 3 less nodes.
----------------------------------------

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

   D(x1) -> B(a(x1))
   B(a(a(x1))) -> A(b(c(x1)))
   A(d(x1)) -> D(a(x1))
   D(x1) -> A(x1)
   B(c(a(x1))) -> A(b(c(x1)))

The TRS R consists of the following rules:

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

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

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


The following pairs can be oriented strictly and are deleted.

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

POL( A_1(x_1) ) = 1
POL( B_1(x_1) ) = x_1 + 1
POL( D_1(x_1) ) = 1
POL( d_1(x_1) ) = max{0, -2}
POL( b_1(x_1) ) = 0
POL( a_1(x_1) ) = max{0, -2}
POL( c_1(x_1) ) = 1
POL( R_1(x_1) ) = 0

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

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


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

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

   D(x1) -> B(a(x1))
   B(a(a(x1))) -> A(b(c(x1)))
   A(d(x1)) -> D(a(x1))
   D(x1) -> A(x1)

The TRS R consists of the following rules:

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

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(d(x1)) -> D(a(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 - 1}
POL( B_1(x_1) ) = 0
POL( D_1(x_1) ) = 2x_1
POL( d_1(x_1) ) = 2x_1 + 2
POL( b_1(x_1) ) = max{0, -2}
POL( a_1(x_1) ) = max{0, 2x_1 - 2}
POL( c_1(x_1) ) = max{0, -2}
POL( R_1(x_1) ) = 0

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

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


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

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

   D(x1) -> B(a(x1))
   B(a(a(x1))) -> A(b(c(x1)))
   D(x1) -> A(x1)

The TRS R consists of the following rules:

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

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

(16) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 3 less nodes.
----------------------------------------

(17)
TRUE

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

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

   L^1(a(a(x1))) -> L^1(a(b(c(x1))))

The TRS R consists of the following rules:

   b(a(a(x1))) -> a(b(c(x1)))
   c(a(x1)) -> a(c(x1))
   b(c(a(x1))) -> a(b(c(x1)))
   c(b(x1)) -> d(x1)
   a(d(x1)) -> d(a(x1))
   d(x1) -> b(a(x1))
   L(a(a(x1))) -> L(a(b(c(x1))))
   c(R(x1)) -> c(b(R(x1)))

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

(19) 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.
----------------------------------------

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

   L^1(a(a(x1))) -> L^1(a(b(c(x1))))

The TRS R consists of the following rules:

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

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

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


The following pairs can be oriented strictly and are deleted.

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

POL( L^1_1(x_1) ) = max{0, x_1 - 2}
POL( a_1(x_1) ) = x_1 + 2
POL( b_1(x_1) ) = max{0, x_1 - 2}
POL( c_1(x_1) ) = x_1 + 2
POL( d_1(x_1) ) = x_1
POL( R_1(x_1) ) = 0

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

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


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

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

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

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

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

(24)
YES