(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
active(from(X)) → mark(cons(X, from(s(X))))
active(first(0, Z)) → mark(nil)
active(first(s(X), cons(Y, Z))) → mark(cons(Y, first(X, Z)))
active(sel(0, cons(X, Z))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(first(X1, X2)) → first(active(X1), X2)
active(first(X1, X2)) → first(X1, active(X2))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
first(mark(X1), X2) → mark(first(X1, X2))
first(X1, mark(X2)) → mark(first(X1, X2))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(first(X1, X2)) → first(proper(X1), proper(X2))
proper(0) → ok(0)
proper(nil) → ok(nil)
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
first(ok(X1), ok(X2)) → ok(first(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Rewrite Strategy: INNERMOST
(1) DecreasingLoopProof (EQUIVALENT transformation)
The following loop(s) give(s) rise to the lower bound Ω(n1):
The rewrite sequence
from(mark(X)) →+ mark(from(X))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [X / mark(X)].
The result substitution is [ ].
(2) BOUNDS(n^1, INF)
(3) RenamingProof (EQUIVALENT transformation)
Renamed function symbols to avoid clashes with predefined symbol.
(4) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
active(from(X)) → mark(cons(X, from(s(X))))
active(first(0', Z)) → mark(nil)
active(first(s(X), cons(Y, Z))) → mark(cons(Y, first(X, Z)))
active(sel(0', cons(X, Z))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(first(X1, X2)) → first(active(X1), X2)
active(first(X1, X2)) → first(X1, active(X2))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
first(mark(X1), X2) → mark(first(X1, X2))
first(X1, mark(X2)) → mark(first(X1, X2))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(first(X1, X2)) → first(proper(X1), proper(X2))
proper(0') → ok(0')
proper(nil) → ok(nil)
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
first(ok(X1), ok(X2)) → ok(first(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
S is empty.
Rewrite Strategy: INNERMOST
(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)
Infered types.
(6) Obligation:
Innermost TRS:
Rules:
active(from(X)) → mark(cons(X, from(s(X))))
active(first(0', Z)) → mark(nil)
active(first(s(X), cons(Y, Z))) → mark(cons(Y, first(X, Z)))
active(sel(0', cons(X, Z))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(first(X1, X2)) → first(active(X1), X2)
active(first(X1, X2)) → first(X1, active(X2))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
first(mark(X1), X2) → mark(first(X1, X2))
first(X1, mark(X2)) → mark(first(X1, X2))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(first(X1, X2)) → first(proper(X1), proper(X2))
proper(0') → ok(0')
proper(nil) → ok(nil)
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
first(ok(X1), ok(X2)) → ok(first(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: mark:0':nil:ok → mark:0':nil:ok
from :: mark:0':nil:ok → mark:0':nil:ok
mark :: mark:0':nil:ok → mark:0':nil:ok
cons :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
s :: mark:0':nil:ok → mark:0':nil:ok
first :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
0' :: mark:0':nil:ok
nil :: mark:0':nil:ok
sel :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
proper :: mark:0':nil:ok → mark:0':nil:ok
ok :: mark:0':nil:ok → mark:0':nil:ok
top :: mark:0':nil:ok → top
hole_mark:0':nil:ok1_0 :: mark:0':nil:ok
hole_top2_0 :: top
gen_mark:0':nil:ok3_0 :: Nat → mark:0':nil:ok
(7) OrderProof (LOWER BOUND(ID) transformation)
Heuristically decided to analyse the following defined symbols:
active,
cons,
from,
s,
first,
sel,
proper,
topThey will be analysed ascendingly in the following order:
cons < active
from < active
s < active
first < active
sel < active
active < top
cons < proper
from < proper
s < proper
first < proper
sel < proper
proper < top
(8) Obligation:
Innermost TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
first(
0',
Z)) →
mark(
nil)
active(
first(
s(
X),
cons(
Y,
Z))) →
mark(
cons(
Y,
first(
X,
Z)))
active(
sel(
0',
cons(
X,
Z))) →
mark(
X)
active(
sel(
s(
X),
cons(
Y,
Z))) →
mark(
sel(
X,
Z))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
first(
X1,
X2)) →
first(
active(
X1),
X2)
active(
first(
X1,
X2)) →
first(
X1,
active(
X2))
active(
sel(
X1,
X2)) →
sel(
active(
X1),
X2)
active(
sel(
X1,
X2)) →
sel(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
first(
mark(
X1),
X2) →
mark(
first(
X1,
X2))
first(
X1,
mark(
X2)) →
mark(
first(
X1,
X2))
sel(
mark(
X1),
X2) →
mark(
sel(
X1,
X2))
sel(
X1,
mark(
X2)) →
mark(
sel(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
first(
X1,
X2)) →
first(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
proper(
nil) →
ok(
nil)
proper(
sel(
X1,
X2)) →
sel(
proper(
X1),
proper(
X2))
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
first(
ok(
X1),
ok(
X2)) →
ok(
first(
X1,
X2))
sel(
ok(
X1),
ok(
X2)) →
ok(
sel(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':nil:ok → mark:0':nil:ok
from :: mark:0':nil:ok → mark:0':nil:ok
mark :: mark:0':nil:ok → mark:0':nil:ok
cons :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
s :: mark:0':nil:ok → mark:0':nil:ok
first :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
0' :: mark:0':nil:ok
nil :: mark:0':nil:ok
sel :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
proper :: mark:0':nil:ok → mark:0':nil:ok
ok :: mark:0':nil:ok → mark:0':nil:ok
top :: mark:0':nil:ok → top
hole_mark:0':nil:ok1_0 :: mark:0':nil:ok
hole_top2_0 :: top
gen_mark:0':nil:ok3_0 :: Nat → mark:0':nil:ok
Generator Equations:
gen_mark:0':nil:ok3_0(0) ⇔ 0'
gen_mark:0':nil:ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':nil:ok3_0(x))
The following defined symbols remain to be analysed:
cons, active, from, s, first, sel, proper, top
They will be analysed ascendingly in the following order:
cons < active
from < active
s < active
first < active
sel < active
active < top
cons < proper
from < proper
s < proper
first < proper
sel < proper
proper < top
(9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol cons.
(10) Obligation:
Innermost TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
first(
0',
Z)) →
mark(
nil)
active(
first(
s(
X),
cons(
Y,
Z))) →
mark(
cons(
Y,
first(
X,
Z)))
active(
sel(
0',
cons(
X,
Z))) →
mark(
X)
active(
sel(
s(
X),
cons(
Y,
Z))) →
mark(
sel(
X,
Z))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
first(
X1,
X2)) →
first(
active(
X1),
X2)
active(
first(
X1,
X2)) →
first(
X1,
active(
X2))
active(
sel(
X1,
X2)) →
sel(
active(
X1),
X2)
active(
sel(
X1,
X2)) →
sel(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
first(
mark(
X1),
X2) →
mark(
first(
X1,
X2))
first(
X1,
mark(
X2)) →
mark(
first(
X1,
X2))
sel(
mark(
X1),
X2) →
mark(
sel(
X1,
X2))
sel(
X1,
mark(
X2)) →
mark(
sel(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
first(
X1,
X2)) →
first(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
proper(
nil) →
ok(
nil)
proper(
sel(
X1,
X2)) →
sel(
proper(
X1),
proper(
X2))
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
first(
ok(
X1),
ok(
X2)) →
ok(
first(
X1,
X2))
sel(
ok(
X1),
ok(
X2)) →
ok(
sel(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':nil:ok → mark:0':nil:ok
from :: mark:0':nil:ok → mark:0':nil:ok
mark :: mark:0':nil:ok → mark:0':nil:ok
cons :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
s :: mark:0':nil:ok → mark:0':nil:ok
first :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
0' :: mark:0':nil:ok
nil :: mark:0':nil:ok
sel :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
proper :: mark:0':nil:ok → mark:0':nil:ok
ok :: mark:0':nil:ok → mark:0':nil:ok
top :: mark:0':nil:ok → top
hole_mark:0':nil:ok1_0 :: mark:0':nil:ok
hole_top2_0 :: top
gen_mark:0':nil:ok3_0 :: Nat → mark:0':nil:ok
Generator Equations:
gen_mark:0':nil:ok3_0(0) ⇔ 0'
gen_mark:0':nil:ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':nil:ok3_0(x))
The following defined symbols remain to be analysed:
from, active, s, first, sel, proper, top
They will be analysed ascendingly in the following order:
from < active
s < active
first < active
sel < active
active < top
from < proper
s < proper
first < proper
sel < proper
proper < top
(11) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol from.
(12) Obligation:
Innermost TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
first(
0',
Z)) →
mark(
nil)
active(
first(
s(
X),
cons(
Y,
Z))) →
mark(
cons(
Y,
first(
X,
Z)))
active(
sel(
0',
cons(
X,
Z))) →
mark(
X)
active(
sel(
s(
X),
cons(
Y,
Z))) →
mark(
sel(
X,
Z))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
first(
X1,
X2)) →
first(
active(
X1),
X2)
active(
first(
X1,
X2)) →
first(
X1,
active(
X2))
active(
sel(
X1,
X2)) →
sel(
active(
X1),
X2)
active(
sel(
X1,
X2)) →
sel(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
first(
mark(
X1),
X2) →
mark(
first(
X1,
X2))
first(
X1,
mark(
X2)) →
mark(
first(
X1,
X2))
sel(
mark(
X1),
X2) →
mark(
sel(
X1,
X2))
sel(
X1,
mark(
X2)) →
mark(
sel(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
first(
X1,
X2)) →
first(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
proper(
nil) →
ok(
nil)
proper(
sel(
X1,
X2)) →
sel(
proper(
X1),
proper(
X2))
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
first(
ok(
X1),
ok(
X2)) →
ok(
first(
X1,
X2))
sel(
ok(
X1),
ok(
X2)) →
ok(
sel(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':nil:ok → mark:0':nil:ok
from :: mark:0':nil:ok → mark:0':nil:ok
mark :: mark:0':nil:ok → mark:0':nil:ok
cons :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
s :: mark:0':nil:ok → mark:0':nil:ok
first :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
0' :: mark:0':nil:ok
nil :: mark:0':nil:ok
sel :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
proper :: mark:0':nil:ok → mark:0':nil:ok
ok :: mark:0':nil:ok → mark:0':nil:ok
top :: mark:0':nil:ok → top
hole_mark:0':nil:ok1_0 :: mark:0':nil:ok
hole_top2_0 :: top
gen_mark:0':nil:ok3_0 :: Nat → mark:0':nil:ok
Generator Equations:
gen_mark:0':nil:ok3_0(0) ⇔ 0'
gen_mark:0':nil:ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':nil:ok3_0(x))
The following defined symbols remain to be analysed:
s, active, first, sel, proper, top
They will be analysed ascendingly in the following order:
s < active
first < active
sel < active
active < top
s < proper
first < proper
sel < proper
proper < top
(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol s.
(14) Obligation:
Innermost TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
first(
0',
Z)) →
mark(
nil)
active(
first(
s(
X),
cons(
Y,
Z))) →
mark(
cons(
Y,
first(
X,
Z)))
active(
sel(
0',
cons(
X,
Z))) →
mark(
X)
active(
sel(
s(
X),
cons(
Y,
Z))) →
mark(
sel(
X,
Z))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
first(
X1,
X2)) →
first(
active(
X1),
X2)
active(
first(
X1,
X2)) →
first(
X1,
active(
X2))
active(
sel(
X1,
X2)) →
sel(
active(
X1),
X2)
active(
sel(
X1,
X2)) →
sel(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
first(
mark(
X1),
X2) →
mark(
first(
X1,
X2))
first(
X1,
mark(
X2)) →
mark(
first(
X1,
X2))
sel(
mark(
X1),
X2) →
mark(
sel(
X1,
X2))
sel(
X1,
mark(
X2)) →
mark(
sel(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
first(
X1,
X2)) →
first(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
proper(
nil) →
ok(
nil)
proper(
sel(
X1,
X2)) →
sel(
proper(
X1),
proper(
X2))
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
first(
ok(
X1),
ok(
X2)) →
ok(
first(
X1,
X2))
sel(
ok(
X1),
ok(
X2)) →
ok(
sel(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':nil:ok → mark:0':nil:ok
from :: mark:0':nil:ok → mark:0':nil:ok
mark :: mark:0':nil:ok → mark:0':nil:ok
cons :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
s :: mark:0':nil:ok → mark:0':nil:ok
first :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
0' :: mark:0':nil:ok
nil :: mark:0':nil:ok
sel :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
proper :: mark:0':nil:ok → mark:0':nil:ok
ok :: mark:0':nil:ok → mark:0':nil:ok
top :: mark:0':nil:ok → top
hole_mark:0':nil:ok1_0 :: mark:0':nil:ok
hole_top2_0 :: top
gen_mark:0':nil:ok3_0 :: Nat → mark:0':nil:ok
Generator Equations:
gen_mark:0':nil:ok3_0(0) ⇔ 0'
gen_mark:0':nil:ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':nil:ok3_0(x))
The following defined symbols remain to be analysed:
first, active, sel, proper, top
They will be analysed ascendingly in the following order:
first < active
sel < active
active < top
first < proper
sel < proper
proper < top
(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol first.
(16) Obligation:
Innermost TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
first(
0',
Z)) →
mark(
nil)
active(
first(
s(
X),
cons(
Y,
Z))) →
mark(
cons(
Y,
first(
X,
Z)))
active(
sel(
0',
cons(
X,
Z))) →
mark(
X)
active(
sel(
s(
X),
cons(
Y,
Z))) →
mark(
sel(
X,
Z))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
first(
X1,
X2)) →
first(
active(
X1),
X2)
active(
first(
X1,
X2)) →
first(
X1,
active(
X2))
active(
sel(
X1,
X2)) →
sel(
active(
X1),
X2)
active(
sel(
X1,
X2)) →
sel(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
first(
mark(
X1),
X2) →
mark(
first(
X1,
X2))
first(
X1,
mark(
X2)) →
mark(
first(
X1,
X2))
sel(
mark(
X1),
X2) →
mark(
sel(
X1,
X2))
sel(
X1,
mark(
X2)) →
mark(
sel(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
first(
X1,
X2)) →
first(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
proper(
nil) →
ok(
nil)
proper(
sel(
X1,
X2)) →
sel(
proper(
X1),
proper(
X2))
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
first(
ok(
X1),
ok(
X2)) →
ok(
first(
X1,
X2))
sel(
ok(
X1),
ok(
X2)) →
ok(
sel(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':nil:ok → mark:0':nil:ok
from :: mark:0':nil:ok → mark:0':nil:ok
mark :: mark:0':nil:ok → mark:0':nil:ok
cons :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
s :: mark:0':nil:ok → mark:0':nil:ok
first :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
0' :: mark:0':nil:ok
nil :: mark:0':nil:ok
sel :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
proper :: mark:0':nil:ok → mark:0':nil:ok
ok :: mark:0':nil:ok → mark:0':nil:ok
top :: mark:0':nil:ok → top
hole_mark:0':nil:ok1_0 :: mark:0':nil:ok
hole_top2_0 :: top
gen_mark:0':nil:ok3_0 :: Nat → mark:0':nil:ok
Generator Equations:
gen_mark:0':nil:ok3_0(0) ⇔ 0'
gen_mark:0':nil:ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':nil:ok3_0(x))
The following defined symbols remain to be analysed:
sel, active, proper, top
They will be analysed ascendingly in the following order:
sel < active
active < top
sel < proper
proper < top
(17) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol sel.
(18) Obligation:
Innermost TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
first(
0',
Z)) →
mark(
nil)
active(
first(
s(
X),
cons(
Y,
Z))) →
mark(
cons(
Y,
first(
X,
Z)))
active(
sel(
0',
cons(
X,
Z))) →
mark(
X)
active(
sel(
s(
X),
cons(
Y,
Z))) →
mark(
sel(
X,
Z))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
first(
X1,
X2)) →
first(
active(
X1),
X2)
active(
first(
X1,
X2)) →
first(
X1,
active(
X2))
active(
sel(
X1,
X2)) →
sel(
active(
X1),
X2)
active(
sel(
X1,
X2)) →
sel(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
first(
mark(
X1),
X2) →
mark(
first(
X1,
X2))
first(
X1,
mark(
X2)) →
mark(
first(
X1,
X2))
sel(
mark(
X1),
X2) →
mark(
sel(
X1,
X2))
sel(
X1,
mark(
X2)) →
mark(
sel(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
first(
X1,
X2)) →
first(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
proper(
nil) →
ok(
nil)
proper(
sel(
X1,
X2)) →
sel(
proper(
X1),
proper(
X2))
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
first(
ok(
X1),
ok(
X2)) →
ok(
first(
X1,
X2))
sel(
ok(
X1),
ok(
X2)) →
ok(
sel(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':nil:ok → mark:0':nil:ok
from :: mark:0':nil:ok → mark:0':nil:ok
mark :: mark:0':nil:ok → mark:0':nil:ok
cons :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
s :: mark:0':nil:ok → mark:0':nil:ok
first :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
0' :: mark:0':nil:ok
nil :: mark:0':nil:ok
sel :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
proper :: mark:0':nil:ok → mark:0':nil:ok
ok :: mark:0':nil:ok → mark:0':nil:ok
top :: mark:0':nil:ok → top
hole_mark:0':nil:ok1_0 :: mark:0':nil:ok
hole_top2_0 :: top
gen_mark:0':nil:ok3_0 :: Nat → mark:0':nil:ok
Generator Equations:
gen_mark:0':nil:ok3_0(0) ⇔ 0'
gen_mark:0':nil:ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':nil:ok3_0(x))
The following defined symbols remain to be analysed:
active, proper, top
They will be analysed ascendingly in the following order:
active < top
proper < top
(19) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol active.
(20) Obligation:
Innermost TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
first(
0',
Z)) →
mark(
nil)
active(
first(
s(
X),
cons(
Y,
Z))) →
mark(
cons(
Y,
first(
X,
Z)))
active(
sel(
0',
cons(
X,
Z))) →
mark(
X)
active(
sel(
s(
X),
cons(
Y,
Z))) →
mark(
sel(
X,
Z))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
first(
X1,
X2)) →
first(
active(
X1),
X2)
active(
first(
X1,
X2)) →
first(
X1,
active(
X2))
active(
sel(
X1,
X2)) →
sel(
active(
X1),
X2)
active(
sel(
X1,
X2)) →
sel(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
first(
mark(
X1),
X2) →
mark(
first(
X1,
X2))
first(
X1,
mark(
X2)) →
mark(
first(
X1,
X2))
sel(
mark(
X1),
X2) →
mark(
sel(
X1,
X2))
sel(
X1,
mark(
X2)) →
mark(
sel(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
first(
X1,
X2)) →
first(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
proper(
nil) →
ok(
nil)
proper(
sel(
X1,
X2)) →
sel(
proper(
X1),
proper(
X2))
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
first(
ok(
X1),
ok(
X2)) →
ok(
first(
X1,
X2))
sel(
ok(
X1),
ok(
X2)) →
ok(
sel(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':nil:ok → mark:0':nil:ok
from :: mark:0':nil:ok → mark:0':nil:ok
mark :: mark:0':nil:ok → mark:0':nil:ok
cons :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
s :: mark:0':nil:ok → mark:0':nil:ok
first :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
0' :: mark:0':nil:ok
nil :: mark:0':nil:ok
sel :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
proper :: mark:0':nil:ok → mark:0':nil:ok
ok :: mark:0':nil:ok → mark:0':nil:ok
top :: mark:0':nil:ok → top
hole_mark:0':nil:ok1_0 :: mark:0':nil:ok
hole_top2_0 :: top
gen_mark:0':nil:ok3_0 :: Nat → mark:0':nil:ok
Generator Equations:
gen_mark:0':nil:ok3_0(0) ⇔ 0'
gen_mark:0':nil:ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':nil:ok3_0(x))
The following defined symbols remain to be analysed:
proper, top
They will be analysed ascendingly in the following order:
proper < top
(21) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol proper.
(22) Obligation:
Innermost TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
first(
0',
Z)) →
mark(
nil)
active(
first(
s(
X),
cons(
Y,
Z))) →
mark(
cons(
Y,
first(
X,
Z)))
active(
sel(
0',
cons(
X,
Z))) →
mark(
X)
active(
sel(
s(
X),
cons(
Y,
Z))) →
mark(
sel(
X,
Z))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
first(
X1,
X2)) →
first(
active(
X1),
X2)
active(
first(
X1,
X2)) →
first(
X1,
active(
X2))
active(
sel(
X1,
X2)) →
sel(
active(
X1),
X2)
active(
sel(
X1,
X2)) →
sel(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
first(
mark(
X1),
X2) →
mark(
first(
X1,
X2))
first(
X1,
mark(
X2)) →
mark(
first(
X1,
X2))
sel(
mark(
X1),
X2) →
mark(
sel(
X1,
X2))
sel(
X1,
mark(
X2)) →
mark(
sel(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
first(
X1,
X2)) →
first(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
proper(
nil) →
ok(
nil)
proper(
sel(
X1,
X2)) →
sel(
proper(
X1),
proper(
X2))
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
first(
ok(
X1),
ok(
X2)) →
ok(
first(
X1,
X2))
sel(
ok(
X1),
ok(
X2)) →
ok(
sel(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':nil:ok → mark:0':nil:ok
from :: mark:0':nil:ok → mark:0':nil:ok
mark :: mark:0':nil:ok → mark:0':nil:ok
cons :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
s :: mark:0':nil:ok → mark:0':nil:ok
first :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
0' :: mark:0':nil:ok
nil :: mark:0':nil:ok
sel :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
proper :: mark:0':nil:ok → mark:0':nil:ok
ok :: mark:0':nil:ok → mark:0':nil:ok
top :: mark:0':nil:ok → top
hole_mark:0':nil:ok1_0 :: mark:0':nil:ok
hole_top2_0 :: top
gen_mark:0':nil:ok3_0 :: Nat → mark:0':nil:ok
Generator Equations:
gen_mark:0':nil:ok3_0(0) ⇔ 0'
gen_mark:0':nil:ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':nil:ok3_0(x))
The following defined symbols remain to be analysed:
top
(23) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol top.
(24) Obligation:
Innermost TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
first(
0',
Z)) →
mark(
nil)
active(
first(
s(
X),
cons(
Y,
Z))) →
mark(
cons(
Y,
first(
X,
Z)))
active(
sel(
0',
cons(
X,
Z))) →
mark(
X)
active(
sel(
s(
X),
cons(
Y,
Z))) →
mark(
sel(
X,
Z))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
first(
X1,
X2)) →
first(
active(
X1),
X2)
active(
first(
X1,
X2)) →
first(
X1,
active(
X2))
active(
sel(
X1,
X2)) →
sel(
active(
X1),
X2)
active(
sel(
X1,
X2)) →
sel(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
first(
mark(
X1),
X2) →
mark(
first(
X1,
X2))
first(
X1,
mark(
X2)) →
mark(
first(
X1,
X2))
sel(
mark(
X1),
X2) →
mark(
sel(
X1,
X2))
sel(
X1,
mark(
X2)) →
mark(
sel(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
first(
X1,
X2)) →
first(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
proper(
nil) →
ok(
nil)
proper(
sel(
X1,
X2)) →
sel(
proper(
X1),
proper(
X2))
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
first(
ok(
X1),
ok(
X2)) →
ok(
first(
X1,
X2))
sel(
ok(
X1),
ok(
X2)) →
ok(
sel(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':nil:ok → mark:0':nil:ok
from :: mark:0':nil:ok → mark:0':nil:ok
mark :: mark:0':nil:ok → mark:0':nil:ok
cons :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
s :: mark:0':nil:ok → mark:0':nil:ok
first :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
0' :: mark:0':nil:ok
nil :: mark:0':nil:ok
sel :: mark:0':nil:ok → mark:0':nil:ok → mark:0':nil:ok
proper :: mark:0':nil:ok → mark:0':nil:ok
ok :: mark:0':nil:ok → mark:0':nil:ok
top :: mark:0':nil:ok → top
hole_mark:0':nil:ok1_0 :: mark:0':nil:ok
hole_top2_0 :: top
gen_mark:0':nil:ok3_0 :: Nat → mark:0':nil:ok
Generator Equations:
gen_mark:0':nil:ok3_0(0) ⇔ 0'
gen_mark:0':nil:ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':nil:ok3_0(x))
No more defined symbols left to analyse.