/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, 64 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 0 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 5 ms]
(6) QTRS
(7) QTRSRRRProof [EQUIVALENT, 0 ms]
(8) QTRS
(9) AAECC Innermost [EQUIVALENT, 0 ms]
(10) QTRS
(11) DependencyPairsProof [EQUIVALENT, 0 ms]
(12) QDP
(13) DependencyGraphProof [EQUIVALENT, 0 ms]
(14) TRUE


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

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

   a__f(X, X) -> a__f(a, b)
   a__b -> a
   mark(f(X1, X2)) -> a__f(mark(X1), X2)
   mark(b) -> a__b
   mark(a) -> a
   a__f(X1, X2) -> f(X1, X2)
   a__b -> b

Q is empty.

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

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

   POL(a) = 0
   POL(a__b) = 0
   POL(a__f(x_1, x_2)) = 2 + 2*x_1 + 2*x_2
   POL(b) = 0
   POL(f(x_1, x_2)) = 1 + 2*x_1 + x_2
   POL(mark(x_1)) = 2*x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   a__f(X1, X2) -> f(X1, X2)




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

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

   a__f(X, X) -> a__f(a, b)
   a__b -> a
   mark(f(X1, X2)) -> a__f(mark(X1), X2)
   mark(b) -> a__b
   mark(a) -> a
   a__b -> b

Q is empty.

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

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

   POL(a) = 0
   POL(a__b) = 0
   POL(a__f(x_1, x_2)) = x_1 + 2*x_2
   POL(b) = 0
   POL(f(x_1, x_2)) = 1 + 2*x_1 + x_2
   POL(mark(x_1)) = 2*x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   mark(f(X1, X2)) -> a__f(mark(X1), X2)




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

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

   a__f(X, X) -> a__f(a, b)
   a__b -> a
   mark(b) -> a__b
   mark(a) -> a
   a__b -> b

Q is empty.

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

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

   POL(a) = 0
   POL(a__b) = 2
   POL(a__f(x_1, x_2)) = x_1 + x_2
   POL(b) = 0
   POL(mark(x_1)) = 2 + x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   a__b -> a
   mark(a) -> a
   a__b -> b




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

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

   a__f(X, X) -> a__f(a, b)
   mark(b) -> a__b

Q is empty.

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

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

   POL(a) = 0
   POL(a__b) = 0
   POL(a__f(x_1, x_2)) = x_1 + x_2
   POL(b) = 0
   POL(mark(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:

   mark(b) -> a__b




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

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

   a__f(X, X) -> a__f(a, b)

Q is empty.

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

(9) AAECC Innermost (EQUIVALENT)
We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is none

The TRS R 2 is 
   a__f(X, X) -> a__f(a, b)

The signature Sigma is {a__f_2}
----------------------------------------

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

   a__f(X, X) -> a__f(a, b)

The set Q consists of the following terms:

   a__f(x0, x0)


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

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

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

   A__F(X, X) -> A__F(a, b)

The TRS R consists of the following rules:

   a__f(X, X) -> a__f(a, b)

The set Q consists of the following terms:

   a__f(x0, x0)

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

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

(14)
TRUE