Runti Compl Inner Rewri 22807 pair #381904301

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	4.02689313889 seconds
cpu usage	7.182004439
max memory	4.5645824E7

stage attributes

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

output

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


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


WORST_CASE(?,O(n^1))
* Step 1: Sum WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            append(@l1,@l2) -> append#1(@l1,@l2)
            append#1(::(@x,@xs),@l2) -> ::(@x,append(@xs,@l2))
            append#1(nil(),@l2) -> @l2
            appendAll(@l) -> appendAll#1(@l)
            appendAll#1(::(@l1,@ls)) -> append(@l1,appendAll(@ls))
            appendAll#1(nil()) -> nil()
            appendAll2(@l) -> appendAll2#1(@l)
            appendAll2#1(::(@l1,@ls)) -> append(appendAll(@l1),appendAll2(@ls))
            appendAll2#1(nil()) -> nil()
            appendAll3(@l) -> appendAll3#1(@l)
            appendAll3#1(::(@l1,@ls)) -> append(appendAll2(@l1),appendAll3(@ls))
            appendAll3#1(nil()) -> nil()
        - Signature:
            {append/2,append#1/2,appendAll/1,appendAll#1/1,appendAll2/1,appendAll2#1/1,appendAll3/1
            ,appendAll3#1/1} / {::/2,nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {append,append#1,appendAll,appendAll#1,appendAll2
            ,appendAll2#1,appendAll3,appendAll3#1} and constructors {::,nil}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            append(@l1,@l2) -> append#1(@l1,@l2)
            append#1(::(@x,@xs),@l2) -> ::(@x,append(@xs,@l2))
            append#1(nil(),@l2) -> @l2
            appendAll(@l) -> appendAll#1(@l)
            appendAll#1(::(@l1,@ls)) -> append(@l1,appendAll(@ls))
            appendAll#1(nil()) -> nil()
            appendAll2(@l) -> appendAll2#1(@l)
            appendAll2#1(::(@l1,@ls)) -> append(appendAll(@l1),appendAll2(@ls))
            appendAll2#1(nil()) -> nil()
            appendAll3(@l) -> appendAll3#1(@l)
            appendAll3#1(::(@l1,@ls)) -> append(appendAll2(@l1),appendAll3(@ls))
            appendAll3#1(nil()) -> nil()
        - Signature:
            {append/2,append#1/2,appendAll/1,appendAll#1/1,appendAll2/1,appendAll2#1/1,appendAll3/1
            ,appendAll3#1/1} / {::/2,nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {append,append#1,appendAll,appendAll#1,appendAll2
            ,appendAll2#1,appendAll3,appendAll3#1} and constructors {::,nil}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 4.
        The enriched problem is compatible with follwoing automaton.
          ::_0(2,2) -> 1
          ::_0(2,2) -> 2
          ::_0(2,2) -> 3
          ::_1(2,1) -> 1
          ::_1(2,3) -> 1
          ::_1(2,3) -> 3
          ::_1(2,4) -> 1
          ::_1(2,4) -> 4
          ::_2(2,7) -> 1
          ::_2(2,7) -> 5
          ::_2(2,7) -> 7
          ::_3(2,8) -> 1
          ::_3(2,8) -> 6
          ::_3(2,8) -> 8
          append_0(2,2) -> 1
          append_1(2,2) -> 3
          append_1(2,4) -> 1
          append_1(2,4) -> 4
          append_1(4,5) -> 1
          append_1(4,5) -> 5
          append_1(4,5) -> 7
          append_1(5,6) -> 1
          append_1(5,6) -> 6
          append_1(5,6) -> 8
          append_2(4,5) -> 7
          append_3(7,6) -> 8
          append#1_0(2,2) -> 1
          append#1_1(2,2) -> 1
          append#1_2(2,2) -> 3
          append#1_2(2,4) -> 1
          append#1_2(2,4) -> 4
          append#1_2(4,5) -> 1
          append#1_2(4,5) -> 5
          append#1_2(4,5) -> 7
          append#1_2(5,6) -> 1
          append#1_2(5,6) -> 6
          append#1_2(5,6) -> 8
          append#1_3(4,5) -> 7
          append#1_4(7,6) -> 8
          appendAll_0(2) -> 1
          appendAll_1(2) -> 1
          appendAll_1(2) -> 4

popout

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

job log

popout

actions all output return to Runti Compl Inner Rewri 22807