2.19/1.52	MAYBE
2.19/1.53	proof of /export/starexec/sandbox/output/output_files/bench.koat
2.19/1.53	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.19/1.53	
2.19/1.53	
2.19/1.53	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
2.19/1.53	
2.19/1.53	(0) CpxIntTrs
2.19/1.53	
2.19/1.53	
2.19/1.53	----------------------------------------
2.19/1.53	
2.19/1.53	(0)
2.19/1.53	Obligation:
2.19/1.53	Complexity Int TRS consisting of the following rules:
2.19/1.53	eval_speedFails2_start(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb0_in(v_i.0, v_n, v_x)) :|: TRUE
2.19/1.53	eval_speedFails2_bb0_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb1_in(v_x, v_n, v_x)) :|: TRUE
2.19/1.53	eval_speedFails2_bb1_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb2_in(v_i.0, v_n, v_x)) :|: v_i.0 < v_n
2.19/1.53	eval_speedFails2_bb1_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb2_in(v_i.0, v_n, v_x)) :|: v_i.0 > v_n
2.19/1.53	eval_speedFails2_bb1_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb3_in(v_i.0, v_n, v_x)) :|: v_i.0 >= v_n && v_i.0 <= v_n
2.19/1.53	eval_speedFails2_bb2_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_bb1_in(v_i.0 + 1, v_n, v_x)) :|: TRUE
2.19/1.53	eval_speedFails2_bb3_in(v_i.0, v_n, v_x) -> Com_1(eval_speedFails2_stop(v_i.0, v_n, v_x)) :|: TRUE
2.19/1.53	
2.19/1.53	The start-symbols are:[eval_speedFails2_start_3]
2.19/1.53	
2.52/1.56	EOF