Problem Strategy outermost added 08 Ex4 7 15 Bor03

Tool CaT

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex4 7 15 Bor03

stdout:

MAYBE

Problem:
 f(0()) -> cons(0(),f(s(0())))
 f(s(0())) -> f(p(s(0())))
 p(s(0())) -> 0()

Proof:
 Complexity Transformation Processor:
  strict:
   f(0()) -> cons(0(),f(s(0())))
   f(s(0())) -> f(p(s(0())))
   p(s(0())) -> 0()
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [p](x0) = x0 + 100,
     
     [cons](x0, x1) = x0 + x1 + 60,
     
     [s](x0) = x0 + 45,
     
     [f](x0) = x0 + 31,
     
     [0] = 4
    orientation:
     f(0()) = 35 >= 144 = cons(0(),f(s(0())))
     
     f(s(0())) = 80 >= 180 = f(p(s(0())))
     
     p(s(0())) = 149 >= 4 = 0()
    problem:
     strict:
      f(0()) -> cons(0(),f(s(0())))
      f(s(0())) -> f(p(s(0())))
     weak:
      p(s(0())) -> 0()
    Open
 

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex4 7 15 Bor03

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex4 7 15 Bor03

stdout:

TIMEOUT

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

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex4 7 15 Bor03

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool RC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex4 7 15 Bor03

stdout:

TIMEOUT

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

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds