Problem Strategy outermost added 08 Ex5 Zan97

Tool CaT

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex5 Zan97

stdout:

MAYBE

Problem:
 f(X) -> if(X,c(),f(true()))
 if(true(),X,Y) -> X
 if(false(),X,Y) -> Y

Proof:
 Complexity Transformation Processor:
  strict:
   f(X) -> if(X,c(),f(true()))
   if(true(),X,Y) -> X
   if(false(),X,Y) -> Y
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [false] = 64,
     
     [if](x0, x1, x2) = x0 + x1 + x2 + 159,
     
     [true] = 112,
     
     [c] = 8,
     
     [f](x0) = x0 + 192
    orientation:
     f(X) = X + 192 >= X + 471 = if(X,c(),f(true()))
     
     if(true(),X,Y) = X + Y + 271 >= X = X
     
     if(false(),X,Y) = X + Y + 223 >= Y = Y
    problem:
     strict:
      f(X) -> if(X,c(),f(true()))
     weak:
      if(true(),X,Y) -> X
      if(false(),X,Y) -> Y
    Open
 

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex5 Zan97

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex5 Zan97

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  f(X) -> if(X, c(), f(true()))
     , if(true(), X, Y) -> X
     , if(false(), X, Y) -> Y}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex5 Zan97

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool RC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex5 Zan97

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  f(X) -> if(X, c(), f(true()))
     , if(true(), X, Y) -> X
     , if(false(), X, Y) -> Y}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds