Problem Strategy outermost added 08 Ex1 Zan97 L

Tool CaT

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex1 Zan97 L

stdout:

MAYBE

Problem:
 g() -> h()
 c() -> d()
 h() -> g()

Proof:
 Complexity Transformation Processor:
  strict:
   g() -> h()
   c() -> d()
   h() -> g()
  weak:
   
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {3,2,1}
    transitions:
     c0() -> 2*
     d1() -> 5*
     g0() -> 1*
     h0() -> 3*
     1 -> 3*
     3 -> 1*
     5 -> 2*
   problem:
    strict:
     g() -> h()
     h() -> g()
    weak:
     c() -> d()
   Matrix Interpretation Processor:
    dimension: 1
    max_matrix:
     0
     interpretation:
      [d] = 0,
      
      [c] = 0,
      
      [h] = 1,
      
      [g] = 0
     orientation:
      g() = 0 >= 1 = h()
      
      h() = 1 >= 0 = g()
      
      c() = 0 >= 0 = d()
     problem:
      strict:
       g() -> h()
      weak:
       h() -> g()
       c() -> d()
     Open
 

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex1 Zan97 L

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex1 Zan97 L

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  g() -> h()
     , c() -> d()
     , h() -> g()}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex1 Zan97 L

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool RC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex1 Zan97 L

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  g() -> h()
     , c() -> d()
     , h() -> g()}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds