/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


WORST_CASE(Omega(n^2), ?)
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF).

(0) CpxTRS
(1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(2) CpxTRS
(3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
(4) typed CpxTrs
(5) OrderProof [LOWER BOUND(ID), 0 ms]
(6) typed CpxTrs
(7) RewriteLemmaProof [LOWER BOUND(ID), 281 ms]
(8) BEST
    (9) proven lower bound
        (10) LowerBoundPropagationProof [FINISHED, 0 ms]
        (11) BOUNDS(n^1, INF)
    (12) typed CpxTrs
        (13) RewriteLemmaProof [LOWER BOUND(ID), 61 ms]
        (14) typed CpxTrs
        (15) RewriteLemmaProof [LOWER BOUND(ID), 0 ms]
        (16) typed CpxTrs
        (17) RewriteLemmaProof [LOWER BOUND(ID), 846 ms]
        (18) proven lower bound
        (19) LowerBoundPropagationProof [FINISHED, 0 ms]
        (20) BOUNDS(n^2, INF)


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

(0)
Obligation:
The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF).


The TRS R consists of the following rules:

   eq(0, 0) -> true
   eq(0, s(m)) -> false
   eq(s(n), 0) -> false
   eq(s(n), s(m)) -> eq(n, m)
   le(0, m) -> true
   le(s(n), 0) -> false
   le(s(n), s(m)) -> le(n, m)
   min(cons(0, nil)) -> 0
   min(cons(s(n), nil)) -> s(n)
   min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x)))
   if_min(true, cons(n, cons(m, x))) -> min(cons(n, x))
   if_min(false, cons(n, cons(m, x))) -> min(cons(m, x))
   replace(n, m, nil) -> nil
   replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x))
   if_replace(true, n, m, cons(k, x)) -> cons(m, x)
   if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x))
   sort(nil) -> nil
   sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, x)))

S is empty.
Rewrite Strategy: FULL
----------------------------------------

(1) RenamingProof (BOTH BOUNDS(ID, ID))
Renamed function symbols to avoid clashes with predefined symbol.
----------------------------------------

(2)
Obligation:
The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF).


The TRS R consists of the following rules:

   eq(0', 0') -> true
   eq(0', s(m)) -> false
   eq(s(n), 0') -> false
   eq(s(n), s(m)) -> eq(n, m)
   le(0', m) -> true
   le(s(n), 0') -> false
   le(s(n), s(m)) -> le(n, m)
   min(cons(0', nil)) -> 0'
   min(cons(s(n), nil)) -> s(n)
   min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x)))
   if_min(true, cons(n, cons(m, x))) -> min(cons(n, x))
   if_min(false, cons(n, cons(m, x))) -> min(cons(m, x))
   replace(n, m, nil) -> nil
   replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x))
   if_replace(true, n, m, cons(k, x)) -> cons(m, x)
   if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x))
   sort(nil) -> nil
   sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, x)))

S is empty.
Rewrite Strategy: FULL
----------------------------------------

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID))
Infered types.
----------------------------------------

(4)
Obligation:
TRS:
Rules:
eq(0', 0') -> true
eq(0', s(m)) -> false
eq(s(n), 0') -> false
eq(s(n), s(m)) -> eq(n, m)
le(0', m) -> true
le(s(n), 0') -> false
le(s(n), s(m)) -> le(n, m)
min(cons(0', nil)) -> 0'
min(cons(s(n), nil)) -> s(n)
min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x)))
if_min(true, cons(n, cons(m, x))) -> min(cons(n, x))
if_min(false, cons(n, cons(m, x))) -> min(cons(m, x))
replace(n, m, nil) -> nil
replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x))
if_replace(true, n, m, cons(k, x)) -> cons(m, x)
if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x))
sort(nil) -> nil
sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, x)))

Types:
eq :: 0':s -> 0':s -> true:false
0' :: 0':s
true :: true:false
s :: 0':s -> 0':s
false :: true:false
le :: 0':s -> 0':s -> true:false
min :: nil:cons -> 0':s
cons :: 0':s -> nil:cons -> nil:cons
nil :: nil:cons
if_min :: true:false -> nil:cons -> 0':s
replace :: 0':s -> 0':s -> nil:cons -> nil:cons
if_replace :: true:false -> 0':s -> 0':s -> nil:cons -> nil:cons
sort :: nil:cons -> nil:cons
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_nil:cons3_0 :: nil:cons
gen_0':s4_0 :: Nat -> 0':s
gen_nil:cons5_0 :: Nat -> nil:cons

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

(5) OrderProof (LOWER BOUND(ID))
Heuristically decided to analyse the following defined symbols:
eq, le, min, replace, sort

They will be analysed ascendingly in the following order:
eq < replace
le < min
min < sort
replace < sort

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

(6)
Obligation:
TRS:
Rules:
eq(0', 0') -> true
eq(0', s(m)) -> false
eq(s(n), 0') -> false
eq(s(n), s(m)) -> eq(n, m)
le(0', m) -> true
le(s(n), 0') -> false
le(s(n), s(m)) -> le(n, m)
min(cons(0', nil)) -> 0'
min(cons(s(n), nil)) -> s(n)
min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x)))
if_min(true, cons(n, cons(m, x))) -> min(cons(n, x))
if_min(false, cons(n, cons(m, x))) -> min(cons(m, x))
replace(n, m, nil) -> nil
replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x))
if_replace(true, n, m, cons(k, x)) -> cons(m, x)
if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x))
sort(nil) -> nil
sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, x)))

Types:
eq :: 0':s -> 0':s -> true:false
0' :: 0':s
true :: true:false
s :: 0':s -> 0':s
false :: true:false
le :: 0':s -> 0':s -> true:false
min :: nil:cons -> 0':s
cons :: 0':s -> nil:cons -> nil:cons
nil :: nil:cons
if_min :: true:false -> nil:cons -> 0':s
replace :: 0':s -> 0':s -> nil:cons -> nil:cons
if_replace :: true:false -> 0':s -> 0':s -> nil:cons -> nil:cons
sort :: nil:cons -> nil:cons
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_nil:cons3_0 :: nil:cons
gen_0':s4_0 :: Nat -> 0':s
gen_nil:cons5_0 :: Nat -> nil:cons


Generator Equations:
gen_0':s4_0(0) <=> 0'
gen_0':s4_0(+(x, 1)) <=> s(gen_0':s4_0(x))
gen_nil:cons5_0(0) <=> nil
gen_nil:cons5_0(+(x, 1)) <=> cons(0', gen_nil:cons5_0(x))


The following defined symbols remain to be analysed:
eq, le, min, replace, sort

They will be analysed ascendingly in the following order:
eq < replace
le < min
min < sort
replace < sort

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

(7) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
eq(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) -> true, rt in Omega(1 + n7_0)

Induction Base:
eq(gen_0':s4_0(0), gen_0':s4_0(0)) ->_R^Omega(1)
true

Induction Step:
eq(gen_0':s4_0(+(n7_0, 1)), gen_0':s4_0(+(n7_0, 1))) ->_R^Omega(1)
eq(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) ->_IH
true

We have rt in Omega(n^1) and sz in O(n). Thus, we have irc_R in Omega(n).
----------------------------------------

(8)
Complex Obligation (BEST)

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

(9)
Obligation:
Proved the lower bound n^1 for the following obligation:

TRS:
Rules:
eq(0', 0') -> true
eq(0', s(m)) -> false
eq(s(n), 0') -> false
eq(s(n), s(m)) -> eq(n, m)
le(0', m) -> true
le(s(n), 0') -> false
le(s(n), s(m)) -> le(n, m)
min(cons(0', nil)) -> 0'
min(cons(s(n), nil)) -> s(n)
min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x)))
if_min(true, cons(n, cons(m, x))) -> min(cons(n, x))
if_min(false, cons(n, cons(m, x))) -> min(cons(m, x))
replace(n, m, nil) -> nil
replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x))
if_replace(true, n, m, cons(k, x)) -> cons(m, x)
if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x))
sort(nil) -> nil
sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, x)))

Types:
eq :: 0':s -> 0':s -> true:false
0' :: 0':s
true :: true:false
s :: 0':s -> 0':s
false :: true:false
le :: 0':s -> 0':s -> true:false
min :: nil:cons -> 0':s
cons :: 0':s -> nil:cons -> nil:cons
nil :: nil:cons
if_min :: true:false -> nil:cons -> 0':s
replace :: 0':s -> 0':s -> nil:cons -> nil:cons
if_replace :: true:false -> 0':s -> 0':s -> nil:cons -> nil:cons
sort :: nil:cons -> nil:cons
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_nil:cons3_0 :: nil:cons
gen_0':s4_0 :: Nat -> 0':s
gen_nil:cons5_0 :: Nat -> nil:cons


Generator Equations:
gen_0':s4_0(0) <=> 0'
gen_0':s4_0(+(x, 1)) <=> s(gen_0':s4_0(x))
gen_nil:cons5_0(0) <=> nil
gen_nil:cons5_0(+(x, 1)) <=> cons(0', gen_nil:cons5_0(x))


The following defined symbols remain to be analysed:
eq, le, min, replace, sort

They will be analysed ascendingly in the following order:
eq < replace
le < min
min < sort
replace < sort

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

(10) LowerBoundPropagationProof (FINISHED)
Propagated lower bound.
----------------------------------------

(11)
BOUNDS(n^1, INF)

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

(12)
Obligation:
TRS:
Rules:
eq(0', 0') -> true
eq(0', s(m)) -> false
eq(s(n), 0') -> false
eq(s(n), s(m)) -> eq(n, m)
le(0', m) -> true
le(s(n), 0') -> false
le(s(n), s(m)) -> le(n, m)
min(cons(0', nil)) -> 0'
min(cons(s(n), nil)) -> s(n)
min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x)))
if_min(true, cons(n, cons(m, x))) -> min(cons(n, x))
if_min(false, cons(n, cons(m, x))) -> min(cons(m, x))
replace(n, m, nil) -> nil
replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x))
if_replace(true, n, m, cons(k, x)) -> cons(m, x)
if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x))
sort(nil) -> nil
sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, x)))

Types:
eq :: 0':s -> 0':s -> true:false
0' :: 0':s
true :: true:false
s :: 0':s -> 0':s
false :: true:false
le :: 0':s -> 0':s -> true:false
min :: nil:cons -> 0':s
cons :: 0':s -> nil:cons -> nil:cons
nil :: nil:cons
if_min :: true:false -> nil:cons -> 0':s
replace :: 0':s -> 0':s -> nil:cons -> nil:cons
if_replace :: true:false -> 0':s -> 0':s -> nil:cons -> nil:cons
sort :: nil:cons -> nil:cons
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_nil:cons3_0 :: nil:cons
gen_0':s4_0 :: Nat -> 0':s
gen_nil:cons5_0 :: Nat -> nil:cons


Lemmas:
eq(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) -> true, rt in Omega(1 + n7_0)


Generator Equations:
gen_0':s4_0(0) <=> 0'
gen_0':s4_0(+(x, 1)) <=> s(gen_0':s4_0(x))
gen_nil:cons5_0(0) <=> nil
gen_nil:cons5_0(+(x, 1)) <=> cons(0', gen_nil:cons5_0(x))


The following defined symbols remain to be analysed:
le, min, replace, sort

They will be analysed ascendingly in the following order:
le < min
min < sort
replace < sort

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

(13) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
le(gen_0':s4_0(n518_0), gen_0':s4_0(n518_0)) -> true, rt in Omega(1 + n518_0)

Induction Base:
le(gen_0':s4_0(0), gen_0':s4_0(0)) ->_R^Omega(1)
true

Induction Step:
le(gen_0':s4_0(+(n518_0, 1)), gen_0':s4_0(+(n518_0, 1))) ->_R^Omega(1)
le(gen_0':s4_0(n518_0), gen_0':s4_0(n518_0)) ->_IH
true

We have rt in Omega(n^1) and sz in O(n). Thus, we have irc_R in Omega(n).
----------------------------------------

(14)
Obligation:
TRS:
Rules:
eq(0', 0') -> true
eq(0', s(m)) -> false
eq(s(n), 0') -> false
eq(s(n), s(m)) -> eq(n, m)
le(0', m) -> true
le(s(n), 0') -> false
le(s(n), s(m)) -> le(n, m)
min(cons(0', nil)) -> 0'
min(cons(s(n), nil)) -> s(n)
min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x)))
if_min(true, cons(n, cons(m, x))) -> min(cons(n, x))
if_min(false, cons(n, cons(m, x))) -> min(cons(m, x))
replace(n, m, nil) -> nil
replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x))
if_replace(true, n, m, cons(k, x)) -> cons(m, x)
if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x))
sort(nil) -> nil
sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, x)))

Types:
eq :: 0':s -> 0':s -> true:false
0' :: 0':s
true :: true:false
s :: 0':s -> 0':s
false :: true:false
le :: 0':s -> 0':s -> true:false
min :: nil:cons -> 0':s
cons :: 0':s -> nil:cons -> nil:cons
nil :: nil:cons
if_min :: true:false -> nil:cons -> 0':s
replace :: 0':s -> 0':s -> nil:cons -> nil:cons
if_replace :: true:false -> 0':s -> 0':s -> nil:cons -> nil:cons
sort :: nil:cons -> nil:cons
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_nil:cons3_0 :: nil:cons
gen_0':s4_0 :: Nat -> 0':s
gen_nil:cons5_0 :: Nat -> nil:cons


Lemmas:
eq(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) -> true, rt in Omega(1 + n7_0)
le(gen_0':s4_0(n518_0), gen_0':s4_0(n518_0)) -> true, rt in Omega(1 + n518_0)


Generator Equations:
gen_0':s4_0(0) <=> 0'
gen_0':s4_0(+(x, 1)) <=> s(gen_0':s4_0(x))
gen_nil:cons5_0(0) <=> nil
gen_nil:cons5_0(+(x, 1)) <=> cons(0', gen_nil:cons5_0(x))


The following defined symbols remain to be analysed:
min, replace, sort

They will be analysed ascendingly in the following order:
min < sort
replace < sort

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

(15) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
min(gen_nil:cons5_0(+(1, n823_0))) -> gen_0':s4_0(0), rt in Omega(1 + n823_0)

Induction Base:
min(gen_nil:cons5_0(+(1, 0))) ->_R^Omega(1)
0'

Induction Step:
min(gen_nil:cons5_0(+(1, +(n823_0, 1)))) ->_R^Omega(1)
if_min(le(0', 0'), cons(0', cons(0', gen_nil:cons5_0(n823_0)))) ->_L^Omega(1)
if_min(true, cons(0', cons(0', gen_nil:cons5_0(n823_0)))) ->_R^Omega(1)
min(cons(0', gen_nil:cons5_0(n823_0))) ->_IH
gen_0':s4_0(0)

We have rt in Omega(n^1) and sz in O(n). Thus, we have irc_R in Omega(n).
----------------------------------------

(16)
Obligation:
TRS:
Rules:
eq(0', 0') -> true
eq(0', s(m)) -> false
eq(s(n), 0') -> false
eq(s(n), s(m)) -> eq(n, m)
le(0', m) -> true
le(s(n), 0') -> false
le(s(n), s(m)) -> le(n, m)
min(cons(0', nil)) -> 0'
min(cons(s(n), nil)) -> s(n)
min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x)))
if_min(true, cons(n, cons(m, x))) -> min(cons(n, x))
if_min(false, cons(n, cons(m, x))) -> min(cons(m, x))
replace(n, m, nil) -> nil
replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x))
if_replace(true, n, m, cons(k, x)) -> cons(m, x)
if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x))
sort(nil) -> nil
sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, x)))

Types:
eq :: 0':s -> 0':s -> true:false
0' :: 0':s
true :: true:false
s :: 0':s -> 0':s
false :: true:false
le :: 0':s -> 0':s -> true:false
min :: nil:cons -> 0':s
cons :: 0':s -> nil:cons -> nil:cons
nil :: nil:cons
if_min :: true:false -> nil:cons -> 0':s
replace :: 0':s -> 0':s -> nil:cons -> nil:cons
if_replace :: true:false -> 0':s -> 0':s -> nil:cons -> nil:cons
sort :: nil:cons -> nil:cons
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_nil:cons3_0 :: nil:cons
gen_0':s4_0 :: Nat -> 0':s
gen_nil:cons5_0 :: Nat -> nil:cons


Lemmas:
eq(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) -> true, rt in Omega(1 + n7_0)
le(gen_0':s4_0(n518_0), gen_0':s4_0(n518_0)) -> true, rt in Omega(1 + n518_0)
min(gen_nil:cons5_0(+(1, n823_0))) -> gen_0':s4_0(0), rt in Omega(1 + n823_0)


Generator Equations:
gen_0':s4_0(0) <=> 0'
gen_0':s4_0(+(x, 1)) <=> s(gen_0':s4_0(x))
gen_nil:cons5_0(0) <=> nil
gen_nil:cons5_0(+(x, 1)) <=> cons(0', gen_nil:cons5_0(x))


The following defined symbols remain to be analysed:
replace, sort

They will be analysed ascendingly in the following order:
replace < sort

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

(17) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
sort(gen_nil:cons5_0(+(1, n1492_0))) -> *6_0, rt in Omega(n1492_0 + n1492_0^2)

Induction Base:
sort(gen_nil:cons5_0(+(1, 0)))

Induction Step:
sort(gen_nil:cons5_0(+(1, +(n1492_0, 1)))) ->_R^Omega(1)
cons(min(cons(0', gen_nil:cons5_0(+(1, n1492_0)))), sort(replace(min(cons(0', gen_nil:cons5_0(+(1, n1492_0)))), 0', gen_nil:cons5_0(+(1, n1492_0))))) ->_L^Omega(2 + n1492_0)
cons(gen_0':s4_0(0), sort(replace(min(cons(0', gen_nil:cons5_0(+(1, n1492_0)))), 0', gen_nil:cons5_0(+(1, n1492_0))))) ->_L^Omega(2 + n1492_0)
cons(gen_0':s4_0(0), sort(replace(gen_0':s4_0(0), 0', gen_nil:cons5_0(+(1, n1492_0))))) ->_R^Omega(1)
cons(gen_0':s4_0(0), sort(if_replace(eq(gen_0':s4_0(0), 0'), gen_0':s4_0(0), 0', cons(0', gen_nil:cons5_0(n1492_0))))) ->_L^Omega(1)
cons(gen_0':s4_0(0), sort(if_replace(true, gen_0':s4_0(0), 0', cons(0', gen_nil:cons5_0(n1492_0))))) ->_R^Omega(1)
cons(gen_0':s4_0(0), sort(cons(0', gen_nil:cons5_0(n1492_0)))) ->_IH
cons(gen_0':s4_0(0), *6_0)

We have rt in Omega(n^2) and sz in O(n). Thus, we have irc_R in Omega(n^2).
----------------------------------------

(18)
Obligation:
Proved the lower bound n^2 for the following obligation:

TRS:
Rules:
eq(0', 0') -> true
eq(0', s(m)) -> false
eq(s(n), 0') -> false
eq(s(n), s(m)) -> eq(n, m)
le(0', m) -> true
le(s(n), 0') -> false
le(s(n), s(m)) -> le(n, m)
min(cons(0', nil)) -> 0'
min(cons(s(n), nil)) -> s(n)
min(cons(n, cons(m, x))) -> if_min(le(n, m), cons(n, cons(m, x)))
if_min(true, cons(n, cons(m, x))) -> min(cons(n, x))
if_min(false, cons(n, cons(m, x))) -> min(cons(m, x))
replace(n, m, nil) -> nil
replace(n, m, cons(k, x)) -> if_replace(eq(n, k), n, m, cons(k, x))
if_replace(true, n, m, cons(k, x)) -> cons(m, x)
if_replace(false, n, m, cons(k, x)) -> cons(k, replace(n, m, x))
sort(nil) -> nil
sort(cons(n, x)) -> cons(min(cons(n, x)), sort(replace(min(cons(n, x)), n, x)))

Types:
eq :: 0':s -> 0':s -> true:false
0' :: 0':s
true :: true:false
s :: 0':s -> 0':s
false :: true:false
le :: 0':s -> 0':s -> true:false
min :: nil:cons -> 0':s
cons :: 0':s -> nil:cons -> nil:cons
nil :: nil:cons
if_min :: true:false -> nil:cons -> 0':s
replace :: 0':s -> 0':s -> nil:cons -> nil:cons
if_replace :: true:false -> 0':s -> 0':s -> nil:cons -> nil:cons
sort :: nil:cons -> nil:cons
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_nil:cons3_0 :: nil:cons
gen_0':s4_0 :: Nat -> 0':s
gen_nil:cons5_0 :: Nat -> nil:cons


Lemmas:
eq(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) -> true, rt in Omega(1 + n7_0)
le(gen_0':s4_0(n518_0), gen_0':s4_0(n518_0)) -> true, rt in Omega(1 + n518_0)
min(gen_nil:cons5_0(+(1, n823_0))) -> gen_0':s4_0(0), rt in Omega(1 + n823_0)


Generator Equations:
gen_0':s4_0(0) <=> 0'
gen_0':s4_0(+(x, 1)) <=> s(gen_0':s4_0(x))
gen_nil:cons5_0(0) <=> nil
gen_nil:cons5_0(+(x, 1)) <=> cons(0', gen_nil:cons5_0(x))


The following defined symbols remain to be analysed:
sort
----------------------------------------

(19) LowerBoundPropagationProof (FINISHED)
Propagated lower bound.
----------------------------------------

(20)
BOUNDS(n^2, INF)