Problem TCT 09 revappend

Tool LMPO

Execution Time
0.044
Answer
MAYBE
InputTCT 09 revappend

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  app(nil(), xs) -> nil()
     , app(cons(x, xs), ys) -> cons(x, app(xs, ys))
     , rev(nil()) -> nil()
     , rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.068
Answer
MAYBE
InputTCT 09 revappend

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  app(nil(), xs) -> nil()
     , app(cons(x, xs), ys) -> cons(x, app(xs, ys))
     , rev(nil()) -> nil()
     , rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.036
Answer
MAYBE
InputTCT 09 revappend

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  app(nil(), xs) -> nil()
     , app(cons(x, xs), ys) -> cons(x, app(xs, ys))
     , rev(nil()) -> nil()
     , rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.036
Answer
MAYBE
InputTCT 09 revappend

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  app(nil(), xs) -> nil()
     , app(cons(x, xs), ys) -> cons(x, app(xs, ys))
     , rev(nil()) -> nil()
     , rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.039
Answer
MAYBE
InputTCT 09 revappend

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  app(nil(), xs) -> nil()
     , app(cons(x, xs), ys) -> cons(x, app(xs, ys))
     , rev(nil()) -> nil()
     , rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.044
Answer
MAYBE
InputTCT 09 revappend

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  app(nil(), xs) -> nil()
     , app(cons(x, xs), ys) -> cons(x, app(xs, ys))
     , rev(nil()) -> nil()
     , rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..