Problem Transformed CSR 04 Ex4 7 15 Bor03 Z

Tool LMPO

Execution Time
0.022
Answer
MAYBE
InputTransformed CSR 04 Ex4 7 15 Bor03 Z

stdout:

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(0())) -> 0()
     , 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..

Tool MPO

Execution Time
0.053
Answer
MAYBE
InputTransformed CSR 04 Ex4 7 15 Bor03 Z

stdout:

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(0())) -> 0()
     , 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..

Tool POP*

Execution Time
0.026
Answer
MAYBE
InputTransformed CSR 04 Ex4 7 15 Bor03 Z

stdout:

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(0())) -> 0()
     , 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..

Tool POP* (PS)

Execution Time
0.033
Answer
MAYBE
InputTransformed CSR 04 Ex4 7 15 Bor03 Z

stdout:

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(0())) -> 0()
     , 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..

Tool Small POP*

Execution Time
0.039
Answer
MAYBE
InputTransformed CSR 04 Ex4 7 15 Bor03 Z

stdout:

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(0())) -> 0()
     , 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..

Tool Small POP* (PS)

Execution Time
0.053
Answer
MAYBE
InputTransformed CSR 04 Ex4 7 15 Bor03 Z

stdout:

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(0())) -> 0()
     , 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..