Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ f''(triple(a, b, c)) -> foldC(triple(a, b, 0()), c)
, f'(triple(a, b, c), A()) -> f''(foldB(triple(s(a), 0(), c), b))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), C()) -> triple(a, b, s(c))
, f(t, x) -> f'(t, g(x))
, foldC(t, s(n)) -> f(foldC(t, n), C())
, foldC(t, 0()) -> t
, foldB(t, s(n)) -> f(foldB(t, n), B())
, foldB(t, 0()) -> t
, 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: 6023
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''(triple(a, b, c)) -> foldC(triple(a, b, 0()), c)
, f'(triple(a, b, c), A()) -> f''(foldB(triple(s(a), 0(), c), b))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), C()) -> triple(a, b, s(c))
, f(t, x) -> f'(t, g(x))
, foldC(t, s(n)) -> f(foldC(t, n), C())
, foldC(t, 0()) -> t
, foldB(t, s(n)) -> f(foldB(t, n), B())
, foldB(t, 0()) -> t
, 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:
MAYBE
We consider the following Problem:
Strict Trs:
{ f''(triple(a, b, c)) -> foldC(triple(a, b, 0()), c)
, f'(triple(a, b, c), A()) -> f''(foldB(triple(s(a), 0(), c), b))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), C()) -> triple(a, b, s(c))
, f(t, x) -> f'(t, g(x))
, foldC(t, s(n)) -> f(foldC(t, n), C())
, foldC(t, 0()) -> t
, foldB(t, s(n)) -> f(foldB(t, n), B())
, foldB(t, 0()) -> t
, 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:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
2) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
3) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
4) 'matrix-interpretation of dimension 2' failed due to the following reason:
The input cannot be shown compatible
5) 'matrix-interpretation of dimension 2' failed due to the following reason:
The input cannot be shown compatible
6) 'matrix-interpretation of dimension 1' failed due to the following reason:
The input cannot be shown compatible
Arrrr..Tool TRI
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ f''(triple(a, b, c)) -> foldC(triple(a, b, 0()), c)
, f'(triple(a, b, c), A()) -> f''(foldB(triple(s(a), 0(), c), b))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), C()) -> triple(a, b, s(c))
, f(t, x) -> f'(t, g(x))
, foldC(t, s(n)) -> f(foldC(t, n), C())
, foldC(t, 0()) -> t
, foldB(t, s(n)) -> f(foldB(t, n), B())
, foldB(t, 0()) -> t
, 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)) -> foldC(triple(a, b, 0()), c)
, f'(triple(a, b, c), A()) -> f''(foldB(triple(s(a), 0(), c), b))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), C()) -> triple(a, b, s(c))
, f(t, x) -> f'(t, g(x))
, foldC(t, s(n)) -> f(foldC(t, n), C())
, foldC(t, 0()) -> t
, foldB(t, s(n)) -> f(foldB(t, n), B())
, foldB(t, 0()) -> t
, 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..