/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: f(s(x),x) -> f(s(x),round(s(x))) round(0()) -> 0() round(0()) -> s(0()) round(s(0())) -> s(0()) round(s(s(x))) -> s(s(round(x))) - Signature: {f/2,round/1} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {f,round} and constructors {0,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Sum. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: f(s(x),x) -> f(s(x),round(s(x))) round(0()) -> 0() round(0()) -> s(0()) round(s(0())) -> s(0()) round(s(s(x))) -> s(s(round(x))) - Signature: {f/2,round/1} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {f,round} and constructors {0,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 3: DecreasingLoops. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: f(s(x),x) -> f(s(x),round(s(x))) round(0()) -> 0() round(0()) -> s(0()) round(s(0())) -> s(0()) round(s(s(x))) -> s(s(round(x))) - Signature: {f/2,round/1} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {f,round} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: round(x){x -> s(s(x))} = round(s(s(x))) ->^+ s(s(round(x))) = C[round(x) = round(x){}] WORST_CASE(Omega(n^1),?)