2.73/1.91	MAYBE
2.84/1.92	proof of /export/starexec/sandbox/output/output_files/bench.koat
2.84/1.92	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.84/1.92	
2.84/1.92	
2.84/1.92	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
2.84/1.92	
2.84/1.92	(0) CpxIntTrs
2.84/1.92	
2.84/1.92	
2.84/1.92	----------------------------------------
2.84/1.92	
2.84/1.92	(0)
2.84/1.92	Obligation:
2.84/1.92	Complexity Int TRS consisting of the following rules:
2.84/1.92	eval_foo_start(v_.0, v_i) -> Com_1(eval_foo_bb0_in(v_.0, v_i)) :|: TRUE
2.84/1.92	eval_foo_bb0_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_i, v_i)) :|: TRUE
2.84/1.92	eval_foo_bb1_in(v_.0, v_i) -> Com_1(eval_foo_bb2_in(v_.0, v_i)) :|: v_.0 > 10
2.84/1.92	eval_foo_bb1_in(v_.0, v_i) -> Com_1(eval_foo_bb3_in(v_.0, v_i)) :|: v_.0 <= 10
2.84/1.92	eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(29, v_i)) :|: v_.0 >= 25 && v_.0 <= 25
2.84/1.92	eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_.0 - 1, v_i)) :|: v_.0 < 25 && v_.0 <= 30
2.84/1.92	eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_.0 - 1, v_i)) :|: v_.0 > 25 && v_.0 <= 30
2.84/1.92	eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(20, v_i)) :|: v_.0 < 25 && v_.0 > 30
2.84/1.92	eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(20, v_i)) :|: v_.0 > 25 && v_.0 > 30
2.84/1.92	eval_foo_bb3_in(v_.0, v_i) -> Com_1(eval_foo_stop(v_.0, v_i)) :|: TRUE
2.84/1.92	
2.84/1.92	The start-symbols are:[eval_foo_start_2]
2.84/1.92	
2.84/1.94	EOF