LMPO

Execution Time (secs)	0.093
Answer	MAYBE
Input	TCT 09 lcs

MAYBE

We consider the following Problem:

  Strict Trs:
    {  lcs(e(), y) -> 0()
     , lcs(x, e()) -> 0()
     , lcs(a(x), a(y)) -> s(lcs(x, y))
     , lcs(b(x), b(y)) -> s(lcs(x, y))
     , lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
     , lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
     , max(x, 0()) -> 0()
     , max(0(), y) -> 0()
     , max(s(x), s(y)) -> max(x, y)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)	0.148
Answer	YES(?,PRIMREC)
Input	TCT 09 lcs

YES(?,PRIMREC)

We consider the following Problem:

  Strict Trs:
    {  lcs(e(), y) -> 0()
     , lcs(x, e()) -> 0()
     , lcs(a(x), a(y)) -> s(lcs(x, y))
     , lcs(b(x), b(y)) -> s(lcs(x, y))
     , lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
     , lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
     , max(x, 0()) -> 0()
     , max(0(), y) -> 0()
     , max(s(x), s(y)) -> max(x, y)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: YES(?,PRIMREC)

Proof:
  The input was oriented with the instance of
  'multiset path orders' as induced by the precedence

   lcs > 0, lcs > s, lcs > max .

Hurray, we answered YES(?,PRIMREC)

POP*

Execution Time (secs)	0.069
Answer	MAYBE
Input	TCT 09 lcs

MAYBE

We consider the following Problem:

  Strict Trs:
    {  lcs(e(), y) -> 0()
     , lcs(x, e()) -> 0()
     , lcs(a(x), a(y)) -> s(lcs(x, y))
     , lcs(b(x), b(y)) -> s(lcs(x, y))
     , lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
     , lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
     , max(x, 0()) -> 0()
     , max(0(), y) -> 0()
     , max(s(x), s(y)) -> max(x, y)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)	0.135
Answer	MAYBE
Input	TCT 09 lcs

MAYBE

We consider the following Problem:

  Strict Trs:
    {  lcs(e(), y) -> 0()
     , lcs(x, e()) -> 0()
     , lcs(a(x), a(y)) -> s(lcs(x, y))
     , lcs(b(x), b(y)) -> s(lcs(x, y))
     , lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
     , lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
     , max(x, 0()) -> 0()
     , max(0(), y) -> 0()
     , max(s(x), s(y)) -> max(x, y)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)	0.072
Answer	MAYBE
Input	TCT 09 lcs

MAYBE

We consider the following Problem:

  Strict Trs:
    {  lcs(e(), y) -> 0()
     , lcs(x, e()) -> 0()
     , lcs(a(x), a(y)) -> s(lcs(x, y))
     , lcs(b(x), b(y)) -> s(lcs(x, y))
     , lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
     , lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
     , max(x, 0()) -> 0()
     , max(0(), y) -> 0()
     , max(s(x), s(y)) -> max(x, y)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)	0.078
Answer	MAYBE
Input	TCT 09 lcs

MAYBE

We consider the following Problem:

  Strict Trs:
    {  lcs(e(), y) -> 0()
     , lcs(x, e()) -> 0()
     , lcs(a(x), a(y)) -> s(lcs(x, y))
     , lcs(b(x), b(y)) -> s(lcs(x, y))
     , lcs(a(x), b(y)) -> max(lcs(x, b(y)), lcs(a(x), y))
     , lcs(b(x), a(y)) -> max(lcs(x, a(y)), lcs(b(x), y))
     , max(x, 0()) -> 0()
     , max(0(), y) -> 0()
     , max(s(x), s(y)) -> max(x, y)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Problem TCT 09 lcs

LMPO

MPO

POP*

POP* (PS)

Small POP*

Small POP* (PS)