Runti Compl Inner Rewri 22807 pair #381904720

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	0.558386087418 seconds
cpu usage	1.255492187
max memory	3.2407552E7

stage attributes

key	value
output-size	5042
starexec-result	WORST_CASE(?,O(1))

output

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


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


WORST_CASE(?,O(1))
* Step 1: Sum WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'()))
            f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'()))
        - Signature:
            {f/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {.,a,b,b',c,d,d',e,g,h,i,if}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DependencyPairs WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'()))
            f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'()))
        - Signature:
            {f/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {.,a,b,b',c,d,d',e,g,h,i,if}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'()))
          f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'()))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 3: PredecessorEstimation WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'()))
            f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'()))
        - Weak TRS:
            f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'()))
            f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'()))
        - Signature:
            {f/2,f#/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3,c_1/2,c_2/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#} and constructors {.,a,b,b',c,d,d',e,g,h,i,if}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {1,2}
        by application of
          Pre({1,2}) = {}.
        Here rules are labelled as follows:
          1: f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'()))
          2: f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'()))
* Step 4: RemoveWeakSuffixes WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak DPs:
            f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'()))
            f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'()))
        - Weak TRS:
            f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'()))
            f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'()))
        - Signature:
            {f/2,f#/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3,c_1/2,c_2/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#} and constructors {.,a,b,b',c,d,d',e,g,h,i,if}
    + Applied Processor:
        RemoveWeakSuffixes
    + Details:
        Consider the dependency graph
          1:W:f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'()))
             
          
          2:W:f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'()))
             
          
        The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
          2: f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'()))
          1: f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'()))
* Step 5: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'()))
            f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'()))
        - Signature:
            {f/2,f#/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3,c_1/2,c_2/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#} and constructors {.,a,b,b',c,d,d',e,g,h,i,if}
    + Applied Processor:
        EmptyProcessor
    + Details:

popout

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

job log

popout

actions all output return to Runti Compl Inner Rewri 22807