Problem AG01 innermost 4.37

LMPO

Execution Time (secs)
0.024
Answer
MAYBE
InputAG01 innermost 4.37
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.043
Answer
MAYBE
InputAG01 innermost 4.37
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.041
Answer
MAYBE
InputAG01 innermost 4.37
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.028
Answer
MAYBE
InputAG01 innermost 4.37
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.045
Answer
MAYBE
InputAG01 innermost 4.37
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.033
Answer
MAYBE
InputAG01 innermost 4.37
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..