Problem Strategy outermost added 08 Ex24 Luc06 L

interpretations

Execution Time (secs)
-
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 L
MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { f(X) -> f(c())
  , c() -> b() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) 'matrix interpretation of dimension 3' failed due to the
   following reason:
   
   The input cannot be shown compatible

2) 'matrix interpretation of dimension 1' failed due to the
   following reason:
   
   The input cannot be shown compatible

3) 'custom shape polynomial interpretation' failed due to the
   following reason:
   
   The input cannot be shown compatible

4) 'custom shape polynomial interpretation' failed due to the
   following reason:
   
   The input cannot be shown compatible


Arrrr..

lmpo

Execution Time (secs)
-
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 L
MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { f(X) -> f(c())
  , c() -> b() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..

mpo

Execution Time (secs)
-
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 L
MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { f(X) -> f(c())
  , c() -> b() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..

popstar

Execution Time (secs)
0.043
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 L
MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { f(X) -> f(c())
  , c() -> b() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..

popstar-ps

Execution Time (secs)
0.059
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 L
MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { f(X) -> f(c())
  , c() -> b() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..