Runti Compl Full Rewri 10127 pair #381903192

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.0180599689484 seconds
cpu usage	0.022019567
max memory	3719168.0

stage attributes

key	value
output-size	4513
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:
            b(u(x)) -> a(e(x))
            c(u(x)) -> b(x)
            d(x) -> e(u(x))
            d(u(x)) -> c(x)
            v(e(x)) -> x
        - Signature:
            {b/1,c/1,d/1,v/1} / {a/1,e/1,u/1}
        - Obligation:
             runtime complexity wrt. defined symbols {b,c,d,v} and constructors {a,e,u}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: ToInnermost WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            b(u(x)) -> a(e(x))
            c(u(x)) -> b(x)
            d(x) -> e(u(x))
            d(u(x)) -> c(x)
            v(e(x)) -> x
        - Signature:
            {b/1,c/1,d/1,v/1} / {a/1,e/1,u/1}
        - Obligation:
             runtime complexity wrt. defined symbols {b,c,d,v} and constructors {a,e,u}
    + 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:
            b(u(x)) -> a(e(x))
            c(u(x)) -> b(x)
            d(x) -> e(u(x))
            d(u(x)) -> c(x)
            v(e(x)) -> x
        - Signature:
            {b/1,c/1,d/1,v/1} / {a/1,e/1,u/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {b,c,d,v} and constructors {a,e,u}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          b#(u(x)) -> c_1()
          c#(u(x)) -> c_2(b#(x))
          d#(x) -> c_3()
          d#(u(x)) -> c_4(c#(x))
          v#(e(x)) -> c_5()
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 4: UsableRules WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            b#(u(x)) -> c_1()
            c#(u(x)) -> c_2(b#(x))
            d#(x) -> c_3()
            d#(u(x)) -> c_4(c#(x))
            v#(e(x)) -> c_5()
        - Weak TRS:
            b(u(x)) -> a(e(x))
            c(u(x)) -> b(x)
            d(x) -> e(u(x))
            d(u(x)) -> c(x)
            v(e(x)) -> x
        - Signature:
            {b/1,c/1,d/1,v/1,b#/1,c#/1,d#/1,v#/1} / {a/1,e/1,u/1,c_1/0,c_2/1,c_3/0,c_4/1,c_5/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {b#,c#,d#,v#} and constructors {a,e,u}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          b#(u(x)) -> c_1()
          c#(u(x)) -> c_2(b#(x))
          d#(x) -> c_3()
          d#(u(x)) -> c_4(c#(x))
          v#(e(x)) -> c_5()
* Step 5: Trivial WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            b#(u(x)) -> c_1()
            c#(u(x)) -> c_2(b#(x))
            d#(x) -> c_3()
            d#(u(x)) -> c_4(c#(x))

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127