Problem Trafo 06 dup08

Tool Bounds

Execution Time60.093636ms
Answer
TIMEOUT
InputTrafo 06 dup08

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time60.04563ms
Answer
TIMEOUT
InputTrafo 06 dup08

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.04885ms
Answer
TIMEOUT
InputTrafo 06 dup08

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time60.06745ms
Answer
TIMEOUT
InputTrafo 06 dup08

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time60.34217ms
Answer
TIMEOUT
InputTrafo 06 dup08

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI2

Execution Time1.4202569ms
Answer
MAYBE
InputTrafo 06 dup08

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..