Problem Mixed outermost afbg

Tool Bounds

Execution Time60.034523ms
Answer
TIMEOUT
InputMixed outermost afbg

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time60.040344ms
Answer
TIMEOUT
InputMixed outermost afbg

stdout:

TIMEOUT

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

Tool EDA

Execution Time60.043037ms
Answer
TIMEOUT
InputMixed outermost afbg

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time60.05575ms
Answer
TIMEOUT
InputMixed outermost afbg

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time60.031975ms
Answer
TIMEOUT
InputMixed outermost afbg

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI2

Execution Time0.9684441ms
Answer
MAYBE
InputMixed outermost afbg

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..