Problem Zantema 05 jw08

Tool Bounds

Execution Time	2.9845953e-2ms
Answer	YES(?,O(n^1))
Input	Zantema 05 jw08

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs:
    {f(a(), f(x, a())) -> f(a(), f(a(), f(f(a(), a()), x)))}
  StartTerms: all
  Strategy: none

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

Proof:
  The problem is match-bounded by 1.
  The enriched problem is compatible with the following automaton:
  {  a_0() -> 1
   , a_1() -> 2
   , a_1() -> 4
   , a_1() -> 7
   , a_1() -> 8
   , f_0(1, 1) -> 1
   , f_1(2, 3) -> 1
   , f_1(4, 5) -> 3
   , f_1(6, 1) -> 5
   , f_1(6, 6) -> 9
   , f_1(7, 8) -> 6
   , f_1(8, 9) -> 5}

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

Tool CDI

Execution Time	60.03843ms
Answer	TIMEOUT
Input	Zantema 05 jw08

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.03454ms
Answer	TIMEOUT
Input	Zantema 05 jw08

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {f(a(), f(x, a())) -> f(a(), f(a(), f(f(a(), a()), x)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.534153ms
Answer	TIMEOUT
Input	Zantema 05 jw08

stdout:

Tool TRI

Execution Time	60.027176ms
Answer	TIMEOUT
Input	Zantema 05 jw08

stdout:

Tool TRI2

Execution Time	0.3687451ms
Answer	MAYBE
Input	Zantema 05 jw08

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {f(a(), f(x, a())) -> f(a(), f(a(), f(f(a(), a()), x)))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..