Problem AProVE 10 ex3

LMPO

Execution Time (secs)
0.035
Answer
MAYBE
InputAProVE 10 ex3
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.037
Answer
MAYBE
InputAProVE 10 ex3
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.042
Answer
MAYBE
InputAProVE 10 ex3
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.033
Answer
MAYBE
InputAProVE 10 ex3
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.044
Answer
MAYBE
InputAProVE 10 ex3
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.039
Answer
MAYBE
InputAProVE 10 ex3
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..