Runti Compl Full Rewri 10127 pair #381903062

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.106509923935 seconds
cpu usage	0.361711827
max memory	1.6293888E7

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /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:
            *(x,+(y,z)) -> +(*(x,y),*(x,z))
            *(+(x,y),z) -> +(*(x,z),*(y,z))
            +(x,0()) -> x
            +(x,i(x)) -> 0()
            +(+(x,y),z) -> +(x,+(y,z))
        - Signature:
            {*/2,+/2} / {0/0,i/1}
        - Obligation:
             runtime complexity wrt. defined symbols {*,+} and constructors {0,i}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DependencyPairs WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            *(x,+(y,z)) -> +(*(x,y),*(x,z))
            *(+(x,y),z) -> +(*(x,z),*(y,z))
            +(x,0()) -> x
            +(x,i(x)) -> 0()
            +(+(x,y),z) -> +(x,+(y,z))
        - Signature:
            {*/2,+/2} / {0/0,i/1}
        - Obligation:
             runtime complexity wrt. defined symbols {*,+} and constructors {0,i}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following weak dependency pairs:
        
        Strict DPs
          *#(x,+(y,z)) -> c_1(+#(*(x,y),*(x,z)))
          *#(+(x,y),z) -> c_2(+#(*(x,z),*(y,z)))
          +#(x,0()) -> c_3(x)
          +#(x,i(x)) -> c_4()
          +#(+(x,y),z) -> c_5(+#(x,+(y,z)))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 3: UsableRules WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            *#(x,+(y,z)) -> c_1(+#(*(x,y),*(x,z)))
            *#(+(x,y),z) -> c_2(+#(*(x,z),*(y,z)))
            +#(x,0()) -> c_3(x)
            +#(x,i(x)) -> c_4()
            +#(+(x,y),z) -> c_5(+#(x,+(y,z)))
        - Strict TRS:
            *(x,+(y,z)) -> +(*(x,y),*(x,z))
            *(+(x,y),z) -> +(*(x,z),*(y,z))
            +(x,0()) -> x
            +(x,i(x)) -> 0()
            +(+(x,y),z) -> +(x,+(y,z))
        - Signature:
            {*/2,+/2,*#/2,+#/2} / {0/0,i/1,c_1/1,c_2/1,c_3/1,c_4/0,c_5/1}
        - Obligation:
             runtime complexity wrt. defined symbols {*#,+#} and constructors {0,i}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          +#(x,0()) -> c_3(x)
          +#(x,i(x)) -> c_4()
* Step 4: PredecessorEstimation WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            +#(x,0()) -> c_3(x)
            +#(x,i(x)) -> c_4()
        - Signature:
            {*/2,+/2,*#/2,+#/2} / {0/0,i/1,c_1/1,c_2/1,c_3/1,c_4/0,c_5/1}
        - Obligation:
             runtime complexity wrt. defined symbols {*#,+#} and constructors {0,i}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {2}
        by application of
          Pre({2}) = {1}.
        Here rules are labelled as follows:
          1: +#(x,0()) -> c_3(x)
          2: +#(x,i(x)) -> c_4()
* Step 5: RemoveWeakSuffixes WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            +#(x,0()) -> c_3(x)
        - Weak DPs:
            +#(x,i(x)) -> c_4()
        - Signature:

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127