Problem Secret 06 TRS 8

Tool Bounds

Execution Time	3.138995e-2ms
Answer	YES(?,O(n^1))
Input	Secret 06 TRS 8

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

Certificate: YES(?,O(n^1))

Proof:
  The problem is match-bounded by 2.
  The enriched problem is compatible with the following automaton:
  {  0_0() -> 1
   , 0_1() -> 1
   , 0_1() -> 2
   , 0_2() -> 8
   , b_0(1, 1) -> 1
   , b_1(1, 2) -> 1
   , b_1(2, 1) -> 7
   , b_1(2, 3) -> 7
   , b_1(2, 4) -> 7
   , b_2(5, 8) -> 4
   , b_2(6, 8) -> 5
   , c_0(1) -> 1
   , c_1(3) -> 1
   , c_1(4) -> 3
   , c_1(7) -> 6
   , a_0(1, 1) -> 1
   , a_1(5, 2) -> 4
   , a_1(6, 2) -> 5}

Hurray, we answered YES(?,O(n^1))

Tool CDI

Execution Time	60.040607ms
Answer	TIMEOUT
Input	Secret 06 TRS 8

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.345448ms
Answer	TIMEOUT
Input	Secret 06 TRS 8

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.157608ms
Answer	TIMEOUT
Input	Secret 06 TRS 8

stdout:

Tool TRI

Execution Time	60.035664ms
Answer	TIMEOUT
Input	Secret 06 TRS 8

stdout:

Tool TRI2

Execution Time	0.38732886ms
Answer	MAYBE
Input	Secret 06 TRS 8

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..