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