Problem Trafo 06 dup14

Tool Bounds

Execution Time60.03607ms
Answer
TIMEOUT
InputTrafo 06 dup14

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  c(c(c(c(c(c(x1)))))) -> b(b(c(c(b(b(x1))))))
     , a(a(c(c(x1)))) -> c(c(c(c(a(a(x1))))))
     , a(a(b(b(b(b(a(a(x1)))))))) -> a(a(c(c(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.041767ms
Answer
TIMEOUT
InputTrafo 06 dup14

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.046265ms
Answer
TIMEOUT
InputTrafo 06 dup14

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  c(c(c(c(c(c(x1)))))) -> b(b(c(c(b(b(x1))))))
     , a(a(c(c(x1)))) -> c(c(c(c(a(a(x1))))))
     , a(a(b(b(b(b(a(a(x1)))))))) -> a(a(c(c(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.06109ms
Answer
TIMEOUT
InputTrafo 06 dup14

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  c(c(c(c(c(c(x1)))))) -> b(b(c(c(b(b(x1))))))
     , a(a(c(c(x1)))) -> c(c(c(c(a(a(x1))))))
     , a(a(b(b(b(b(a(a(x1)))))))) -> a(a(c(c(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.033966ms
Answer
TIMEOUT
InputTrafo 06 dup14

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  c(c(c(c(c(c(x1)))))) -> b(b(c(c(b(b(x1))))))
     , a(a(c(c(x1)))) -> c(c(c(c(a(a(x1))))))
     , a(a(b(b(b(b(a(a(x1)))))))) -> a(a(c(c(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.233989ms
Answer
MAYBE
InputTrafo 06 dup14

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..