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