Problem AProVE 10 challenge fab

LMPO

Execution Time (secs)
0.051
Answer
MAYBE
InputAProVE 10 challenge fab
MAYBE

We consider the following Problem:

  Strict Trs:
    {  and(tt(), tt()) -> tt()
     , is_nat(0()) -> tt()
     , is_nat(s(x)) -> is_nat(x)
     , is_natlist(nil()) -> tt()
     , is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
     , from(x) -> fromCond(is_natlist(x), x)
     , fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.071
Answer
MAYBE
InputAProVE 10 challenge fab
MAYBE

We consider the following Problem:

  Strict Trs:
    {  and(tt(), tt()) -> tt()
     , is_nat(0()) -> tt()
     , is_nat(s(x)) -> is_nat(x)
     , is_natlist(nil()) -> tt()
     , is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
     , from(x) -> fromCond(is_natlist(x), x)
     , fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.046
Answer
MAYBE
InputAProVE 10 challenge fab
MAYBE

We consider the following Problem:

  Strict Trs:
    {  and(tt(), tt()) -> tt()
     , is_nat(0()) -> tt()
     , is_nat(s(x)) -> is_nat(x)
     , is_natlist(nil()) -> tt()
     , is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
     , from(x) -> fromCond(is_natlist(x), x)
     , fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.044
Answer
MAYBE
InputAProVE 10 challenge fab
MAYBE

We consider the following Problem:

  Strict Trs:
    {  and(tt(), tt()) -> tt()
     , is_nat(0()) -> tt()
     , is_nat(s(x)) -> is_nat(x)
     , is_natlist(nil()) -> tt()
     , is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
     , from(x) -> fromCond(is_natlist(x), x)
     , fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.042
Answer
MAYBE
InputAProVE 10 challenge fab
MAYBE

We consider the following Problem:

  Strict Trs:
    {  and(tt(), tt()) -> tt()
     , is_nat(0()) -> tt()
     , is_nat(s(x)) -> is_nat(x)
     , is_natlist(nil()) -> tt()
     , is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
     , from(x) -> fromCond(is_natlist(x), x)
     , fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.068
Answer
MAYBE
InputAProVE 10 challenge fab
MAYBE

We consider the following Problem:

  Strict Trs:
    {  and(tt(), tt()) -> tt()
     , is_nat(0()) -> tt()
     , is_nat(s(x)) -> is_nat(x)
     , is_natlist(nil()) -> tt()
     , is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
     , from(x) -> fromCond(is_natlist(x), x)
     , fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..