Problem Strategy outermost added 08 Ex14 AEGL02 L

Tool CaT

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 L

stdout:

MAYBE

Problem:
 from(X) -> cons(X)
 length() -> 0()
 length() -> s(length1())
 length1() -> length()

Proof:
 Complexity Transformation Processor:
  strict:
   from(X) -> cons(X)
   length() -> 0()
   length() -> s(length1())
   length1() -> length()
  weak:
   
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {6,5,4}
    transitions:
     cons1(15) -> 16*
     cons1(7) -> 8*
     cons1(13) -> 14*
     01() -> 37*
     s1(20) -> 21*
     length11() -> 20*
     length1() -> 30*
     from0(2) -> 4*
     from0(1) -> 4*
     from0(3) -> 4*
     cons0(2) -> 1*
     cons0(1) -> 1*
     cons0(3) -> 1*
     length0() -> 5*
     00() -> 2*
     s0(2) -> 3*
     s0(1) -> 3*
     s0(3) -> 3*
     length10() -> 6*
     1 -> 13*
     2 -> 5,15
     3 -> 7*
     5 -> 6*
     8 -> 4*
     14 -> 4*
     16 -> 4*
     21 -> 30,5
     30 -> 20*
     37 -> 30*
   problem:
    strict:
     length() -> 0()
     length() -> s(length1())
     length1() -> length()
    weak:
     from(X) -> cons(X)
   Arctic Interpretation Processor:
    dimension: 3
    interpretation:
               [0  2  4 ]  
     [s](x0) = [-& -& 6 ]x0
               [-& -& 4 ]  ,
     
                 [2 ]
     [length1] = [0 ]
                 [-&],
     
           [0 ]
     [0] = [-&]
           [-&],
     
                [2 ]
     [length] = [-&]
                [-&],
     
                  [0  0  0 ]  
     [cons](x0) = [0  -& 0 ]x0
                  [-& 0  -&]  ,
     
                  [0 4 3]  
     [from](x0) = [0 0 0]x0
                  [0 0 0]  
    orientation:
                [2 ]    [0 ]      
     length() = [-&] >= [-&] = 0()
                [-&]    [-&]      
     
                [2 ]    [2 ]               
     length() = [-&] >= [-&] = s(length1())
                [-&]    [-&]               
     
                 [2 ]    [2 ]           
     length1() = [0 ] >= [-&] = length()
                 [-&]    [-&]           
     
               [0 4 3]     [0  0  0 ]           
     from(X) = [0 0 0]X >= [0  -& 0 ]X = cons(X)
               [0 0 0]     [-& 0  -&]           
    problem:
     strict:
      length() -> s(length1())
      length1() -> length()
     weak:
      length() -> 0()
      from(X) -> cons(X)
    Matrix Interpretation Processor:
     dimension: 1
     max_matrix:
      1
      interpretation:
       [s](x0) = x0 + 31,
       
       [length1] = 193,
       
       [0] = 0,
       
       [length] = 0,
       
       [cons](x0) = x0,
       
       [from](x0) = x0
      orientation:
       length() = 0 >= 224 = s(length1())
       
       length1() = 193 >= 0 = length()
       
       length() = 0 >= 0 = 0()
       
       from(X) = X >= X = cons(X)
      problem:
       strict:
        length() -> s(length1())
       weak:
        length1() -> length()
        length() -> 0()
        from(X) -> cons(X)
      Open
 

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 L

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex14 AEGL02 L

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  from(X) -> cons(X)
     , length() -> 0()
     , length() -> s(length1())
     , length1() -> length()}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 L

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool RC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex14 AEGL02 L

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  from(X) -> cons(X)
     , length() -> 0()
     , length() -> s(length1())
     , length1() -> length()}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds