Problem Trafo 06 dup13

Tool Bounds

Execution Time60.045918ms
Answer
TIMEOUT
InputTrafo 06 dup13

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time60.042236ms
Answer
TIMEOUT
InputTrafo 06 dup13

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.053566ms
Answer
TIMEOUT
InputTrafo 06 dup13

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time60.073296ms
Answer
TIMEOUT
InputTrafo 06 dup13

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time60.03164ms
Answer
TIMEOUT
InputTrafo 06 dup13

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI2

Execution Time2.327398ms
Answer
MAYBE
InputTrafo 06 dup13

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..