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