/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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


Termination of the given CSR could be proven:

(0) CSR
(1) CSRRRRProof [EQUIVALENT, 76 ms]
(2) CSR
(3) CSRRRRProof [EQUIVALENT, 13 ms]
(4) CSR
(5) CSRRRRProof [EQUIVALENT, 6 ms]
(6) CSR
(7) CSRRRRProof [EQUIVALENT, 0 ms]
(8) CSR
(9) CSRRRRProof [EQUIVALENT, 0 ms]
(10) CSR
(11) RisEmptyProof [EQUIVALENT, 0 ms]
(12) YES


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

(0)
Obligation:
Context-sensitive 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

The replacement map contains the following entries:

nats: empty set
adx: {1}
zeros: empty set
cons: empty set
0: empty set
incr: {1}
s: empty set
hd: {1}
tl: {1}

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

(1) CSRRRRProof (EQUIVALENT)
The following CSR is given: Context-sensitive 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

The replacement map contains the following entries:

nats: empty set
adx: {1}
zeros: empty set
cons: empty set
0: empty set
incr: {1}
s: empty set
hd: {1}
tl: {1}
Used ordering:
Polynomial interpretation [POLO]:

   POL(0) = 0
   POL(adx(x_1)) = 1 + x_1
   POL(cons(x_1, x_2)) = x_1 + x_2
   POL(hd(x_1)) = 1 + x_1
   POL(incr(x_1)) = x_1
   POL(nats) = 1
   POL(s(x_1)) = 0
   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:

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




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

(2)
Obligation:
Context-sensitive 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)))
   tl(cons(X, Y)) -> Y

The replacement map contains the following entries:

nats: empty set
adx: {1}
zeros: empty set
cons: empty set
0: empty set
incr: {1}
s: empty set
tl: {1}

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

(3) CSRRRRProof (EQUIVALENT)
The following CSR is given: Context-sensitive 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)))
   tl(cons(X, Y)) -> Y

The replacement map contains the following entries:

nats: empty set
adx: {1}
zeros: empty set
cons: empty set
0: empty set
incr: {1}
s: empty set
tl: {1}
Used ordering:
Polynomial interpretation [POLO]:

   POL(0) = 1
   POL(adx(x_1)) = x_1
   POL(cons(x_1, x_2)) = x_2
   POL(incr(x_1)) = x_1
   POL(nats) = 2
   POL(s(x_1)) = 2 + x_1
   POL(tl(x_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:

   nats -> adx(zeros)




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

(4)
Obligation:
Context-sensitive 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)))
   tl(cons(X, Y)) -> Y

The replacement map contains the following entries:

adx: {1}
zeros: empty set
cons: empty set
0: empty set
incr: {1}
s: empty set
tl: {1}

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

(5) CSRRRRProof (EQUIVALENT)
The following CSR is given: Context-sensitive 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)))
   tl(cons(X, Y)) -> Y

The replacement map contains the following entries:

adx: {1}
zeros: empty set
cons: empty set
0: empty set
incr: {1}
s: empty set
tl: {1}
Used ordering:
Polynomial interpretation [POLO]:

   POL(0) = 0
   POL(adx(x_1)) = x_1
   POL(cons(x_1, x_2)) = x_1 + x_2
   POL(incr(x_1)) = x_1
   POL(s(x_1)) = x_1
   POL(tl(x_1)) = 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:

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




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

(6)
Obligation:
Context-sensitive 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 replacement map contains the following entries:

adx: {1}
zeros: empty set
cons: empty set
0: empty set
incr: {1}
s: empty set

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

(7) CSRRRRProof (EQUIVALENT)
The following CSR is given: Context-sensitive 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 replacement map contains the following entries:

adx: {1}
zeros: empty set
cons: empty set
0: empty set
incr: {1}
s: empty set
Used ordering:
Polynomial interpretation [POLO]:

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

   zeros -> cons(0, zeros)




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

(8)
Obligation:
Context-sensitive rewrite system:
The TRS R consists of the following rules:

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

The replacement map contains the following entries:

adx: {1}
cons: empty set
incr: {1}
s: empty set

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

(9) CSRRRRProof (EQUIVALENT)
The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

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

The replacement map contains the following entries:

adx: {1}
cons: empty set
incr: {1}
s: empty set
Used ordering:
Polynomial interpretation [POLO]:

   POL(adx(x_1)) = 2 + 2*x_1
   POL(cons(x_1, x_2)) = 1
   POL(incr(x_1)) = 1 + 2*x_1
   POL(s(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:

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




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

(10)
Obligation:
Context-sensitive rewrite system:
R is empty.

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

(11) RisEmptyProof (EQUIVALENT)
The CSR R is empty. Hence, termination is trivially proven.
----------------------------------------

(12)
YES