Deriv Compl Full Rewri 33144 pair #381922449

details

property	value
status	complete
benchmark	PALINDROME_nosorts-noand_L.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n035.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	30.1556079388 seconds
cpu usage	84.217208511
max memory	3.24636672E8

stage attributes

key	value
output-size	8829
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:
            U11(tt()) -> U12(tt())
            U12(tt()) -> tt()
            __(X,nil()) -> X
            __(__(X,Y),Z) -> __(X,__(Y,Z))
            __(nil(),X) -> X
            isNePal(__(I,__(P,I))) -> U11(tt())
        - Signature:
            {U11/1,U12/1,__/2,isNePal/1} / {nil/0,tt/0}
        - Obligation:
             derivational complexity wrt. signature {U11,U12,__,isNePal,nil,tt}
    + 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(U11) = [1] x1 + [0]         
              p(U12) = [1] x1 + [0]         
               p(__) = [1] x1 + [1] x2 + [0]
          p(isNePal) = [1] x1 + [1]         
              p(nil) = [5]                  
               p(tt) = [0]                  
        
        Following rules are strictly oriented:
                   __(X,nil()) = [1] X + [5]        
                               > [1] X + [0]        
                               = X                  
        
                   __(nil(),X) = [1] X + [5]        
                               > [1] X + [0]        
                               = X                  
        
        isNePal(__(I,__(P,I))) = [2] I + [1] P + [1]
                               > [0]                
                               = U11(tt())          
        
        
        Following rules are (at-least) weakly oriented:
            U11(tt()) =  [0]                        
                      >= [0]                        
                      =  U12(tt())                  
        
            U12(tt()) =  [0]                        
                      >= [0]                        
                      =  tt()                       
        
        __(__(X,Y),Z) =  [1] X + [1] Y + [1] Z + [0]
                      >= [1] X + [1] Y + [1] Z + [0]
                      =  __(X,__(Y,Z))              
        
* Step 2: NaturalMI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            U11(tt()) -> U12(tt())
            U12(tt()) -> tt()
            __(__(X,Y),Z) -> __(X,__(Y,Z))
        - Weak TRS:
            __(X,nil()) -> X
            __(nil(),X) -> X
            isNePal(__(I,__(P,I))) -> U11(tt())
        - Signature:
            {U11/1,U12/1,__/2,isNePal/1} / {nil/0,tt/0}
        - Obligation:
             derivational complexity wrt. signature {U11,U12,__,isNePal,nil,tt}
    + 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(U11) = [1] x1 + [3]         
              p(U12) = [1] x1 + [1]         
               p(__) = [1] x1 + [1] x2 + [0]
          p(isNePal) = [1] x1 + [9]         
              p(nil) = [0]                  
               p(tt) = [0]                  
        
        Following rules are strictly oriented:
        U11(tt()) = [3]      
                  > [1]      
                  = U12(tt())
        
        U12(tt()) = [1]      
                  > [0]      
                  = tt()

popout

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

job log

popout

actions all output return to Deriv Compl Full Rewri 33144