4.10/3.14	MAYBE
4.19/3.15	proof of /export/starexec/sandbox2/output/output_files/bench.koat
4.19/3.15	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.19/3.15	
4.19/3.15	
4.19/3.15	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
4.19/3.15	
4.19/3.15	(0) CpxIntTrs
4.19/3.15	
4.19/3.15	
4.19/3.15	----------------------------------------
4.19/3.15	
4.19/3.15	(0)
4.19/3.15	Obligation:
4.19/3.15	Complexity Int TRS consisting of the following rules:
4.19/3.15	eval_speedFails1_start(v_.0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_bb0_in(v_.0, v_i, v_m, v_n)) :|: TRUE
4.19/3.15	eval_speedFails1_bb0_in(v_.0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_bb1_in(v_i, v_i, v_m, v_n)) :|: TRUE
4.19/3.15	eval_speedFails1_bb1_in(v_.0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_bb2_in(v_.0, v_i, v_m, v_n)) :|: v_.0 <= v_n
4.19/3.15	eval_speedFails1_bb1_in(v_.0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_bb3_in(v_.0, v_i, v_m, v_n)) :|: v_.0 > v_n
4.19/3.15	eval_speedFails1_bb2_in(v_.0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_bb1_in(v_.0 + v_m, v_i, v_m, v_n)) :|: TRUE
4.19/3.15	eval_speedFails1_bb3_in(v_.0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_stop(v_.0, v_i, v_m, v_n)) :|: TRUE
4.19/3.15	
4.19/3.15	The start-symbols are:[eval_speedFails1_start_4]
4.19/3.15	
4.20/3.18	EOF