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