Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ f''(triple(a, b, c)) -> foldf(triple(a, b, nil()), c)
, f'(triple(a, b, c), A()) ->
f''(foldf(triple(cons(A(), a), nil(), c), b))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), C()) -> triple(a, b, cons(C(), c))
, f(t, x) -> f'(t, g(x))
, foldf(x, cons(y, z)) -> f(foldf(x, z), y)
, foldf(x, nil()) -> x
, g(C()) -> C()
, g(C()) -> B()
, g(C()) -> A()
, g(B()) -> B()
, g(B()) -> A()
, g(A()) -> A()}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool CDI
stdout:
TIMEOUT
Statistics:
Number of monomials: 0
Last formula building started for bound 0
Last SAT solving started for bound 0Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ f''(triple(a, b, c)) -> foldf(triple(a, b, nil()), c)
, f'(triple(a, b, c), A()) ->
f''(foldf(triple(cons(A(), a), nil(), c), b))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), C()) -> triple(a, b, cons(C(), c))
, f(t, x) -> f'(t, g(x))
, foldf(x, cons(y, z)) -> f(foldf(x, z), y)
, foldf(x, nil()) -> x
, g(C()) -> C()
, g(C()) -> B()
, g(C()) -> A()
, g(B()) -> B()
, g(B()) -> A()
, g(A()) -> A()}
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''(triple(a, b, c)) -> foldf(triple(a, b, nil()), c)
, f'(triple(a, b, c), A()) ->
f''(foldf(triple(cons(A(), a), nil(), c), b))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), C()) -> triple(a, b, cons(C(), c))
, f(t, x) -> f'(t, g(x))
, foldf(x, cons(y, z)) -> f(foldf(x, z), y)
, foldf(x, nil()) -> x
, g(C()) -> C()
, g(C()) -> B()
, g(C()) -> A()
, g(B()) -> B()
, g(B()) -> A()
, g(A()) -> A()}
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''(triple(a, b, c)) -> foldf(triple(a, b, nil()), c)
, f'(triple(a, b, c), A()) ->
f''(foldf(triple(cons(A(), a), nil(), c), b))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), C()) -> triple(a, b, cons(C(), c))
, f(t, x) -> f'(t, g(x))
, foldf(x, cons(y, z)) -> f(foldf(x, z), y)
, foldf(x, nil()) -> x
, g(C()) -> C()
, g(C()) -> B()
, g(C()) -> A()
, g(B()) -> B()
, g(B()) -> A()
, g(A()) -> A()}
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''(triple(a, b, c)) -> foldf(triple(a, b, nil()), c)
, f'(triple(a, b, c), A()) ->
f''(foldf(triple(cons(A(), a), nil(), c), b))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), C()) -> triple(a, b, cons(C(), c))
, f(t, x) -> f'(t, g(x))
, foldf(x, cons(y, z)) -> f(foldf(x, z), y)
, foldf(x, nil()) -> x
, g(C()) -> C()
, g(C()) -> B()
, g(C()) -> A()
, g(B()) -> B()
, g(B()) -> A()
, g(A()) -> A()}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..