Problem AG01 3.37

Tool LMPO

Execution Time
0.024
Answer
MAYBE
InputAG01 3.37

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  not(true()) -> false()
     , not(false()) -> true()
     , evenodd(x, 0()) -> not(evenodd(x, s(0())))
     , evenodd(0(), s(0())) -> false()
     , evenodd(s(x), s(0())) -> evenodd(x, 0())}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.029
Answer
MAYBE
InputAG01 3.37

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  not(true()) -> false()
     , not(false()) -> true()
     , evenodd(x, 0()) -> not(evenodd(x, s(0())))
     , evenodd(0(), s(0())) -> false()
     , evenodd(s(x), s(0())) -> evenodd(x, 0())}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.023
Answer
MAYBE
InputAG01 3.37

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  not(true()) -> false()
     , not(false()) -> true()
     , evenodd(x, 0()) -> not(evenodd(x, s(0())))
     , evenodd(0(), s(0())) -> false()
     , evenodd(s(x), s(0())) -> evenodd(x, 0())}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.037
Answer
MAYBE
InputAG01 3.37

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  not(true()) -> false()
     , not(false()) -> true()
     , evenodd(x, 0()) -> not(evenodd(x, s(0())))
     , evenodd(0(), s(0())) -> false()
     , evenodd(s(x), s(0())) -> evenodd(x, 0())}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.031
Answer
MAYBE
InputAG01 3.37

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  not(true()) -> false()
     , not(false()) -> true()
     , evenodd(x, 0()) -> not(evenodd(x, s(0())))
     , evenodd(0(), s(0())) -> false()
     , evenodd(s(x), s(0())) -> evenodd(x, 0())}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.025
Answer
MAYBE
InputAG01 3.37

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  not(true()) -> false()
     , not(false()) -> true()
     , evenodd(x, 0()) -> not(evenodd(x, s(0())))
     , evenodd(0(), s(0())) -> false()
     , evenodd(s(x), s(0())) -> evenodd(x, 0())}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..