interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ g(A()) -> A()
, g(B()) -> A()
, g(B()) -> B()
, g(C()) -> A()
, g(C()) -> B()
, g(C()) -> C()
, foldf(x, nil()) -> x
, foldf(x, cons(y, z)) -> f(foldf(x, z), y)
, f(t, x) -> f'(t, g(x))
, 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''(triple(a, b, c)) -> foldf(triple(a, b, nil()), c) }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ g(A()) -> A()
, g(B()) -> A()
, g(B()) -> B()
, g(C()) -> A()
, g(C()) -> B()
, g(C()) -> C()
, foldf(x, nil()) -> x
, foldf(x, cons(y, z)) -> f(foldf(x, z), y)
, f(t, x) -> f'(t, g(x))
, f'(triple(a, b, c), C()) -> triple(a, b, cons(C(), c))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), A()) ->
f''(foldf(triple(cons(A(), a), nil(), c), b))
, f''(triple(a, b, c)) -> foldf(triple(a, b, nil()), c) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ g(A()) -> A()
, g(B()) -> A()
, g(B()) -> B()
, g(C()) -> A()
, g(C()) -> B()
, g(C()) -> C()
, foldf(x, nil()) -> x
, foldf(x, cons(y, z)) -> f(foldf(x, z), y)
, f(t, x) -> f'(t, g(x))
, f'(triple(a, b, c), C()) -> triple(a, b, cons(C(), c))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), A()) ->
f''(foldf(triple(cons(A(), a), nil(), c), b))
, f''(triple(a, b, c)) -> foldf(triple(a, b, nil()), c) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ g(A()) -> A()
, g(B()) -> A()
, g(B()) -> B()
, g(C()) -> A()
, g(C()) -> B()
, g(C()) -> C()
, foldf(x, nil()) -> x
, foldf(x, cons(y, z)) -> f(foldf(x, z), y)
, f(t, x) -> f'(t, g(x))
, f'(triple(a, b, c), C()) -> triple(a, b, cons(C(), c))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), A()) ->
f''(foldf(triple(cons(A(), a), nil(), c), b))
, f''(triple(a, b, c)) -> foldf(triple(a, b, nil()), c) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ g(A()) -> A()
, g(B()) -> A()
, g(B()) -> B()
, g(C()) -> A()
, g(C()) -> B()
, g(C()) -> C()
, foldf(x, nil()) -> x
, foldf(x, cons(y, z)) -> f(foldf(x, z), y)
, f(t, x) -> f'(t, g(x))
, f'(triple(a, b, c), C()) -> triple(a, b, cons(C(), c))
, f'(triple(a, b, c), B()) -> f(triple(a, b, c), A())
, f'(triple(a, b, c), A()) ->
f''(foldf(triple(cons(A(), a), nil(), c), b))
, f''(triple(a, b, c)) -> foldf(triple(a, b, nil()), c) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..