Problem Transformed CSR 04 Ex15 Luc06 FR

LMPO

Execution Time (secs)
0.037
Answer
MAYBE
InputTransformed CSR 04 Ex15 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__f(n__a())) -> f(n__g(n__f(n__a())))
     , f(X) -> n__f(X)
     , a() -> n__a()
     , g(X) -> n__g(X)
     , activate(n__f(X)) -> f(X)
     , activate(n__a()) -> a()
     , activate(n__g(X)) -> g(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.045
Answer
MAYBE
InputTransformed CSR 04 Ex15 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__f(n__a())) -> f(n__g(n__f(n__a())))
     , f(X) -> n__f(X)
     , a() -> n__a()
     , g(X) -> n__g(X)
     , activate(n__f(X)) -> f(X)
     , activate(n__a()) -> a()
     , activate(n__g(X)) -> g(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.027
Answer
MAYBE
InputTransformed CSR 04 Ex15 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__f(n__a())) -> f(n__g(n__f(n__a())))
     , f(X) -> n__f(X)
     , a() -> n__a()
     , g(X) -> n__g(X)
     , activate(n__f(X)) -> f(X)
     , activate(n__a()) -> a()
     , activate(n__g(X)) -> g(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.054
Answer
MAYBE
InputTransformed CSR 04 Ex15 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__f(n__a())) -> f(n__g(n__f(n__a())))
     , f(X) -> n__f(X)
     , a() -> n__a()
     , g(X) -> n__g(X)
     , activate(n__f(X)) -> f(X)
     , activate(n__a()) -> a()
     , activate(n__g(X)) -> g(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.064
Answer
MAYBE
InputTransformed CSR 04 Ex15 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__f(n__a())) -> f(n__g(n__f(n__a())))
     , f(X) -> n__f(X)
     , a() -> n__a()
     , g(X) -> n__g(X)
     , activate(n__f(X)) -> f(X)
     , activate(n__a()) -> a()
     , activate(n__g(X)) -> g(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.037
Answer
MAYBE
InputTransformed CSR 04 Ex15 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__f(n__a())) -> f(n__g(n__f(n__a())))
     , f(X) -> n__f(X)
     , a() -> n__a()
     , g(X) -> n__g(X)
     , activate(n__f(X)) -> f(X)
     , activate(n__a()) -> a()
     , activate(n__g(X)) -> g(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..