Problem HirokawaMiddeldorp 04 t013

LMPO

Execution Time (secs)
0.042
Answer
MAYBE
InputHirokawaMiddeldorp 04 t013
MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(0(), s(y)) -> 0()
     , -(s(x), s(y)) -> -(x, y)
     , f(0()) -> 0()
     , f(s(x)) -> -(s(x), g(f(x)))
     , g(0()) -> s(0())
     , g(s(x)) -> -(s(x), f(g(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.042
Answer
MAYBE
InputHirokawaMiddeldorp 04 t013
MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(0(), s(y)) -> 0()
     , -(s(x), s(y)) -> -(x, y)
     , f(0()) -> 0()
     , f(s(x)) -> -(s(x), g(f(x)))
     , g(0()) -> s(0())
     , g(s(x)) -> -(s(x), f(g(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.033
Answer
MAYBE
InputHirokawaMiddeldorp 04 t013
MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(0(), s(y)) -> 0()
     , -(s(x), s(y)) -> -(x, y)
     , f(0()) -> 0()
     , f(s(x)) -> -(s(x), g(f(x)))
     , g(0()) -> s(0())
     , g(s(x)) -> -(s(x), f(g(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.035
Answer
MAYBE
InputHirokawaMiddeldorp 04 t013
MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(0(), s(y)) -> 0()
     , -(s(x), s(y)) -> -(x, y)
     , f(0()) -> 0()
     , f(s(x)) -> -(s(x), g(f(x)))
     , g(0()) -> s(0())
     , g(s(x)) -> -(s(x), f(g(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.040
Answer
MAYBE
InputHirokawaMiddeldorp 04 t013
MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(0(), s(y)) -> 0()
     , -(s(x), s(y)) -> -(x, y)
     , f(0()) -> 0()
     , f(s(x)) -> -(s(x), g(f(x)))
     , g(0()) -> s(0())
     , g(s(x)) -> -(s(x), f(g(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.048
Answer
MAYBE
InputHirokawaMiddeldorp 04 t013
MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(0(), s(y)) -> 0()
     , -(s(x), s(y)) -> -(x, y)
     , f(0()) -> 0()
     , f(s(x)) -> -(s(x), g(f(x)))
     , g(0()) -> s(0())
     , g(s(x)) -> -(s(x), f(g(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..