%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC382+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 08:00:17 EST 2010
% Result : Theorem 20.08s
% Output : Solution 20.08s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP30322/SWC382+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30322/SWC382+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30322/SWC382+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 30418
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.92 CPU 2.02 WC
% PrfWatch: 3.91 CPU 4.03 WC
% PrfWatch: 5.52 CPU 6.03 WC
% PrfWatch: 7.17 CPU 8.04 WC
% PrfWatch: 9.17 CPU 10.04 WC
% PrfWatch: 11.15 CPU 12.05 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 13.14 CPU 14.05 WC
% PrfWatch: 15.14 CPU 16.05 WC
% PrfWatch: 17.13 CPU 18.06 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(11, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(12, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>hd(cons(X2,X1))=X2)),file('/tmp/SRASS.s.p', ax23)).
% fof(20, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(21, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% fof(24, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(segmentP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1))))),file('/tmp/SRASS.s.p', ax7)).
% fof(29, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(42, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(55, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X3=X5))&?[X6]:(((ssItem(X6)&cons(X6,nil)=X5)&hd(X4)=X6)&neq(nil,X4))))|(singletonP(X1)&segmentP(X2,X1)))&(~(neq(X2,nil))|neq(X4,nil)))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X3=X5))&?[X6]:(((ssItem(X6)&cons(X6,nil)=X5)&hd(X4)=X6)&neq(nil,X4))))|(singletonP(X1)&segmentP(X2,X1)))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X3=X5))&?[X6]:(((ssItem(X6)&cons(X6,nil)=X5)&hd(X4)=X6)&neq(nil,X4))))|(singletonP(X1)&segmentP(X2,X1)))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|((~(singletonP(X1))|?[X2]:(ssItem(X2)&cons(X2,nil)=X1))&(![X2]:(~(ssItem(X2))|~(cons(X2,nil)=X1))|singletonP(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|?[X4]:(ssItem(X4)&cons(X4,nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk3_1(X3))&cons(esk3_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk3_1(X3))&cons(esk3_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk3_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk3_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[118])).
% cnf(120,plain,(cons(esk3_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[119])).
% cnf(121,plain,(ssItem(esk3_1(X1))|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[119])).
% cnf(122,plain,(singletonP(X1)|~ssList(X1)|cons(X2,nil)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[119])).
% fof(123, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[4])).
% fof(124, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[124])).
% fof(126, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[125])).
% cnf(127,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[126])).
% cnf(128,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[126])).
% fof(129, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(130, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[129])).
% fof(131, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[130])).
% cnf(132,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[131])).
% cnf(133,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% fof(155, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[11])).
% fof(156, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[155])).
% cnf(157,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[156])).
% fof(158, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|hd(cons(X2,X1))=X2)),inference(fof_nnf,[status(thm)],[12])).
% fof(159, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|hd(cons(X4,X3))=X4)),inference(variable_rename,[status(thm)],[158])).
% fof(160, plain,![X3]:![X4]:((~(ssItem(X4))|hd(cons(X4,X3))=X4)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[159])).
% cnf(161,plain,(hd(cons(X2,X1))=X2|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[160])).
% fof(188, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[20])).
% fof(189, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[188])).
% fof(190, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[189])).
% cnf(191,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[190])).
% fof(192, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[21])).
% fof(193, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[192])).
% cnf(194,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[193])).
% fof(203, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1)))&(![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|~(app(app(X3,X2),X4)=X1)))|segmentP(X1,X2))))),inference(fof_nnf,[status(thm)],[24])).
% fof(204, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&app(app(X7,X6),X8)=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(variable_rename,[status(thm)],[203])).
% fof(205, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk7_2(X5,X6))&(ssList(esk8_2(X5,X6))&app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[204])).
% fof(206, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk7_2(X5,X6))&(ssList(esk8_2(X5,X6))&app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[205])).
% fof(207, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk7_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk8_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[206])).
% cnf(211,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[207])).
% fof(234, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[29])).
% fof(235, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[234])).
% cnf(236,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[235])).
% fof(290, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[42])).
% fof(291, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[290])).
% cnf(292,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[291])).
% fof(365, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[55])).
% fof(366, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[365])).
% fof(367, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[366])).
% cnf(368,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[367])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&![X5]:((~(ssList(X5))|X3=X5)|![X6]:(((~(ssItem(X6))|~(cons(X6,nil)=X5))|~(hd(X4)=X6))|~(neq(nil,X4)))))&(~(singletonP(X1))|~(segmentP(X2,X1))))|(neq(X2,nil)&~(neq(X4,nil))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&((X8=X10&X7=X9)&(((neq(X8,nil)&![X11]:((~(ssList(X11))|X9=X11)|![X12]:(((~(ssItem(X12))|~(cons(X12,nil)=X11))|~(hd(X10)=X12))|~(neq(nil,X10)))))&(~(singletonP(X7))|~(segmentP(X8,X7))))|(neq(X8,nil)&~(neq(X10,nil))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((esk49_0=esk51_0&esk48_0=esk50_0)&(((neq(esk49_0,nil)&![X11]:((~(ssList(X11))|esk50_0=X11)|![X12]:(((~(ssItem(X12))|~(cons(X12,nil)=X11))|~(hd(esk51_0)=X12))|~(neq(nil,esk51_0)))))&(~(singletonP(esk48_0))|~(segmentP(esk49_0,esk48_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:![X12]:((((((((((((~(ssItem(X12))|~(cons(X12,nil)=X11))|~(hd(esk51_0)=X12))|~(neq(nil,esk51_0)))|(~(ssList(X11))|esk50_0=X11))&neq(esk49_0,nil))&(~(singletonP(esk48_0))|~(segmentP(esk49_0,esk48_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X11]:![X12]:(((((((((neq(esk49_0,nil)|((((~(ssItem(X12))|~(cons(X12,nil)=X11))|~(hd(esk51_0)=X12))|~(neq(nil,esk51_0)))|(~(ssList(X11))|esk50_0=X11)))&(~(neq(esk51_0,nil))|((((~(ssItem(X12))|~(cons(X12,nil)=X11))|~(hd(esk51_0)=X12))|~(neq(nil,esk51_0)))|(~(ssList(X11))|esk50_0=X11))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil))))&((neq(esk49_0,nil)|(~(singletonP(esk48_0))|~(segmentP(esk49_0,esk48_0))))&(~(neq(esk51_0,nil))|(~(singletonP(esk48_0))|~(segmentP(esk49_0,esk48_0))))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(~segmentP(esk49_0,esk48_0)|~singletonP(esk48_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk50_0=X1|~ssList(X1)|~neq(nil,esk51_0)|hd(esk51_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,578,theory(equality)])).
% cnf(588,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[582,578,theory(equality)])).
% cnf(592,negated_conjecture,(~singletonP(esk48_0)|$false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[579,588,theory(equality)])).
% cnf(593,negated_conjecture,(~singletonP(esk48_0)|$false|~segmentP(esk51_0,esk48_0)),inference(rw,[status(thm)],[592,578,theory(equality)])).
% cnf(594,negated_conjecture,(~singletonP(esk48_0)|~segmentP(esk51_0,esk48_0)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(608,plain,(singletonP(cons(X1,nil))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(er,[status(thm)],[122,theory(equality)])).
% cnf(610,plain,(~ssList(X1)|~neq(X1,X1)),inference(er,[status(thm)],[128,theory(equality)])).
% cnf(642,plain,(hd(X1)=esk3_1(X1)|~ssList(nil)|~ssItem(esk3_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[161,120,theory(equality)])).
% cnf(643,plain,(hd(X1)=esk3_1(X1)|$false|~ssItem(esk3_1(X1))|~singletonP(X1)|~ssList(X1)),inference(rw,[status(thm)],[642,133,theory(equality)])).
% cnf(644,plain,(hd(X1)=esk3_1(X1)|~ssItem(esk3_1(X1))|~singletonP(X1)|~ssList(X1)),inference(cn,[status(thm)],[643,theory(equality)])).
% cnf(647,negated_conjecture,(esk48_0=X1|hd(esk51_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk51_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[583,577,theory(equality)])).
% cnf(648,negated_conjecture,(esk48_0=X1|hd(esk51_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk51_0)|$false),inference(rw,[status(thm)],[647,588,theory(equality)])).
% cnf(649,negated_conjecture,(esk48_0=X1|hd(esk51_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk51_0)),inference(cn,[status(thm)],[648,theory(equality)])).
% cnf(663,negated_conjecture,(esk48_0=X1|nil=esk51_0|cons(X2,nil)!=X1|hd(esk51_0)!=X2|~ssList(X1)|~ssItem(X2)|~ssList(esk51_0)|~ssList(nil)),inference(spm,[status(thm)],[649,127,theory(equality)])).
% cnf(664,negated_conjecture,(esk48_0=X1|nil=esk51_0|cons(X2,nil)!=X1|hd(esk51_0)!=X2|~ssList(X1)|~ssItem(X2)|$false|~ssList(nil)),inference(rw,[status(thm)],[663,585,theory(equality)])).
% cnf(665,negated_conjecture,(esk48_0=X1|nil=esk51_0|cons(X2,nil)!=X1|hd(esk51_0)!=X2|~ssList(X1)|~ssItem(X2)|$false|$false),inference(rw,[status(thm)],[664,133,theory(equality)])).
% cnf(666,negated_conjecture,(esk48_0=X1|nil=esk51_0|cons(X2,nil)!=X1|hd(esk51_0)!=X2|~ssList(X1)|~ssItem(X2)),inference(cn,[status(thm)],[665,theory(equality)])).
% cnf(822,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[211,236,theory(equality)])).
% cnf(825,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[822,133,theory(equality)])).
% cnf(826,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[825,theory(equality)])).
% cnf(1493,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[608,132,theory(equality)])).
% cnf(1494,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|$false),inference(rw,[status(thm)],[1493,133,theory(equality)])).
% cnf(1495,plain,(singletonP(cons(X1,nil))|~ssItem(X1)),inference(cn,[status(thm)],[1494,theory(equality)])).
% cnf(1843,plain,(esk3_1(X1)=hd(X1)|~singletonP(X1)|~ssList(X1)),inference(csr,[status(thm)],[644,121])).
% cnf(1844,plain,(ssItem(hd(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[121,1843,theory(equality)])).
% cnf(1970,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)|~ssItem(hd(esk51_0))),inference(er,[status(thm)],[666,theory(equality)])).
% cnf(1971,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[1970,157,theory(equality)])).
% cnf(1972,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)|$false),inference(rw,[status(thm)],[1971,585,theory(equality)])).
% cnf(1973,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)),inference(cn,[status(thm)],[1972,theory(equality)])).
% cnf(1974,negated_conjecture,(esk51_0=nil|esk48_0=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))),inference(er,[status(thm)],[1973,theory(equality)])).
% cnf(1975,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|~ssList(nil)|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[1974,132,theory(equality)])).
% cnf(1977,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|$false|~ssItem(hd(esk51_0))),inference(rw,[status(thm)],[1975,133,theory(equality)])).
% cnf(1978,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|~ssItem(hd(esk51_0))),inference(cn,[status(thm)],[1977,theory(equality)])).
% cnf(1979,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[1978,157,theory(equality)])).
% cnf(1980,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|$false),inference(rw,[status(thm)],[1979,585,theory(equality)])).
% cnf(1981,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil),inference(cn,[status(thm)],[1980,theory(equality)])).
% cnf(1985,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|~ssList(nil)|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[161,1981,theory(equality)])).
% cnf(2016,negated_conjecture,(app(esk48_0,X1)=cons(hd(esk51_0),X1)|esk51_0=nil|~ssList(X1)|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[191,1981,theory(equality)])).
% cnf(2019,negated_conjecture,(singletonP(esk48_0)|esk51_0=nil|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[1495,1981,theory(equality)])).
% cnf(2032,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|$false|~ssItem(hd(esk51_0))),inference(rw,[status(thm)],[1985,133,theory(equality)])).
% cnf(2033,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|~ssItem(hd(esk51_0))),inference(cn,[status(thm)],[2032,theory(equality)])).
% cnf(2081,negated_conjecture,(esk51_0=nil|singletonP(esk48_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[2019,157,theory(equality)])).
% cnf(2082,negated_conjecture,(esk51_0=nil|singletonP(esk48_0)|$false),inference(rw,[status(thm)],[2081,585,theory(equality)])).
% cnf(2083,negated_conjecture,(esk51_0=nil|singletonP(esk48_0)),inference(cn,[status(thm)],[2082,theory(equality)])).
% cnf(2093,negated_conjecture,(ssItem(hd(esk48_0))|esk51_0=nil|~ssList(esk48_0)),inference(spm,[status(thm)],[1844,2083,theory(equality)])).
% cnf(2094,negated_conjecture,(esk51_0=nil|~segmentP(esk51_0,esk48_0)),inference(spm,[status(thm)],[594,2083,theory(equality)])).
% cnf(2113,negated_conjecture,(ssItem(hd(esk48_0))|esk51_0=nil|$false),inference(rw,[status(thm)],[2093,573,theory(equality)])).
% cnf(2114,negated_conjecture,(ssItem(hd(esk48_0))|esk51_0=nil),inference(cn,[status(thm)],[2113,theory(equality)])).
% cnf(2219,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2033,157,theory(equality)])).
% cnf(2220,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|$false),inference(rw,[status(thm)],[2219,585,theory(equality)])).
% cnf(2221,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil),inference(cn,[status(thm)],[2220,theory(equality)])).
% cnf(2229,negated_conjecture,(esk51_0=nil|ssItem(hd(esk51_0))),inference(spm,[status(thm)],[2114,2221,theory(equality)])).
% cnf(2603,negated_conjecture,(cons(hd(esk51_0),X1)=app(esk48_0,X1)|esk51_0=nil|~ssList(X1)),inference(csr,[status(thm)],[2016,2229])).
% cnf(2655,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|nil=esk51_0|~ssList(esk51_0)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[194,2603,theory(equality)])).
% cnf(2691,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|nil=esk51_0|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[2655,585,theory(equality)])).
% cnf(2692,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|nil=esk51_0|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[2691,theory(equality)])).
% cnf(6609,plain,(segmentP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[826,theory(equality)])).
% cnf(109373,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2692,292,theory(equality)])).
% cnf(109374,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|$false),inference(rw,[status(thm)],[109373,585,theory(equality)])).
% cnf(109375,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[109374,theory(equality)])).
% cnf(392207,plain,(segmentP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[6609,368])).
% cnf(392218,negated_conjecture,(segmentP(esk51_0,esk48_0)|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[392207,109375,theory(equality)])).
% cnf(392297,negated_conjecture,(segmentP(esk51_0,esk48_0)|esk51_0=nil|~ssList(tl(esk51_0))|$false),inference(rw,[status(thm)],[392218,573,theory(equality)])).
% cnf(392298,negated_conjecture,(segmentP(esk51_0,esk48_0)|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[392297,theory(equality)])).
% cnf(392496,negated_conjecture,(esk51_0=nil|~ssList(tl(esk51_0))),inference(csr,[status(thm)],[392298,2094])).
% cnf(392497,negated_conjecture,(esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[392496,292,theory(equality)])).
% cnf(392498,negated_conjecture,(esk51_0=nil|$false),inference(rw,[status(thm)],[392497,585,theory(equality)])).
% cnf(392499,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[392498,theory(equality)])).
% cnf(395848,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[588,392499,theory(equality)])).
% cnf(395852,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[610,395848,theory(equality)])).
% cnf(395853,negated_conjecture,($false),inference(rw,[status(thm)],[395852,133,theory(equality)])).
% cnf(395854,negated_conjecture,($false),inference(cn,[status(thm)],[395853,theory(equality)])).
% cnf(395855,negated_conjecture,($false),395854,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 20024
% # ...of these trivial : 18
% # ...subsumed : 17297
% # ...remaining for further processing: 2709
% # Other redundant clauses eliminated : 1209
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 37
% # Backward-rewritten : 1701
% # Generated clauses : 194332
% # ...of the previous two non-trivial : 191162
% # Contextual simplify-reflections : 11717
% # Paramodulations : 192628
% # Factorizations : 0
% # Equation resolutions : 1701
% # Current number of processed clauses: 964
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 937
% # Current number of unprocessed clauses: 24853
% # ...number of literals in the above : 216954
% # Clause-clause subsumption calls (NU) : 1253018
% # Rec. Clause-clause subsumption calls : 680261
% # Unit Clause-clause subsumption calls : 889
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 705 leaves, 1.66+/-1.559 terms/leaf
% # Paramod-from index: 261 leaves, 1.05+/-0.279 terms/leaf
% # Paramod-into index: 466 leaves, 1.53+/-1.374 terms/leaf
% # -------------------------------------------------
% # User time : 11.454 s
% # System time : 0.372 s
% # Total time : 11.826 s
% # Maximum resident set size: 0 pages
% PrfWatch: 18.92 CPU 19.86 WC
% FINAL PrfWatch: 18.92 CPU 19.86 WC
% SZS output end Solution for /tmp/SystemOnTPTP30322/SWC382+1.tptp
%
%------------------------------------------------------------------------------