2.13/1.74	MAYBE
2.13/1.75	proof of /export/starexec/sandbox/output/output_files/bench.koat
2.13/1.75	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.13/1.75	
2.13/1.75	
2.13/1.75	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
2.13/1.75	
2.13/1.75	(0) CpxIntTrs
2.13/1.75	
2.13/1.75	
2.13/1.75	----------------------------------------
2.13/1.75	
2.13/1.75	(0)
2.13/1.75	Obligation:
2.13/1.75	Complexity Int TRS consisting of the following rules:
2.13/1.75	eval_foo_start(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_i, v_j)) :|: TRUE
2.13/1.75	eval_foo_bb0_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb1_in(0, 0, v_i, v_j)) :|: TRUE
2.13/1.75	eval_foo_bb1_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_i, v_j)) :|: v_.0 <= v_.01
2.13/1.75	eval_foo_bb1_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_i, v_j)) :|: v_.0 > v_.01
2.13/1.75	eval_foo_bb2_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_.01 + 2, v_i, v_j)) :|: v_.01 - v_.0 < 1
2.13/1.75	eval_foo_bb2_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_.01, v_i, v_j)) :|: v_.01 - v_.0 >= 1
2.13/1.75	eval_foo_bb3_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_stop(v_.0, v_.01, v_i, v_j)) :|: TRUE
2.13/1.75	
2.13/1.75	The start-symbols are:[eval_foo_start_4]
2.13/1.75	
2.72/1.77	EOF