/export/starexec/sandbox/solver/bin/starexec_run_c_complexity /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


MAYBE
proof of /export/starexec/sandbox/output/output_files/bench.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).

(0) CpxIntTrs


----------------------------------------

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
eval_catmouse_start(v_m, v_n, v_x.0) -> Com_1(eval_catmouse_bb0_in(v_m, v_n, v_x.0)) :|: TRUE
eval_catmouse_bb0_in(v_m, v_n, v_x.0) -> Com_1(eval_catmouse_bb1_in(v_m, v_n, 0)) :|: TRUE
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
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
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
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
eval_catmouse_bb3_in(v_m, v_n, v_x.0) -> Com_1(eval_catmouse_stop(v_m, v_n, v_x.0)) :|: TRUE

The start-symbols are:[eval_catmouse_start_3]