LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(ls) -> r1(ls, empty())
, r1(empty(), a) -> a
, r1(cons(x, k), a) -> r1(k, cons(x, a))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(ls) -> r1(ls, empty())
, r1(empty(), a) -> a
, r1(cons(x, k), a) -> r1(k, cons(x, a))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(ls) -> r1(ls, empty())
, r1(empty(), a) -> a
, r1(cons(x, k), a) -> r1(k, cons(x, a))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
YES(?,POLY)
We consider the following Problem:
Strict Trs:
{ rev(ls) -> r1(ls, empty())
, r1(empty(), a) -> a
, r1(cons(x, k), a) -> r1(k, cons(x, a))}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,POLY)
Proof:
The input was oriented with the instance of
Polynomial Path Order (PS) as induced by the safe mapping
safe(rev) = {}, safe(r1) = {2}, safe(empty) = {},
safe(cons) = {1, 2}
and precedence
rev > r1 .
Following symbols are considered recursive:
{rev, r1}
The recursion depth is 2 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ rev(ls;) -> r1(ls; empty())
, r1(empty(); a) -> a
, r1(cons(; x, k); a) -> r1(k; cons(; x, a))}
Weak Trs : {}
Hurray, we answered YES(?,POLY)
Small POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(ls) -> r1(ls, empty())
, r1(empty(), a) -> a
, r1(cons(x, k), a) -> r1(k, cons(x, a))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ rev(ls) -> r1(ls, empty())
, r1(empty(), a) -> a
, r1(cons(x, k), a) -> r1(k, cons(x, a))}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,O(n^1))
Proof:
The input was oriented with the instance of
Small Polynomial Path Order (WSC,
PS,
Nat 1-bounded) as induced by the safe mapping
safe(rev) = {}, safe(r1) = {2}, safe(empty) = {},
safe(cons) = {1, 2}
and precedence
rev > r1 .
Following symbols are considered recursive:
{r1}
The recursion depth is 1 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ rev(ls;) -> r1(ls; empty())
, r1(empty(); a) -> a
, r1(cons(; x, k); a) -> r1(k; cons(; x, a))}
Weak Trs : {}
Hurray, we answered YES(?,O(n^1))