Problem Zantema 06 while1

Tool Bounds

Execution Time	60.03973ms
Answer	TIMEOUT
Input	Zantema 06 while1

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  2(c(0(x1))) -> c(0(0(x1)))
     , 2(c(1(x1))) -> c(0(R(1(x1))))
     , 3(c(x1)) -> c(1(x1))
     , R(b(x1)) -> c(1(b(x1)))
     , 0(L(x1)) -> 2(R(x1))
     , 2(L(x1)) -> L(2(x1))
     , 3(L(x1)) -> L(3(x1))
     , R(1(x1)) -> L(3(x1))
     , R(3(x1)) -> 3(R(x1))
     , R(2(x1)) -> 2(R(x1))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	53.6827ms
Answer	MAYBE
Input	Zantema 06 while1

stdout:

MAYBE

Statistics:
Number of monomials: 2095
Last formula building started for bound 3
Last SAT solving started for bound 3

Tool EDA

Execution Time	60.068256ms
Answer	TIMEOUT
Input	Zantema 06 while1

stdout:

Tool IDA

Execution Time	60.037598ms
Answer	TIMEOUT
Input	Zantema 06 while1

stdout:

Tool TRI

Execution Time	60.0338ms
Answer	TIMEOUT
Input	Zantema 06 while1

stdout:

Tool TRI2

Execution Time	0.39714193ms
Answer	MAYBE
Input	Zantema 06 while1

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  2(c(0(x1))) -> c(0(0(x1)))
     , 2(c(1(x1))) -> c(0(R(1(x1))))
     , 3(c(x1)) -> c(1(x1))
     , R(b(x1)) -> c(1(b(x1)))
     , 0(L(x1)) -> 2(R(x1))
     , 2(L(x1)) -> L(2(x1))
     , 3(L(x1)) -> L(3(x1))
     , R(1(x1)) -> L(3(x1))
     , R(3(x1)) -> 3(R(x1))
     , R(2(x1)) -> 2(R(x1))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..