LMPO

Execution Time (secs)	0.042
Answer	MAYBE
Input	AProVE 07 thiemann40

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nonZero(0()) -> false()
     , nonZero(s(x)) -> true()
     , p(0()) -> 0()
     , p(s(x)) -> x
     , id_inc(x) -> x
     , id_inc(x) -> s(x)
     , random(x) -> rand(x, 0())
     , rand(x, y) -> if(nonZero(x), x, y)
     , if(false(), x, y) -> y
     , if(true(), x, y) -> rand(p(x), id_inc(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)	0.065
Answer	MAYBE
Input	AProVE 07 thiemann40

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nonZero(0()) -> false()
     , nonZero(s(x)) -> true()
     , p(0()) -> 0()
     , p(s(x)) -> x
     , id_inc(x) -> x
     , id_inc(x) -> s(x)
     , random(x) -> rand(x, 0())
     , rand(x, y) -> if(nonZero(x), x, y)
     , if(false(), x, y) -> y
     , if(true(), x, y) -> rand(p(x), id_inc(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)	0.039
Answer	MAYBE
Input	AProVE 07 thiemann40

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nonZero(0()) -> false()
     , nonZero(s(x)) -> true()
     , p(0()) -> 0()
     , p(s(x)) -> x
     , id_inc(x) -> x
     , id_inc(x) -> s(x)
     , random(x) -> rand(x, 0())
     , rand(x, y) -> if(nonZero(x), x, y)
     , if(false(), x, y) -> y
     , if(true(), x, y) -> rand(p(x), id_inc(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)	0.051
Answer	MAYBE
Input	AProVE 07 thiemann40

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nonZero(0()) -> false()
     , nonZero(s(x)) -> true()
     , p(0()) -> 0()
     , p(s(x)) -> x
     , id_inc(x) -> x
     , id_inc(x) -> s(x)
     , random(x) -> rand(x, 0())
     , rand(x, y) -> if(nonZero(x), x, y)
     , if(false(), x, y) -> y
     , if(true(), x, y) -> rand(p(x), id_inc(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)	0.050
Answer	MAYBE
Input	AProVE 07 thiemann40

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nonZero(0()) -> false()
     , nonZero(s(x)) -> true()
     , p(0()) -> 0()
     , p(s(x)) -> x
     , id_inc(x) -> x
     , id_inc(x) -> s(x)
     , random(x) -> rand(x, 0())
     , rand(x, y) -> if(nonZero(x), x, y)
     , if(false(), x, y) -> y
     , if(true(), x, y) -> rand(p(x), id_inc(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)	0.054
Answer	MAYBE
Input	AProVE 07 thiemann40

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nonZero(0()) -> false()
     , nonZero(s(x)) -> true()
     , p(0()) -> 0()
     , p(s(x)) -> x
     , id_inc(x) -> x
     , id_inc(x) -> s(x)
     , random(x) -> rand(x, 0())
     , rand(x, y) -> if(nonZero(x), x, y)
     , if(false(), x, y) -> y
     , if(true(), x, y) -> rand(p(x), id_inc(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Problem AProVE 07 thiemann40

LMPO

MPO

POP*

POP* (PS)

Small POP*

Small POP* (PS)