/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), O(n^2))
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

(0) CpxTRS
(1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 1 ms]
(2) CpxWeightedTrs
    (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (4) CpxTypedWeightedTrs
    (5) CompletionProof [UPPER BOUND(ID), 0 ms]
    (6) CpxTypedWeightedCompleteTrs
    (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (8) CpxTypedWeightedCompleteTrs
    (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
    (10) CpxRNTS
    (11) InliningProof [UPPER BOUND(ID), 46 ms]
    (12) CpxRNTS
    (13) SimplificationProof [BOTH BOUNDS(ID, ID), 1 ms]
    (14) CpxRNTS
    (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
    (16) CpxRNTS
    (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (18) CpxRNTS
    (19) IntTrsBoundProof [UPPER BOUND(ID), 304 ms]
    (20) CpxRNTS
    (21) IntTrsBoundProof [UPPER BOUND(ID), 87 ms]
    (22) CpxRNTS
    (23) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (24) CpxRNTS
    (25) IntTrsBoundProof [UPPER BOUND(ID), 189 ms]
    (26) CpxRNTS
    (27) IntTrsBoundProof [UPPER BOUND(ID), 73 ms]
    (28) CpxRNTS
    (29) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (30) CpxRNTS
    (31) IntTrsBoundProof [UPPER BOUND(ID), 127 ms]
    (32) CpxRNTS
    (33) IntTrsBoundProof [UPPER BOUND(ID), 52 ms]
    (34) CpxRNTS
    (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (36) CpxRNTS
    (37) IntTrsBoundProof [UPPER BOUND(ID), 140 ms]
    (38) CpxRNTS
    (39) IntTrsBoundProof [UPPER BOUND(ID), 52 ms]
    (40) CpxRNTS
    (41) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (42) CpxRNTS
    (43) IntTrsBoundProof [UPPER BOUND(ID), 1511 ms]
    (44) CpxRNTS
    (45) IntTrsBoundProof [UPPER BOUND(ID), 648 ms]
    (46) CpxRNTS
    (47) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (48) CpxRNTS
    (49) IntTrsBoundProof [UPPER BOUND(ID), 74 ms]
    (50) CpxRNTS
    (51) IntTrsBoundProof [UPPER BOUND(ID), 2 ms]
    (52) CpxRNTS
    (53) FinalProof [FINISHED, 0 ms]
    (54) BOUNDS(1, n^2)
(55) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(56) CpxTRS
    (57) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (58) typed CpxTrs
    (59) OrderProof [LOWER BOUND(ID), 0 ms]
    (60) typed CpxTrs
    (61) RewriteLemmaProof [LOWER BOUND(ID), 285 ms]
    (62) BEST
        (63) proven lower bound
            (64) LowerBoundPropagationProof [FINISHED, 0 ms]
            (65) BOUNDS(n^1, INF)
        (66) typed CpxTrs
            (67) RewriteLemmaProof [LOWER BOUND(ID), 21 ms]
            (68) typed CpxTrs


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

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


The TRS R consists of the following rules:

   half(0) -> 0
   half(s(0)) -> 0
   half(s(s(x))) -> s(half(x))
   inc(0) -> 0
   inc(s(x)) -> s(inc(x))
   zero(0) -> true
   zero(s(x)) -> false
   p(0) -> 0
   p(s(x)) -> x
   bits(x) -> bitIter(x, 0)
   bitIter(x, y) -> if(zero(x), x, inc(y))
   if(true, x, y) -> p(y)
   if(false, x, y) -> bitIter(half(x), y)

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

(1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID))
Transformed relative TRS to weighted TRS
----------------------------------------

(2)
Obligation:
The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^2).


The TRS R consists of the following rules:

   half(0) -> 0 [1]
   half(s(0)) -> 0 [1]
   half(s(s(x))) -> s(half(x)) [1]
   inc(0) -> 0 [1]
   inc(s(x)) -> s(inc(x)) [1]
   zero(0) -> true [1]
   zero(s(x)) -> false [1]
   p(0) -> 0 [1]
   p(s(x)) -> x [1]
   bits(x) -> bitIter(x, 0) [1]
   bitIter(x, y) -> if(zero(x), x, inc(y)) [1]
   if(true, x, y) -> p(y) [1]
   if(false, x, y) -> bitIter(half(x), y) [1]

Rewrite Strategy: INNERMOST
----------------------------------------

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

(4)
Obligation:
Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   half(0) -> 0 [1]
   half(s(0)) -> 0 [1]
   half(s(s(x))) -> s(half(x)) [1]
   inc(0) -> 0 [1]
   inc(s(x)) -> s(inc(x)) [1]
   zero(0) -> true [1]
   zero(s(x)) -> false [1]
   p(0) -> 0 [1]
   p(s(x)) -> x [1]
   bits(x) -> bitIter(x, 0) [1]
   bitIter(x, y) -> if(zero(x), x, inc(y)) [1]
   if(true, x, y) -> p(y) [1]
   if(false, x, y) -> bitIter(half(x), y) [1]

The TRS has the following type information:
half :: 0:s -> 0:s
0 :: 0:s
s :: 0:s -> 0:s
inc :: 0:s -> 0:s
zero :: 0:s -> true:false
true :: true:false
false :: true:false
p :: 0:s -> 0:s
bits :: 0:s -> 0:s
bitIter :: 0:s -> 0:s -> 0:s
if :: true:false -> 0:s -> 0:s -> 0:s

Rewrite Strategy: INNERMOST
----------------------------------------

(5) CompletionProof (UPPER BOUND(ID))
The transformation into a RNTS is sound, since:

(a) The obligation is a constructor system where every type has a constant constructor,

(b) The following defined symbols do not have to be completely defined, as they can never occur inside other defined symbols:

   p_1
   bits_1
   bitIter_2
   if_3

(c) The following functions are completely defined:

   zero_1
   inc_1
   half_1

Due to the following rules being added:
none

And the following fresh constants: none

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

(6)
Obligation:
Runtime Complexity Weighted TRS where critical functions are completely defined. The underlying TRS is:

Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   half(0) -> 0 [1]
   half(s(0)) -> 0 [1]
   half(s(s(x))) -> s(half(x)) [1]
   inc(0) -> 0 [1]
   inc(s(x)) -> s(inc(x)) [1]
   zero(0) -> true [1]
   zero(s(x)) -> false [1]
   p(0) -> 0 [1]
   p(s(x)) -> x [1]
   bits(x) -> bitIter(x, 0) [1]
   bitIter(x, y) -> if(zero(x), x, inc(y)) [1]
   if(true, x, y) -> p(y) [1]
   if(false, x, y) -> bitIter(half(x), y) [1]

The TRS has the following type information:
half :: 0:s -> 0:s
0 :: 0:s
s :: 0:s -> 0:s
inc :: 0:s -> 0:s
zero :: 0:s -> true:false
true :: true:false
false :: true:false
p :: 0:s -> 0:s
bits :: 0:s -> 0:s
bitIter :: 0:s -> 0:s -> 0:s
if :: true:false -> 0:s -> 0:s -> 0:s

Rewrite Strategy: INNERMOST
----------------------------------------

(7) NarrowingProof (BOTH BOUNDS(ID, ID))
Narrowed the inner basic terms of all right-hand sides by a single narrowing step.
----------------------------------------

(8)
Obligation:
Runtime Complexity Weighted TRS where critical functions are completely defined. The underlying TRS is:

Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   half(0) -> 0 [1]
   half(s(0)) -> 0 [1]
   half(s(s(x))) -> s(half(x)) [1]
   inc(0) -> 0 [1]
   inc(s(x)) -> s(inc(x)) [1]
   zero(0) -> true [1]
   zero(s(x)) -> false [1]
   p(0) -> 0 [1]
   p(s(x)) -> x [1]
   bits(x) -> bitIter(x, 0) [1]
   bitIter(0, 0) -> if(true, 0, 0) [3]
   bitIter(0, s(x'')) -> if(true, 0, s(inc(x''))) [3]
   bitIter(s(x'), 0) -> if(false, s(x'), 0) [3]
   bitIter(s(x'), s(x1)) -> if(false, s(x'), s(inc(x1))) [3]
   if(true, x, y) -> p(y) [1]
   if(false, 0, y) -> bitIter(0, y) [2]
   if(false, s(0), y) -> bitIter(0, y) [2]
   if(false, s(s(x2)), y) -> bitIter(s(half(x2)), y) [2]

The TRS has the following type information:
half :: 0:s -> 0:s
0 :: 0:s
s :: 0:s -> 0:s
inc :: 0:s -> 0:s
zero :: 0:s -> true:false
true :: true:false
false :: true:false
p :: 0:s -> 0:s
bits :: 0:s -> 0:s
bitIter :: 0:s -> 0:s -> 0:s
if :: true:false -> 0:s -> 0:s -> 0:s

Rewrite Strategy: INNERMOST
----------------------------------------

(9) CpxTypedWeightedTrsToRntsProof (UPPER BOUND(ID))
Transformed the TRS into an over-approximating RNTS by (improved) Size Abstraction.
The constant constructors are abstracted as follows:

   0 => 0
   true => 1
   false => 0

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

(10)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(1, 0, 1 + inc(x'')) :|: z' = 1 + x'', x'' >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + x', 0) :|: z = 1 + x', x' >= 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + x', 1 + inc(x1)) :|: z = 1 + x', x1 >= 0, x' >= 0, z' = 1 + x1
   bits(z) -{ 1 }-> bitIter(x, 0) :|: x >= 0, z = x
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 }-> 1 + half(x) :|: x >= 0, z = 1 + (1 + x)
   if(z, z', z'') -{ 1 }-> p(y) :|: z' = x, z'' = y, z = 1, x >= 0, y >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, y) :|: z'' = y, y >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, y) :|: z'' = y, y >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 }-> bitIter(1 + half(x2), y) :|: z'' = y, z' = 1 + (1 + x2), y >= 0, z = 0, x2 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 }-> 1 + inc(x) :|: x >= 0, z = 1 + x
   p(z) -{ 1 }-> x :|: x >= 0, z = 1 + x
   p(z) -{ 1 }-> 0 :|: z = 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: x >= 0, z = 1 + x


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

(11) InliningProof (UPPER BOUND(ID))
Inlined the following terminating rules on right-hand sides where appropriate:

   p(z) -{ 1 }-> x :|: x >= 0, z = 1 + x
   p(z) -{ 1 }-> 0 :|: z = 0

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

(12)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(1, 0, 1 + inc(x'')) :|: z' = 1 + x'', x'' >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + x', 0) :|: z = 1 + x', x' >= 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + x', 1 + inc(x1)) :|: z = 1 + x', x1 >= 0, x' >= 0, z' = 1 + x1
   bits(z) -{ 1 }-> bitIter(x, 0) :|: x >= 0, z = x
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 }-> 1 + half(x) :|: x >= 0, z = 1 + (1 + x)
   if(z, z', z'') -{ 2 }-> x' :|: z' = x, z'' = y, z = 1, x >= 0, y >= 0, x' >= 0, y = 1 + x'
   if(z, z', z'') -{ 2 }-> bitIter(0, y) :|: z'' = y, y >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, y) :|: z'' = y, y >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 }-> bitIter(1 + half(x2), y) :|: z'' = y, z' = 1 + (1 + x2), y >= 0, z = 0, x2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z' = x, z'' = y, z = 1, x >= 0, y >= 0, y = 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 }-> 1 + inc(x) :|: x >= 0, z = 1 + x
   p(z) -{ 1 }-> x :|: x >= 0, z = 1 + x
   p(z) -{ 1 }-> 0 :|: z = 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: x >= 0, z = 1 + x


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

(13) SimplificationProof (BOTH BOUNDS(ID, ID))
Simplified the RNTS by moving equalities from the constraints into the right-hand sides.
----------------------------------------

(14)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(1, 0, 1 + inc(z' - 1)) :|: z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 1 + inc(z' - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 }-> 1 + half(z - 2) :|: z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 }-> bitIter(1 + half(z' - 2), z'') :|: z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 }-> 1 + inc(z - 1) :|: z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0


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

(15) CpxRntsAnalysisOrderProof (BOTH BOUNDS(ID, ID))
Found the following analysis order by SCC decomposition:

   { half }
   { inc }
   { zero }
   { p }
   { if, bitIter }
   { bits }

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

(16)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(1, 0, 1 + inc(z' - 1)) :|: z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 1 + inc(z' - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 }-> 1 + half(z - 2) :|: z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 }-> bitIter(1 + half(z' - 2), z'') :|: z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 }-> 1 + inc(z - 1) :|: z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {half}, {inc}, {zero}, {p}, {if,bitIter}, {bits}

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

(17) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(18)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(1, 0, 1 + inc(z' - 1)) :|: z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 1 + inc(z' - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 }-> 1 + half(z - 2) :|: z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 }-> bitIter(1 + half(z' - 2), z'') :|: z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 }-> 1 + inc(z - 1) :|: z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {half}, {inc}, {zero}, {p}, {if,bitIter}, {bits}

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

(19) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using KoAT for: half
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: z

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

(20)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(1, 0, 1 + inc(z' - 1)) :|: z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 1 + inc(z' - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 }-> 1 + half(z - 2) :|: z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 }-> bitIter(1 + half(z' - 2), z'') :|: z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 }-> 1 + inc(z - 1) :|: z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {half}, {inc}, {zero}, {p}, {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: ?, size: O(n^1) [z]

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

(21) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: half
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 2 + z

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

(22)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(1, 0, 1 + inc(z' - 1)) :|: z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 1 + inc(z' - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 }-> 1 + half(z - 2) :|: z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 }-> bitIter(1 + half(z' - 2), z'') :|: z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 }-> 1 + inc(z - 1) :|: z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {inc}, {zero}, {p}, {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]

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

(23) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(24)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(1, 0, 1 + inc(z' - 1)) :|: z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 1 + inc(z' - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 }-> 1 + inc(z - 1) :|: z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {inc}, {zero}, {p}, {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]

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

(25) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: inc
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: z

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

(26)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(1, 0, 1 + inc(z' - 1)) :|: z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 1 + inc(z' - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 }-> 1 + inc(z - 1) :|: z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {inc}, {zero}, {p}, {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: ?, size: O(n^1) [z]

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

(27) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: inc
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 1 + z

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

(28)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(1, 0, 1 + inc(z' - 1)) :|: z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 1 + inc(z' - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 }-> 1 + inc(z - 1) :|: z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {zero}, {p}, {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]

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

(29) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(30)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(1, 0, 1 + s1) :|: s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(0, 1 + (z - 1), 1 + s2) :|: s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {zero}, {p}, {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]

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

(31) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: zero
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 1

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

(32)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(1, 0, 1 + s1) :|: s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(0, 1 + (z - 1), 1 + s2) :|: s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {zero}, {p}, {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: ?, size: O(1) [1]

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

(33) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: zero
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 1

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

(34)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(1, 0, 1 + s1) :|: s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(0, 1 + (z - 1), 1 + s2) :|: s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {p}, {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: O(1) [1], size: O(1) [1]

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

(35) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(36)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(1, 0, 1 + s1) :|: s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(0, 1 + (z - 1), 1 + s2) :|: s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {p}, {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: O(1) [1], size: O(1) [1]

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

(37) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using KoAT for: p
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: z

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

(38)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(1, 0, 1 + s1) :|: s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(0, 1 + (z - 1), 1 + s2) :|: s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {p}, {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: O(1) [1], size: O(1) [1]
  p: runtime: ?, size: O(n^1) [z]

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

(39) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: p
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 1

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

(40)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(1, 0, 1 + s1) :|: s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(0, 1 + (z - 1), 1 + s2) :|: s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: O(1) [1], size: O(1) [1]
  p: runtime: O(1) [1], size: O(n^1) [z]

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

(41) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(42)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(1, 0, 1 + s1) :|: s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(0, 1 + (z - 1), 1 + s2) :|: s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: O(1) [1], size: O(1) [1]
  p: runtime: O(1) [1], size: O(n^1) [z]

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

(43) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using KoAT for: if
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: z''

Computed SIZE bound using CoFloCo for: bitIter
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: z'

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

(44)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(1, 0, 1 + s1) :|: s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(0, 1 + (z - 1), 1 + s2) :|: s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {if,bitIter}, {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: O(1) [1], size: O(1) [1]
  p: runtime: O(1) [1], size: O(n^1) [z]
  if: runtime: ?, size: O(n^1) [z'']
  bitIter: runtime: ?, size: O(n^1) [z']

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

(45) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: if
after applying outer abstraction to obtain an ITS,
resulting in: O(n^2) with polynomial bound: 12 + 7*z' + z'*z'' + z'^2 + 2*z''

Computed RUNTIME bound using KoAT for: bitIter
after applying outer abstraction to obtain an ITS,
resulting in: O(n^2) with polynomial bound: 60 + 14*z + z*z' + 2*z^2 + 6*z'

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

(46)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 3 }-> if(1, 0, 0) :|: z = 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(1, 0, 1 + s1) :|: s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 3 }-> if(0, 1 + (z - 1), 0) :|: z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 3 + z' }-> if(0, 1 + (z - 1), 1 + s2) :|: s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 1 }-> bitIter(z, 0) :|: z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 2 }-> bitIter(0, z'') :|: z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 + z' }-> bitIter(1 + s', z'') :|: s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: O(1) [1], size: O(1) [1]
  p: runtime: O(1) [1], size: O(n^1) [z]
  if: runtime: O(n^2) [12 + 7*z' + z'*z'' + z'^2 + 2*z''], size: O(n^1) [z'']
  bitIter: runtime: O(n^2) [60 + 14*z + z*z' + 2*z^2 + 6*z'], size: O(n^1) [z']

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

(47) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(48)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 15 }-> s4 :|: s4 >= 0, s4 <= 0, z = 0, z' = 0
   bitIter(z, z') -{ 17 + 2*s1 + z' }-> s5 :|: s5 >= 0, s5 <= 1 + s1, s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 15 + 7*z + z^2 }-> s6 :|: s6 >= 0, s6 <= 0, z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 17 + 2*s2 + s2*z + 8*z + z^2 + z' }-> s7 :|: s7 >= 0, s7 <= 1 + s2, s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 61 + 14*z + 2*z^2 }-> s3 :|: s3 >= 0, s3 <= 0, z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 78 + 18*s' + s'*z'' + 2*s'^2 + z' + 7*z'' }-> s10 :|: s10 >= 0, s10 <= z'', s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 62 + 6*z'' }-> s8 :|: s8 >= 0, s8 <= z'', z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 62 + 6*z'' }-> s9 :|: s9 >= 0, s9 <= z'', z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: O(1) [1], size: O(1) [1]
  p: runtime: O(1) [1], size: O(n^1) [z]
  if: runtime: O(n^2) [12 + 7*z' + z'*z'' + z'^2 + 2*z''], size: O(n^1) [z'']
  bitIter: runtime: O(n^2) [60 + 14*z + z*z' + 2*z^2 + 6*z'], size: O(n^1) [z']

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

(49) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: bits
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

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

(50)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 15 }-> s4 :|: s4 >= 0, s4 <= 0, z = 0, z' = 0
   bitIter(z, z') -{ 17 + 2*s1 + z' }-> s5 :|: s5 >= 0, s5 <= 1 + s1, s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 15 + 7*z + z^2 }-> s6 :|: s6 >= 0, s6 <= 0, z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 17 + 2*s2 + s2*z + 8*z + z^2 + z' }-> s7 :|: s7 >= 0, s7 <= 1 + s2, s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 61 + 14*z + 2*z^2 }-> s3 :|: s3 >= 0, s3 <= 0, z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 78 + 18*s' + s'*z'' + 2*s'^2 + z' + 7*z'' }-> s10 :|: s10 >= 0, s10 <= z'', s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 62 + 6*z'' }-> s8 :|: s8 >= 0, s8 <= z'', z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 62 + 6*z'' }-> s9 :|: s9 >= 0, s9 <= z'', z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: {bits}
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: O(1) [1], size: O(1) [1]
  p: runtime: O(1) [1], size: O(n^1) [z]
  if: runtime: O(n^2) [12 + 7*z' + z'*z'' + z'^2 + 2*z''], size: O(n^1) [z'']
  bitIter: runtime: O(n^2) [60 + 14*z + z*z' + 2*z^2 + 6*z'], size: O(n^1) [z']
  bits: runtime: ?, size: O(1) [0]

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

(51) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: bits
after applying outer abstraction to obtain an ITS,
resulting in: O(n^2) with polynomial bound: 61 + 14*z + 2*z^2

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

(52)
Obligation:
Complexity RNTS consisting of the following rules:

   bitIter(z, z') -{ 15 }-> s4 :|: s4 >= 0, s4 <= 0, z = 0, z' = 0
   bitIter(z, z') -{ 17 + 2*s1 + z' }-> s5 :|: s5 >= 0, s5 <= 1 + s1, s1 >= 0, s1 <= z' - 1, z' - 1 >= 0, z = 0
   bitIter(z, z') -{ 15 + 7*z + z^2 }-> s6 :|: s6 >= 0, s6 <= 0, z - 1 >= 0, z' = 0
   bitIter(z, z') -{ 17 + 2*s2 + s2*z + 8*z + z^2 + z' }-> s7 :|: s7 >= 0, s7 <= 1 + s2, s2 >= 0, s2 <= z' - 1, z' - 1 >= 0, z - 1 >= 0
   bits(z) -{ 61 + 14*z + 2*z^2 }-> s3 :|: s3 >= 0, s3 <= 0, z >= 0
   half(z) -{ 1 }-> 0 :|: z = 0
   half(z) -{ 1 }-> 0 :|: z = 1 + 0
   half(z) -{ 1 + z }-> 1 + s :|: s >= 0, s <= z - 2, z - 2 >= 0
   if(z, z', z'') -{ 78 + 18*s' + s'*z'' + 2*s'^2 + z' + 7*z'' }-> s10 :|: s10 >= 0, s10 <= z'', s' >= 0, s' <= z' - 2, z'' >= 0, z = 0, z' - 2 >= 0
   if(z, z', z'') -{ 62 + 6*z'' }-> s8 :|: s8 >= 0, s8 <= z'', z'' >= 0, z = 0, z' = 0
   if(z, z', z'') -{ 62 + 6*z'' }-> s9 :|: s9 >= 0, s9 <= z'', z'' >= 0, z' = 1 + 0, z = 0
   if(z, z', z'') -{ 2 }-> 0 :|: z = 1, z' >= 0, z'' >= 0, z'' = 0
   if(z, z', z'') -{ 2 }-> z'' - 1 :|: z = 1, z' >= 0, z'' >= 0, z'' - 1 >= 0
   inc(z) -{ 1 }-> 0 :|: z = 0
   inc(z) -{ 1 + z }-> 1 + s'' :|: s'' >= 0, s'' <= z - 1, z - 1 >= 0
   p(z) -{ 1 }-> 0 :|: z = 0
   p(z) -{ 1 }-> z - 1 :|: z - 1 >= 0
   zero(z) -{ 1 }-> 1 :|: z = 0
   zero(z) -{ 1 }-> 0 :|: z - 1 >= 0

Function symbols to be analyzed: 
Previous analysis results are:
  half: runtime: O(n^1) [2 + z], size: O(n^1) [z]
  inc: runtime: O(n^1) [1 + z], size: O(n^1) [z]
  zero: runtime: O(1) [1], size: O(1) [1]
  p: runtime: O(1) [1], size: O(n^1) [z]
  if: runtime: O(n^2) [12 + 7*z' + z'*z'' + z'^2 + 2*z''], size: O(n^1) [z'']
  bitIter: runtime: O(n^2) [60 + 14*z + z*z' + 2*z^2 + 6*z'], size: O(n^1) [z']
  bits: runtime: O(n^2) [61 + 14*z + 2*z^2], size: O(1) [0]

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

(53) FinalProof (FINISHED)
Computed overall runtime complexity
----------------------------------------

(54)
BOUNDS(1, n^2)

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

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

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


The TRS R consists of the following rules:

   half(0') -> 0'
   half(s(0')) -> 0'
   half(s(s(x))) -> s(half(x))
   inc(0') -> 0'
   inc(s(x)) -> s(inc(x))
   zero(0') -> true
   zero(s(x)) -> false
   p(0') -> 0'
   p(s(x)) -> x
   bits(x) -> bitIter(x, 0')
   bitIter(x, y) -> if(zero(x), x, inc(y))
   if(true, x, y) -> p(y)
   if(false, x, y) -> bitIter(half(x), y)

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

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

(58)
Obligation:
Innermost TRS:
Rules:
half(0') -> 0'
half(s(0')) -> 0'
half(s(s(x))) -> s(half(x))
inc(0') -> 0'
inc(s(x)) -> s(inc(x))
zero(0') -> true
zero(s(x)) -> false
p(0') -> 0'
p(s(x)) -> x
bits(x) -> bitIter(x, 0')
bitIter(x, y) -> if(zero(x), x, inc(y))
if(true, x, y) -> p(y)
if(false, x, y) -> bitIter(half(x), y)

Types:
half :: 0':s -> 0':s
0' :: 0':s
s :: 0':s -> 0':s
inc :: 0':s -> 0':s
zero :: 0':s -> true:false
true :: true:false
false :: true:false
p :: 0':s -> 0':s
bits :: 0':s -> 0':s
bitIter :: 0':s -> 0':s -> 0':s
if :: true:false -> 0':s -> 0':s -> 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat -> 0':s

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

(59) OrderProof (LOWER BOUND(ID))
Heuristically decided to analyse the following defined symbols:
half, inc, bitIter

They will be analysed ascendingly in the following order:
half < bitIter
inc < bitIter

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

(60)
Obligation:
Innermost TRS:
Rules:
half(0') -> 0'
half(s(0')) -> 0'
half(s(s(x))) -> s(half(x))
inc(0') -> 0'
inc(s(x)) -> s(inc(x))
zero(0') -> true
zero(s(x)) -> false
p(0') -> 0'
p(s(x)) -> x
bits(x) -> bitIter(x, 0')
bitIter(x, y) -> if(zero(x), x, inc(y))
if(true, x, y) -> p(y)
if(false, x, y) -> bitIter(half(x), y)

Types:
half :: 0':s -> 0':s
0' :: 0':s
s :: 0':s -> 0':s
inc :: 0':s -> 0':s
zero :: 0':s -> true:false
true :: true:false
false :: true:false
p :: 0':s -> 0':s
bits :: 0':s -> 0':s
bitIter :: 0':s -> 0':s -> 0':s
if :: true:false -> 0':s -> 0':s -> 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
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:
half, inc, bitIter

They will be analysed ascendingly in the following order:
half < bitIter
inc < bitIter

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

(61) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
half(gen_0':s3_0(*(2, n5_0))) -> gen_0':s3_0(n5_0), rt in Omega(1 + n5_0)

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

Induction Step:
half(gen_0':s3_0(*(2, +(n5_0, 1)))) ->_R^Omega(1)
s(half(gen_0':s3_0(*(2, n5_0)))) ->_IH
s(gen_0':s3_0(c6_0))

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

(62)
Complex Obligation (BEST)

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

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

Innermost TRS:
Rules:
half(0') -> 0'
half(s(0')) -> 0'
half(s(s(x))) -> s(half(x))
inc(0') -> 0'
inc(s(x)) -> s(inc(x))
zero(0') -> true
zero(s(x)) -> false
p(0') -> 0'
p(s(x)) -> x
bits(x) -> bitIter(x, 0')
bitIter(x, y) -> if(zero(x), x, inc(y))
if(true, x, y) -> p(y)
if(false, x, y) -> bitIter(half(x), y)

Types:
half :: 0':s -> 0':s
0' :: 0':s
s :: 0':s -> 0':s
inc :: 0':s -> 0':s
zero :: 0':s -> true:false
true :: true:false
false :: true:false
p :: 0':s -> 0':s
bits :: 0':s -> 0':s
bitIter :: 0':s -> 0':s -> 0':s
if :: true:false -> 0':s -> 0':s -> 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
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:
half, inc, bitIter

They will be analysed ascendingly in the following order:
half < bitIter
inc < bitIter

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

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

(65)
BOUNDS(n^1, INF)

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

(66)
Obligation:
Innermost TRS:
Rules:
half(0') -> 0'
half(s(0')) -> 0'
half(s(s(x))) -> s(half(x))
inc(0') -> 0'
inc(s(x)) -> s(inc(x))
zero(0') -> true
zero(s(x)) -> false
p(0') -> 0'
p(s(x)) -> x
bits(x) -> bitIter(x, 0')
bitIter(x, y) -> if(zero(x), x, inc(y))
if(true, x, y) -> p(y)
if(false, x, y) -> bitIter(half(x), y)

Types:
half :: 0':s -> 0':s
0' :: 0':s
s :: 0':s -> 0':s
inc :: 0':s -> 0':s
zero :: 0':s -> true:false
true :: true:false
false :: true:false
p :: 0':s -> 0':s
bits :: 0':s -> 0':s
bitIter :: 0':s -> 0':s -> 0':s
if :: true:false -> 0':s -> 0':s -> 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat -> 0':s


Lemmas:
half(gen_0':s3_0(*(2, n5_0))) -> gen_0':s3_0(n5_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:
inc, bitIter

They will be analysed ascendingly in the following order:
inc < bitIter

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

(67) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
inc(gen_0':s3_0(n355_0)) -> gen_0':s3_0(n355_0), rt in Omega(1 + n355_0)

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

Induction Step:
inc(gen_0':s3_0(+(n355_0, 1))) ->_R^Omega(1)
s(inc(gen_0':s3_0(n355_0))) ->_IH
s(gen_0':s3_0(c356_0))

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

(68)
Obligation:
Innermost TRS:
Rules:
half(0') -> 0'
half(s(0')) -> 0'
half(s(s(x))) -> s(half(x))
inc(0') -> 0'
inc(s(x)) -> s(inc(x))
zero(0') -> true
zero(s(x)) -> false
p(0') -> 0'
p(s(x)) -> x
bits(x) -> bitIter(x, 0')
bitIter(x, y) -> if(zero(x), x, inc(y))
if(true, x, y) -> p(y)
if(false, x, y) -> bitIter(half(x), y)

Types:
half :: 0':s -> 0':s
0' :: 0':s
s :: 0':s -> 0':s
inc :: 0':s -> 0':s
zero :: 0':s -> true:false
true :: true:false
false :: true:false
p :: 0':s -> 0':s
bits :: 0':s -> 0':s
bitIter :: 0':s -> 0':s -> 0':s
if :: true:false -> 0':s -> 0':s -> 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat -> 0':s


Lemmas:
half(gen_0':s3_0(*(2, n5_0))) -> gen_0':s3_0(n5_0), rt in Omega(1 + n5_0)
inc(gen_0':s3_0(n355_0)) -> gen_0':s3_0(n355_0), rt in Omega(1 + n355_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:
bitIter