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