Problem Strategy outermost added 08 Ex4 Zan97

LMPO

Execution Time (secs)
0.028
Answer
MAYBE
InputStrategy outermost added 08 Ex4 Zan97
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> cons(X, f(g(X)))
     , g(0()) -> s(0())
     , g(s(X)) -> s(s(g(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.051
Answer
MAYBE
InputStrategy outermost added 08 Ex4 Zan97
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> cons(X, f(g(X)))
     , g(0()) -> s(0())
     , g(s(X)) -> s(s(g(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.029
Answer
MAYBE
InputStrategy outermost added 08 Ex4 Zan97
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> cons(X, f(g(X)))
     , g(0()) -> s(0())
     , g(s(X)) -> s(s(g(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.032
Answer
MAYBE
InputStrategy outermost added 08 Ex4 Zan97
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> cons(X, f(g(X)))
     , g(0()) -> s(0())
     , g(s(X)) -> s(s(g(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.030
Answer
MAYBE
InputStrategy outermost added 08 Ex4 Zan97
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> cons(X, f(g(X)))
     , g(0()) -> s(0())
     , g(s(X)) -> s(s(g(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.064
Answer
MAYBE
InputStrategy outermost added 08 Ex4 Zan97
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> cons(X, f(g(X)))
     , g(0()) -> s(0())
     , g(s(X)) -> s(s(g(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..