Problem Strategy outermost added 08 ExConc Zan97 Z

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 ExConc Zan97 Z

stdout:

MAYBE

Problem:
f(X) -> g(n__h(f(X)))
h(X) -> n__h(X)
activate(n__h(X)) -> h(X)
activate(X) -> X

Proof:
Complexity Transformation Processor:
  strict:
   f(X) -> g(n__h(f(X)))
   h(X) -> n__h(X)
   activate(n__h(X)) -> h(X)
   activate(X) -> X
  weak:

  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {5,4,3}
    transitions:
     g1(26) -> 27*
     n__h1(25) -> 26*
     n__h1(10) -> 11*
     n__h1(16) -> 17*
     f1(34) -> 35*
     f1(24) -> 25*
     f0(2) -> 3*
     f0(1) -> 3*
     g0(2) -> 1*
     g0(1) -> 1*
     n__h0(2) -> 2*
     n__h0(1) -> 2*
     h0(2) -> 4*
     h0(1) -> 4*
     activate0(2) -> 5*
     activate0(1) -> 5*
     1 -> 5,24,10
     2 -> 5,34,16
     4 -> 5*
     11 -> 4*
     17 -> 4*
     27 -> 35,25,3
     35 -> 25*
   problem:
    strict:
     f(X) -> g(n__h(f(X)))
     activate(n__h(X)) -> h(X)
     activate(X) -> X
    weak:
     h(X) -> n__h(X)
   Bounds Processor:
    bound: 1
    enrichment: match
    automaton:
     final states: {5,4,3}
     transitions:
      g1(22) -> 23*
      n__h1(44) -> 45*
      n__h1(34) -> 35*
      n__h1(21) -> 22*
      f1(20) -> 21*
      f1(24) -> 25*
      h1(10) -> 11*
      h1(12) -> 13*
      f0(2) -> 3*
      f0(1) -> 3*
      g0(2) -> 1*
      g0(1) -> 1*
      n__h0(2) -> 2*
      n__h0(1) -> 2*
      h0(2) -> 5*
      h0(1) -> 5*
      activate0(2) -> 4*
      activate0(1) -> 4*
      1 -> 4,20,12
      2 -> 4,5,24,10
      10 -> 44*
      11 -> 4*
      12 -> 34*
      13 -> 4*
      23 -> 25,3
      25 -> 21*
      35 -> 13*
      45 -> 11*
    problem:
     strict:
      f(X) -> g(n__h(f(X)))
      activate(X) -> X
     weak:
      activate(n__h(X)) -> h(X)
      h(X) -> n__h(X)
    Arctic Interpretation Processor:
     dimension: 1
     interpretation:
      [activate](x0) = 7x0,

      [h](x0) = x0,

      [g](x0) = x0,

      [n__h](x0) = x0,

      [f](x0) = x0
     orientation:
      f(X) = X >= X = g(n__h(f(X)))

      activate(X) = 7X >= X = X

      activate(n__h(X)) = 7X >= X = h(X)

      h(X) = X >= X = n__h(X)
     problem:
      strict:
       f(X) -> g(n__h(f(X)))
      weak:
       activate(X) -> X
       activate(n__h(X)) -> h(X)
       h(X) -> n__h(X)
     Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 ExConc Zan97 Z

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 ExConc Zan97 Z

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 ExConc Zan97 Z

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 ExConc Zan97 Z

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds