Runti Compl Full Rewri 10127 pair #381902778

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.0200819969177 seconds
cpu usage	0.024300251
max memory	2621440.0

stage attributes

key	value
output-size	3125
starexec-result	WORST_CASE(?,O(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(?,O(1))
* Step 1: Sum WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            f(s(X),Y) -> h(s(f(h(Y),X)))
        - Signature:
            {f/2} / {h/1,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {h,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: ToInnermost WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            f(s(X),Y) -> h(s(f(h(Y),X)))
        - Signature:
            {f/2} / {h/1,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {h,s}
    + Applied Processor:
        ToInnermost
    + Details:
        switch to innermost, as the system is overlay and right linear and does not contain weak rules
* Step 3: DependencyPairs WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            f(s(X),Y) -> h(s(f(h(Y),X)))
        - Signature:
            {f/2} / {h/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {h,s}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          f#(s(X),Y) -> c_1(f#(h(Y),X))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 4: UsableRules WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            f#(s(X),Y) -> c_1(f#(h(Y),X))
        - Weak TRS:
            f(s(X),Y) -> h(s(f(h(Y),X)))
        - Signature:
            {f/2,f#/2} / {h/1,s/1,c_1/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#} and constructors {h,s}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          f#(s(X),Y) -> c_1(f#(h(Y),X))
* Step 5: Trivial WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            f#(s(X),Y) -> c_1(f#(h(Y),X))
        - Signature:
            {f/2,f#/2} / {h/1,s/1,c_1/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#} and constructors {h,s}
    + Applied Processor:
        Trivial
    + Details:
        Consider the dependency graph
          1:S:f#(s(X),Y) -> c_1(f#(h(Y),X))
             
          
        The dependency graph contains no loops, we remove all dependency pairs.
* Step 6: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        
        - Signature:
            {f/2,f#/2} / {h/1,s/1,c_1/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#} and constructors {h,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(1))

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127