Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ check(old(x)) -> old(x)
, check(old(x)) -> old(check(x))
, check(new(x)) -> new(check(x))
, check(free(x)) -> free(check(x))
, old(serve()) -> free(serve())
, new(serve()) -> free(serve())
, old(free(x)) -> free(old(x))
, new(free(x)) -> free(new(x))
, top(free(x)) -> top(check(new(x)))}
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: 384
Last formula building started for bound 3
Last SAT solving started for bound 3Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ check(old(x)) -> old(x)
, check(old(x)) -> old(check(x))
, check(new(x)) -> new(check(x))
, check(free(x)) -> free(check(x))
, old(serve()) -> free(serve())
, new(serve()) -> free(serve())
, old(free(x)) -> free(old(x))
, new(free(x)) -> free(new(x))
, top(free(x)) -> top(check(new(x)))}
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:
{ check(old(x)) -> old(x)
, check(old(x)) -> old(check(x))
, check(new(x)) -> new(check(x))
, check(free(x)) -> free(check(x))
, old(serve()) -> free(serve())
, new(serve()) -> free(serve())
, old(free(x)) -> free(old(x))
, new(free(x)) -> free(new(x))
, top(free(x)) -> top(check(new(x)))}
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:
{ check(old(x)) -> old(x)
, check(old(x)) -> old(check(x))
, check(new(x)) -> new(check(x))
, check(free(x)) -> free(check(x))
, old(serve()) -> free(serve())
, new(serve()) -> free(serve())
, old(free(x)) -> free(old(x))
, new(free(x)) -> free(new(x))
, top(free(x)) -> top(check(new(x)))}
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:
{ check(old(x)) -> old(x)
, check(old(x)) -> old(check(x))
, check(new(x)) -> new(check(x))
, check(free(x)) -> free(check(x))
, old(serve()) -> free(serve())
, new(serve()) -> free(serve())
, old(free(x)) -> free(old(x))
, new(free(x)) -> free(new(x))
, top(free(x)) -> top(check(new(x)))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..