TSTP Solution File: SWC015+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC015+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 : art06.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 06:50:27 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP6232/SWC015+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6232/SWC015+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6232/SWC015+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 6328
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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(6, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(cons(X2,X1)=X1))),file('/tmp/SRASS.s.p', ax18)).
% fof(10, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(12, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(14, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(16, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(app(X3,X2)=app(X1,X2)=>X3=X1)))),file('/tmp/SRASS.s.p', ax79)).
% fof(22, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>tl(app(X1,X2))=app(tl(X1),X2)))),file('/tmp/SRASS.s.p', ax86)).
% fof(23, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% fof(27, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(32, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% 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)&~(X4=X5))&?[X6]:(((ssList(X6)&tl(X4)=X6)&app(X3,X6)=X5)&neq(nil,X4))))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&cons(X7,nil)=X1)&app(cons(X7,nil),X8)=X2)))&(~(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)&~(X4=X5))&?[X6]:(((ssList(X6)&tl(X4)=X6)&app(X3,X6)=X5)&neq(nil,X4))))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&cons(X7,nil)=X1)&app(cons(X7,nil),X8)=X2)))&(~(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)&~(X4=X5))&?[X6]:(((ssList(X6)&tl(X4)=X6)&app(X3,X6)=X5)&neq(nil,X4))))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&cons(X7,nil)=X1)&app(cons(X7,nil),X8)=X2)))&(~(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(126, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(cons(X2,X1)=X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(127, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(cons(X4,X3)=X3))),inference(variable_rename,[status(thm)],[126])).
% fof(128, plain,![X3]:![X4]:((~(ssItem(X4))|~(cons(X4,X3)=X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[127])).
% cnf(129,plain,(~ssList(X1)|cons(X2,X1)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[128])).
% fof(147, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(148, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[147])).
% cnf(149,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[148])).
% fof(154, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[12])).
% fof(155, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[155])).
% cnf(157,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[156])).
% fof(162, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[14])).
% fof(163, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[162])).
% cnf(164,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[163])).
% fof(171, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X3,X2)=app(X1,X2))|X3=X1)))),inference(fof_nnf,[status(thm)],[16])).
% fof(172, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4)))),inference(variable_rename,[status(thm)],[171])).
% fof(173, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[172])).
% cnf(174,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X3,X2)!=app(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[173])).
% fof(197, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|tl(app(X1,X2))=app(tl(X1),X2)))),inference(fof_nnf,[status(thm)],[22])).
% fof(198, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))),inference(variable_rename,[status(thm)],[197])).
% fof(199, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[198])).
% cnf(200,plain,(tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[199])).
% fof(201, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[23])).
% fof(202, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[201])).
% cnf(203,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[202])).
% fof(238, 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)],[27])).
% fof(239, 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)],[238])).
% fof(240, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk17_1(X3))&cons(esk17_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[239])).
% fof(241, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk17_1(X3))&cons(esk17_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[240])).
% fof(242, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk17_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk17_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[241])).
% cnf(243,plain,(cons(esk17_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[242])).
% cnf(244,plain,(ssItem(esk17_1(X1))|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[242])).
% cnf(245,plain,(singletonP(X1)|~ssList(X1)|cons(X2,nil)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[242])).
% fof(265, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[32])).
% fof(266, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[265])).
% cnf(267,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[266])).
% 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))|X4=X5)|![X6]:(((~(ssList(X6))|~(tl(X4)=X6))|~(app(X3,X6)=X5))|~(neq(nil,X4)))))&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|~(cons(X7,nil)=X1))|~(app(cons(X7,nil),X8)=X2))))|(neq(X2,nil)&~(neq(X4,nil))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&((X10=X12&X9=X11)&(((neq(X10,nil)&![X13]:((~(ssList(X13))|X12=X13)|![X14]:(((~(ssList(X14))|~(tl(X12)=X14))|~(app(X11,X14)=X13))|~(neq(nil,X12)))))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(cons(X15,nil)=X9))|~(app(cons(X15,nil),X16)=X10))))|(neq(X10,nil)&~(neq(X12,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)&![X13]:((~(ssList(X13))|esk51_0=X13)|![X14]:(((~(ssList(X14))|~(tl(esk51_0)=X14))|~(app(esk50_0,X14)=X13))|~(neq(nil,esk51_0)))))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(cons(X15,nil)=esk48_0))|~(app(cons(X15,nil),X16)=esk49_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:![X15]:![X16]:((((((((((~(ssList(X16))|~(cons(X15,nil)=esk48_0))|~(app(cons(X15,nil),X16)=esk49_0))|~(ssItem(X15)))&(((((~(ssList(X14))|~(tl(esk51_0)=X14))|~(app(esk50_0,X14)=X13))|~(neq(nil,esk51_0)))|(~(ssList(X13))|esk51_0=X13))&neq(esk49_0,nil)))|(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,![X13]:![X14]:![X15]:![X16]:((((((((neq(esk49_0,nil)|(((~(ssList(X16))|~(cons(X15,nil)=esk48_0))|~(app(cons(X15,nil),X16)=esk49_0))|~(ssItem(X15))))&(~(neq(esk51_0,nil))|(((~(ssList(X16))|~(cons(X15,nil)=esk48_0))|~(app(cons(X15,nil),X16)=esk49_0))|~(ssItem(X15)))))&(((neq(esk49_0,nil)|((((~(ssList(X14))|~(tl(esk51_0)=X14))|~(app(esk50_0,X14)=X13))|~(neq(nil,esk51_0)))|(~(ssList(X13))|esk51_0=X13)))&(~(neq(esk51_0,nil))|((((~(ssList(X14))|~(tl(esk51_0)=X14))|~(app(esk50_0,X14)=X13))|~(neq(nil,esk51_0)))|(~(ssList(X13))|esk51_0=X13))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil)))))&(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(580,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(esk51_0=X1|~ssList(X1)|~neq(nil,esk51_0)|app(esk50_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(~ssItem(X1)|app(cons(X1,nil),X2)!=esk49_0|cons(X1,nil)!=esk48_0|~ssList(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)],[580,578,theory(equality)])).
% cnf(615,negated_conjecture,(cons(X1,nil)!=esk48_0|app(cons(X1,nil),X2)!=esk51_0|~ssItem(X1)|~ssList(X2)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[583,578,theory(equality)])).
% cnf(616,negated_conjecture,(cons(X1,nil)!=esk48_0|app(cons(X1,nil),X2)!=esk51_0|~ssItem(X1)|~ssList(X2)|$false),inference(rw,[status(thm)],[615,588,theory(equality)])).
% cnf(617,negated_conjecture,(cons(X1,nil)!=esk48_0|app(cons(X1,nil),X2)!=esk51_0|~ssItem(X1)|~ssList(X2)),inference(cn,[status(thm)],[616,theory(equality)])).
% cnf(619,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)],[245,theory(equality)])).
% cnf(640,negated_conjecture,(app(X1,X2)!=esk51_0|X1!=esk48_0|~ssList(X2)|~ssItem(esk17_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[617,243,theory(equality)])).
% cnf(651,negated_conjecture,(esk51_0=X1|tl(esk51_0)!=X2|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(X1)|~neq(nil,esk51_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,577,theory(equality)])).
% cnf(652,negated_conjecture,(esk51_0=X1|tl(esk51_0)!=X2|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(X1)|~neq(nil,esk51_0)|$false),inference(rw,[status(thm)],[651,588,theory(equality)])).
% cnf(653,negated_conjecture,(esk51_0=X1|tl(esk51_0)!=X2|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(X1)|~neq(nil,esk51_0)),inference(cn,[status(thm)],[652,theory(equality)])).
% cnf(667,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(esk48_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)|~ssList(esk51_0)|~ssList(nil)),inference(spm,[status(thm)],[653,119,theory(equality)])).
% cnf(668,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(esk48_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)|$false|~ssList(nil)),inference(rw,[status(thm)],[667,585,theory(equality)])).
% cnf(669,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(esk48_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[668,125,theory(equality)])).
% cnf(670,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(esk48_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[669,theory(equality)])).
% cnf(676,plain,(nil=X1|X1!=tl(X1)|~ssList(tl(X1))|~ssItem(hd(X1))|~ssList(X1)),inference(spm,[status(thm)],[129,203,theory(equality)])).
% cnf(730,plain,(X1=nil|app(X1,X2)!=X2|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[174,164,theory(equality)])).
% cnf(736,plain,(X1=nil|app(X1,X2)!=X2|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[730,125,theory(equality)])).
% cnf(737,plain,(X1=nil|app(X1,X2)!=X2|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[736,theory(equality)])).
% cnf(1743,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[625,124,theory(equality)])).
% cnf(1744,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|$false),inference(rw,[status(thm)],[1743,125,theory(equality)])).
% cnf(1745,plain,(singletonP(cons(X1,nil))|~ssItem(X1)),inference(cn,[status(thm)],[1744,theory(equality)])).
% cnf(2034,plain,(nil=X1|tl(X1)!=X1|~ssList(tl(X1))|~ssList(X1)),inference(csr,[status(thm)],[676,267])).
% cnf(2035,plain,(nil=X1|tl(X1)!=X1|~ssList(X1)),inference(csr,[status(thm)],[2034,149])).
% cnf(2223,negated_conjecture,(app(X1,X2)!=esk51_0|X1!=esk48_0|~singletonP(X1)|~ssList(X1)|~ssList(X2)),inference(csr,[status(thm)],[640,244])).
% cnf(2224,negated_conjecture,(app(esk48_0,X1)!=esk51_0|~singletonP(esk48_0)|~ssList(X1)|~ssList(esk48_0)),inference(er,[status(thm)],[2223,theory(equality)])).
% cnf(2225,negated_conjecture,(app(esk48_0,X1)!=esk51_0|~singletonP(esk48_0)|~ssList(X1)|$false),inference(rw,[status(thm)],[2224,573,theory(equality)])).
% cnf(2226,negated_conjecture,(app(esk48_0,X1)!=esk51_0|~singletonP(esk48_0)|~ssList(X1)),inference(cn,[status(thm)],[2225,theory(equality)])).
% cnf(2232,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(tl(esk51_0))|~ssList(X1)),inference(er,[status(thm)],[670,theory(equality)])).
% cnf(2233,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[2232,149,theory(equality)])).
% cnf(2234,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(X1)|$false),inference(rw,[status(thm)],[2233,585,theory(equality)])).
% cnf(2235,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(esk48_0,tl(esk51_0))!=X1|~ssList(X1)),inference(cn,[status(thm)],[2234,theory(equality)])).
% cnf(2236,negated_conjecture,(esk51_0=nil|esk51_0=app(esk48_0,tl(esk51_0))|~ssList(app(esk48_0,tl(esk51_0)))),inference(er,[status(thm)],[2235,theory(equality)])).
% cnf(2239,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[2236,157,theory(equality)])).
% cnf(2240,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(tl(esk51_0))|$false),inference(rw,[status(thm)],[2239,573,theory(equality)])).
% cnf(2241,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[2240,theory(equality)])).
% cnf(2242,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2241,149,theory(equality)])).
% cnf(2243,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil|$false),inference(rw,[status(thm)],[2242,585,theory(equality)])).
% cnf(2244,negated_conjecture,(app(esk48_0,tl(esk51_0))=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[2243,theory(equality)])).
% cnf(2249,negated_conjecture,(tl(esk51_0)=app(tl(esk48_0),tl(esk51_0))|nil=esk48_0|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[200,2244,theory(equality)])).
% cnf(2273,negated_conjecture,(tl(esk51_0)=app(tl(esk48_0),tl(esk51_0))|nil=esk48_0|esk51_0=nil|~ssList(tl(esk51_0))|$false),inference(rw,[status(thm)],[2249,573,theory(equality)])).
% cnf(2274,negated_conjecture,(tl(esk51_0)=app(tl(esk48_0),tl(esk51_0))|nil=esk48_0|esk51_0=nil|~ssList(tl(esk51_0))),inference(cn,[status(thm)],[2273,theory(equality)])).
% cnf(2301,negated_conjecture,(app(tl(esk48_0),tl(esk51_0))=tl(esk51_0)|esk51_0=nil|esk48_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2274,149,theory(equality)])).
% cnf(2302,negated_conjecture,(app(tl(esk48_0),tl(esk51_0))=tl(esk51_0)|esk51_0=nil|esk48_0=nil|$false),inference(rw,[status(thm)],[2301,585,theory(equality)])).
% cnf(2303,negated_conjecture,(app(tl(esk48_0),tl(esk51_0))=tl(esk51_0)|esk51_0=nil|esk48_0=nil),inference(cn,[status(thm)],[2302,theory(equality)])).
% cnf(2310,negated_conjecture,(tl(esk48_0)=nil|esk48_0=nil|esk51_0=nil|~ssList(tl(esk51_0))|~ssList(tl(esk48_0))),inference(spm,[status(thm)],[737,2303,theory(equality)])).
% cnf(2322,negated_conjecture,(tl(esk48_0)=nil|esk51_0=nil|esk48_0=nil|~ssList(tl(esk48_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[2310,149,theory(equality)])).
% cnf(2323,negated_conjecture,(tl(esk48_0)=nil|esk51_0=nil|esk48_0=nil|~ssList(tl(esk48_0))|$false),inference(rw,[status(thm)],[2322,585,theory(equality)])).
% cnf(2324,negated_conjecture,(tl(esk48_0)=nil|esk51_0=nil|esk48_0=nil|~ssList(tl(esk48_0))),inference(cn,[status(thm)],[2323,theory(equality)])).
% cnf(2325,negated_conjecture,(tl(esk48_0)=nil|esk48_0=nil|esk51_0=nil|~ssList(esk48_0)),inference(spm,[status(thm)],[2324,149,theory(equality)])).
% cnf(2326,negated_conjecture,(tl(esk48_0)=nil|esk48_0=nil|esk51_0=nil|$false),inference(rw,[status(thm)],[2325,573,theory(equality)])).
% cnf(2327,negated_conjecture,(tl(esk48_0)=nil|esk48_0=nil|esk51_0=nil),inference(cn,[status(thm)],[2326,theory(equality)])).
% cnf(2329,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0|nil=esk48_0|esk51_0=nil|~ssList(esk48_0)),inference(spm,[status(thm)],[203,2327,theory(equality)])).
% cnf(2338,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0|nil=esk48_0|esk51_0=nil|$false),inference(rw,[status(thm)],[2329,573,theory(equality)])).
% cnf(2339,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0|nil=esk48_0|esk51_0=nil),inference(cn,[status(thm)],[2338,theory(equality)])).
% cnf(2943,negated_conjecture,(singletonP(esk48_0)|esk51_0=nil|esk48_0=nil|~ssItem(hd(esk48_0))),inference(spm,[status(thm)],[1745,2339,theory(equality)])).
% cnf(3297,negated_conjecture,(esk48_0=nil|esk51_0=nil|singletonP(esk48_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[2943,267,theory(equality)])).
% cnf(3298,negated_conjecture,(esk48_0=nil|esk51_0=nil|singletonP(esk48_0)|$false),inference(rw,[status(thm)],[3297,573,theory(equality)])).
% cnf(3299,negated_conjecture,(esk48_0=nil|esk51_0=nil|singletonP(esk48_0)),inference(cn,[status(thm)],[3298,theory(equality)])).
% cnf(3308,negated_conjecture,(esk51_0=nil|esk48_0=nil|app(esk48_0,X1)!=esk51_0|~ssList(X1)),inference(spm,[status(thm)],[2226,3299,theory(equality)])).
% cnf(3329,negated_conjecture,(esk48_0=nil|esk51_0=nil|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[3308,2244,theory(equality)])).
% cnf(3337,negated_conjecture,(esk51_0=nil|esk48_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[3329,149,theory(equality)])).
% cnf(3338,negated_conjecture,(esk51_0=nil|esk48_0=nil|$false),inference(rw,[status(thm)],[3337,585,theory(equality)])).
% cnf(3339,negated_conjecture,(esk51_0=nil|esk48_0=nil),inference(cn,[status(thm)],[3338,theory(equality)])).
% cnf(3343,negated_conjecture,(app(nil,tl(esk51_0))=esk51_0|esk51_0=nil),inference(spm,[status(thm)],[2244,3339,theory(equality)])).
% cnf(3361,negated_conjecture,(esk51_0=tl(esk51_0)|esk51_0=nil|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[164,3343,theory(equality)])).
% cnf(3395,negated_conjecture,(tl(esk51_0)=esk51_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[3361,149,theory(equality)])).
% cnf(3396,negated_conjecture,(tl(esk51_0)=esk51_0|esk51_0=nil|$false),inference(rw,[status(thm)],[3395,585,theory(equality)])).
% cnf(3397,negated_conjecture,(tl(esk51_0)=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[3396,theory(equality)])).
% cnf(3401,negated_conjecture,(nil=esk51_0|~ssList(esk51_0)),inference(spm,[status(thm)],[2035,3397,theory(equality)])).
% cnf(3417,negated_conjecture,(nil=esk51_0|$false),inference(rw,[status(thm)],[3401,585,theory(equality)])).
% cnf(3418,negated_conjecture,(nil=esk51_0),inference(cn,[status(thm)],[3417,theory(equality)])).
% cnf(3492,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[588,3418,theory(equality)])).
% cnf(3495,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[619,3492,theory(equality)])).
% cnf(3497,negated_conjecture,($false),inference(rw,[status(thm)],[3495,125,theory(equality)])).
% cnf(3498,negated_conjecture,($false),inference(cn,[status(thm)],[3497,theory(equality)])).
% cnf(3499,negated_conjecture,($false),3498,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 459
% # ...of these trivial : 5
% # ...subsumed : 124
% # ...remaining for further processing: 330
% # Other redundant clauses eliminated : 75
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 42
% # Backward-rewritten : 37
% # Generated clauses : 1385
% # ...of the previous two non-trivial : 1148
% # Contextual simplify-reflections : 128
% # Paramodulations : 1279
% # Factorizations : 0
% # Equation resolutions : 106
% # Current number of processed clauses: 245
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 220
% # Current number of unprocessed clauses: 624
% # ...number of literals in the above : 4452
% # Clause-clause subsumption calls (NU) : 2976
% # Rec. Clause-clause subsumption calls : 1528
% # Unit Clause-clause subsumption calls : 27
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 255 leaves, 1.35+/-1.099 terms/leaf
% # Paramod-from index: 135 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 229 leaves, 1.21+/-0.916 terms/leaf
% # -------------------------------------------------
% # User time : 0.113 s
% # System time : 0.006 s
% # Total time : 0.119 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.35 WC
% FINAL PrfWatch: 0.26 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP6232/SWC015+1.tptp
%
%------------------------------------------------------------------------------