Runti Compl Full Rewri 10127 pair #381903832

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	1.16874289513 seconds
cpu usage	4.580705589
max memory	8.0781312E7

stage attributes

key	value
output-size	15010
starexec-result	WORST_CASE(Omega(n^1),O(n^1))

output

/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),O(n^1))
* Step 1: Sum WORST_CASE(Omega(n^1),O(n^1))
    + Considered Problem:
        - Strict TRS:
            active(and(X1,X2)) -> and(active(X1),X2)
            active(and(tt(),X)) -> mark(X)
            active(cons(X1,X2)) -> cons(active(X1),X2)
            active(length(X)) -> length(active(X))
            active(length(cons(N,L))) -> mark(s(length(L)))
            active(length(nil())) -> mark(0())
            active(s(X)) -> s(active(X))
            active(zeros()) -> mark(cons(0(),zeros()))
            and(mark(X1),X2) -> mark(and(X1,X2))
            and(ok(X1),ok(X2)) -> ok(and(X1,X2))
            cons(mark(X1),X2) -> mark(cons(X1,X2))
            cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
            length(mark(X)) -> mark(length(X))
            length(ok(X)) -> ok(length(X))
            proper(0()) -> ok(0())
            proper(and(X1,X2)) -> and(proper(X1),proper(X2))
            proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
            proper(length(X)) -> length(proper(X))
            proper(nil()) -> ok(nil())
            proper(s(X)) -> s(proper(X))
            proper(tt()) -> ok(tt())
            proper(zeros()) -> ok(zeros())
            s(mark(X)) -> mark(s(X))
            s(ok(X)) -> ok(s(X))
            top(mark(X)) -> top(proper(X))
            top(ok(X)) -> top(active(X))
        - Signature:
            {active/1,and/2,cons/2,length/1,proper/1,s/1,top/1} / {0/0,mark/1,nil/0,ok/1,tt/0,zeros/0}
        - Obligation:
             runtime complexity wrt. defined symbols {active,and,cons,length,proper,s,top} and constructors {0,mark,nil
            ,ok,tt,zeros}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            active(and(X1,X2)) -> and(active(X1),X2)
            active(and(tt(),X)) -> mark(X)
            active(cons(X1,X2)) -> cons(active(X1),X2)
            active(length(X)) -> length(active(X))
            active(length(cons(N,L))) -> mark(s(length(L)))
            active(length(nil())) -> mark(0())
            active(s(X)) -> s(active(X))
            active(zeros()) -> mark(cons(0(),zeros()))
            and(mark(X1),X2) -> mark(and(X1,X2))
            and(ok(X1),ok(X2)) -> ok(and(X1,X2))
            cons(mark(X1),X2) -> mark(cons(X1,X2))
            cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
            length(mark(X)) -> mark(length(X))
            length(ok(X)) -> ok(length(X))
            proper(0()) -> ok(0())
            proper(and(X1,X2)) -> and(proper(X1),proper(X2))
            proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
            proper(length(X)) -> length(proper(X))
            proper(nil()) -> ok(nil())
            proper(s(X)) -> s(proper(X))
            proper(tt()) -> ok(tt())
            proper(zeros()) -> ok(zeros())
            s(mark(X)) -> mark(s(X))
            s(ok(X)) -> ok(s(X))
            top(mark(X)) -> top(proper(X))
            top(ok(X)) -> top(active(X))
        - Signature:
            {active/1,and/2,cons/2,length/1,proper/1,s/1,top/1} / {0/0,mark/1,nil/0,ok/1,tt/0,zeros/0}
        - Obligation:
             runtime complexity wrt. defined symbols {active,and,cons,length,proper,s,top} and constructors {0,mark,nil
            ,ok,tt,zeros}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          and(x,y){x -> mark(x)} =
            and(mark(x),y) ->^+ mark(and(x,y))
              = C[and(x,y) = and(x,y){}]

** Step 1.b:1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            active(and(X1,X2)) -> and(active(X1),X2)
            active(and(tt(),X)) -> mark(X)
            active(cons(X1,X2)) -> cons(active(X1),X2)
            active(length(X)) -> length(active(X))
            active(length(cons(N,L))) -> mark(s(length(L)))
            active(length(nil())) -> mark(0())
            active(s(X)) -> s(active(X))
            active(zeros()) -> mark(cons(0(),zeros()))
            and(mark(X1),X2) -> mark(and(X1,X2))
            and(ok(X1),ok(X2)) -> ok(and(X1,X2))

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127