Sindbad~EG File Manager

Length of proof is 9.  Level of proof is 5.
 
---------------- PROOF ----------------
 
7 [] -T(x,y,x)|x=y.
70 [] le(xa,xb,xc,xd)|le(xc,xd,xa,xb).
107 [] -M(xa,xm,xb)|M(xb,xm,xa).
109 [] M(xa,xm,xa)|xm!=xa.
187 [] -opposite(xa,xp,xq,xb)|opposite(xb,xp,xq,xa).
191 [] -opposite(xa,xp,xq,xc)|xp=xq| -Col(xp,xq,xcs)| -Col(xp,xq,xr)| -perp(xp,xq,xa,xr)| -perp(xp,xq,xc,xcs)| -M(xr,xm,xcs)| -sameside(u,xr,xa)| -le(xcs,xc,xr,xa)|xr=xcs|sameside(s(xm,u),xcs,xc).
192 [] -opposite(xa,xp,xq,xc)|xp=xq| -Col(xp,xq,xcs)| -Col(xp,xq,xr)| -perp(xp,xq,xa,xr)| -perp(xp,xq,xc,xcs)| -M(xr,xm,xcs)|sameside(u,xr,xa)| -le(xcs,xc,xr,xa)|xr=xcs| -sameside(s(xm,u),xcs,xc).
193 [] -opposite(xa,xp,xq,xc)|xp=xq| -Col(xp,xq,xcs)| -Col(xp,xq,xr)| -perp(xp,xq,xa,xr)| -perp(xp,xq,xc,xcs)| -M(xr,xm,xcs)| -sameside(u,xr,xa)|xr!=xcs|sameside(s(xm,u),xcs,xc).
230 [] -M(xa,xm,xb)|T(xa,xm,xb).
269 [] s(xa,s(xa,xp))=xp.
270 [] opposite(a,p,q,c).
271 [] p!=q.
272 [] Col(p,q,cs).
273 [] Col(p,q,r).
274 [] perp(p,q,a,r).
275 [] perp(p,q,c,cs).
276 [] M(r,m,cs).
277 [] sameside(cu,r,a).
278 [] -sameside(s(m,cu),cs,c).
283 [binary,270.1,187.1] opposite(c,p,q,a).
436 [binary,276.1,107.1] M(cs,m,r).
465 [hyper,191,270,272,273,274,275,276,277,70,unit_del,271,278] r=cs|le(r,a,cs,c).
470 [ur,193,270,271,272,273,274,275,276,277,278] r!=cs.
651 [binary,470.1,7.2] -T(r,cs,r).
1441 [binary,651.1,230.2] -M(r,cs,r).
4016 [binary,1441.1,109.1] cs!=r.
19335 [binary,465.1,470.1] le(r,a,cs,c).
63734 [ur,192,283,271,273,272,275,274,436,278,19335,4016,demod,269] -sameside(cu,r,a).
63735 [binary,63734.1,277.1] $F.