Problem Trafo 06 dup11

Tool Bounds

Execution Time	60.09204ms
Answer	TIMEOUT
Input	Trafo 06 dup11

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	60.044624ms
Answer	TIMEOUT
Input	Trafo 06 dup11

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.07946ms
Answer	TIMEOUT
Input	Trafo 06 dup11

stdout:

Tool IDA

Execution Time	60.08378ms
Answer	TIMEOUT
Input	Trafo 06 dup11

stdout:

Tool TRI

Execution Time	60.072697ms
Answer	TIMEOUT
Input	Trafo 06 dup11

stdout:

Tool TRI2

Execution Time	11.964575ms
Answer	MAYBE
Input	Trafo 06 dup11

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..