2.26/1.54	MAYBE
2.26/1.55	proof of /export/starexec/sandbox/output/output_files/bench.koat
2.26/1.55	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.26/1.55	
2.26/1.55	
2.26/1.55	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
2.26/1.55	
2.26/1.55	(0) CpxIntTrs
2.26/1.55	
2.26/1.55	
2.26/1.55	----------------------------------------
2.26/1.55	
2.26/1.55	(0)
2.26/1.55	Obligation:
2.26/1.55	Complexity Int TRS consisting of the following rules:
2.26/1.55	eval_catmouse_start(v_m, v_n, v_x.0) -> Com_1(eval_catmouse_bb0_in(v_m, v_n, v_x.0)) :|: TRUE
2.26/1.55	eval_catmouse_bb0_in(v_m, v_n, v_x.0) -> Com_1(eval_catmouse_bb1_in(v_m, v_n, 0)) :|: TRUE
2.26/1.55	eval_catmouse_bb1_in(v_m, v_n, v_x.0) -> Com_1(eval_catmouse_bb2_in(v_m, v_n, v_x.0)) :|: v_x.0 <= v_n
2.26/1.55	eval_catmouse_bb1_in(v_m, v_n, v_x.0) -> Com_1(eval_catmouse_bb3_in(v_m, v_n, v_x.0)) :|: v_x.0 > v_n
2.26/1.55	eval_catmouse_bb2_in(v_m, v_n, v_x.0) -> Com_1(eval_catmouse_bb1_in(v_m, v_n, v_x.0 + 1)) :|: v_x.0 <= v_m
2.26/1.55	eval_catmouse_bb2_in(v_m, v_n, v_x.0) -> Com_1(eval_catmouse_bb1_in(v_m, v_n, v_x.0 - 1)) :|: v_x.0 > v_m
2.26/1.55	eval_catmouse_bb3_in(v_m, v_n, v_x.0) -> Com_1(eval_catmouse_stop(v_m, v_n, v_x.0)) :|: TRUE
2.26/1.55	
2.26/1.55	The start-symbols are:[eval_catmouse_start_3]
2.26/1.55	
2.26/1.57	EOF