4.23/3.25	MAYBE
4.23/3.26	proof of /export/starexec/sandbox/output/output_files/bench.koat
4.23/3.26	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.23/3.26	
4.23/3.26	
4.23/3.26	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
4.23/3.26	
4.23/3.26	(0) CpxIntTrs
4.23/3.26	
4.23/3.26	
4.23/3.26	----------------------------------------
4.23/3.26	
4.23/3.26	(0)
4.23/3.26	Obligation:
4.23/3.26	Complexity Int TRS consisting of the following rules:
4.23/3.26	eval_speedFails4_start(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb0_in(v_., v_.0, v_0, v_n, v_x)) :|: TRUE
4.23/3.26	eval_speedFails4_bb0_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(1, v_x, nondef.0, v_n, v_x)) :|: nondef.0 >= 1
4.23/3.26	eval_speedFails4_bb0_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(-(1), v_x, nondef.0, v_n, v_x)) :|: nondef.0 < 1
4.23/3.26	eval_speedFails4_bb1_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb2_in(v_., v_.0, v_0, v_n, v_x)) :|: v_.0 <= v_n
4.23/3.26	eval_speedFails4_bb1_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb3_in(v_., v_.0, v_0, v_n, v_x)) :|: v_.0 > v_n
4.23/3.26	eval_speedFails4_bb2_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(v_., v_.0 + v_., v_0, v_n, v_x)) :|: v_0 >= 1
4.23/3.26	eval_speedFails4_bb2_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(v_., v_.0 - v_., v_0, v_n, v_x)) :|: v_0 < 1
4.23/3.26	eval_speedFails4_bb3_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_stop(v_., v_.0, v_0, v_n, v_x)) :|: TRUE
4.23/3.26	
4.23/3.26	The start-symbols are:[eval_speedFails4_start_5]
4.23/3.26	
4.37/3.29	EOF