3.15/2.21	MAYBE
3.15/2.22	proof of /export/starexec/sandbox/output/output_files/bench.koat
3.15/2.22	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.15/2.22	
3.15/2.22	
3.15/2.22	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
3.15/2.22	
3.15/2.22	(0) CpxIntTrs
3.15/2.22	
3.15/2.22	
3.15/2.22	----------------------------------------
3.15/2.22	
3.15/2.22	(0)
3.15/2.22	Obligation:
3.15/2.22	Complexity Int TRS consisting of the following rules:
3.15/2.22	eval_speedFails3_start(v_.0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb0_in(v_.0, v_0, v_n, v_t, v_x)) :|: TRUE
3.15/2.22	eval_speedFails3_bb0_in(v_.0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_0(v_.0, v_0, v_n, v_t, v_x)) :|: TRUE
3.15/2.22	eval_speedFails3_0(v_.0, v_0, v_n, v_t, v_x) -> Com_2(eval_nondet_start(v_.0, v_0, v_n, v_t, v_x), eval_speedFails3_1(v_.0, nondef.0, v_n, v_t, v_x)) :|: TRUE
3.15/2.22	eval_speedFails3_1(v_.0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb1_in(v_x, v_0, v_n, v_t, v_x)) :|: TRUE
3.15/2.22	eval_speedFails3_bb1_in(v_.0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb2_in(v_.0, v_0, v_n, v_t, v_x)) :|: v_.0 >= 0 && v_.0 <= v_n
3.15/2.22	eval_speedFails3_bb1_in(v_.0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb3_in(v_.0, v_0, v_n, v_t, v_x)) :|: v_.0 < 0
3.15/2.22	eval_speedFails3_bb1_in(v_.0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb3_in(v_.0, v_0, v_n, v_t, v_x)) :|: v_.0 > v_n
3.15/2.22	eval_speedFails3_bb2_in(v_.0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb1_in(v_.0 + v_t, v_0, v_n, v_t, v_x)) :|: v_0 > 0
3.15/2.22	eval_speedFails3_bb2_in(v_.0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb1_in(v_.0 - v_t, v_0, v_n, v_t, v_x)) :|: v_0 <= 0
3.15/2.22	eval_speedFails3_bb3_in(v_.0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_stop(v_.0, v_0, v_n, v_t, v_x)) :|: TRUE
3.15/2.22	
3.15/2.22	The start-symbols are:[eval_speedFails3_start_5]
3.15/2.22	
3.23/2.26	EOF