Problem Trafo 06 un07

Tool Bounds

Execution Time60.037273ms
Answer
TIMEOUT
InputTrafo 06 un07

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  b(a(a(b(a(b(x1)))))) -> b(b(x1))
     , b(a(b(x1))) -> b(a(a(b(x1))))
     , b(b(a(b(x1)))) -> b(a(b(a(a(b(b(x1)))))))
     , b(b(x1)) -> b(a(b(x1)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time60.042015ms
Answer
TIMEOUT
InputTrafo 06 un07

stdout:

TIMEOUT

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

Tool EDA

Execution Time60.040775ms
Answer
TIMEOUT
InputTrafo 06 un07

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  b(a(a(b(a(b(x1)))))) -> b(b(x1))
     , b(a(b(x1))) -> b(a(a(b(x1))))
     , b(b(a(b(x1)))) -> b(a(b(a(a(b(b(x1)))))))
     , b(b(x1)) -> b(a(b(x1)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time60.177574ms
Answer
TIMEOUT
InputTrafo 06 un07

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  b(a(a(b(a(b(x1)))))) -> b(b(x1))
     , b(a(b(x1))) -> b(a(a(b(x1))))
     , b(b(a(b(x1)))) -> b(a(b(a(a(b(b(x1)))))))
     , b(b(x1)) -> b(a(b(x1)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time60.029903ms
Answer
TIMEOUT
InputTrafo 06 un07

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  b(a(a(b(a(b(x1)))))) -> b(b(x1))
     , b(a(b(x1))) -> b(a(a(b(x1))))
     , b(b(a(b(x1)))) -> b(a(b(a(a(b(b(x1)))))))
     , b(b(x1)) -> b(a(b(x1)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI2

Execution Time0.49868393ms
Answer
MAYBE
InputTrafo 06 un07

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  b(a(a(b(a(b(x1)))))) -> b(b(x1))
     , b(a(b(x1))) -> b(a(a(b(x1))))
     , b(b(a(b(x1)))) -> b(a(b(a(a(b(b(x1)))))))
     , b(b(x1)) -> b(a(b(x1)))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..