Problem Transformed CSR 04 ExProp7 Luc06 Z

LMPO

Execution Time (secs)
0.033
Answer
MAYBE
InputTransformed CSR 04 ExProp7 Luc06 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(0()) -> cons(0(), n__f(s(0())))
     , f(s(0())) -> f(p(s(0())))
     , p(s(X)) -> X
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(X)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.047
Answer
MAYBE
InputTransformed CSR 04 ExProp7 Luc06 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(0()) -> cons(0(), n__f(s(0())))
     , f(s(0())) -> f(p(s(0())))
     , p(s(X)) -> X
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(X)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.048
Answer
MAYBE
InputTransformed CSR 04 ExProp7 Luc06 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(0()) -> cons(0(), n__f(s(0())))
     , f(s(0())) -> f(p(s(0())))
     , p(s(X)) -> X
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(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.033
Answer
MAYBE
InputTransformed CSR 04 ExProp7 Luc06 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(0()) -> cons(0(), n__f(s(0())))
     , f(s(0())) -> f(p(s(0())))
     , p(s(X)) -> X
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(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.034
Answer
MAYBE
InputTransformed CSR 04 ExProp7 Luc06 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(0()) -> cons(0(), n__f(s(0())))
     , f(s(0())) -> f(p(s(0())))
     , p(s(X)) -> X
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(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.033
Answer
MAYBE
InputTransformed CSR 04 ExProp7 Luc06 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(0()) -> cons(0(), n__f(s(0())))
     , f(s(0())) -> f(p(s(0())))
     , p(s(X)) -> X
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(X)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..