/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


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

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


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

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

   active(incr(nil)) -> mark(nil)
   active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
   active(adx(nil)) -> mark(nil)
   active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
   active(nats) -> mark(adx(zeros))
   active(zeros) -> mark(cons(0, zeros))
   active(head(cons(X, L))) -> mark(X)
   active(tail(cons(X, L))) -> mark(L)
   active(incr(X)) -> incr(active(X))
   active(cons(X1, X2)) -> cons(active(X1), X2)
   active(s(X)) -> s(active(X))
   active(adx(X)) -> adx(active(X))
   active(head(X)) -> head(active(X))
   active(tail(X)) -> tail(active(X))
   incr(mark(X)) -> mark(incr(X))
   cons(mark(X1), X2) -> mark(cons(X1, X2))
   s(mark(X)) -> mark(s(X))
   adx(mark(X)) -> mark(adx(X))
   head(mark(X)) -> mark(head(X))
   tail(mark(X)) -> mark(tail(X))
   proper(incr(X)) -> incr(proper(X))
   proper(nil) -> ok(nil)
   proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
   proper(s(X)) -> s(proper(X))
   proper(adx(X)) -> adx(proper(X))
   proper(nats) -> ok(nats)
   proper(zeros) -> ok(zeros)
   proper(0) -> ok(0)
   proper(head(X)) -> head(proper(X))
   proper(tail(X)) -> tail(proper(X))
   incr(ok(X)) -> ok(incr(X))
   cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
   s(ok(X)) -> ok(s(X))
   adx(ok(X)) -> ok(adx(X))
   head(ok(X)) -> ok(head(X))
   tail(ok(X)) -> ok(tail(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))

Q is empty.

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

(1) QTRSToCSRProof (EQUIVALENT)
The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

   active(incr(nil)) -> mark(nil)
   active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
   active(adx(nil)) -> mark(nil)
   active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
   active(nats) -> mark(adx(zeros))
   active(zeros) -> mark(cons(0, zeros))
   active(head(cons(X, L))) -> mark(X)
   active(tail(cons(X, L))) -> mark(L)
   active(incr(X)) -> incr(active(X))
   active(cons(X1, X2)) -> cons(active(X1), X2)
   active(s(X)) -> s(active(X))
   active(adx(X)) -> adx(active(X))
   active(head(X)) -> head(active(X))
   active(tail(X)) -> tail(active(X))
   incr(mark(X)) -> mark(incr(X))
   cons(mark(X1), X2) -> mark(cons(X1, X2))
   s(mark(X)) -> mark(s(X))
   adx(mark(X)) -> mark(adx(X))
   head(mark(X)) -> mark(head(X))
   tail(mark(X)) -> mark(tail(X))
   proper(incr(X)) -> incr(proper(X))
   proper(nil) -> ok(nil)
   proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
   proper(s(X)) -> s(proper(X))
   proper(adx(X)) -> adx(proper(X))
   proper(nats) -> ok(nats)
   proper(zeros) -> ok(zeros)
   proper(0) -> ok(0)
   proper(head(X)) -> head(proper(X))
   proper(tail(X)) -> tail(proper(X))
   incr(ok(X)) -> ok(incr(X))
   cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
   s(ok(X)) -> ok(s(X))
   adx(ok(X)) -> ok(adx(X))
   head(ok(X)) -> ok(head(X))
   tail(ok(X)) -> ok(tail(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))

Q is empty.
Special symbols used for the transformation (see [GM04]):
top: top_1, active: active_1, mark: mark_1, ok: ok_1, proper: proper_1
The replacement map contains the following entries:

incr: {1}
nil: empty set
cons: {1}
s: {1}
adx: {1}
nats: empty set
zeros: empty set
0: empty set
head: {1}
tail: {1}
The QTRS contained all rules created by the complete Giesl-Middeldorp transformation. Therefore, the inverse transformation is complete (and sound).
----------------------------------------

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

   incr(nil) -> nil
   incr(cons(X, L)) -> cons(s(X), incr(L))
   adx(nil) -> nil
   adx(cons(X, L)) -> incr(cons(X, adx(L)))
   nats -> adx(zeros)
   zeros -> cons(0, zeros)
   head(cons(X, L)) -> X
   tail(cons(X, L)) -> L

The replacement map contains the following entries:

incr: {1}
nil: empty set
cons: {1}
s: {1}
adx: {1}
nats: empty set
zeros: empty set
0: empty set
head: {1}
tail: {1}

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

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

   incr(nil) -> nil
   incr(cons(X, L)) -> cons(s(X), incr(L))
   adx(nil) -> nil
   adx(cons(X, L)) -> incr(cons(X, adx(L)))
   nats -> adx(zeros)
   zeros -> cons(0, zeros)
   head(cons(X, L)) -> X
   tail(cons(X, L)) -> L

The replacement map contains the following entries:

incr: {1}
nil: empty set
cons: {1}
s: {1}
adx: {1}
nats: empty set
zeros: empty set
0: empty set
head: {1}
tail: {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(head(x_1)) = 1 + x_1
   POL(incr(x_1)) = x_1
   POL(nats) = 1
   POL(nil) = 0
   POL(s(x_1)) = x_1
   POL(tail(x_1)) = 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:

   head(cons(X, L)) -> X




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

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

   incr(nil) -> nil
   incr(cons(X, L)) -> cons(s(X), incr(L))
   adx(nil) -> nil
   adx(cons(X, L)) -> incr(cons(X, adx(L)))
   nats -> adx(zeros)
   zeros -> cons(0, zeros)
   tail(cons(X, L)) -> L

The replacement map contains the following entries:

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

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

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

   incr(nil) -> nil
   incr(cons(X, L)) -> cons(s(X), incr(L))
   adx(nil) -> nil
   adx(cons(X, L)) -> incr(cons(X, adx(L)))
   nats -> adx(zeros)
   zeros -> cons(0, zeros)
   tail(cons(X, L)) -> L

The replacement map contains the following entries:

incr: {1}
nil: empty set
cons: {1}
s: {1}
adx: {1}
nats: empty set
zeros: empty set
0: empty set
tail: {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(nats) = 2
   POL(nil) = 0
   POL(s(x_1)) = x_1
   POL(tail(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)




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

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

   incr(nil) -> nil
   incr(cons(X, L)) -> cons(s(X), incr(L))
   adx(nil) -> nil
   adx(cons(X, L)) -> incr(cons(X, adx(L)))
   zeros -> cons(0, zeros)
   tail(cons(X, L)) -> L

The replacement map contains the following entries:

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

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

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

   incr(nil) -> nil
   incr(cons(X, L)) -> cons(s(X), incr(L))
   adx(nil) -> nil
   adx(cons(X, L)) -> incr(cons(X, adx(L)))
   zeros -> cons(0, zeros)
   tail(cons(X, L)) -> L

The replacement map contains the following entries:

incr: {1}
nil: empty set
cons: {1}
s: {1}
adx: {1}
zeros: empty set
0: empty set
tail: {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(nil) = 0
   POL(s(x_1)) = x_1
   POL(tail(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:

   tail(cons(X, L)) -> L




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

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

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

The replacement map contains the following entries:

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

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

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

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

The replacement map contains the following entries:

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

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

   incr(nil) -> nil
   adx(nil) -> nil
   zeros -> cons(0, zeros)




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

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

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

The replacement map contains the following entries:

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

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

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

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

The replacement map contains the following entries:

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

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




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

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

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

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

(14)
YES