Problem Zantema 08 cariboo add2a

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 cariboo add2a

stdout:

MAYBE

Problem:
f(h(x)) -> f(i(x))
h(x) -> f(h(x))
i(x) -> h(x)
f(i(x)) -> x

Proof:
Complexity Transformation Processor:
  strict:
   f(h(x)) -> f(i(x))
   h(x) -> f(h(x))
   i(x) -> h(x)
   f(i(x)) -> x
  weak:

  Arctic Interpretation Processor:
   dimension: 1
   interpretation:
    [i](x0) = 5x0,

    [f](x0) = x0,

    [h](x0) = 5x0
   orientation:
    f(h(x)) = 5x >= 5x = f(i(x))

    h(x) = 5x >= 5x = f(h(x))

    i(x) = 5x >= 5x = h(x)

    f(i(x)) = 5x >= x = x
   problem:
    strict:
     f(h(x)) -> f(i(x))
     h(x) -> f(h(x))
     i(x) -> h(x)
    weak:
     f(i(x)) -> x
   Matrix Interpretation Processor:
    dimension: 1
    max_matrix:
     1
     interpretation:
      [i](x0) = x0,

      [f](x0) = x0,

      [h](x0) = x0 + 66
     orientation:
      f(h(x)) = x + 66 >= x = f(i(x))

      h(x) = x + 66 >= x + 66 = f(h(x))

      i(x) = x >= x + 66 = h(x)

      f(i(x)) = x >= x = x
     problem:
      strict:
       h(x) -> f(h(x))
       i(x) -> h(x)
      weak:
       f(h(x)) -> f(i(x))
       f(i(x)) -> x
     Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 cariboo add2a

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Zantema 08 cariboo add2a

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 cariboo add2a

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Zantema 08 cariboo add2a

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds