The following uses Polish notation with the following definition for meaningful expressions.
- All lower case letters are meaningful expressions.
- If $\alpha$ is a meaningful expression, then so is N$\alpha$.
- If $\alpha$ is a meaningful expression, if $\beta$ is a meaningful expression also, then C$\alpha$$\beta$ is a meaningful expression.
The axioms are
Ax1 CxCyx
Ax2 CCxCyzCCxyCxz
Ax3 CCNxNyCyx
The rules of inference are uniform substitution for any thesis of the system and C-detachment, from $\vdash$C$\alpha$$\beta$, from $\vdash$$\alpha$ also, we may infer $\vdash$$\beta$.
Can CNCxyx get proven in around 50 steps?
Counting the axioms as steps in the proof, the following consists of a less than 50 step which indicates an answer of yes.
I constructed the above proof with the help of this first-order, hyperresolution proof I found with OTTER as my assistant.
1 [] -P(C(x,y))| -P(x)|P(y).
2 [] -P(C(N(C(p,N(q))),p)).
3 [] P(C(x,C(y,x))).
4 [] P(C(C(x,C(y,z)),C(C(x,y),C(x,z)))).
5 [] P(C(C(N(x),N(y)),C(y,x))).
6 [hyper,1,3,3] P(C(x,C(y,C(z,y)))).
8 [hyper,1,3,5] P(C(x,C(C(N(y),N(z)),C(z,y)))).
9 [hyper,1,4,6] P(C(C(x,y),C(x,C(z,y)))).
15 [hyper,1,4,8] P(C(C(x,C(N(y),N(z))),C(x,C(z,y)))).
30 [hyper,1,15,3] P(C(N(x),C(x,y))).
67 [hyper,1,9,30] P(C(N(x),C(y,C(x,z)))).
68 [hyper,1,4,30] P(C(C(N(x),x),C(N(x),y))).
136 [hyper,1,15,68] P(C(C(N(x),x),C(y,x))).
138 [hyper,1,3,68] P(C(x,C(C(N(y),y),C(N(y),z)))).
220 [hyper,1,4,136] P(C(C(C(N(x),x),y),C(C(N(x),x),x))).
240 [hyper,1,4,138] P(C(C(x,C(N(y),y)),C(x,C(N(y),z)))).
326 [hyper,1,220,136] P(C(C(N(x),x),x)).
353 [hyper,1,240,67] P(C(N(x),C(N(C(x,y)),z))).
459 [hyper,1,3,326] P(C(x,C(C(N(y),y),y))).
503 [hyper,1,4,353] P(C(C(N(x),N(C(x,y))),C(N(x),z))).
659 [hyper,1,4,459] P(C(C(x,C(N(y),y)),C(x,y))).
902 [hyper,1,9,659] P(C(C(x,C(N(y),y)),C(z,C(x,y)))).
1343 [hyper,1,902,503] P(C(x,C(C(N(y),N(C(y,z))),y))).
1859 [hyper,1,4,1343] P(C(C(x,C(N(y),N(C(y,z)))),C(x,y))).
2803 [hyper,1,1859,3] P(C(N(C(x,y)),x)).
4153 [hyper,2,2803] $F.