YES
Input TRS:
    1: s(p(x)) -> x
    2: p(s(x)) -> x
    3: pos(0()) -> false()
    4: pos(s(0())) -> true()
    5: pos(s(x)) -> true() | pos(x) --> true()
    6: pos(p(x)) -> false() | pos(x) --> false()
Infeasibility test:
    pos(0()) --> true()
Symbol transition graph:
    p	-->  # 0 false p pos s true
    s	-->  # 0 false p pos s true
    pos	--> false true
  Collapsable symbols: { s p }