TSTP Solution File: SWC324+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC324+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 07:54:07 EST 2010
% Result : Theorem 1.57s
% Output : Solution 1.57s
% 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/SystemOnTPTP933/SWC324+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP933/SWC324+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP933/SWC324+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 1146
% 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(2, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(3, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(6, axiom,![X1]:(ssList(X1)=>(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax20)).
% fof(13, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(20, 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]:(ssItem(X2)=>hd(cons(X2,X1))=X2)),file('/tmp/SRASS.s.p', ax23)).
% fof(36, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(41, axiom,![X1]:(ssList(X1)=>(frontsegP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax46)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|?[X5]:(ssList(X5)&?[X6]:((ssList(X6)&app(X5,X6)=X2)&app(X6,X5)=X1)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&~(app(X8,cons(X7,nil))=X3))&app(cons(X7,nil),X8)=X4)))|(~(nil=X3)&nil=X4))))),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))|?[X5]:(ssList(X5)&?[X6]:((ssList(X6)&app(X5,X6)=X2)&app(X6,X5)=X1)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&~(app(X8,cons(X7,nil))=X3))&app(cons(X7,nil),X8)=X4)))|(~(nil=X3)&nil=X4)))))),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))|?[X5]:(ssList(X5)&?[X6]:((ssList(X6)&app(X5,X6)=X2)&app(X6,X5)=X1)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&~(app(X8,cons(X7,nil))=X3))&app(cons(X7,nil),X8)=X4)))|(~(nil=X3)&nil=X4)))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(109, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(110, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[109])).
% fof(111, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[110])).
% cnf(112,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[111])).
% cnf(113,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(124, plain,![X1]:(~(ssList(X1))|(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(125, plain,![X4]:(~(ssList(X4))|(nil=X4|?[X5]:(ssList(X5)&?[X6]:(ssItem(X6)&cons(X6,X5)=X4)))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X4]:(~(ssList(X4))|(nil=X4|(ssList(esk3_1(X4))&(ssItem(esk4_1(X4))&cons(esk4_1(X4),esk3_1(X4))=X4)))),inference(skolemize,[status(esa)],[125])).
% fof(127, plain,![X4]:(((ssList(esk3_1(X4))|nil=X4)|~(ssList(X4)))&(((ssItem(esk4_1(X4))|nil=X4)|~(ssList(X4)))&((cons(esk4_1(X4),esk3_1(X4))=X4|nil=X4)|~(ssList(X4))))),inference(distribute,[status(thm)],[126])).
% cnf(128,plain,(nil=X1|cons(esk4_1(X1),esk3_1(X1))=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[127])).
% cnf(129,plain,(nil=X1|ssItem(esk4_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[127])).
% cnf(130,plain,(nil=X1|ssList(esk3_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[127])).
% fof(154, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(155, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[155])).
% cnf(157,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[156])).
% fof(162, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[15])).
% fof(163, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[162])).
% fof(164, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[163])).
% fof(165, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[164])).
% cnf(168,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[165])).
% fof(206, 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)],[20])).
% fof(207, 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)],[206])).
% fof(208, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk16_1(X3))&cons(esk16_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[207])).
% fof(209, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk16_1(X3))&cons(esk16_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[208])).
% fof(210, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk16_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk16_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[209])).
% cnf(211,plain,(cons(esk16_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[210])).
% cnf(212,plain,(ssItem(esk16_1(X1))|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[210])).
% cnf(213,plain,(singletonP(X1)|~ssList(X1)|cons(X2,nil)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[210])).
% fof(222, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|hd(cons(X2,X1))=X2)),inference(fof_nnf,[status(thm)],[23])).
% fof(223, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|hd(cons(X4,X3))=X4)),inference(variable_rename,[status(thm)],[222])).
% fof(224, plain,![X3]:![X4]:((~(ssItem(X4))|hd(cons(X4,X3))=X4)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[223])).
% cnf(225,plain,(hd(cons(X2,X1))=X2|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[224])).
% fof(274, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(frontsegP(X1,X2))|?[X3]:(ssList(X3)&app(X2,X3)=X1))&(![X3]:(~(ssList(X3))|~(app(X2,X3)=X1))|frontsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[36])).
% fof(275, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|?[X6]:(ssList(X6)&app(X5,X6)=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(variable_rename,[status(thm)],[274])).
% fof(276, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk18_2(X4,X5))&app(X5,esk18_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[275])).
% fof(277, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk18_2(X4,X5))&app(X5,esk18_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[276])).
% fof(278, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk18_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk18_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[277])).
% cnf(279,plain,(app(X2,esk18_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[278])).
% cnf(280,plain,(ssList(esk18_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[278])).
% fof(309, plain,![X1]:(~(ssList(X1))|((~(frontsegP(nil,X1))|nil=X1)&(~(nil=X1)|frontsegP(nil,X1)))),inference(fof_nnf,[status(thm)],[41])).
% fof(310, plain,![X2]:(~(ssList(X2))|((~(frontsegP(nil,X2))|nil=X2)&(~(nil=X2)|frontsegP(nil,X2)))),inference(variable_rename,[status(thm)],[309])).
% fof(311, plain,![X2]:(((~(frontsegP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|frontsegP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[310])).
% cnf(312,plain,(frontsegP(nil,X1)|~ssList(X1)|nil!=X1),inference(split_conjunct,[status(thm)],[311])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(((((ssList(X4)&X2=X4)&X1=X3)&![X5]:(~(ssList(X5))|![X6]:((~(ssList(X6))|~(app(X5,X6)=X2))|~(app(X6,X5)=X1))))&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|app(X8,cons(X7,nil))=X3)|~(app(cons(X7,nil),X8)=X4))))&(nil=X3|~(nil=X4)))))),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)&![X13]:(~(ssList(X13))|![X14]:((~(ssList(X14))|~(app(X13,X14)=X10))|~(app(X14,X13)=X9))))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|app(X16,cons(X15,nil))=X11)|~(app(cons(X15,nil),X16)=X12))))&(nil=X11|~(nil=X12)))))),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)&![X13]:(~(ssList(X13))|![X14]:((~(ssList(X14))|~(app(X13,X14)=esk49_0))|~(app(X14,X13)=esk48_0))))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|app(X16,cons(X15,nil))=esk50_0)|~(app(cons(X15,nil),X16)=esk51_0))))&(nil=esk50_0|~(nil=esk51_0)))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:![X15]:![X16]:((((((((~(ssList(X16))|app(X16,cons(X15,nil))=esk50_0)|~(app(cons(X15,nil),X16)=esk51_0))|~(ssItem(X15)))&((((~(ssList(X14))|~(app(X13,X14)=esk49_0))|~(app(X14,X13)=esk48_0))|~(ssList(X13)))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)))&(nil=esk50_0|~(nil=esk51_0)))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(573,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(575,negated_conjecture,(nil=esk50_0|nil!=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(~ssList(X1)|app(X2,X1)!=esk48_0|app(X1,X2)!=esk49_0|~ssList(X2)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(app(X2,cons(X1,nil))=esk50_0|~ssItem(X1)|app(cons(X1,nil),X2)!=esk51_0|~ssList(X2)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,577,theory(equality)])).
% cnf(585,plain,(frontsegP(nil,nil)|~ssList(nil)),inference(er,[status(thm)],[312,theory(equality)])).
% cnf(586,plain,(frontsegP(nil,nil)|$false),inference(rw,[status(thm)],[585,113,theory(equality)])).
% cnf(587,plain,(frontsegP(nil,nil)),inference(cn,[status(thm)],[586,theory(equality)])).
% cnf(608,negated_conjecture,(app(X2,X1)!=esk50_0|app(X1,X2)!=esk49_0|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[579,576,theory(equality)])).
% cnf(609,negated_conjecture,(app(X2,X1)!=esk50_0|app(X1,X2)!=esk51_0|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[608,577,theory(equality)])).
% cnf(620,plain,(singletonP(cons(X1,nil))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(er,[status(thm)],[213,theory(equality)])).
% cnf(648,negated_conjecture,(app(X1,X2)=esk50_0|app(X2,X1)!=esk51_0|~ssList(X1)|~ssItem(esk16_1(X2))|~singletonP(X2)|~ssList(X2)),inference(spm,[status(thm)],[580,211,theory(equality)])).
% cnf(653,plain,(hd(X1)=esk16_1(X1)|~ssList(nil)|~ssItem(esk16_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[225,211,theory(equality)])).
% cnf(654,plain,(hd(X1)=esk16_1(X1)|$false|~ssItem(esk16_1(X1))|~singletonP(X1)|~ssList(X1)),inference(rw,[status(thm)],[653,113,theory(equality)])).
% cnf(655,plain,(hd(X1)=esk16_1(X1)|~ssItem(esk16_1(X1))|~singletonP(X1)|~ssList(X1)),inference(cn,[status(thm)],[654,theory(equality)])).
% cnf(1318,plain,(ssList(esk18_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[280,587,theory(equality)])).
% cnf(1319,plain,(app(nil,esk18_2(nil,nil))=nil|~ssList(nil)),inference(spm,[status(thm)],[279,587,theory(equality)])).
% cnf(1322,plain,(ssList(esk18_2(nil,nil))|$false),inference(rw,[status(thm)],[1318,113,theory(equality)])).
% cnf(1323,plain,(ssList(esk18_2(nil,nil))),inference(cn,[status(thm)],[1322,theory(equality)])).
% cnf(1324,plain,(app(nil,esk18_2(nil,nil))=nil|$false),inference(rw,[status(thm)],[1319,113,theory(equality)])).
% cnf(1325,plain,(app(nil,esk18_2(nil,nil))=nil),inference(cn,[status(thm)],[1324,theory(equality)])).
% cnf(1360,plain,(nil=esk18_2(nil,nil)|~ssList(esk18_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[168,1325,theory(equality)])).
% cnf(1380,plain,(nil=esk18_2(nil,nil)|$false|~ssList(nil)),inference(rw,[status(thm)],[1360,1323,theory(equality)])).
% cnf(1381,plain,(nil=esk18_2(nil,nil)|$false|$false),inference(rw,[status(thm)],[1380,113,theory(equality)])).
% cnf(1382,plain,(nil=esk18_2(nil,nil)),inference(cn,[status(thm)],[1381,theory(equality)])).
% cnf(1409,plain,(app(nil,nil)=nil),inference(rw,[status(thm)],[1325,1382,theory(equality)])).
% cnf(1412,negated_conjecture,(nil!=esk50_0|app(nil,nil)!=esk51_0|~ssList(nil)),inference(spm,[status(thm)],[609,1409,theory(equality)])).
% cnf(1425,negated_conjecture,(nil!=esk50_0|nil!=esk51_0|~ssList(nil)),inference(rw,[status(thm)],[1412,1409,theory(equality)])).
% cnf(1426,negated_conjecture,(nil!=esk50_0|nil!=esk51_0|$false),inference(rw,[status(thm)],[1425,113,theory(equality)])).
% cnf(1427,negated_conjecture,(nil!=esk50_0|nil!=esk51_0),inference(cn,[status(thm)],[1426,theory(equality)])).
% cnf(1446,negated_conjecture,(esk51_0!=nil),inference(csr,[status(thm)],[1427,575])).
% cnf(1848,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[620,112,theory(equality)])).
% cnf(1849,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|$false),inference(rw,[status(thm)],[1848,113,theory(equality)])).
% cnf(1850,plain,(singletonP(cons(X1,nil))|~ssItem(X1)),inference(cn,[status(thm)],[1849,theory(equality)])).
% cnf(2193,negated_conjecture,(app(X1,X2)=esk50_0|app(X2,X1)!=esk51_0|~singletonP(X2)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[648,212])).
% cnf(2194,negated_conjecture,(app(X2,X1)!=esk51_0|~singletonP(X2)|~ssList(X1)|~ssList(X2)),inference(csr,[status(thm)],[2193,609])).
% cnf(2208,negated_conjecture,(cons(X1,X2)!=esk51_0|~singletonP(cons(X1,nil))|~ssList(X2)|~ssList(cons(X1,nil))|~ssItem(X1)),inference(spm,[status(thm)],[2194,157,theory(equality)])).
% cnf(2234,plain,(esk16_1(X1)=hd(X1)|~singletonP(X1)|~ssList(X1)),inference(csr,[status(thm)],[655,212])).
% cnf(2235,plain,(ssItem(hd(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[212,2234,theory(equality)])).
% cnf(2236,plain,(cons(hd(X1),nil)=X1|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[211,2234,theory(equality)])).
% cnf(2240,plain,(ssItem(hd(cons(X1,nil)))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(spm,[status(thm)],[2235,1850,theory(equality)])).
% cnf(2242,plain,(ssItem(hd(cons(X1,nil)))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2240,112,theory(equality)])).
% cnf(2243,plain,(ssItem(hd(cons(X1,nil)))|~ssItem(X1)|$false),inference(rw,[status(thm)],[2242,113,theory(equality)])).
% cnf(2244,plain,(ssItem(hd(cons(X1,nil)))|~ssItem(X1)),inference(cn,[status(thm)],[2243,theory(equality)])).
% cnf(2249,plain,(cons(hd(cons(X1,nil)),nil)=cons(X1,nil)|~ssList(cons(X1,nil))|~ssItem(X1)),inference(spm,[status(thm)],[2236,1850,theory(equality)])).
% cnf(2304,plain,(cons(hd(cons(X1,nil)),nil)=cons(X1,nil)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2249,112,theory(equality)])).
% cnf(2305,plain,(cons(hd(cons(X1,nil)),nil)=cons(X1,nil)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2304,113,theory(equality)])).
% cnf(2306,plain,(cons(hd(cons(X1,nil)),nil)=cons(X1,nil)|~ssItem(X1)),inference(cn,[status(thm)],[2305,theory(equality)])).
% cnf(2311,plain,(ssList(cons(X1,nil))|~ssList(nil)|~ssItem(hd(cons(X1,nil)))|~ssItem(X1)),inference(spm,[status(thm)],[112,2306,theory(equality)])).
% cnf(2359,plain,(ssList(cons(X1,nil))|$false|~ssItem(hd(cons(X1,nil)))|~ssItem(X1)),inference(rw,[status(thm)],[2311,113,theory(equality)])).
% cnf(2360,plain,(ssList(cons(X1,nil))|~ssItem(hd(cons(X1,nil)))|~ssItem(X1)),inference(cn,[status(thm)],[2359,theory(equality)])).
% cnf(2412,plain,(ssList(cons(X1,nil))|~ssItem(X1)),inference(csr,[status(thm)],[2360,2244])).
% cnf(3462,negated_conjecture,(cons(X1,X2)!=esk51_0|~singletonP(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(csr,[status(thm)],[2208,2412])).
% cnf(3463,negated_conjecture,(cons(X1,X2)!=esk51_0|~ssList(X2)|~ssItem(X1)),inference(csr,[status(thm)],[3462,1850])).
% cnf(3466,negated_conjecture,(nil=X1|X1!=esk51_0|~ssList(esk3_1(X1))|~ssItem(esk4_1(X1))|~ssList(X1)),inference(spm,[status(thm)],[3463,128,theory(equality)])).
% cnf(3560,negated_conjecture,(nil=X1|X1!=esk51_0|~ssList(esk3_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[3466,129])).
% cnf(3561,negated_conjecture,(nil=X1|X1!=esk51_0|~ssList(X1)),inference(csr,[status(thm)],[3560,130])).
% cnf(3562,negated_conjecture,(nil=esk51_0|~ssList(esk51_0)),inference(er,[status(thm)],[3561,theory(equality)])).
% cnf(3563,negated_conjecture,(nil=esk51_0|$false),inference(rw,[status(thm)],[3562,582,theory(equality)])).
% cnf(3564,negated_conjecture,(nil=esk51_0),inference(cn,[status(thm)],[3563,theory(equality)])).
% cnf(3565,negated_conjecture,($false),inference(sr,[status(thm)],[3564,1446,theory(equality)])).
% cnf(3566,negated_conjecture,($false),3565,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 577
% # ...of these trivial : 2
% # ...subsumed : 241
% # ...remaining for further processing: 334
% # Other redundant clauses eliminated : 81
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 10
% # Generated clauses : 1460
% # ...of the previous two non-trivial : 1252
% # Contextual simplify-reflections : 238
% # Paramodulations : 1340
% # Factorizations : 0
% # Equation resolutions : 120
% # Current number of processed clauses: 309
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 277
% # Current number of unprocessed clauses: 791
% # ...number of literals in the above : 5403
% # Clause-clause subsumption calls (NU) : 4408
% # Rec. Clause-clause subsumption calls : 2903
% # Unit Clause-clause subsumption calls : 26
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 305 leaves, 1.34+/-1.078 terms/leaf
% # Paramod-from index: 156 leaves, 1.01+/-0.160 terms/leaf
% # Paramod-into index: 269 leaves, 1.21+/-0.913 terms/leaf
% # -------------------------------------------------
% # User time : 0.115 s
% # System time : 0.005 s
% # Total time : 0.120 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.34 WC
% FINAL PrfWatch: 0.27 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP933/SWC324+1.tptp
%
%------------------------------------------------------------------------------