/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 of the given CSR could be proven:

(0) CSR
(1) CSRRRRProof [EQUIVALENT, 91 ms]
(2) CSR
(3) CSRRRRProof [EQUIVALENT, 0 ms]
(4) CSR
(5) CSRRRRProof [EQUIVALENT, 0 ms]
(6) CSR
(7) RisEmptyProof [EQUIVALENT, 0 ms]
(8) YES


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

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

   app(nil, YS) -> YS
   app(cons(X, XS), YS) -> cons(X, app(XS, YS))
   from(X) -> cons(X, from(s(X)))
   zWadr(nil, YS) -> nil
   zWadr(XS, nil) -> nil
   zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS))
   prefix(L) -> cons(nil, zWadr(L, prefix(L)))

The replacement map contains the following entries:

app: {1, 2}
nil: empty set
cons: {1}
from: {1}
s: {1}
zWadr: {1, 2}
prefix: {1}

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

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

   app(nil, YS) -> YS
   app(cons(X, XS), YS) -> cons(X, app(XS, YS))
   from(X) -> cons(X, from(s(X)))
   zWadr(nil, YS) -> nil
   zWadr(XS, nil) -> nil
   zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS))
   prefix(L) -> cons(nil, zWadr(L, prefix(L)))

The replacement map contains the following entries:

app: {1, 2}
nil: empty set
cons: {1}
from: {1}
s: {1}
zWadr: {1, 2}
prefix: {1}
Used ordering:
Polynomial interpretation [POLO]:

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

   from(X) -> cons(X, from(s(X)))
   prefix(L) -> cons(nil, zWadr(L, prefix(L)))




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

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

   app(nil, YS) -> YS
   app(cons(X, XS), YS) -> cons(X, app(XS, YS))
   zWadr(nil, YS) -> nil
   zWadr(XS, nil) -> nil
   zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS))

The replacement map contains the following entries:

app: {1, 2}
nil: empty set
cons: {1}
zWadr: {1, 2}

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

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

   app(nil, YS) -> YS
   app(cons(X, XS), YS) -> cons(X, app(XS, YS))
   zWadr(nil, YS) -> nil
   zWadr(XS, nil) -> nil
   zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS))

The replacement map contains the following entries:

app: {1, 2}
nil: empty set
cons: {1}
zWadr: {1, 2}
Used ordering:
Polynomial interpretation [POLO]:

   POL(app(x_1, x_2)) = 1 + x_1 + x_2
   POL(cons(x_1, x_2)) = x_1
   POL(nil) = 1
   POL(zWadr(x_1, x_2)) = 1 + x_1 + x_2
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   app(nil, YS) -> YS
   app(cons(X, XS), YS) -> cons(X, app(XS, YS))
   zWadr(nil, YS) -> nil
   zWadr(XS, nil) -> nil




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

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

   zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS))

The replacement map contains the following entries:

app: {1, 2}
nil: empty set
cons: {1}
zWadr: {1, 2}

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

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

   zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS))

The replacement map contains the following entries:

app: {1, 2}
nil: empty set
cons: {1}
zWadr: {1, 2}
Used ordering:
Polynomial interpretation [POLO]:

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

   zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS))




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

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

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

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

(8)
YES