Problem Transformed CSR 04 Ex6 9 Luc02c FR

LMPO

Execution Time (secs)
0.032
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR
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..

MPO

Execution Time (secs)
0.066
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR
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..

POP*

Execution Time (secs)
0.043
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR
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..

POP* (PS)

Execution Time (secs)
0.037
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR
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..

Small POP*

Execution Time (secs)
0.032
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR
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..

Small POP* (PS)

Execution Time (secs)
0.047
Answer
MAYBE
InputTransformed CSR 04 Ex6 9 Luc02c FR
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..