Problem Strategy outermost added 08 Ex6 GM04 FR

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex6 GM04 FR

stdout:

MAYBE

Problem:
c() -> f(n__g(n__c()))
f(n__g(X)) -> g(activate(X))
g(X) -> n__g(X)
c() -> n__c()
activate(n__g(X)) -> g(X)
activate(n__c()) -> c()
activate(X) -> X

Proof:
Complexity Transformation Processor:
  strict:
   c() -> f(n__g(n__c()))
   f(n__g(X)) -> g(activate(X))
   g(X) -> n__g(X)
   c() -> n__c()
   activate(n__g(X)) -> g(X)
   activate(n__c()) -> c()
   activate(X) -> X
  weak:

  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {6,5,4,3}
    transitions:
     f1(45) -> 46*
     n__g1(62) -> 63*
     n__g1(44) -> 45*
     n__g1(106) -> 107*
     n__g1(58) -> 59*
     n__c1() -> 44*
     g1(22) -> 23*
     g1(16) -> 17*
     g1(93) -> 94*
     activate1(92) -> 93*
     c1() -> 111*
     c0() -> 3*
     f0(2) -> 4*
     f0(1) -> 4*
     n__g0(2) -> 1*
     n__g0(1) -> 1*
     n__g0(98) -> 99*
     n__c0() -> 2*
     g0(2) -> 5*
     g0(49) -> 50*
     g0(1) -> 5*
     activate0(2) -> 6*
     activate0(1) -> 6*
     1 -> 6,5,22
     2 -> 3,16
     3 -> 6*
     6 -> 49*
     16 -> 58*
     17 -> 6*
     22 -> 62*
     23 -> 6*
     44 -> 111,92
     46 -> 111,3
     49 -> 98*
     50 -> 4*
     59 -> 17*
     63 -> 23*
     92 -> 93*
     93 -> 106*
     94 -> 46*
     99 -> 50*
     107 -> 94*
     111 -> 93*
   problem:
    strict:
     c() -> f(n__g(n__c()))
     f(n__g(X)) -> g(activate(X))
     g(X) -> n__g(X)
     c() -> n__c()
     activate(n__c()) -> c()
     activate(X) -> X
    weak:
     activate(n__g(X)) -> g(X)
   Arctic Interpretation Processor:
    dimension: 1
    interpretation:
     [g](x0) = x0,

     [activate](x0) = 1x0,

     [f](x0) = 1x0,

     [n__g](x0) = x0,

     [n__c] = 8,

     [c] = 9
    orientation:
     c() = 9 >= 9 = f(n__g(n__c()))

     f(n__g(X)) = 1X >= 1X = g(activate(X))

     g(X) = X >= X = n__g(X)

     c() = 9 >= 8 = n__c()

     activate(n__c()) = 9 >= 9 = c()

     activate(X) = 1X >= X = X

     activate(n__g(X)) = 1X >= X = g(X)
    problem:
     strict:
      c() -> f(n__g(n__c()))
      f(n__g(X)) -> g(activate(X))
      g(X) -> n__g(X)
      activate(n__c()) -> c()
     weak:
      c() -> n__c()
      activate(X) -> X
      activate(n__g(X)) -> g(X)
    Matrix Interpretation Processor:
     dimension: 1
     max_matrix:
      1
      interpretation:
       [g](x0) = x0 + 2,

       [activate](x0) = x0 + 2,

       [f](x0) = x0 + 156,

       [n__g](x0) = x0,

       [n__c] = 66,

       [c] = 67
      orientation:
       c() = 67 >= 222 = f(n__g(n__c()))

       f(n__g(X)) = X + 156 >= X + 4 = g(activate(X))

       g(X) = X + 2 >= X = n__g(X)

       activate(n__c()) = 68 >= 67 = c()

       c() = 67 >= 66 = n__c()

       activate(X) = X + 2 >= X = X

       activate(n__g(X)) = X + 2 >= X + 2 = g(X)
      problem:
       strict:
        c() -> f(n__g(n__c()))
       weak:
        f(n__g(X)) -> g(activate(X))
        g(X) -> n__g(X)
        activate(n__c()) -> c()
        c() -> n__c()
        activate(X) -> X
        activate(n__g(X)) -> g(X)
      Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex6 GM04 FR

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex6 GM04 FR

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  c() -> f(n__g(n__c()))
     , f(n__g(X)) -> g(activate(X))
     , g(X) -> n__g(X)
     , c() -> n__c()
     , activate(n__g(X)) -> g(X)
     , activate(n__c()) -> c()
     , 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 Ex6 GM04 FR

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex6 GM04 FR

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds