/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: cond(true(),x,y) -> cond(gr(x,y),y,x) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) - Signature: {cond/3,gr/2} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {cond,gr} and constructors {0,false,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Sum. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: cond(true(),x,y) -> cond(gr(x,y),y,x) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) - Signature: {cond/3,gr/2} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {cond,gr} and constructors {0,false,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 3: DecreasingLoops. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: cond(true(),x,y) -> cond(gr(x,y),y,x) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) - Signature: {cond/3,gr/2} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {cond,gr} and constructors {0,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: gr(x,y){x -> s(x),y -> s(y)} = gr(s(x),s(y)) ->^+ gr(x,y) = C[gr(x,y) = gr(x,y){}] WORST_CASE(Omega(n^1),?)