Problem Strategy outermost added 08 ExIntrod GM01

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 ExIntrod GM01

stdout:

MAYBE

Problem:
incr(nil()) -> nil()
incr(cons(X,L)) -> cons(s(X),incr(L))
adx(nil()) -> nil()
adx(cons(X,L)) -> incr(cons(X,adx(L)))
nats() -> adx(zeros())
zeros() -> cons(0(),zeros())
head(cons(X,L)) -> X
tail(cons(X,L)) -> L

Proof:
Complexity Transformation Processor:
  strict:
   incr(nil()) -> nil()
   incr(cons(X,L)) -> cons(s(X),incr(L))
   adx(nil()) -> nil()
   adx(cons(X,L)) -> incr(cons(X,adx(L)))
   nats() -> adx(zeros())
   zeros() -> cons(0(),zeros())
   head(cons(X,L)) -> X
   tail(cons(X,L)) -> L
  weak:

  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [tail](x0) = x0 + 15,

     [head](x0) = x0 + 14,

     [0] = 14,

     [zeros] = 16,

     [nats] = 0,

     [adx](x0) = x0 + 4,

     [s](x0) = x0,

     [cons](x0, x1) = x0 + x1 + 18,

     [incr](x0) = x0 + 8,

     [nil] = 16
    orientation:
     incr(nil()) = 24 >= 16 = nil()

     incr(cons(X,L)) = L + X + 26 >= L + X + 26 = cons(s(X),incr(L))

     adx(nil()) = 20 >= 16 = nil()

     adx(cons(X,L)) = L + X + 22 >= L + X + 30 = incr(cons(X,adx(L)))

     nats() = 0 >= 20 = adx(zeros())

     zeros() = 16 >= 48 = cons(0(),zeros())

     head(cons(X,L)) = L + X + 32 >= X = X

     tail(cons(X,L)) = L + X + 33 >= L = L
    problem:
     strict:
      incr(cons(X,L)) -> cons(s(X),incr(L))
      adx(cons(X,L)) -> incr(cons(X,adx(L)))
      nats() -> adx(zeros())
      zeros() -> cons(0(),zeros())
     weak:
      incr(nil()) -> nil()
      adx(nil()) -> nil()
      head(cons(X,L)) -> X
      tail(cons(X,L)) -> L
    Matrix Interpretation Processor:
     dimension: 1
     max_matrix:
      1
      interpretation:
       [tail](x0) = x0 + 192,

       [head](x0) = x0 + 78,

       [0] = 60,

       [zeros] = 68,

       [nats] = 69,

       [adx](x0) = x0,

       [s](x0) = x0 + 107,

       [cons](x0, x1) = x0 + x1 + 68,

       [incr](x0) = x0,

       [nil] = 156
      orientation:
       incr(cons(X,L)) = L + X + 68 >= L + X + 175 = cons(s(X),incr(L))

       adx(cons(X,L)) = L + X + 68 >= L + X + 68 = incr(cons(X,adx(L)))

       nats() = 69 >= 68 = adx(zeros())

       zeros() = 68 >= 196 = cons(0(),zeros())

       incr(nil()) = 156 >= 156 = nil()

       adx(nil()) = 156 >= 156 = nil()

       head(cons(X,L)) = L + X + 146 >= X = X

       tail(cons(X,L)) = L + X + 260 >= L = L
      problem:
       strict:
        incr(cons(X,L)) -> cons(s(X),incr(L))
        adx(cons(X,L)) -> incr(cons(X,adx(L)))
        zeros() -> cons(0(),zeros())
       weak:
        nats() -> adx(zeros())
        incr(nil()) -> nil()
        adx(nil()) -> nil()
        head(cons(X,L)) -> X
        tail(cons(X,L)) -> L
      Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 ExIntrod GM01

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 ExIntrod GM01

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  incr(nil()) -> nil()
     , incr(cons(X, L)) -> cons(s(X), incr(L))
     , adx(nil()) -> nil()
     , adx(cons(X, L)) -> incr(cons(X, adx(L)))
     , nats() -> adx(zeros())
     , zeros() -> cons(0(), zeros())
     , head(cons(X, L)) -> X
     , tail(cons(X, L)) -> L}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 ExIntrod GM01

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 ExIntrod GM01

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  incr(nil()) -> nil()
     , incr(cons(X, L)) -> cons(s(X), incr(L))
     , adx(nil()) -> nil()
     , adx(cons(X, L)) -> incr(cons(X, adx(L)))
     , nats() -> adx(zeros())
     , zeros() -> cons(0(), zeros())
     , head(cons(X, L)) -> X
     , tail(cons(X, L)) -> L}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds