Problem GTSSK07 cade11

LMPO

Execution Time (secs)
0.042
Answer
MAYBE
InputGTSSK07 cade11
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(true(), x, y) -> f(gt(x, y), s(x), s(s(y)))
     , gt(0(), v) -> false()
     , gt(s(u), 0()) -> true()
     , gt(s(u), s(v)) -> gt(u, v)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.063
Answer
MAYBE
InputGTSSK07 cade11
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(true(), x, y) -> f(gt(x, y), s(x), s(s(y)))
     , gt(0(), v) -> false()
     , gt(s(u), 0()) -> true()
     , gt(s(u), s(v)) -> gt(u, v)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.032
Answer
MAYBE
InputGTSSK07 cade11
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(true(), x, y) -> f(gt(x, y), s(x), s(s(y)))
     , gt(0(), v) -> false()
     , gt(s(u), 0()) -> true()
     , gt(s(u), s(v)) -> gt(u, v)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.033
Answer
MAYBE
InputGTSSK07 cade11
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(true(), x, y) -> f(gt(x, y), s(x), s(s(y)))
     , gt(0(), v) -> false()
     , gt(s(u), 0()) -> true()
     , gt(s(u), s(v)) -> gt(u, v)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.039
Answer
MAYBE
InputGTSSK07 cade11
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(true(), x, y) -> f(gt(x, y), s(x), s(s(y)))
     , gt(0(), v) -> false()
     , gt(s(u), 0()) -> true()
     , gt(s(u), s(v)) -> gt(u, v)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.037
Answer
MAYBE
InputGTSSK07 cade11
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(true(), x, y) -> f(gt(x, y), s(x), s(s(y)))
     , gt(0(), v) -> false()
     , gt(s(u), 0()) -> true()
     , gt(s(u), s(v)) -> gt(u, v)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..