/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) DependencyPairsProof [EQUIVALENT, 0 ms]
(2) QDP
(3) DependencyGraphProof [EQUIVALENT, 0 ms]
(4) AND
    (5) QDP
        (6) UsableRulesProof [EQUIVALENT, 0 ms]
        (7) QDP
        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (9) YES
    (10) QDP
        (11) UsableRulesProof [EQUIVALENT, 0 ms]
        (12) QDP
        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (14) YES
    (15) QDP
        (16) UsableRulesProof [EQUIVALENT, 0 ms]
        (17) QDP
        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (19) YES
    (20) QDP
        (21) QDPOrderProof [EQUIVALENT, 132 ms]
        (22) QDP
        (23) PisEmptyProof [EQUIVALENT, 0 ms]
        (24) YES


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

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

   min(x, 0) -> 0
   min(0, y) -> 0
   min(s(x), s(y)) -> s(min(x, y))
   max(x, 0) -> x
   max(0, y) -> y
   max(s(x), s(y)) -> s(max(x, y))
   -(x, 0) -> x
   -(s(x), s(y)) -> -(x, y)
   gcd(s(x), s(y), z) -> gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
   gcd(x, s(y), s(z)) -> gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
   gcd(s(x), y, s(z)) -> gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
   gcd(x, 0, 0) -> x
   gcd(0, y, 0) -> y
   gcd(0, 0, z) -> z

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:

   MIN(s(x), s(y)) -> MIN(x, y)
   MAX(s(x), s(y)) -> MAX(x, y)
   -^1(s(x), s(y)) -> -^1(x, y)
   GCD(s(x), s(y), z) -> GCD(-(max(x, y), min(x, y)), s(min(x, y)), z)
   GCD(s(x), s(y), z) -> -^1(max(x, y), min(x, y))
   GCD(s(x), s(y), z) -> MAX(x, y)
   GCD(s(x), s(y), z) -> MIN(x, y)
   GCD(x, s(y), s(z)) -> GCD(x, -(max(y, z), min(y, z)), s(min(y, z)))
   GCD(x, s(y), s(z)) -> -^1(max(y, z), min(y, z))
   GCD(x, s(y), s(z)) -> MAX(y, z)
   GCD(x, s(y), s(z)) -> MIN(y, z)
   GCD(s(x), y, s(z)) -> GCD(-(max(x, z), min(x, z)), y, s(min(x, z)))
   GCD(s(x), y, s(z)) -> -^1(max(x, z), min(x, z))
   GCD(s(x), y, s(z)) -> MAX(x, z)
   GCD(s(x), y, s(z)) -> MIN(x, z)

The TRS R consists of the following rules:

   min(x, 0) -> 0
   min(0, y) -> 0
   min(s(x), s(y)) -> s(min(x, y))
   max(x, 0) -> x
   max(0, y) -> y
   max(s(x), s(y)) -> s(max(x, y))
   -(x, 0) -> x
   -(s(x), s(y)) -> -(x, y)
   gcd(s(x), s(y), z) -> gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
   gcd(x, s(y), s(z)) -> gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
   gcd(s(x), y, s(z)) -> gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
   gcd(x, 0, 0) -> x
   gcd(0, y, 0) -> y
   gcd(0, 0, z) -> z

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 4 SCCs with 9 less nodes.
----------------------------------------

(4)
Complex Obligation (AND)

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

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

   -^1(s(x), s(y)) -> -^1(x, y)

The TRS R consists of the following rules:

   min(x, 0) -> 0
   min(0, y) -> 0
   min(s(x), s(y)) -> s(min(x, y))
   max(x, 0) -> x
   max(0, y) -> y
   max(s(x), s(y)) -> s(max(x, y))
   -(x, 0) -> x
   -(s(x), s(y)) -> -(x, y)
   gcd(s(x), s(y), z) -> gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
   gcd(x, s(y), s(z)) -> gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
   gcd(s(x), y, s(z)) -> gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
   gcd(x, 0, 0) -> x
   gcd(0, y, 0) -> y
   gcd(0, 0, z) -> z

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:

   -^1(s(x), s(y)) -> -^1(x, y)

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

(8) QDPSizeChangeProof (EQUIVALENT)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 

From the DPs we obtained the following set of size-change graphs:
*-^1(s(x), s(y)) -> -^1(x, y)
The graph contains the following edges 1 > 1, 2 > 2


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

(9)
YES

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

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

   MAX(s(x), s(y)) -> MAX(x, y)

The TRS R consists of the following rules:

   min(x, 0) -> 0
   min(0, y) -> 0
   min(s(x), s(y)) -> s(min(x, y))
   max(x, 0) -> x
   max(0, y) -> y
   max(s(x), s(y)) -> s(max(x, y))
   -(x, 0) -> x
   -(s(x), s(y)) -> -(x, y)
   gcd(s(x), s(y), z) -> gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
   gcd(x, s(y), s(z)) -> gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
   gcd(s(x), y, s(z)) -> gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
   gcd(x, 0, 0) -> x
   gcd(0, y, 0) -> y
   gcd(0, 0, z) -> z

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

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

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

   MAX(s(x), s(y)) -> MAX(x, y)

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

(13) QDPSizeChangeProof (EQUIVALENT)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 

From the DPs we obtained the following set of size-change graphs:
*MAX(s(x), s(y)) -> MAX(x, y)
The graph contains the following edges 1 > 1, 2 > 2


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

(14)
YES

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

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

   MIN(s(x), s(y)) -> MIN(x, y)

The TRS R consists of the following rules:

   min(x, 0) -> 0
   min(0, y) -> 0
   min(s(x), s(y)) -> s(min(x, y))
   max(x, 0) -> x
   max(0, y) -> y
   max(s(x), s(y)) -> s(max(x, y))
   -(x, 0) -> x
   -(s(x), s(y)) -> -(x, y)
   gcd(s(x), s(y), z) -> gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
   gcd(x, s(y), s(z)) -> gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
   gcd(s(x), y, s(z)) -> gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
   gcd(x, 0, 0) -> x
   gcd(0, y, 0) -> y
   gcd(0, 0, z) -> z

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

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

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

   MIN(s(x), s(y)) -> MIN(x, y)

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

(18) QDPSizeChangeProof (EQUIVALENT)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 

From the DPs we obtained the following set of size-change graphs:
*MIN(s(x), s(y)) -> MIN(x, y)
The graph contains the following edges 1 > 1, 2 > 2


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

(19)
YES

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

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

   GCD(x, s(y), s(z)) -> GCD(x, -(max(y, z), min(y, z)), s(min(y, z)))
   GCD(s(x), s(y), z) -> GCD(-(max(x, y), min(x, y)), s(min(x, y)), z)
   GCD(s(x), y, s(z)) -> GCD(-(max(x, z), min(x, z)), y, s(min(x, z)))

The TRS R consists of the following rules:

   min(x, 0) -> 0
   min(0, y) -> 0
   min(s(x), s(y)) -> s(min(x, y))
   max(x, 0) -> x
   max(0, y) -> y
   max(s(x), s(y)) -> s(max(x, y))
   -(x, 0) -> x
   -(s(x), s(y)) -> -(x, y)
   gcd(s(x), s(y), z) -> gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
   gcd(x, s(y), s(z)) -> gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
   gcd(s(x), y, s(z)) -> gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
   gcd(x, 0, 0) -> x
   gcd(0, y, 0) -> y
   gcd(0, 0, z) -> z

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.

   GCD(x, s(y), s(z)) -> GCD(x, -(max(y, z), min(y, z)), s(min(y, z)))
   GCD(s(x), s(y), z) -> GCD(-(max(x, y), min(x, y)), s(min(x, y)), z)
   GCD(s(x), y, s(z)) -> GCD(-(max(x, z), min(x, z)), y, s(min(x, z)))
The remaining pairs can at least be oriented weakly.
Used ordering:  Polynomial interpretation [POLO,RATPOLO]:

   POL(-(x_1, x_2)) = x_1
   POL(0) = 0
   POL(GCD(x_1, x_2, x_3)) = x_1 + x_2 + [1/2]x_3
   POL(max(x_1, x_2)) = x_1 + x_2
   POL(min(x_1, x_2)) = [1/2]x_1 + [1/2]x_2
   POL(s(x_1)) = [4] + [4]x_1
The value of delta used in the strict ordering is 4.
The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

   max(x, 0) -> x
   max(0, y) -> y
   max(s(x), s(y)) -> s(max(x, y))
   min(x, 0) -> 0
   min(0, y) -> 0
   min(s(x), s(y)) -> s(min(x, y))
   -(x, 0) -> x
   -(s(x), s(y)) -> -(x, y)


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

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

   min(x, 0) -> 0
   min(0, y) -> 0
   min(s(x), s(y)) -> s(min(x, y))
   max(x, 0) -> x
   max(0, y) -> y
   max(s(x), s(y)) -> s(max(x, y))
   -(x, 0) -> x
   -(s(x), s(y)) -> -(x, y)
   gcd(s(x), s(y), z) -> gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
   gcd(x, s(y), s(z)) -> gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
   gcd(s(x), y, s(z)) -> gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
   gcd(x, 0, 0) -> x
   gcd(0, y, 0) -> y
   gcd(0, 0, z) -> z

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