2.82/1.95	MAYBE
2.82/1.96	proof of /export/starexec/sandbox2/output/output_files/bench.koat
2.82/1.96	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.82/1.96	
2.82/1.96	
2.82/1.96	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
2.82/1.96	
2.82/1.96	(0) CpxIntTrs
2.82/1.96	
2.82/1.96	
2.82/1.96	----------------------------------------
2.82/1.96	
2.82/1.96	(0)
2.82/1.96	Obligation:
2.82/1.96	Complexity Int TRS consisting of the following rules:
2.82/1.96	eval_foo_start(v_.0, v_i) -> Com_1(eval_foo_bb0_in(v_.0, v_i)) :|: TRUE
2.82/1.96	eval_foo_bb0_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_i, v_i)) :|: TRUE
2.82/1.96	eval_foo_bb1_in(v_.0, v_i) -> Com_1(eval_foo_bb2_in(v_.0, v_i)) :|: v_.0 < 0
2.82/1.96	eval_foo_bb1_in(v_.0, v_i) -> Com_1(eval_foo_bb2_in(v_.0, v_i)) :|: v_.0 > 0
2.82/1.96	eval_foo_bb1_in(v_.0, v_i) -> Com_1(eval_foo_bb5_in(v_.0, v_i)) :|: v_.0 >= 0 && v_.0 <= 0
2.82/1.96	eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb3_in(v_.0, v_i)) :|: -(5) <= v_.0 && v_.0 <= 35
2.82/1.96	eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(0, v_i)) :|: -(5) > v_.0
2.82/1.96	eval_foo_bb2_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(0, v_i)) :|: v_.0 > 35
2.82/1.96	eval_foo_bb3_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(-(5), v_i)) :|: v_.0 < 0
2.82/1.96	eval_foo_bb3_in(v_.0, v_i) -> Com_1(eval_foo_bb4_in(v_.0, v_i)) :|: v_.0 >= 0
2.82/1.96	eval_foo_bb4_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(35, v_i)) :|: v_.0 > 30
2.82/1.96	eval_foo_bb4_in(v_.0, v_i) -> Com_1(eval_foo_bb1_in(v_.0 - 1, v_i)) :|: v_.0 <= 30
2.82/1.96	eval_foo_bb5_in(v_.0, v_i) -> Com_1(eval_foo_stop(v_.0, v_i)) :|: TRUE
2.82/1.96	
2.82/1.96	The start-symbols are:[eval_foo_start_2]
2.82/1.96	
2.82/1.98	EOF