/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: +(+(x,y),minus(y)) -> x +(minus(x),+(x,y)) -> y minus(minus(x)) -> x minux(+(x,y)) -> +(minus(y),minus(x)) - Signature: {+/2,minus/1,minux/1} / {} - Obligation: derivational complexity wrt. signature {+,minus,minux} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 1. The enriched problem is compatible with follwoing automaton. +_0(1,1) -> 1 +_0(1,1) -> 2 +_0(1,1) -> 3 +_1(2,3) -> 1 +_1(2,3) -> 2 +_1(2,3) -> 3 minus_0(1) -> 1 minus_0(1) -> 2 minus_0(1) -> 3 minus_1(1) -> 1 minus_1(1) -> 2 minus_1(1) -> 3 minus_1(2) -> 1 minus_1(2) -> 2 minus_1(2) -> 3 minus_1(3) -> 1 minus_1(3) -> 2 minus_1(3) -> 3 minux_0(1) -> 1 minux_0(1) -> 2 minux_0(1) -> 3 1 -> 2 1 -> 3 2 -> 1 2 -> 3 3 -> 1 3 -> 2 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: +(+(x,y),minus(y)) -> x +(minus(x),+(x,y)) -> y minus(minus(x)) -> x minux(+(x,y)) -> +(minus(y),minus(x)) - Signature: {+/2,minus/1,minux/1} / {} - Obligation: derivational complexity wrt. signature {+,minus,minux} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))