interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ ite(tt(), x, y) -> x
, ite(ff(), x, y) -> y
, lt(x, 0()) -> ff()
, lt(0(), s(y)) -> tt()
, lt(s(x), s(y)) -> lt(x, y)
, insert(a, nil()) -> cons(a, nil())
, insert(a, cons(b, l)) ->
ite(lt(a, b), cons(a, cons(b, l)), cons(b, insert(a, l)))
, sort(nil()) -> nil()
, sort(cons(a, l)) -> insert(a, sort(l)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'custom shape polynomial interpretation' 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) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
4) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ ite(tt(), x, y) -> x
, ite(ff(), x, y) -> y
, lt(0(), s(y)) -> tt()
, lt(x, 0()) -> ff()
, lt(s(x), s(y)) -> lt(x, y)
, insert(a, nil()) -> cons(a, nil())
, insert(a, cons(b, l)) ->
ite(lt(a, b), cons(a, cons(b, l)), cons(b, insert(a, l)))
, sort(nil()) -> nil()
, sort(cons(a, l)) -> insert(a, sort(l)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ ite(tt(), x, y) -> x
, ite(ff(), x, y) -> y
, lt(0(), s(y)) -> tt()
, lt(x, 0()) -> ff()
, lt(s(x), s(y)) -> lt(x, y)
, insert(a, nil()) -> cons(a, nil())
, insert(a, cons(b, l)) ->
ite(lt(a, b), cons(a, cons(b, l)), cons(b, insert(a, l)))
, sort(nil()) -> nil()
, sort(cons(a, l)) -> insert(a, sort(l)) }
Obligation:
innermost runtime complexity
Answer:
YES(?,PRIMREC)
The input was oriented with the instance of'multiset path orders'
as induced by the precedence
insert > ite, insert > lt, insert > cons, sort > insert, tt ~ s,
ff ~ 0 .
Hurray, we answered YES(?,PRIMREC)
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ ite(tt(), x, y) -> x
, ite(ff(), x, y) -> y
, lt(0(), s(y)) -> tt()
, lt(x, 0()) -> ff()
, lt(s(x), s(y)) -> lt(x, y)
, insert(a, nil()) -> cons(a, nil())
, insert(a, cons(b, l)) ->
ite(lt(a, b), cons(a, cons(b, l)), cons(b, insert(a, l)))
, sort(nil()) -> nil()
, sort(cons(a, l)) -> insert(a, sort(l)) }
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:
{ ite(tt(), x, y) -> x
, ite(ff(), x, y) -> y
, lt(0(), s(y)) -> tt()
, lt(x, 0()) -> ff()
, lt(s(x), s(y)) -> lt(x, y)
, insert(a, nil()) -> cons(a, nil())
, insert(a, cons(b, l)) ->
ite(lt(a, b), cons(a, cons(b, l)), cons(b, insert(a, l)))
, sort(nil()) -> nil()
, sort(cons(a, l)) -> insert(a, sort(l)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..