Deriv Compl Full Rewri 33144 pair #381922131

details

property	value
status	complete
benchmark	4.37.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n074.star.cs.uiowa.edu
space	SK90

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	0.0899038314819 seconds
cpu usage	0.292480914
max memory	3.0777344E7

stage attributes

key	value
output-size	1328
starexec-result	WORST_CASE(?,O(n^1))

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


WORST_CASE(?,O(n^1))
* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a(b(a(x))) -> b(a(x))
        - Signature:
            {a/1} / {b/1}
        - Obligation:
             derivational complexity wrt. signature {a,b}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 2.
        The enriched problem is compatible with follwoing automaton.
          a_0(1) -> 1
          a_1(1) -> 2
          a_2(1) -> 3
          b_0(1) -> 1
          b_1(2) -> 1
          b_1(2) -> 2
          b_1(2) -> 3
          b_2(3) -> 2
          b_2(3) -> 3
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a(b(a(x))) -> b(a(x))
        - Signature:
            {a/1} / {b/1}
        - Obligation:
             derivational complexity wrt. signature {a,b}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Deriv Compl Full Rewri 33144