Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ f(u(x)) -> u(g(x))
, f(b(x)) -> u(g(b(x)))
, f(g(x)) -> f(f(x))
, b(u(x)) -> b(f(x))
, f(f(f(x))) -> c()}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool CDI
stdout:
MAYBE
Statistics:
Number of monomials: 317
Last formula building started for bound 3
Last SAT solving started for bound 3Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ f(u(x)) -> u(g(x))
, f(b(x)) -> u(g(b(x)))
, f(g(x)) -> f(f(x))
, b(u(x)) -> b(f(x))
, f(f(f(x))) -> c()}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool IDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ f(u(x)) -> u(g(x))
, f(b(x)) -> u(g(b(x)))
, f(g(x)) -> f(f(x))
, b(u(x)) -> b(f(x))
, f(f(f(x))) -> c()}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ f(u(x)) -> u(g(x))
, f(b(x)) -> u(g(b(x)))
, f(g(x)) -> f(f(x))
, b(u(x)) -> b(f(x))
, f(f(f(x))) -> c()}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI2
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(u(x)) -> u(g(x))
, f(b(x)) -> u(g(b(x)))
, f(g(x)) -> f(f(x))
, b(u(x)) -> b(f(x))
, f(f(f(x))) -> c()}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..