Deriv Compl Full Rewri 33144 pair #381922207

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	30.0320351124 seconds
cpu usage	97.143335626
max memory	1.24329984E8

stage attributes

key	value
output-size	12224
starexec-result	WORST_CASE(?,O(n^2))

output

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


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


WORST_CASE(?,O(n^2))
* Step 1: NaturalMI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            +(x,0()) -> x
            +(x,s(y)) -> s(+(x,y))
            +(s(x),y) -> s(+(x,y))
            not(false()) -> true()
            not(true()) -> false()
            odd(0()) -> false()
            odd(s(x)) -> not(odd(x))
        - Signature:
            {+/2,not/1,odd/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
             derivational complexity wrt. signature {+,0,false,not,odd,s,true}
    + Applied Processor:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just 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(+) = [1] x1 + [1] x2 + [1]
              p(0) = [0]                  
          p(false) = [0]                  
            p(not) = [1] x1 + [0]         
            p(odd) = [1] x1 + [0]         
              p(s) = [1] x1 + [0]         
           p(true) = [0]                  
        
        Following rules are strictly oriented:
        +(x,0()) = [1] x + [1]
                 > [1] x + [0]
                 = x          
        
        
        Following rules are (at-least) weakly oriented:
           +(x,s(y)) =  [1] x + [1] y + [1]
                     >= [1] x + [1] y + [1]
                     =  s(+(x,y))          
        
           +(s(x),y) =  [1] x + [1] y + [1]
                     >= [1] x + [1] y + [1]
                     =  s(+(x,y))          
        
        not(false()) =  [0]                
                     >= [0]                
                     =  true()             
        
         not(true()) =  [0]                
                     >= [0]                
                     =  false()            
        
            odd(0()) =  [0]                
                     >= [0]                
                     =  false()            
        
           odd(s(x)) =  [1] x + [0]        
                     >= [1] x + [0]        
                     =  not(odd(x))        
        
* Step 2: NaturalMI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            +(x,s(y)) -> s(+(x,y))
            +(s(x),y) -> s(+(x,y))
            not(false()) -> true()
            not(true()) -> false()
            odd(0()) -> false()
            odd(s(x)) -> not(odd(x))
        - Weak TRS:
            +(x,0()) -> x
        - Signature:
            {+/2,not/1,odd/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
             derivational complexity wrt. signature {+,0,false,not,odd,s,true}
    + Applied Processor:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just 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(+) = [1] x1 + [1] x2 + [2]
              p(0) = [8]                  
          p(false) = [9]                  
            p(not) = [1] x1 + [5]         
            p(odd) = [1] x1 + [6]         
              p(s) = [1] x1 + [8]         
           p(true) = [12]                 
        
        Following rules are strictly oriented:

popout

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

job log

popout

actions all output return to Deriv Compl Full Rewri 33144