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


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


WORST_CASE(Omega(n^1), ?)
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, 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), 295 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), 76 ms]
        (14) typed CpxTrs


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

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


The TRS R consists of the following rules:

   minus(0, y) -> 0
   minus(x, 0) -> x
   minus(s(x), s(y)) -> minus(x, y)
   plus(0, y) -> y
   plus(s(x), y) -> plus(x, s(y))
   zero(s(x)) -> false
   zero(0) -> true
   p(s(x)) -> x
   div(x, y) -> quot(x, y, 0)
   quot(x, y, z) -> if(zero(x), x, y, plus(z, s(0)))
   if(true, x, y, z) -> p(z)
   if(false, x, s(y), z) -> quot(minus(x, s(y)), s(y), z)

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^1, INF).


The TRS R consists of the following rules:

   minus(0', y) -> 0'
   minus(x, 0') -> x
   minus(s(x), s(y)) -> minus(x, y)
   plus(0', y) -> y
   plus(s(x), y) -> plus(x, s(y))
   zero(s(x)) -> false
   zero(0') -> true
   p(s(x)) -> x
   div(x, y) -> quot(x, y, 0')
   quot(x, y, z) -> if(zero(x), x, y, plus(z, s(0')))
   if(true, x, y, z) -> p(z)
   if(false, x, s(y), z) -> quot(minus(x, s(y)), s(y), z)

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

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

(4)
Obligation:
TRS:
Rules:
minus(0', y) -> 0'
minus(x, 0') -> x
minus(s(x), s(y)) -> minus(x, y)
plus(0', y) -> y
plus(s(x), y) -> plus(x, s(y))
zero(s(x)) -> false
zero(0') -> true
p(s(x)) -> x
div(x, y) -> quot(x, y, 0')
quot(x, y, z) -> if(zero(x), x, y, plus(z, s(0')))
if(true, x, y, z) -> p(z)
if(false, x, s(y), z) -> quot(minus(x, s(y)), s(y), z)

Types:
minus :: 0':s -> 0':s -> 0':s
0' :: 0':s
s :: 0':s -> 0':s
plus :: 0':s -> 0':s -> 0':s
zero :: 0':s -> false:true
false :: false:true
true :: false:true
p :: 0':s -> 0':s
div :: 0':s -> 0':s -> 0':s
quot :: 0':s -> 0':s -> 0':s -> 0':s
if :: false:true -> 0':s -> 0':s -> 0':s -> 0':s
hole_0':s1_0 :: 0':s
hole_false:true2_0 :: false:true
gen_0':s3_0 :: Nat -> 0':s

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

(5) OrderProof (LOWER BOUND(ID))
Heuristically decided to analyse the following defined symbols:
minus, plus, quot

They will be analysed ascendingly in the following order:
minus < quot
plus < quot

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

(6)
Obligation:
TRS:
Rules:
minus(0', y) -> 0'
minus(x, 0') -> x
minus(s(x), s(y)) -> minus(x, y)
plus(0', y) -> y
plus(s(x), y) -> plus(x, s(y))
zero(s(x)) -> false
zero(0') -> true
p(s(x)) -> x
div(x, y) -> quot(x, y, 0')
quot(x, y, z) -> if(zero(x), x, y, plus(z, s(0')))
if(true, x, y, z) -> p(z)
if(false, x, s(y), z) -> quot(minus(x, s(y)), s(y), z)

Types:
minus :: 0':s -> 0':s -> 0':s
0' :: 0':s
s :: 0':s -> 0':s
plus :: 0':s -> 0':s -> 0':s
zero :: 0':s -> false:true
false :: false:true
true :: false:true
p :: 0':s -> 0':s
div :: 0':s -> 0':s -> 0':s
quot :: 0':s -> 0':s -> 0':s -> 0':s
if :: false:true -> 0':s -> 0':s -> 0':s -> 0':s
hole_0':s1_0 :: 0':s
hole_false:true2_0 :: false:true
gen_0':s3_0 :: Nat -> 0':s


Generator Equations:
gen_0':s3_0(0) <=> 0'
gen_0':s3_0(+(x, 1)) <=> s(gen_0':s3_0(x))


The following defined symbols remain to be analysed:
minus, plus, quot

They will be analysed ascendingly in the following order:
minus < quot
plus < quot

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

(7) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
minus(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) -> gen_0':s3_0(0), rt in Omega(1 + n5_0)

Induction Base:
minus(gen_0':s3_0(0), gen_0':s3_0(0)) ->_R^Omega(1)
0'

Induction Step:
minus(gen_0':s3_0(+(n5_0, 1)), gen_0':s3_0(+(n5_0, 1))) ->_R^Omega(1)
minus(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) ->_IH
gen_0':s3_0(0)

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:
minus(0', y) -> 0'
minus(x, 0') -> x
minus(s(x), s(y)) -> minus(x, y)
plus(0', y) -> y
plus(s(x), y) -> plus(x, s(y))
zero(s(x)) -> false
zero(0') -> true
p(s(x)) -> x
div(x, y) -> quot(x, y, 0')
quot(x, y, z) -> if(zero(x), x, y, plus(z, s(0')))
if(true, x, y, z) -> p(z)
if(false, x, s(y), z) -> quot(minus(x, s(y)), s(y), z)

Types:
minus :: 0':s -> 0':s -> 0':s
0' :: 0':s
s :: 0':s -> 0':s
plus :: 0':s -> 0':s -> 0':s
zero :: 0':s -> false:true
false :: false:true
true :: false:true
p :: 0':s -> 0':s
div :: 0':s -> 0':s -> 0':s
quot :: 0':s -> 0':s -> 0':s -> 0':s
if :: false:true -> 0':s -> 0':s -> 0':s -> 0':s
hole_0':s1_0 :: 0':s
hole_false:true2_0 :: false:true
gen_0':s3_0 :: Nat -> 0':s


Generator Equations:
gen_0':s3_0(0) <=> 0'
gen_0':s3_0(+(x, 1)) <=> s(gen_0':s3_0(x))


The following defined symbols remain to be analysed:
minus, plus, quot

They will be analysed ascendingly in the following order:
minus < quot
plus < quot

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

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

(11)
BOUNDS(n^1, INF)

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

(12)
Obligation:
TRS:
Rules:
minus(0', y) -> 0'
minus(x, 0') -> x
minus(s(x), s(y)) -> minus(x, y)
plus(0', y) -> y
plus(s(x), y) -> plus(x, s(y))
zero(s(x)) -> false
zero(0') -> true
p(s(x)) -> x
div(x, y) -> quot(x, y, 0')
quot(x, y, z) -> if(zero(x), x, y, plus(z, s(0')))
if(true, x, y, z) -> p(z)
if(false, x, s(y), z) -> quot(minus(x, s(y)), s(y), z)

Types:
minus :: 0':s -> 0':s -> 0':s
0' :: 0':s
s :: 0':s -> 0':s
plus :: 0':s -> 0':s -> 0':s
zero :: 0':s -> false:true
false :: false:true
true :: false:true
p :: 0':s -> 0':s
div :: 0':s -> 0':s -> 0':s
quot :: 0':s -> 0':s -> 0':s -> 0':s
if :: false:true -> 0':s -> 0':s -> 0':s -> 0':s
hole_0':s1_0 :: 0':s
hole_false:true2_0 :: false:true
gen_0':s3_0 :: Nat -> 0':s


Lemmas:
minus(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) -> gen_0':s3_0(0), rt in Omega(1 + n5_0)


Generator Equations:
gen_0':s3_0(0) <=> 0'
gen_0':s3_0(+(x, 1)) <=> s(gen_0':s3_0(x))


The following defined symbols remain to be analysed:
plus, quot

They will be analysed ascendingly in the following order:
plus < quot

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

(13) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
plus(gen_0':s3_0(n263_0), gen_0':s3_0(b)) -> gen_0':s3_0(+(n263_0, b)), rt in Omega(1 + n263_0)

Induction Base:
plus(gen_0':s3_0(0), gen_0':s3_0(b)) ->_R^Omega(1)
gen_0':s3_0(b)

Induction Step:
plus(gen_0':s3_0(+(n263_0, 1)), gen_0':s3_0(b)) ->_R^Omega(1)
plus(gen_0':s3_0(n263_0), s(gen_0':s3_0(b))) ->_IH
gen_0':s3_0(+(+(b, 1), c264_0))

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

(14)
Obligation:
TRS:
Rules:
minus(0', y) -> 0'
minus(x, 0') -> x
minus(s(x), s(y)) -> minus(x, y)
plus(0', y) -> y
plus(s(x), y) -> plus(x, s(y))
zero(s(x)) -> false
zero(0') -> true
p(s(x)) -> x
div(x, y) -> quot(x, y, 0')
quot(x, y, z) -> if(zero(x), x, y, plus(z, s(0')))
if(true, x, y, z) -> p(z)
if(false, x, s(y), z) -> quot(minus(x, s(y)), s(y), z)

Types:
minus :: 0':s -> 0':s -> 0':s
0' :: 0':s
s :: 0':s -> 0':s
plus :: 0':s -> 0':s -> 0':s
zero :: 0':s -> false:true
false :: false:true
true :: false:true
p :: 0':s -> 0':s
div :: 0':s -> 0':s -> 0':s
quot :: 0':s -> 0':s -> 0':s -> 0':s
if :: false:true -> 0':s -> 0':s -> 0':s -> 0':s
hole_0':s1_0 :: 0':s
hole_false:true2_0 :: false:true
gen_0':s3_0 :: Nat -> 0':s


Lemmas:
minus(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) -> gen_0':s3_0(0), rt in Omega(1 + n5_0)
plus(gen_0':s3_0(n263_0), gen_0':s3_0(b)) -> gen_0':s3_0(+(n263_0, b)), rt in Omega(1 + n263_0)


Generator Equations:
gen_0':s3_0(0) <=> 0'
gen_0':s3_0(+(x, 1)) <=> s(gen_0':s3_0(x))


The following defined symbols remain to be analysed:
quot