Problem Transformed CSR 04 Ex6 9 Luc02c FR

Tool LMPO

Execution Time
0.032
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, activate(X1)))
     , from(X) -> cons(X, n__from(n__s(X)))
     , from(X) -> n__from(X)
     , s(X) -> n__s(X)
     , activate(n__from(X)) -> from(activate(X))
     , activate(n__s(X)) -> s(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.066
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, activate(X1)))
     , from(X) -> cons(X, n__from(n__s(X)))
     , from(X) -> n__from(X)
     , s(X) -> n__s(X)
     , activate(n__from(X)) -> from(activate(X))
     , activate(n__s(X)) -> s(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.043
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, activate(X1)))
     , from(X) -> cons(X, n__from(n__s(X)))
     , from(X) -> n__from(X)
     , s(X) -> n__s(X)
     , activate(n__from(X)) -> from(activate(X))
     , activate(n__s(X)) -> s(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.037
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, activate(X1)))
     , from(X) -> cons(X, n__from(n__s(X)))
     , from(X) -> n__from(X)
     , s(X) -> n__s(X)
     , activate(n__from(X)) -> from(activate(X))
     , activate(n__s(X)) -> s(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.032
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, activate(X1)))
     , from(X) -> cons(X, n__from(n__s(X)))
     , from(X) -> n__from(X)
     , s(X) -> n__s(X)
     , activate(n__from(X)) -> from(activate(X))
     , activate(n__s(X)) -> s(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.047
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, activate(X1)))
     , from(X) -> cons(X, n__from(n__s(X)))
     , from(X) -> n__from(X)
     , s(X) -> n__s(X)
     , activate(n__from(X)) -> from(activate(X))
     , activate(n__s(X)) -> s(activate(X))
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..