Deriv Compl Full Rewri 33144 pair #381922034

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	293.68565917 seconds
cpu usage	640.612687707
max memory	6.803787776E9

stage attributes

key	value
output-size	14818
starexec-result	WORST_CASE(?,O(n^9))

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


WORST_CASE(?,O(n^9))
* Step 1: DecomposeCP WORST_CASE(?,O(n^9))
    + Considered Problem:
        - Strict TRS:
            e(r(x1)) -> e(w(x1))
            e(w(x1)) -> r(i(x1))
            i(t(x1)) -> e(r(x1))
            r(e(x1)) -> w(r(x1))
            r(i(t(e(r(x1))))) -> e(w(r(i(t(e(x1))))))
            t(e(x1)) -> r(e(x1))
            w(r(x1)) -> i(t(x1))
        - Signature:
            {e/1,i/1,r/1,t/1,w/1} / {}
        - Obligation:
             derivational complexity wrt. signature {e,i,r,t,w}
    + Applied Processor:
        DecomposeCP {onSelectionCP_ = any strict-rules, withBoundCP_ = RelativeComp, withCP_ = NaturalMI {miDimension = 3, miDegree = 3, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Nothing}}
    + Details:
        We first use the processor NaturalMI {miDimension = 3, miDegree = 3, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Nothing} to orient following rules strictly:
          
          r(i(t(e(r(x1))))) -> e(w(r(i(t(e(x1))))))
        The Processor induces the complexity certificate TIME (?,O(n^3))
        SPACE(?,?)
        
        Observe that weak rules from Problem (R) are non-size-increasing. Once the complexity of (R) has been
        assessed, it suffices to consider only rules whose complexity has not been estimated in (R) resulting in the
        following Problem (S). Overall the certificate is obtained by composition.
        Problem (S)
          - Strict TRS:
              e(r(x1)) -> e(w(x1))
              e(w(x1)) -> r(i(x1))
              i(t(x1)) -> e(r(x1))
              r(e(x1)) -> w(r(x1))
              t(e(x1)) -> r(e(x1))
              w(r(x1)) -> i(t(x1))
          - Signature:
              {e/1,i/1,r/1,t/1,w/1} / {}
          - Obligation:
               derivational complexity wrt. signature {e,i,r,t,w}
** Step 1.a:1: NaturalMI WORST_CASE(?,O(n^3))
    + Considered Problem:
        - Strict TRS:
            e(r(x1)) -> e(w(x1))
            e(w(x1)) -> r(i(x1))
            i(t(x1)) -> e(r(x1))
            r(e(x1)) -> w(r(x1))
            r(i(t(e(r(x1))))) -> e(w(r(i(t(e(x1))))))
            t(e(x1)) -> r(e(x1))
            w(r(x1)) -> i(t(x1))
        - Signature:
            {e/1,i/1,r/1,t/1,w/1} / {}
        - Obligation:
             derivational complexity wrt. signature {e,i,r,t,w}
    + Applied Processor:
        NaturalMI {miDimension = 3, miDegree = 3, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just first alternative for decompose on any strict-rules}
    + Details:
        We apply a matrix interpretation of kind triangular matrix interpretation:
        
        Following symbols are considered usable:
          all
        TcT has computed the following interpretation:
          p(e) = [1 0 1]      [0]
                 [0 1 0] x1 + [0]
                 [0 0 0]      [0]
          p(i) = [1 0 0]      [0]
                 [0 0 1] x1 + [0]
                 [0 0 0]      [0]
          p(r) = [1 1 0]      [0]
                 [0 0 0] x1 + [1]
                 [0 0 1]      [0]
          p(t) = [1 1 1]      [0]
                 [0 0 0] x1 + [1]
                 [0 0 0]      [1]
          p(w) = [1 0 1]      [0]
                 [0 0 0] x1 + [1]
                 [0 0 0]      [0]
        
        Following rules are strictly oriented:
        r(i(t(e(r(x1))))) = [1 1 1]      [2]    
                            [0 0 0] x1 + [1]    
                            [0 0 0]      [0]    
                          > [1 1 1]      [1]    
                            [0 0 0] x1 + [1]    
                            [0 0 0]      [0]    
                          = e(w(r(i(t(e(x1))))))
        
        
        Following rules are (at-least) weakly oriented:
        e(r(x1)) =  [1 1 1]      [0]
                    [0 0 0] x1 + [1]
                    [0 0 0]      [0]
                 >= [1 0 1]      [0]
                    [0 0 0] x1 + [1]
                    [0 0 0]      [0]

popout

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

job log

popout

actions all output return to Deriv Compl Full Rewri 33144