2.43/1.60	MAYBE
2.55/1.61	proof of /export/starexec/sandbox2/output/output_files/bench.koat
2.55/1.61	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.55/1.61	
2.55/1.61	
2.55/1.61	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
2.55/1.61	
2.55/1.61	(0) CpxIntTrs
2.55/1.61	
2.55/1.61	
2.55/1.61	----------------------------------------
2.55/1.61	
2.55/1.61	(0)
2.55/1.61	Obligation:
2.55/1.61	Complexity Int TRS consisting of the following rules:
2.55/1.61	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.55/1.61	eval_foo_bb0_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb1_in(0, v_.01, v_i, v_j)) :|: TRUE
2.55/1.61	eval_foo_bb1_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb2_in(v_.0, 0, v_i, v_j)) :|: v_.0 < 100
2.55/1.61	eval_foo_bb1_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_i, v_j)) :|: v_.0 >= 100
2.55/1.61	eval_foo_bb2_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_i, v_j)) :|: v_.01 < 1
2.55/1.61	eval_foo_bb2_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_i, v_j)) :|: v_.01 >= 1
2.55/1.61	eval_foo_bb3_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb2_in(v_.0, v_.01 + 1, v_i, v_j)) :|: TRUE
2.55/1.61	eval_foo_bb4_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0, v_.01, v_i, v_j)) :|: TRUE
2.55/1.61	eval_foo_bb5_in(v_.0, v_.01, v_i, v_j) -> Com_1(eval_foo_stop(v_.0, v_.01, v_i, v_j)) :|: TRUE
2.55/1.61	
2.55/1.61	The start-symbols are:[eval_foo_start_4]
2.55/1.61	
2.55/1.63	EOF