Runti Compl Inner Rewri 22807 pair #381904979

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	0.360646009445 seconds
cpu usage	1.370418912
max memory	3.0068736E7

stage attributes

key	value
output-size	2573
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:
            activate(X) -> X
            activate(n__from(X)) -> from(X)
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
            sel(0(),cons(X,Y)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
        - Signature:
            {activate/1,from/1,sel/2} / {0/0,cons/2,n__from/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,from,sel} and constructors {0,cons,n__from,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__from(X)) -> from(X)
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
            sel(0(),cons(X,Y)) -> X
            sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
        - Signature:
            {activate/1,from/1,sel/2} / {0/0,cons/2,n__from/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,from,sel} and constructors {0,cons,n__from,s}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(13)
          activate :: ["A"(8)] -(15)-> "A"(8)
          cons :: ["A"(0) x "A"(8)] -(8)-> "A"(8)
          cons :: ["A"(0) x "A"(9)] -(9)-> "A"(9)
          from :: ["A"(0)] -(14)-> "A"(8)
          n__from :: ["A"(0)] -(0)-> "A"(8)
          n__from :: ["A"(0)] -(0)-> "A"(15)
          n__from :: ["A"(0)] -(0)-> "A"(13)
          s :: ["A"(13)] -(13)-> "A"(13)
          s :: ["A"(0)] -(0)-> "A"(0)
          sel :: ["A"(13) x "A"(8)] -(2)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "0_A" :: [] -(0)-> "A"(1)
          "cons_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "n__from_A" :: ["A"(0)] -(0)-> "A"(1)
          "s_A" :: ["A"(1)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))

popout

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

job log

popout

actions all output return to Runti Compl Inner Rewri 22807