2.11/1.58	MAYBE
2.11/1.59	proof of /export/starexec/sandbox/output/output_files/bench.koat
2.11/1.59	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.11/1.59	
2.11/1.59	
2.11/1.59	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
2.11/1.59	
2.11/1.59	(0) CpxIntTrs
2.11/1.59	
2.11/1.59	
2.11/1.59	----------------------------------------
2.11/1.59	
2.11/1.59	(0)
2.11/1.59	Obligation:
2.11/1.59	Complexity Int TRS consisting of the following rules:
2.11/1.59	eval_foo_start(v_.0, v_.01, v_i, v_j, v_t) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_i, v_j, v_t)) :|: TRUE
2.11/1.59	eval_foo_bb0_in(v_.0, v_.01, v_i, v_j, v_t) -> Com_1(eval_foo_bb1_in(v_i, v_j, v_i, v_j, v_t)) :|: TRUE
2.11/1.59	eval_foo_bb1_in(v_.0, v_.01, v_i, v_j, v_t) -> Com_1(eval_foo_bb1_in(v_.01, v_.0, v_i, v_j, v_t)) :|: v_.0 < 0 && v_.01 < 0
2.11/1.59	eval_foo_bb1_in(v_.0, v_.01, v_i, v_j, v_t) -> Com_1(eval_foo_bb1_in(v_.01, v_.0, v_i, v_j, v_t)) :|: v_.0 < 0 && v_.01 > 0
2.11/1.59	eval_foo_bb1_in(v_.0, v_.01, v_i, v_j, v_t) -> Com_1(eval_foo_bb1_in(v_.01, v_.0, v_i, v_j, v_t)) :|: v_.0 > 0 && v_.01 < 0
2.11/1.59	eval_foo_bb1_in(v_.0, v_.01, v_i, v_j, v_t) -> Com_1(eval_foo_bb1_in(v_.01, v_.0, v_i, v_j, v_t)) :|: v_.0 > 0 && v_.01 > 0
2.11/1.59	eval_foo_bb1_in(v_.0, v_.01, v_i, v_j, v_t) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_i, v_j, v_t)) :|: v_.0 >= 0 && v_.0 <= 0
2.11/1.59	eval_foo_bb1_in(v_.0, v_.01, v_i, v_j, v_t) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_i, v_j, v_t)) :|: v_.01 >= 0 && v_.01 <= 0
2.11/1.59	eval_foo_bb2_in(v_.0, v_.01, v_i, v_j, v_t) -> Com_1(eval_foo_stop(v_.0, v_.01, v_i, v_j, v_t)) :|: TRUE
2.11/1.59	
2.11/1.59	The start-symbols are:[eval_foo_start_5]
2.11/1.59	
2.11/1.61	EOF