Runti Compl Full Rewri 10127 pair #381902828

details

property	value
status	complete
benchmark	4.53.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_rc
runtime (wallclock)	3.02578282356 seconds
cpu usage	11.965000179
max memory	1.27299584E8

stage attributes

key	value
output-size	8755
starexec-result	WORST_CASE(Omega(n^1),O(n^2))

output

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


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


WORST_CASE(Omega(n^1),O(n^2))
* Step 1: Sum WORST_CASE(Omega(n^1),O(n^2))
    + Considered Problem:
        - Strict TRS:
            f(a()) -> b()
            f(c()) -> d()
            f(g(x,y)) -> g(f(x),f(y))
            f(h(x,y)) -> g(h(y,f(x)),h(x,f(y)))
            g(x,x) -> h(e(),x)
        - Signature:
            {f/1,g/2} / {a/0,b/0,c/0,d/0,e/0,h/2}
        - Obligation:
             runtime complexity wrt. defined symbols {f,g} and constructors {a,b,c,d,e,h}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            f(a()) -> b()
            f(c()) -> d()
            f(g(x,y)) -> g(f(x),f(y))
            f(h(x,y)) -> g(h(y,f(x)),h(x,f(y)))
            g(x,x) -> h(e(),x)
        - Signature:
            {f/1,g/2} / {a/0,b/0,c/0,d/0,e/0,h/2}
        - Obligation:
             runtime complexity wrt. defined symbols {f,g} and constructors {a,b,c,d,e,h}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          f(x){x -> h(x,y)} =
            f(h(x,y)) ->^+ g(h(y,f(x)),h(x,f(y)))
              = C[f(x) = f(x){}]

** Step 1.b:1: NaturalPI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            f(a()) -> b()
            f(c()) -> d()
            f(g(x,y)) -> g(f(x),f(y))
            f(h(x,y)) -> g(h(y,f(x)),h(x,f(y)))
            g(x,x) -> h(e(),x)
        - Signature:
            {f/1,g/2} / {a/0,b/0,c/0,d/0,e/0,h/2}
        - Obligation:
             runtime complexity wrt. defined symbols {f,g} and constructors {a,b,c,d,e,h}
    + Applied Processor:
        NaturalPI {shape = Mixed 2, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(mixed(2)):
        The following argument positions are considered usable:
          uargs(g) = {1,2},
          uargs(h) = {2}
        
        Following symbols are considered usable:
          all
        TcT has computed the following interpretation:
          p(a) = 0              
          p(b) = 0              
          p(c) = 0              
          p(d) = 0              
          p(e) = 0              
          p(f) = 1 + 3*x1 + x1^2
          p(g) = 1 + x1 + x2    
          p(h) = 1 + x1 + x2    
        
        Following rules are strictly oriented:
           f(a()) = 1                                
                  > 0                                
                  = b()                              
        
           f(c()) = 1                                
                  > 0                                
                  = d()                              
        
        f(g(x,y)) = 5 + 5*x + 2*x*y + x^2 + 5*y + y^2
                  > 3 + 3*x + x^2 + 3*y + y^2        
                  = g(f(x),f(y))                     
        
        
        Following rules are (at-least) weakly oriented:
        f(h(x,y)) =  5 + 5*x + 2*x*y + x^2 + 5*y + y^2
                  >= 5 + 4*x + x^2 + 4*y + y^2        
                  =  g(h(y,f(x)),h(x,f(y)))           
        
           g(x,x) =  1 + 2*x                          
                  >= 1 + x                            
                  =  h(e(),x)                         
        
** Step 1.b:2: NaturalPI WORST_CASE(?,O(n^2))
    + Considered Problem:

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127