Problem Zantema 04 z119

Tool Bounds

Execution Time60.062366ms
Answer
TIMEOUT
InputZantema 04 z119

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time2.459866ms
Answer
MAYBE
InputZantema 04 z119

stdout:

MAYBE

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

Tool EDA

Execution Time60.034946ms
Answer
TIMEOUT
InputZantema 04 z119

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time60.035442ms
Answer
TIMEOUT
InputZantema 04 z119

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time60.03256ms
Answer
TIMEOUT
InputZantema 04 z119

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI2

Execution Time0.16672206ms
Answer
MAYBE
InputZantema 04 z119

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..