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


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


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


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

(0) QTRS
(1) QTRSRRRProof [EQUIVALENT, 58 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 0 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 0 ms]
(6) QTRS
(7) Overlay + Local Confluence [EQUIVALENT, 0 ms]
(8) QTRS
(9) DependencyPairsProof [EQUIVALENT, 0 ms]
(10) QDP
(11) DependencyGraphProof [EQUIVALENT, 0 ms]
(12) AND
    (13) QDP
        (14) UsableRulesProof [EQUIVALENT, 0 ms]
        (15) QDP
        (16) QReductionProof [EQUIVALENT, 0 ms]
        (17) QDP
        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (19) YES
    (20) QDP
        (21) UsableRulesProof [EQUIVALENT, 0 ms]
        (22) QDP
        (23) QReductionProof [EQUIVALENT, 0 ms]
        (24) QDP
        (25) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (26) YES
    (27) QDP
        (28) UsableRulesProof [EQUIVALENT, 0 ms]
        (29) QDP
        (30) QReductionProof [EQUIVALENT, 0 ms]
        (31) QDP
        (32) NonTerminationLoopProof [COMPLETE, 0 ms]
        (33) NO


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

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

   nats -> adx(zeros)
   zeros -> cons(0, zeros)
   incr(cons(X, Y)) -> cons(s(X), incr(Y))
   adx(cons(X, Y)) -> incr(cons(X, adx(Y)))
   hd(cons(X, Y)) -> X
   tl(cons(X, Y)) -> Y

Q is empty.

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

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

   POL(0) = 0
   POL(adx(x_1)) = x_1
   POL(cons(x_1, x_2)) = 2*x_1 + x_2
   POL(hd(x_1)) = 2*x_1
   POL(incr(x_1)) = x_1
   POL(nats) = 2
   POL(s(x_1)) = x_1
   POL(tl(x_1)) = x_1
   POL(zeros) = 0
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   nats -> adx(zeros)




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

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

   zeros -> cons(0, zeros)
   incr(cons(X, Y)) -> cons(s(X), incr(Y))
   adx(cons(X, Y)) -> incr(cons(X, adx(Y)))
   hd(cons(X, Y)) -> X
   tl(cons(X, Y)) -> Y

Q is empty.

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

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

   POL(0) = 0
   POL(adx(x_1)) = x_1
   POL(cons(x_1, x_2)) = 2*x_1 + x_2
   POL(hd(x_1)) = 2*x_1
   POL(incr(x_1)) = x_1
   POL(s(x_1)) = x_1
   POL(tl(x_1)) = 1 + 2*x_1
   POL(zeros) = 0
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   tl(cons(X, Y)) -> Y




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

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

   zeros -> cons(0, zeros)
   incr(cons(X, Y)) -> cons(s(X), incr(Y))
   adx(cons(X, Y)) -> incr(cons(X, adx(Y)))
   hd(cons(X, Y)) -> X

Q is empty.

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

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

   POL(0) = 0
   POL(adx(x_1)) = x_1
   POL(cons(x_1, x_2)) = 2*x_1 + x_2
   POL(hd(x_1)) = 1 + 2*x_1
   POL(incr(x_1)) = x_1
   POL(s(x_1)) = x_1
   POL(zeros) = 0
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   hd(cons(X, Y)) -> X




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

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

   zeros -> cons(0, zeros)
   incr(cons(X, Y)) -> cons(s(X), incr(Y))
   adx(cons(X, Y)) -> incr(cons(X, adx(Y)))

Q is empty.

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

(7) Overlay + Local Confluence (EQUIVALENT)
The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.
----------------------------------------

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

   zeros -> cons(0, zeros)
   incr(cons(X, Y)) -> cons(s(X), incr(Y))
   adx(cons(X, Y)) -> incr(cons(X, adx(Y)))

The set Q consists of the following terms:

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))


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

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

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

   ZEROS -> ZEROS
   INCR(cons(X, Y)) -> INCR(Y)
   ADX(cons(X, Y)) -> INCR(cons(X, adx(Y)))
   ADX(cons(X, Y)) -> ADX(Y)

The TRS R consists of the following rules:

   zeros -> cons(0, zeros)
   incr(cons(X, Y)) -> cons(s(X), incr(Y))
   adx(cons(X, Y)) -> incr(cons(X, adx(Y)))

The set Q consists of the following terms:

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))

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

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

(12)
Complex Obligation (AND)

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

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

   INCR(cons(X, Y)) -> INCR(Y)

The TRS R consists of the following rules:

   zeros -> cons(0, zeros)
   incr(cons(X, Y)) -> cons(s(X), incr(Y))
   adx(cons(X, Y)) -> incr(cons(X, adx(Y)))

The set Q consists of the following terms:

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))

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

(14) UsableRulesProof (EQUIVALENT)
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
----------------------------------------

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

   INCR(cons(X, Y)) -> INCR(Y)

R is empty.
The set Q consists of the following terms:

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))

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

(16) QReductionProof (EQUIVALENT)
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))


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

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

   INCR(cons(X, Y)) -> INCR(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:
*INCR(cons(X, Y)) -> INCR(Y)
The graph contains the following edges 1 > 1


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

(19)
YES

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

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

   ADX(cons(X, Y)) -> ADX(Y)

The TRS R consists of the following rules:

   zeros -> cons(0, zeros)
   incr(cons(X, Y)) -> cons(s(X), incr(Y))
   adx(cons(X, Y)) -> incr(cons(X, adx(Y)))

The set Q consists of the following terms:

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))

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

(21) UsableRulesProof (EQUIVALENT)
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
----------------------------------------

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

   ADX(cons(X, Y)) -> ADX(Y)

R is empty.
The set Q consists of the following terms:

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))

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

(23) QReductionProof (EQUIVALENT)
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))


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

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

   ADX(cons(X, Y)) -> ADX(Y)

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

(25) 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:
*ADX(cons(X, Y)) -> ADX(Y)
The graph contains the following edges 1 > 1


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

(26)
YES

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

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

   ZEROS -> ZEROS

The TRS R consists of the following rules:

   zeros -> cons(0, zeros)
   incr(cons(X, Y)) -> cons(s(X), incr(Y))
   adx(cons(X, Y)) -> incr(cons(X, adx(Y)))

The set Q consists of the following terms:

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))

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

(28) UsableRulesProof (EQUIVALENT)
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
----------------------------------------

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

   ZEROS -> ZEROS

R is empty.
The set Q consists of the following terms:

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))

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

(30) QReductionProof (EQUIVALENT)
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

   zeros
   incr(cons(x0, x1))
   adx(cons(x0, x1))


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

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

   ZEROS -> ZEROS

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

(32) NonTerminationLoopProof (COMPLETE)
We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

s = ZEROS evaluates to  t =ZEROS

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
* Matcher: [ ]
* Semiunifier: [ ]

--------------------------------------------------------------------------------
Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from ZEROS to ZEROS.




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

(33)
NO