Sindbad~EG File Manager

Length of proof is 50.  Level of proof is 13.
 
---------------- PROOF ----------------
 
24 [] T(xa,xb,xb).
25 [] -T(xa,xb,xc)|T(xc,xb,xa).
29 [] -T(xa,xb,xc)| -T(xa,xc,xd)|T(xb,xc,xd).
30 [] -T(xa,xb,xc)| -T(xb,xc,xd)|xb=xc|T(xa,xc,xd).
31 [] -T(xa,xb,xd)| -T(xb,xc,xd)|T(xa,xc,xd).
32 [] -T(xa,xb,xc)| -T(xa,xc,xd)|T(xa,xb,xd).
48 [] -Col(xa,xb,xc)|Col(xc,xb,xa).
84 [] -sameside(xa,xp,xb)|Col(xa,xp,xb).
85 [] -sameside(xa,xp,xb)| -T(xa,xp,xb).
86 [] sameside(xa,xp,xb)| -Col(xa,xp,xb)|T(xa,xp,xb).
107 [] -M(xa,xm,xb)|M(xb,xm,xa).
109 [] M(xa,xm,xa)|xm!=xa.
110 [] M(xp,xa,s(xa,xp)).
111 [] -M(xp,xa,xr)| -M(xp,xa,xq)|xr=xq.
112 [] -M(xp,xa,xq)|xq=s(xa,xp).
115 [] s(xa,xp)!=s(xa,xq)|xp=xq.
116 [] s(xa,xp)!=xp|xp=xa.
119 [] -T(xp,xq,xr)|T(s(xa,xp),s(xa,xq),s(xa,xr)).
166 [] xa=xb|xc=xd| -Col(xa,xb,xc)| -Col(xa,xb,xd)| -Col(xc,xd,xp)|Col(xa,xb,xp).
187 [] -opposite(xa,xp,xq,xb)|opposite(xb,xp,xq,xa).
188 [] -opposite(xa,xp,xq,xc)| -Col(xp,xq,xm)| -M(xa,xm,xc)| -Col(xp,xq,xr)| -sameside(xa,xr,xb)|opposite(xb,xp,xq,xc)| -T(xr,xb,xa).
208 [] -Col(xa,xb,xc)|T(xa,xb,xc)|T(xb,xc,xa)|T(xc,xa,xb).
210 [] Col(xa,xb,xc)| -T(xb,xc,xa).
211 [] Col(xa,xb,xc)| -T(xc,xa,xb).
220 [] -sameside(xa,xp,xb)|xa!=xp.
221 [] -sameside(xa,xp,xb)|xb!=xp.
222 [] -sameside(xa,xp,xb)|T(xp,xa,xb)|T(xp,xb,xa).
224 [] -T(xp,xb,xa)|xa=xp|xb=xp|sameside(xa,xp,xb).
225 [] -M(xa,xm,xb)|T(xa,xm,xb).
247 [] xp=xq|Col(xp,xq,xa)|Col(xp,xq,xb)| -T(xa,xt,xb)| -Col(xp,xq,xt)|opposite(xa,xp,xq,xb).
248 [] -opposite(xa,xp,xq,xb)| -Col(xp,xq,xa).
249 [] -opposite(xa,xp,xq,xb)| -Col(xp,xq,xb).
265 [] opposite(a,p,q,c).
266 [] Col(p,q,m).
267 [] M(a,m,c).
268 [] Col(p,q,r).
269 [] sameside(a,r,b).
270 [] -opposite(b,p,q,c).
271 [] b1=s(m,b).
272 [] r1=s(m,r).
273 [] s(m,b)=b1.
274 [] s(m,r)=r1.
329 [binary,265.1,249.1] -Col(p,q,c).
330 [binary,265.1,248.1] -Col(p,q,a).
357 [binary,267.1,225.1] T(a,m,c).
360 [binary,267.1,112.1] c=s(m,a).
396 [binary,269.1,221.1] b!=r.
397 [binary,269.1,220.1] a!=r.
403 [binary,269.1,85.1] -T(a,r,b).
404 [binary,269.1,84.1] Col(a,r,b).
417 [binary,270.1,187.2] -opposite(c,p,q,b).
418 [ur,188,265,266,267,268,269,270] -T(r,b,a).
437 [para_from,271.1.2,116.1.1] b1!=b|b=m.
438 [para_from,271.1.2,115.1.1] b1!=s(m,x)|b=x.
441 [para_from,271.1.2,110.1.3] M(b,m,b1).
458 [para_from,272.1.2,115.1.2] s(m,x)!=r1|x=r.
464 [para_from,272.1.2,110.1.3] M(r,m,r1).
484 [binary,330.1,211.1] -T(a,p,q).
696 [binary,404.1,208.1,unit_del,403,418] T(b,a,r).
704 [binary,404.1,48.1] Col(b,r,a).
718 [binary,418.1,222.3,unit_del,269] T(r,a,b).
770 [binary,438.2,396.1,demod,274] b1!=r1.
783 [binary,441.1,225.1] T(b,m,b1).
786 [binary,441.1,107.1] M(b1,m,b).
800 [para_into,458.1.1,360.1.2,unit_del,397] c!=r1.
811 [binary,464.1,225.1] T(r,m,r1).
844 [ur,31,24,484] -T(q,p,q).
930 [binary,718.1,119.1] T(s(x,r),s(x,a),s(x,b)).
1057 [binary,783.1,211.2] Col(m,b1,b).
1075 [binary,783.1,25.1] T(b1,m,b).
1192 [binary,811.1,210.2] Col(r1,r,m).
1209 [binary,811.1,25.1] T(r1,m,r).
1263 [binary,844.1,225.2] -M(q,p,q).
1287 [para_into,930.1.2,360.1.2,demod,274,273] T(r1,c,b1).
1391 [binary,1192.1,48.1] Col(m,r,r1).
1462 [binary,1263.1,109.1] p!=q.
1464 [binary,1287.1,224.1,unit_del,770,800] sameside(b1,r1,c).
1576 [ur,166,1462,396,268,704,330] -Col(p,q,b).
1657 [ur,247,1462,1576,329,268,270] -T(b,r,c).
1670 [para_into,1576.1.3,437.2.1,unit_del,266] b1!=b.
1697 [ur,30,696,397,1657] -T(a,r,c).
1724 [ur,111,786,1670] -M(b1,m,b1).
1801 [ur,32,357,1697] -T(a,r,m).
1816 [binary,1724.1,109.1] m!=b1.
1843 [ur,31,24,1801] -T(m,r,m).
1868 [ur,166,1462,1816,266,1057,1576] -Col(p,q,b1).
1961 [ur,29,1209,1843] -T(r1,r,m).
1985 [ur,247,1462,1868,1576,1075,266] opposite(b1,p,q,b).
2000 [binary,1961.1,86.3,unit_del,1192] sameside(r1,r,m).
2029 [ur,188,1985,266,786,1464,417,1287] -Col(p,q,r1).
2043 [binary,2000.1,221.1] m!=r.
2076 [ur,166,1462,266,268,1391,2029] m=r.
2077 [binary,2076.1,2043.1] $F.