Problem Zantema 06 beans4

Tool Bounds

Execution Time60.038555ms
Answer
TIMEOUT
InputZantema 06 beans4

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time13.305142ms
Answer
MAYBE
InputZantema 06 beans4

stdout:

MAYBE

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

Tool EDA

Execution Time60.035564ms
Answer
TIMEOUT
InputZantema 06 beans4

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time60.03448ms
Answer
TIMEOUT
InputZantema 06 beans4

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time60.033417ms
Answer
TIMEOUT
InputZantema 06 beans4

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI2

Execution Time0.26482487ms
Answer
MAYBE
InputZantema 06 beans4

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..