3.11/2.05	MAYBE
3.11/2.06	proof of /export/starexec/sandbox/output/output_files/bench.koat
3.11/2.06	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.11/2.06	
3.11/2.06	
3.11/2.06	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
3.11/2.06	
3.11/2.06	(0) CpxIntTrs
3.11/2.06	
3.11/2.06	
3.11/2.06	----------------------------------------
3.11/2.06	
3.11/2.06	(0)
3.11/2.06	Obligation:
3.11/2.06	Complexity Int TRS consisting of the following rules:
3.11/2.06	eval_foo_start(v_.0, v_i, v_w) -> Com_1(eval_foo_bb0_in(v_.0, v_i, v_w)) :|: TRUE
3.11/2.06	eval_foo_bb0_in(v_.0, v_i, v_w) -> Com_1(eval_foo_bb1_in(v_i, v_i, v_w)) :|: TRUE
3.11/2.06	eval_foo_bb1_in(v_.0, v_i, v_w) -> Com_1(eval_foo_bb2_in(v_.0, v_i, v_w)) :|: v_.0 < 0
3.11/2.06	eval_foo_bb1_in(v_.0, v_i, v_w) -> Com_1(eval_foo_bb2_in(v_.0, v_i, v_w)) :|: v_.0 > 0
3.11/2.06	eval_foo_bb1_in(v_.0, v_i, v_w) -> Com_1(eval_foo_bb6_in(v_.0, v_i, v_w)) :|: v_.0 >= 0 && v_.0 <= 0
3.11/2.06	eval_foo_bb2_in(v_.0, v_i, v_w) -> Com_1(eval_foo_bb3_in(v_.0, v_i, v_w)) :|: v_.0 < -(5)
3.11/2.06	eval_foo_bb2_in(v_.0, v_i, v_w) -> Com_1(eval_foo_bb4_in(v_.0, v_i, v_w)) :|: v_.0 >= -(5)
3.11/2.06	eval_foo_bb3_in(v_.0, v_i, v_w) -> Com_1(eval_foo_bb1_in(-(v_.0) + 1, v_i, v_w)) :|: TRUE
3.11/2.06	eval_foo_bb4_in(v_.0, v_i, v_w) -> Com_1(eval_foo_bb5_in(v_.0, v_i, v_w)) :|: v_.0 > 5
3.11/2.06	eval_foo_bb4_in(v_.0, v_i, v_w) -> Com_1(eval_foo_bb1_in(0, v_i, v_w)) :|: v_.0 <= 5
3.11/2.06	eval_foo_bb5_in(v_.0, v_i, v_w) -> Com_1(eval_foo_bb1_in(-(v_.0) - 1, v_i, v_w)) :|: TRUE
3.11/2.06	eval_foo_bb6_in(v_.0, v_i, v_w) -> Com_1(eval_foo_stop(v_.0, v_i, v_w)) :|: TRUE
3.11/2.06	
3.11/2.06	The start-symbols are:[eval_foo_start_3]
3.11/2.06	
3.11/2.10	EOF