2.78/1.79	MAYBE
2.78/1.81	proof of /export/starexec/sandbox/output/output_files/bench.koat
2.78/1.81	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.78/1.81	
2.78/1.81	
2.78/1.81	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
2.78/1.81	
2.78/1.81	(0) CpxIntTrs
2.78/1.81	
2.78/1.81	
2.78/1.81	----------------------------------------
2.78/1.81	
2.78/1.81	(0)
2.78/1.81	Obligation:
2.78/1.81	Complexity Int TRS consisting of the following rules:
2.78/1.81	eval_foo_start(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z)) :|: TRUE
2.78/1.81	eval_foo_bb0_in(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_z, v_n, v_x, v_y, v_z)) :|: TRUE
2.78/1.81	eval_foo_bb1_in(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z)) :|: v_.0 + v_.01 >= 0 && v_.0 <= v_n
2.78/1.81	eval_foo_bb1_in(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z)) :|: v_.0 + v_.01 < 0
2.78/1.81	eval_foo_bb1_in(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z)) :|: v_.0 > v_n
2.78/1.81	eval_foo_bb2_in(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z) -> Com_1(eval_foo_bb1_in(2 * v_.0 + v_.01, v_.02, v_.02 + 1, v_n, v_x, v_y, v_z)) :|: TRUE
2.78/1.81	eval_foo_bb3_in(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z) -> Com_1(eval_foo_stop(v_.0, v_.01, v_.02, v_n, v_x, v_y, v_z)) :|: TRUE
2.78/1.81	
2.78/1.81	The start-symbols are:[eval_foo_start_7]
2.78/1.81	
2.78/1.82	EOF