TSTP Solution File: SWC354+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC354+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 : art01.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 07:56:23 EST 2010
% Result : Theorem 20.66s
% Output : Solution 20.66s
% 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/SystemOnTPTP6451/SWC354+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6451/SWC354+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6451/SWC354+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 6547
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% PrfWatch: 3.94 CPU 4.03 WC
% PrfWatch: 5.53 CPU 6.04 WC
% PrfWatch: 7.15 CPU 8.04 WC
% PrfWatch: 9.14 CPU 10.05 WC
% PrfWatch: 11.13 CPU 12.06 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 13.09 CPU 14.06 WC
% PrfWatch: 15.09 CPU 16.07 WC
% PrfWatch: 17.08 CPU 18.08 WC
% PrfWatch: 19.07 CPU 20.08 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(10, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(11, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>hd(cons(X2,X1))=X2)),file('/tmp/SRASS.s.p', ax23)).
% fof(18, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(19, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% fof(22, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(23, 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(28, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(41, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(54, 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))))|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))))|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))))|segmentP(X2,X1))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[116])).
% fof(118, 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)],[117])).
% cnf(119,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[118])).
% cnf(120,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[118])).
% fof(121, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(122, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[121])).
% fof(123, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[122])).
% cnf(124,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[123])).
% cnf(125,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(147, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(148, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[147])).
% cnf(149,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[148])).
% fof(150, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|hd(cons(X2,X1))=X2)),inference(fof_nnf,[status(thm)],[11])).
% fof(151, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|hd(cons(X4,X3))=X4)),inference(variable_rename,[status(thm)],[150])).
% fof(152, plain,![X3]:![X4]:((~(ssItem(X4))|hd(cons(X4,X3))=X4)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[151])).
% cnf(153,plain,(hd(cons(X2,X1))=X2|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[152])).
% fof(179, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(180, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[179])).
% fof(181, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[180])).
% cnf(182,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[181])).
% fof(183, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[19])).
% fof(184, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[183])).
% cnf(185,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[184])).
% fof(194, 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)],[22])).
% fof(195, 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)],[194])).
% fof(196, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk6_1(X3))&cons(esk6_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[195])).
% fof(197, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk6_1(X3))&cons(esk6_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[196])).
% fof(198, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk6_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk6_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[197])).
% cnf(199,plain,(cons(esk6_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[198])).
% cnf(200,plain,(ssItem(esk6_1(X1))|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[198])).
% cnf(201,plain,(singletonP(X1)|~ssList(X1)|cons(X2,nil)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[198])).
% fof(202, 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)],[23])).
% fof(203, 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)],[202])).
% fof(204, 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)],[203])).
% fof(205, 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)],[204])).
% fof(206, 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)],[205])).
% cnf(210,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[206])).
% fof(233, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[28])).
% fof(234, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[233])).
% cnf(235,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[234])).
% fof(289, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[41])).
% fof(290, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[289])).
% cnf(291,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[290])).
% fof(364, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[54])).
% fof(365, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[364])).
% fof(366, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[365])).
% cnf(367,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[366])).
% 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)))))&~(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)))))&~(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)))))&~(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))&~(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)|~(segmentP(esk49_0,esk48_0)))&(~(neq(esk51_0,nil))|~(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)|~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(589,negated_conjecture,($false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[579,588,theory(equality)])).
% cnf(590,negated_conjecture,($false|~segmentP(esk51_0,esk48_0)),inference(rw,[status(thm)],[589,578,theory(equality)])).
% cnf(591,negated_conjecture,(~segmentP(esk51_0,esk48_0)),inference(cn,[status(thm)],[590,theory(equality)])).
% cnf(609,plain,(~ssList(X1)|~neq(X1,X1)),inference(er,[status(thm)],[120,theory(equality)])).
% cnf(625,plain,(singletonP(cons(X1,nil))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(er,[status(thm)],[201,theory(equality)])).
% cnf(629,plain,(hd(X1)=esk6_1(X1)|~ssList(nil)|~ssItem(esk6_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[153,199,theory(equality)])).
% cnf(644,plain,(hd(X1)=esk6_1(X1)|$false|~ssItem(esk6_1(X1))|~singletonP(X1)|~ssList(X1)),inference(rw,[status(thm)],[629,125,theory(equality)])).
% cnf(645,plain,(hd(X1)=esk6_1(X1)|~ssItem(esk6_1(X1))|~singletonP(X1)|~ssList(X1)),inference(cn,[status(thm)],[644,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,119,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,125,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(821,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[210,235,theory(equality)])).
% cnf(825,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[821,125,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(1593,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[625,124,theory(equality)])).
% cnf(1594,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|$false),inference(rw,[status(thm)],[1593,125,theory(equality)])).
% cnf(1595,plain,(singletonP(cons(X1,nil))|~ssItem(X1)),inference(cn,[status(thm)],[1594,theory(equality)])).
% cnf(1719,plain,(esk6_1(X1)=hd(X1)|~singletonP(X1)|~ssList(X1)),inference(csr,[status(thm)],[645,200])).
% cnf(1720,plain,(ssItem(hd(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[200,1719,theory(equality)])).
% cnf(1722,plain,(ssItem(hd(cons(X1,nil)))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(spm,[status(thm)],[1720,1595,theory(equality)])).
% cnf(1724,plain,(ssItem(hd(cons(X1,nil)))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1722,124,theory(equality)])).
% cnf(1725,plain,(ssItem(hd(cons(X1,nil)))|~ssItem(X1)|$false),inference(rw,[status(thm)],[1724,125,theory(equality)])).
% cnf(1726,plain,(ssItem(hd(cons(X1,nil)))|~ssItem(X1)),inference(cn,[status(thm)],[1725,theory(equality)])).
% cnf(2112,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(2113,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[2112,149,theory(equality)])).
% cnf(2114,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)|$false),inference(rw,[status(thm)],[2113,585,theory(equality)])).
% cnf(2115,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)),inference(cn,[status(thm)],[2114,theory(equality)])).
% cnf(2116,negated_conjecture,(esk51_0=nil|esk48_0=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))),inference(er,[status(thm)],[2115,theory(equality)])).
% cnf(2117,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|~ssList(nil)|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[2116,124,theory(equality)])).
% cnf(2119,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|$false|~ssItem(hd(esk51_0))),inference(rw,[status(thm)],[2117,125,theory(equality)])).
% cnf(2120,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|~ssItem(hd(esk51_0))),inference(cn,[status(thm)],[2119,theory(equality)])).
% cnf(2121,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2120,149,theory(equality)])).
% cnf(2122,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|$false),inference(rw,[status(thm)],[2121,585,theory(equality)])).
% cnf(2123,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil),inference(cn,[status(thm)],[2122,theory(equality)])).
% cnf(2127,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|~ssList(nil)|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[153,2123,theory(equality)])).
% cnf(2159,negated_conjecture,(app(esk48_0,X1)=cons(hd(esk51_0),X1)|esk51_0=nil|~ssList(X1)|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[182,2123,theory(equality)])).
% cnf(2163,negated_conjecture,(ssItem(hd(esk48_0))|esk51_0=nil|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[1726,2123,theory(equality)])).
% cnf(2174,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|$false|~ssItem(hd(esk51_0))),inference(rw,[status(thm)],[2127,125,theory(equality)])).
% cnf(2175,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|~ssItem(hd(esk51_0))),inference(cn,[status(thm)],[2174,theory(equality)])).
% cnf(2223,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2175,149,theory(equality)])).
% cnf(2224,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|$false),inference(rw,[status(thm)],[2223,585,theory(equality)])).
% cnf(2225,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil),inference(cn,[status(thm)],[2224,theory(equality)])).
% cnf(2249,negated_conjecture,(esk51_0=nil|ssItem(hd(esk48_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[2163,149,theory(equality)])).
% cnf(2251,negated_conjecture,(esk51_0=nil|ssItem(hd(esk48_0))|$false),inference(rw,[status(thm)],[2249,585,theory(equality)])).
% cnf(2252,negated_conjecture,(esk51_0=nil|ssItem(hd(esk48_0))),inference(cn,[status(thm)],[2251,theory(equality)])).
% cnf(2253,negated_conjecture,(esk51_0=nil|ssItem(hd(esk51_0))),inference(spm,[status(thm)],[2252,2225,theory(equality)])).
% cnf(2687,negated_conjecture,(cons(hd(esk51_0),X1)=app(esk48_0,X1)|esk51_0=nil|~ssList(X1)),inference(csr,[status(thm)],[2159,2253])).
% cnf(2738,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|nil=esk51_0|~ssList(esk51_0)|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[185,2687,theory(equality)])).
% cnf(2772,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|nil=esk51_0|$false|~ssList(tl(esk51_0))),inference(rw,[status(thm)],[2738,585,theory(equality)])).
% cnf(2773,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|nil=esk51_0|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[2772,theory(equality)])).
% cnf(6610,plain,(segmentP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[826,theory(equality)])).
% cnf(110905,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2773,291,theory(equality)])).
% cnf(110906,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|$false),inference(rw,[status(thm)],[110905,585,theory(equality)])).
% cnf(110907,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[110906,theory(equality)])).
% cnf(403751,plain,(segmentP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[6610,367])).
% cnf(403762,negated_conjecture,(segmentP(esk51_0,esk48_0)|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[403751,110907,theory(equality)])).
% cnf(403844,negated_conjecture,(segmentP(esk51_0,esk48_0)|esk51_0=nil|~ssList(tl(esk51_0))|$false),inference(rw,[status(thm)],[403762,573,theory(equality)])).
% cnf(403845,negated_conjecture,(segmentP(esk51_0,esk48_0)|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[403844,theory(equality)])).
% cnf(403846,negated_conjecture,(esk51_0=nil|~ssList(tl(esk51_0))),inference(sr,[status(thm)],[403845,591,theory(equality)])).
% cnf(403983,negated_conjecture,(esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[403846,291,theory(equality)])).
% cnf(403984,negated_conjecture,(esk51_0=nil|$false),inference(rw,[status(thm)],[403983,585,theory(equality)])).
% cnf(403985,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[403984,theory(equality)])).
% cnf(407075,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[588,403985,theory(equality)])).
% cnf(407168,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[609,407075,theory(equality)])).
% cnf(407169,negated_conjecture,($false),inference(rw,[status(thm)],[407168,125,theory(equality)])).
% cnf(407170,negated_conjecture,($false),inference(cn,[status(thm)],[407169,theory(equality)])).
% cnf(407171,negated_conjecture,($false),407170,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 19724
% # ...of these trivial : 18
% # ...subsumed : 17034
% # ...remaining for further processing: 2672
% # Other redundant clauses eliminated : 1200
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 30
% # Backward-rewritten : 1658
% # Generated clauses : 198737
% # ...of the previous two non-trivial : 195479
% # Contextual simplify-reflections : 11627
% # Paramodulations : 197044
% # Factorizations : 0
% # Equation resolutions : 1690
% # Current number of processed clauses: 977
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 949
% # Current number of unprocessed clauses: 25746
% # ...number of literals in the above : 223936
% # Clause-clause subsumption calls (NU) : 1432325
% # Rec. Clause-clause subsumption calls : 788013
% # Unit Clause-clause subsumption calls : 939
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 713 leaves, 1.65+/-1.544 terms/leaf
% # Paramod-from index: 270 leaves, 1.05+/-0.275 terms/leaf
% # Paramod-into index: 477 leaves, 1.51+/-1.348 terms/leaf
% # -------------------------------------------------
% # User time : 11.831 s
% # System time : 0.424 s
% # Total time : 12.255 s
% # Maximum resident set size: 0 pages
% PrfWatch: 19.32 CPU 20.34 WC
% FINAL PrfWatch: 19.32 CPU 20.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP6451/SWC354+1.tptp
%
%------------------------------------------------------------------------------