I don't think your argument holds water. The Robot has to check n p-complex approaches to m problems. This has complexity n.m.p'max I think that's in p. All

I don't think your argument holds water. The Robot has to check n p-complex approaches to m problems. This has complexity n.m.p'max I think that's in p. All the problems that are known to be p are in n and m.