TSTP Solution File: SWC330-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC330-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 22:03:21 EDT 2022

% Result   : Unsatisfiable 69.08s 69.33s
% Output   : Refutation 85.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SWC330-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 11 22:19:47 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 69.08/69.33  
% 69.08/69.33  SPASS V 3.9 
% 69.08/69.33  SPASS beiseite: Proof found.
% 69.08/69.33  % SZS status Theorem
% 69.08/69.33  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 69.08/69.33  SPASS derived 39298 clauses, backtracked 17871 clauses, performed 136 splits and kept 27328 clauses.
% 69.08/69.33  SPASS allocated 119740 KBytes.
% 69.08/69.33  SPASS spent	0:01:08.90 on the problem.
% 69.08/69.33  		0:00:00.04 for the input.
% 69.08/69.33  		0:00:00.00 for the FLOTTER CNF translation.
% 69.08/69.33  		0:00:00.59 for inferences.
% 69.08/69.33  		0:00:03.23 for the backtracking.
% 69.08/69.33  		0:01:04.42 for the reduction.
% 69.08/69.33  
% 69.08/69.33  
% 69.08/69.33  Here is a proof with depth 4, length 189 :
% 69.08/69.33  % SZS output start Refutation
% 69.08/69.33  1[0:Inp] ||  -> ssList(sk1)*.
% 69.08/69.33  2[0:Inp] ||  -> ssList(sk2)*.
% 69.08/69.33  5[0:Inp] ||  -> equal(sk4,sk2)**.
% 69.08/69.33  6[0:Inp] ||  -> equal(sk3,sk1)**.
% 69.08/69.33  8[0:Inp] ||  -> ssItem(sk5)* equal(nil,sk3).
% 69.08/69.33  15[0:Inp] ||  -> ssList(sk6)* equal(nil,sk3).
% 69.08/69.33  16[0:Inp] ||  -> ssList(sk7)* equal(nil,sk3).
% 69.08/69.33  17[0:Inp] ||  -> equal(cons(sk5,nil),sk3)** equal(nil,sk3).
% 69.08/69.33  18[0:Inp] ||  -> equal(app(app(sk6,sk3),sk7),sk4)** equal(nil,sk3).
% 69.08/69.33  21[0:Inp] || equalelemsP(sk1) segmentP(sk2,sk1)* -> .
% 69.08/69.33  22[0:Inp] ||  -> equalelemsP(nil)*.
% 69.08/69.33  23[0:Inp] ||  -> duplicatefreeP(nil)*.
% 69.08/69.33  24[0:Inp] ||  -> strictorderedP(nil)*.
% 69.08/69.33  25[0:Inp] ||  -> totalorderedP(nil)*.
% 69.08/69.33  26[0:Inp] ||  -> strictorderP(nil)*.
% 69.08/69.33  27[0:Inp] ||  -> totalorderP(nil)*.
% 69.08/69.33  28[0:Inp] ||  -> cyclefreeP(nil)*.
% 69.08/69.33  29[0:Inp] ||  -> ssList(nil)*.
% 69.08/69.33  77[0:Inp] ssList(u) ||  -> segmentP(u,nil)*.
% 69.08/69.33  85[0:Inp] ssItem(u) ||  -> equalelemsP(cons(u,nil))*.
% 69.08/69.33  86[0:Inp] ssItem(u) ||  -> duplicatefreeP(cons(u,nil))*.
% 69.08/69.33  87[0:Inp] ssItem(u) ||  -> strictorderedP(cons(u,nil))*.
% 69.08/69.33  88[0:Inp] ssItem(u) ||  -> totalorderedP(cons(u,nil))*.
% 69.08/69.33  89[0:Inp] ssItem(u) ||  -> strictorderP(cons(u,nil))*.
% 69.08/69.33  90[0:Inp] ssItem(u) ||  -> totalorderP(cons(u,nil))*.
% 69.08/69.33  91[0:Inp] ssItem(u) ||  -> cyclefreeP(cons(u,nil))*.
% 69.08/69.33  93[0:Inp] ssList(u) ||  -> ssItem(v)* duplicatefreeP(u)*.
% 69.08/69.33  94[0:Inp] ssList(u) ||  -> equal(app(u,nil),u)**.
% 69.08/69.33  95[0:Inp] ssList(u) ||  -> equal(app(nil,u),u)**.
% 69.08/69.33  106[0:Inp] ssList(u) ssList(v) ||  -> ssList(app(u,v))*.
% 69.08/69.33  108[0:Inp] ssList(u) ||  -> cyclefreeP(u) leq(skaf50(u),skaf49(u))*.
% 69.08/69.33  137[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)* -> singletonP(u)*.
% 69.08/69.33  170[0:Inp] ssList(u) ssList(v) ssList(w) ||  -> equal(app(app(u,v),w),app(u,app(v,w)))**.
% 69.08/69.33  184[0:Inp] ssList(u) ||  -> strictorderedP(u) equal(app(app(skaf71(u),cons(skaf69(u),skaf72(u))),cons(skaf70(u),skaf73(u))),u)**.
% 69.08/69.33  185[0:Inp] ssList(u) ||  -> totalorderedP(u) equal(app(app(skaf66(u),cons(skaf64(u),skaf67(u))),cons(skaf65(u),skaf68(u))),u)**.
% 69.08/69.33  193[0:Inp] ssList(u) ssList(v) ssList(w) ssList(x) || segmentP(x,w) -> segmentP(app(app(v,x),u),w)*.
% 69.08/69.33  194[0:Inp] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(app(v,w),u),x)* -> segmentP(x,w)*.
% 69.08/69.33  198[0:Inp] ssList(u) ssList(v) || equal(hd(v),hd(u))* equal(tl(v),tl(u)) -> equal(v,u) equal(nil,v) equal(nil,u).
% 69.08/69.33  209[0:Rew:6.0,16.1] ||  -> ssList(sk7)* equal(nil,sk1).
% 69.08/69.33  210[0:Rew:6.0,15.1] ||  -> ssList(sk6)* equal(nil,sk1).
% 69.08/69.33  213[0:Rew:6.0,8.1] ||  -> ssItem(sk5)* equal(nil,sk1).
% 69.08/69.33  215[0:Rew:6.0,17.1,6.0,17.0] ||  -> equal(nil,sk1) equal(cons(sk5,nil),sk1)**.
% 69.08/69.33  217[0:Rew:6.0,18.1,6.0,18.0,5.0,18.0] ||  -> equal(nil,sk1) equal(app(app(sk6,sk1),sk7),sk2)**.
% 69.08/69.33  225[0:Rew:170.3,193.5] ssList(u) ssList(v) ssList(w) ssList(x) || segmentP(u,v) -> segmentP(app(w,app(u,x)),v)*.
% 69.08/69.33  226[0:Rew:170.3,194.4] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(w,app(v,x)),u)*+ -> segmentP(u,v)*.
% 69.08/69.33  307[0:Res:2.0,95.0] ||  -> equal(app(nil,sk2),sk2)**.
% 69.08/69.33  308[0:Res:2.0,93.0] ||  -> ssItem(u)* duplicatefreeP(sk2)*.
% 69.08/69.33  309[0:Res:2.0,77.0] ||  -> segmentP(sk2,nil)*.
% 69.08/69.33  416[0:Res:1.0,185.0] ||  -> totalorderedP(sk1) equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1)**.
% 69.08/69.33  417[0:Res:1.0,184.0] ||  -> strictorderedP(sk1) equal(app(app(skaf71(sk1),cons(skaf69(sk1),skaf72(sk1))),cons(skaf70(sk1),skaf73(sk1))),sk1)**.
% 69.08/69.33  472[0:Res:1.0,106.0] ssList(u) ||  -> ssList(app(u,sk1))*.
% 69.08/69.33  473[0:Res:1.0,108.0] ||  -> cyclefreeP(sk1) leq(skaf50(sk1),skaf49(sk1))*.
% 69.08/69.33  477[0:Res:1.0,94.0] ||  -> equal(app(sk1,nil),sk1)**.
% 69.08/69.33  479[0:Res:1.0,93.0] ||  -> ssItem(u)* duplicatefreeP(sk1)*.
% 69.08/69.33  494[0:Res:1.0,198.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 69.08/69.33  528[0:Res:1.0,137.1] ssItem(u) || equal(cons(u,nil),sk1)** -> singletonP(sk1).
% 69.08/69.33  573[1:Spt:93.1] ||  -> ssItem(u)*.
% 69.08/69.33  579[1:MRR:91.0,573.0] ||  -> cyclefreeP(cons(u,nil))*.
% 69.08/69.33  580[1:MRR:90.0,573.0] ||  -> totalorderP(cons(u,nil))*.
% 69.08/69.33  581[1:MRR:89.0,573.0] ||  -> strictorderP(cons(u,nil))*.
% 69.08/69.33  582[1:MRR:88.0,573.0] ||  -> totalorderedP(cons(u,nil))*.
% 69.08/69.33  583[1:MRR:87.0,573.0] ||  -> strictorderedP(cons(u,nil))*.
% 69.08/69.33  584[1:MRR:86.0,573.0] ||  -> duplicatefreeP(cons(u,nil))*.
% 69.08/69.33  585[1:MRR:85.0,573.0] ||  -> equalelemsP(cons(u,nil))*.
% 69.08/69.33  595[1:MRR:528.0,573.0] || equal(cons(u,nil),sk1)** -> singletonP(sk1).
% 69.08/69.33  781[2:Spt:494.5] ||  -> equal(nil,sk1)**.
% 69.08/69.33  846[2:Rew:781.0,22.0] ||  -> equalelemsP(sk1)*.
% 69.08/69.33  852[2:Rew:781.0,309.0] ||  -> segmentP(sk2,sk1)*.
% 69.08/69.33  891[2:MRR:21.0,846.0] || segmentP(sk2,sk1)* -> .
% 69.08/69.33  897[2:MRR:891.0,852.0] ||  -> .
% 69.08/69.33  1197[2:Spt:897.0,494.5,781.0] || equal(nil,sk1)** -> .
% 69.08/69.33  1198[2:Spt:897.0,494.0,494.1,494.2,494.3,494.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 69.08/69.33  1199[2:MRR:209.1,1197.0] ||  -> ssList(sk7)*.
% 69.08/69.33  1200[2:MRR:210.1,1197.0] ||  -> ssList(sk6)*.
% 69.08/69.33  1205[2:MRR:215.0,1197.0] ||  -> equal(cons(sk5,nil),sk1)**.
% 69.08/69.33  1208[2:MRR:217.0,1197.0] ||  -> equal(app(app(sk6,sk1),sk7),sk2)**.
% 69.08/69.33  2019[3:Spt:417.0] ||  -> strictorderedP(sk1)*.
% 69.08/69.33  2022[4:Spt:416.0] ||  -> totalorderedP(sk1)*.
% 69.08/69.33  2033[5:Spt:473.0] ||  -> cyclefreeP(sk1)*.
% 69.08/69.33  2037[6:Spt:21.0] || equalelemsP(sk1)* -> .
% 69.08/69.33  2044[2:SpR:1205.0,579.0] ||  -> cyclefreeP(sk1)*.
% 69.08/69.33  2045[2:SpR:1205.0,580.0] ||  -> totalorderP(sk1)*.
% 69.08/69.33  2046[2:SpR:1205.0,581.0] ||  -> strictorderP(sk1)*.
% 69.08/69.33  2047[2:SpR:1205.0,582.0] ||  -> totalorderedP(sk1)*.
% 69.08/69.33  2048[2:SpR:1205.0,583.0] ||  -> strictorderedP(sk1)*.
% 69.08/69.33  2049[2:SpR:1205.0,584.0] ||  -> duplicatefreeP(sk1)*.
% 69.08/69.33  2050[2:SpR:1205.0,585.0] ||  -> equalelemsP(sk1)*.
% 69.08/69.33  2053[6:MRR:2050.0,2037.0] ||  -> .
% 69.08/69.33  2054[6:Spt:2053.0,21.0,2037.0] ||  -> equalelemsP(sk1)*.
% 69.08/69.33  2055[6:Spt:2053.0,21.1] || segmentP(sk2,sk1)* -> .
% 69.08/69.33  2100[2:SpL:1205.0,595.0] || equal(sk1,sk1) -> singletonP(sk1)*.
% 69.08/69.33  2101[2:Obv:2100.0] ||  -> singletonP(sk1)*.
% 69.08/69.33  8068[0:EqR:226.4] ssList(app(u,app(v,w))) ssList(v) ssList(u) ssList(w) ||  -> segmentP(app(u,app(v,w)),v)*.
% 69.08/69.33  8111[0:SSi:8068.0,106.2,106.2] ssList(u) ssList(v) ssList(w) ||  -> segmentP(app(v,app(u,w)),u)*.
% 69.08/69.33  17793[2:SpR:1208.0,225.5] ssList(app(sk6,sk1)) ssList(u) ssList(v) ssList(sk7) || segmentP(app(sk6,sk1),u)* -> segmentP(app(v,sk2),u)*.
% 69.08/69.33  17821[2:SSi:17793.3,17793.0,1199.0,472.1,1200.0] ssList(u) ssList(v) || segmentP(app(sk6,sk1),u)*+ -> segmentP(app(v,sk2),u)*.
% 69.08/69.33  36034[0:SpR:477.0,8111.3] ssList(sk1) ssList(u) ssList(nil) ||  -> segmentP(app(u,sk1),sk1)*.
% 69.08/69.33  36057[5:SSi:36034.2,36034.0,29.0,28.0,27.0,26.0,25.0,24.0,23.0,22.0,1.0,2019.0,2022.0,2033.0,2049.0,2045.0,2046.0,2050.0,2101.0] ssList(u) ||  -> segmentP(app(u,sk1),sk1)*.
% 69.08/69.33  41656[5:Res:36057.1,17821.2] ssList(sk6) ssList(sk1) ssList(u) ||  -> segmentP(app(u,sk2),sk1)*.
% 69.08/69.33  44961[5:SSi:41656.1,41656.0,1.0,2019.0,2022.0,2033.0,2049.0,2045.0,2046.0,2050.0,2101.0,1200.0] ssList(u) ||  -> segmentP(app(u,sk2),sk1)*.
% 69.08/69.33  48863[5:SpR:307.0,44961.1] ssList(nil) ||  -> segmentP(sk2,sk1)*.
% 69.08/69.33  48870[5:SSi:48863.0,22.0,23.0,24.0,25.0,26.0,27.0,28.0,29.0] ||  -> segmentP(sk2,sk1)*.
% 69.08/69.33  48871[6:MRR:48870.0,2055.0] ||  -> .
% 69.08/69.33  48886[5:Spt:48871.0,473.0,2033.0] || cyclefreeP(sk1)* -> .
% 69.08/69.33  48887[5:Spt:48871.0,473.1] ||  -> leq(skaf50(sk1),skaf49(sk1))*.
% 69.08/69.33  48888[5:MRR:48886.0,2044.0] ||  -> .
% 69.08/69.33  49972[4:Spt:48888.0,416.0,2022.0] || totalorderedP(sk1)* -> .
% 69.08/69.33  49973[4:Spt:48888.0,416.1] ||  -> equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1)**.
% 69.08/69.33  49974[4:MRR:49972.0,2047.0] ||  -> .
% 69.08/69.33  50785[3:Spt:49974.0,417.0,2019.0] || strictorderedP(sk1)* -> .
% 69.08/69.33  50786[3:Spt:49974.0,417.1] ||  -> equal(app(app(skaf71(sk1),cons(skaf69(sk1),skaf72(sk1))),cons(skaf70(sk1),skaf73(sk1))),sk1)**.
% 69.08/69.33  50787[3:MRR:50785.0,2048.0] ||  -> .
% 69.08/69.33  51050[1:Spt:50787.0,93.0,93.2] ssList(u) ||  -> duplicatefreeP(u)*.
% 69.08/69.33  51458[2:Spt:479.0] ||  -> ssItem(u)*.
% 69.08/69.33  51462[2:MRR:85.0,51458.0] ||  -> equalelemsP(cons(u,nil))*.
% 69.08/69.33  51463[2:MRR:86.0,51458.0] ||  -> duplicatefreeP(cons(u,nil))*.
% 69.08/69.33  51466[2:MRR:89.0,51458.0] ||  -> strictorderP(cons(u,nil))*.
% 85.74/85.94  51467[2:MRR:90.0,51458.0] ||  -> totalorderP(cons(u,nil))*.
% 85.74/85.94  51468[2:MRR:91.0,51458.0] ||  -> cyclefreeP(cons(u,nil))*.
% 85.74/85.94  51660[3:Spt:494.5] ||  -> equal(nil,sk1)**.
% 85.74/85.94  51662[3:Rew:51660.0,22.0] ||  -> equalelemsP(sk1)*.
% 85.74/85.94  51672[3:Rew:51660.0,309.0] ||  -> segmentP(sk2,sk1)*.
% 85.74/85.94  51942[3:MRR:21.0,51662.0] || segmentP(sk2,sk1)* -> .
% 85.74/85.94  51956[3:MRR:51942.0,51672.0] ||  -> .
% 85.74/85.94  53104[3:Spt:51956.0,494.5,51660.0] || equal(nil,sk1)** -> .
% 85.74/85.94  53105[3:Spt:51956.0,494.0,494.1,494.2,494.3,494.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 85.74/85.94  53106[3:MRR:209.1,53104.0] ||  -> ssList(sk7)*.
% 85.74/85.94  53107[3:MRR:210.1,53104.0] ||  -> ssList(sk6)*.
% 85.74/85.94  53113[3:MRR:215.0,53104.0] ||  -> equal(cons(sk5,nil),sk1)**.
% 85.74/85.94  53118[3:MRR:217.0,53104.0] ||  -> equal(app(app(sk6,sk1),sk7),sk2)**.
% 85.74/85.94  54237[3:SpR:53118.0,170.3] ssList(sk6) ssList(sk1) ssList(sk7) ||  -> equal(app(sk6,app(sk1,sk7)),sk2)**.
% 85.74/85.94  54519[3:SSi:54237.2,54237.1,54237.0,53106.0,1.0,53107.0] ||  -> equal(app(sk6,app(sk1,sk7)),sk2)**.
% 85.74/85.94  54697[3:SpR:53113.0,51462.0] ||  -> equalelemsP(sk1)*.
% 85.74/85.94  54698[3:SpR:53113.0,51463.0] ||  -> duplicatefreeP(sk1)*.
% 85.74/85.94  54701[3:SpR:53113.0,51466.0] ||  -> strictorderP(sk1)*.
% 85.74/85.94  54702[3:SpR:53113.0,51467.0] ||  -> totalorderP(sk1)*.
% 85.74/85.94  54703[3:SpR:53113.0,51468.0] ||  -> cyclefreeP(sk1)*.
% 85.74/85.94  54931[3:SpR:54519.0,8111.3] ssList(sk1) ssList(sk6) ssList(sk7) ||  -> segmentP(sk2,sk1)*.
% 85.74/85.94  54964[3:MRR:21.0,54697.0] || segmentP(sk2,sk1)* -> .
% 85.74/85.94  54999[3:SSi:54931.2,54931.1,54931.0,53106.0,53107.0,1.0,54698.0,54701.0,54702.0,54703.0,54697.0] ||  -> segmentP(sk2,sk1)*.
% 85.74/85.94  55000[3:MRR:54999.0,54964.0] ||  -> .
% 85.74/85.94  55026[2:Spt:55000.0,479.1] ||  -> duplicatefreeP(sk1)*.
% 85.74/85.94  55029[3:Spt:308.0] ||  -> ssItem(u)*.
% 85.74/85.94  55035[3:MRR:91.0,55029.0] ||  -> cyclefreeP(cons(u,nil))*.
% 85.74/85.94  55036[3:MRR:90.0,55029.0] ||  -> totalorderP(cons(u,nil))*.
% 85.74/85.94  55037[3:MRR:89.0,55029.0] ||  -> strictorderP(cons(u,nil))*.
% 85.74/85.94  55041[3:MRR:85.0,55029.0] ||  -> equalelemsP(cons(u,nil))*.
% 85.74/85.94  55229[4:Spt:494.5] ||  -> equal(nil,sk1)**.
% 85.74/85.94  55230[4:Rew:55229.0,22.0] ||  -> equalelemsP(sk1)*.
% 85.74/85.94  55241[4:Rew:55229.0,309.0] ||  -> segmentP(sk2,sk1)*.
% 85.74/85.94  55511[4:MRR:21.0,55230.0] || segmentP(sk2,sk1)* -> .
% 85.74/85.94  55525[4:MRR:55511.0,55241.0] ||  -> .
% 85.74/85.94  56664[4:Spt:55525.0,494.5,55229.0] || equal(nil,sk1)** -> .
% 85.74/85.94  56665[4:Spt:55525.0,494.0,494.1,494.2,494.3,494.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 85.74/85.94  56666[4:MRR:209.1,56664.0] ||  -> ssList(sk7)*.
% 85.74/85.94  56667[4:MRR:210.1,56664.0] ||  -> ssList(sk6)*.
% 85.74/85.94  56673[4:MRR:215.0,56664.0] ||  -> equal(cons(sk5,nil),sk1)**.
% 85.74/85.94  56678[4:MRR:217.0,56664.0] ||  -> equal(app(app(sk6,sk1),sk7),sk2)**.
% 85.74/85.94  57797[4:SpR:56678.0,170.3] ssList(sk6) ssList(sk1) ssList(sk7) ||  -> equal(app(sk6,app(sk1,sk7)),sk2)**.
% 85.74/85.94  58038[4:SSi:57797.2,57797.1,57797.0,56666.0,1.0,55026.0,56667.0] ||  -> equal(app(sk6,app(sk1,sk7)),sk2)**.
% 85.74/85.94  58251[4:SpR:56673.0,55035.0] ||  -> cyclefreeP(sk1)*.
% 85.74/85.94  58252[4:SpR:56673.0,55036.0] ||  -> totalorderP(sk1)*.
% 85.74/85.94  58253[4:SpR:56673.0,55037.0] ||  -> strictorderP(sk1)*.
% 85.74/85.94  58257[4:SpR:56673.0,55041.0] ||  -> equalelemsP(sk1)*.
% 85.74/85.94  58459[4:SpR:58038.0,8111.3] ssList(sk1) ssList(sk6) ssList(sk7) ||  -> segmentP(sk2,sk1)*.
% 85.74/85.94  58492[4:MRR:21.0,58257.0] || segmentP(sk2,sk1)* -> .
% 85.74/85.94  58525[4:SSi:58459.2,58459.1,58459.0,56666.0,56667.0,1.0,55026.0,58253.0,58252.0,58251.0,58257.0] ||  -> segmentP(sk2,sk1)*.
% 85.74/85.94  58526[4:MRR:58525.0,58492.0] ||  -> .
% 85.74/85.94  58550[3:Spt:58526.0,308.1] ||  -> duplicatefreeP(sk2)*.
% 85.74/85.94  58551[4:Spt:494.5] ||  -> equal(nil,sk1)**.
% 85.74/85.94  58552[4:Rew:58551.0,22.0] ||  -> equalelemsP(sk1)*.
% 85.74/85.94  58563[4:Rew:58551.0,309.0] ||  -> segmentP(sk2,sk1)*.
% 85.74/85.94  58835[4:MRR:21.0,58552.0] || segmentP(sk2,sk1)* -> .
% 85.74/85.94  58845[4:MRR:58835.0,58563.0] ||  -> .
% 85.74/85.94  59255[4:Spt:58845.0,494.5,58551.0] || equal(nil,sk1)** -> .
% 85.74/85.94  59256[4:Spt:58845.0,494.0,494.1,494.2,494.3,494.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 85.74/85.94  59257[4:MRR:209.1,59255.0] ||  -> ssList(sk7)*.
% 85.74/85.94  59258[4:MRR:210.1,59255.0] ||  -> ssList(sk6)*.
% 85.74/85.94  59259[4:MRR:213.1,59255.0] ||  -> ssItem(sk5)*.
% 85.74/85.94  59267[4:MRR:215.0,59255.0] ||  -> equal(cons(sk5,nil),sk1)**.
% 85.74/85.94  59272[4:MRR:217.0,59255.0] ||  -> equal(app(app(sk6,sk1),sk7),sk2)**.
% 85.74/85.94  60276[4:SpR:59272.0,170.3] ssList(sk6) ssList(sk1) ssList(sk7) ||  -> equal(app(sk6,app(sk1,sk7)),sk2)**.
% 85.74/85.94  60751[4:SSi:60276.2,60276.1,60276.0,59257.0,1.0,55026.0,59258.0] ||  -> equal(app(sk6,app(sk1,sk7)),sk2)**.
% 85.74/85.94  60989[4:SpR:59267.0,85.1] ssItem(sk5) ||  -> equalelemsP(sk1)*.
% 85.74/85.94  60990[4:SSi:60989.0,59259.0] ||  -> equalelemsP(sk1)*.
% 85.74/85.94  61078[4:SpR:60751.0,8111.3] ssList(sk1) ssList(sk6) ssList(sk7) ||  -> segmentP(sk2,sk1)*.
% 85.74/85.94  61193[4:MRR:21.0,60990.0] || segmentP(sk2,sk1)* -> .
% 85.74/85.94  61230[4:SSi:61078.2,61078.1,61078.0,59257.0,59258.0,1.0,55026.0,60990.0] ||  -> segmentP(sk2,sk1)*.
% 85.74/85.94  61231[4:MRR:61230.0,61193.0] ||  -> .
% 85.74/85.94  % SZS output end Refutation
% 85.74/85.94  Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_8 co1_15 co1_16 co1_17 co1_18 co1_21 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause56 clause64 clause65 clause66 clause67 clause68 clause69 clause70 clause72 clause73 clause74 clause85 clause87 clause116 clause149 clause163 clause164 clause172 clause173 clause177
% 85.74/85.94  
%------------------------------------------------------------------------------