Problem Zantema 06 15

Tool Bounds

Execution Time	60.170277ms
Answer	TIMEOUT
Input	Zantema 06 15

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	60.04097ms
Answer	TIMEOUT
Input	Zantema 06 15

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.05468ms
Answer	TIMEOUT
Input	Zantema 06 15

stdout:

Tool IDA

Execution Time	60.05813ms
Answer	TIMEOUT
Input	Zantema 06 15

stdout:

Tool TRI

Execution Time	60.045406ms
Answer	TIMEOUT
Input	Zantema 06 15

stdout:

Tool TRI2

Execution Time	3.2686248ms
Answer	MAYBE
Input	Zantema 06 15

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..