Problem GTSSK07 cade04t

LMPO

Execution Time (secs)
0.041
Answer
MAYBE
InputGTSSK07 cade04t
MAYBE

We consider the following Problem:

  Strict Trs:
    {  minus(x, y) -> cond(min(x, y), x, y)
     , cond(y, x, y) -> s(minus(x, s(y)))
     , min(0(), v) -> 0()
     , min(u, 0()) -> 0()
     , min(s(u), s(v)) -> s(min(u, v))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.052
Answer
MAYBE
InputGTSSK07 cade04t
MAYBE

We consider the following Problem:

  Strict Trs:
    {  minus(x, y) -> cond(min(x, y), x, y)
     , cond(y, x, y) -> s(minus(x, s(y)))
     , min(0(), v) -> 0()
     , min(u, 0()) -> 0()
     , min(s(u), s(v)) -> s(min(u, v))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.047
Answer
MAYBE
InputGTSSK07 cade04t
MAYBE

We consider the following Problem:

  Strict Trs:
    {  minus(x, y) -> cond(min(x, y), x, y)
     , cond(y, x, y) -> s(minus(x, s(y)))
     , min(0(), v) -> 0()
     , min(u, 0()) -> 0()
     , min(s(u), s(v)) -> s(min(u, v))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.039
Answer
MAYBE
InputGTSSK07 cade04t
MAYBE

We consider the following Problem:

  Strict Trs:
    {  minus(x, y) -> cond(min(x, y), x, y)
     , cond(y, x, y) -> s(minus(x, s(y)))
     , min(0(), v) -> 0()
     , min(u, 0()) -> 0()
     , min(s(u), s(v)) -> s(min(u, v))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.061
Answer
MAYBE
InputGTSSK07 cade04t
MAYBE

We consider the following Problem:

  Strict Trs:
    {  minus(x, y) -> cond(min(x, y), x, y)
     , cond(y, x, y) -> s(minus(x, s(y)))
     , min(0(), v) -> 0()
     , min(u, 0()) -> 0()
     , min(s(u), s(v)) -> s(min(u, v))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.054
Answer
MAYBE
InputGTSSK07 cade04t
MAYBE

We consider the following Problem:

  Strict Trs:
    {  minus(x, y) -> cond(min(x, y), x, y)
     , cond(y, x, y) -> s(minus(x, s(y)))
     , min(0(), v) -> 0()
     , min(u, 0()) -> 0()
     , min(s(u), s(v)) -> s(min(u, v))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..