TSTP Solution File: SWC193+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC193+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 : art02.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:19:22 EST 2010
% Result : Theorem 1.36s
% Output : Solution 1.36s
% 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/SystemOnTPTP29378/SWC193+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29378/SWC193+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29378/SWC193+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 29474
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(6, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(7, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(13, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssItem(X3)=>cons(X3,app(X2,X1))=app(cons(X3,X2),X1)))),file('/tmp/SRASS.s.p', ax27)).
% fof(17, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>((segmentP(X1,X2)&segmentP(X2,X1))=>X1=X2))),file('/tmp/SRASS.s.p', ax54)).
% fof(20, axiom,![X1]:(ssList(X1)=>segmentP(X1,nil)),file('/tmp/SRASS.s.p', ax57)).
% fof(24, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(25, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>app(app(X1,X2),X3)=app(X1,app(X2,X3))))),file('/tmp/SRASS.s.p', ax82)).
% fof(30, axiom,![X1]:(ssList(X1)=>(equalelemsP(X1)<=>![X2]:(ssItem(X2)=>![X3]:(ssItem(X3)=>![X4]:(ssList(X4)=>![X5]:(ssList(X5)=>(app(X4,cons(X2,cons(X3,X5)))=X1=>X2=X3))))))),file('/tmp/SRASS.s.p', ax14)).
% fof(45, axiom,![X1]:(ssItem(X1)=>equalelemsP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax73)).
% fof(79, axiom,equalelemsP(nil),file('/tmp/SRASS.s.p', ax74)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,X3)))|![X5]:(ssItem(X5)=>![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:(ssList(X8)=>(~(app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X1)|X5=X6))))))|(~(singletonP(X3))&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))|~(segmentP(X4,X3)))|![X5]:(ssItem(X5)=>![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:(ssList(X8)=>(~(app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X1)|X5=X6))))))|(~(singletonP(X3))&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))|~(segmentP(X4,X3)))|![X5]:(ssItem(X5)=>![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:(ssList(X8)=>(~(app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X1)|X5=X6))))))|(~(singletonP(X3))&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])).
% fof(132, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[5])).
% fof(133, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[132])).
% fof(134, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[133])).
% fof(135, 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)],[134])).
% cnf(136,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[135])).
% fof(138, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(139, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[138])).
% fof(140, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[139])).
% cnf(141,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[140])).
% cnf(142,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[7])).
% fof(168, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssItem(X3))|cons(X3,app(X2,X1))=app(cons(X3,X2),X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(169, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssItem(X6))|cons(X6,app(X5,X4))=app(cons(X6,X5),X4)))),inference(variable_rename,[status(thm)],[168])).
% fof(170, plain,![X4]:![X5]:![X6]:(((~(ssItem(X6))|cons(X6,app(X5,X4))=app(cons(X6,X5),X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[169])).
% cnf(171,plain,(cons(X3,app(X2,X1))=app(cons(X3,X2),X1)|~ssList(X1)|~ssList(X2)|~ssItem(X3)),inference(split_conjunct,[status(thm)],[170])).
% fof(180, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|~(segmentP(X2,X1)))|X1=X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(181, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(segmentP(X3,X4))|~(segmentP(X4,X3)))|X3=X4))),inference(variable_rename,[status(thm)],[180])).
% fof(182, plain,![X3]:![X4]:((~(ssList(X4))|((~(segmentP(X3,X4))|~(segmentP(X4,X3)))|X3=X4))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[181])).
% cnf(183,plain,(X1=X2|~ssList(X1)|~segmentP(X2,X1)|~segmentP(X1,X2)|~ssList(X2)),inference(split_conjunct,[status(thm)],[182])).
% fof(191, plain,![X1]:(~(ssList(X1))|segmentP(X1,nil)),inference(fof_nnf,[status(thm)],[20])).
% fof(192, plain,![X2]:(~(ssList(X2))|segmentP(X2,nil)),inference(variable_rename,[status(thm)],[191])).
% cnf(193,plain,(segmentP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[192])).
% fof(207, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(208, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[207])).
% fof(209, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[208])).
% cnf(210,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[209])).
% fof(211, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|app(app(X1,X2),X3)=app(X1,app(X2,X3))))),inference(fof_nnf,[status(thm)],[25])).
% fof(212, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6))))),inference(variable_rename,[status(thm)],[211])).
% fof(213, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[212])).
% cnf(214,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[213])).
% fof(247, plain,![X1]:(~(ssList(X1))|((~(equalelemsP(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssItem(X3))|![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|(~(app(X4,cons(X2,cons(X3,X5)))=X1)|X2=X3))))))&(?[X2]:(ssItem(X2)&?[X3]:(ssItem(X3)&?[X4]:(ssList(X4)&?[X5]:(ssList(X5)&(app(X4,cons(X2,cons(X3,X5)))=X1&~(X2=X3))))))|equalelemsP(X1)))),inference(fof_nnf,[status(thm)],[30])).
% fof(248, plain,![X6]:(~(ssList(X6))|((~(equalelemsP(X6))|![X7]:(~(ssItem(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))))))&(?[X11]:(ssItem(X11)&?[X12]:(ssItem(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&(app(X13,cons(X11,cons(X12,X14)))=X6&~(X11=X12))))))|equalelemsP(X6)))),inference(variable_rename,[status(thm)],[247])).
% fof(249, plain,![X6]:(~(ssList(X6))|((~(equalelemsP(X6))|![X7]:(~(ssItem(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))))))&((ssItem(esk15_1(X6))&(ssItem(esk16_1(X6))&(ssList(esk17_1(X6))&(ssList(esk18_1(X6))&(app(esk17_1(X6),cons(esk15_1(X6),cons(esk16_1(X6),esk18_1(X6))))=X6&~(esk15_1(X6)=esk16_1(X6)))))))|equalelemsP(X6)))),inference(skolemize,[status(esa)],[248])).
% fof(250, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((((~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))|~(ssList(X9)))|~(ssItem(X8)))|~(ssItem(X7)))|~(equalelemsP(X6)))&((ssItem(esk15_1(X6))&(ssItem(esk16_1(X6))&(ssList(esk17_1(X6))&(ssList(esk18_1(X6))&(app(esk17_1(X6),cons(esk15_1(X6),cons(esk16_1(X6),esk18_1(X6))))=X6&~(esk15_1(X6)=esk16_1(X6)))))))|equalelemsP(X6)))|~(ssList(X6))),inference(shift_quantors,[status(thm)],[249])).
% fof(251, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((((~(ssList(X10))|(~(app(X9,cons(X7,cons(X8,X10)))=X6)|X7=X8))|~(ssList(X9)))|~(ssItem(X8)))|~(ssItem(X7)))|~(equalelemsP(X6)))|~(ssList(X6)))&(((ssItem(esk15_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((ssItem(esk16_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((ssList(esk17_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((ssList(esk18_1(X6))|equalelemsP(X6))|~(ssList(X6)))&(((app(esk17_1(X6),cons(esk15_1(X6),cons(esk16_1(X6),esk18_1(X6))))=X6|equalelemsP(X6))|~(ssList(X6)))&((~(esk15_1(X6)=esk16_1(X6))|equalelemsP(X6))|~(ssList(X6))))))))),inference(distribute,[status(thm)],[250])).
% cnf(258,plain,(X2=X3|~ssList(X1)|~equalelemsP(X1)|~ssItem(X2)|~ssItem(X3)|~ssList(X4)|app(X4,cons(X2,cons(X3,X5)))!=X1|~ssList(X5)),inference(split_conjunct,[status(thm)],[251])).
% fof(316, plain,![X1]:(~(ssItem(X1))|equalelemsP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[45])).
% fof(317, plain,![X2]:(~(ssItem(X2))|equalelemsP(cons(X2,nil))),inference(variable_rename,[status(thm)],[316])).
% cnf(318,plain,(equalelemsP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[317])).
% cnf(488,plain,(equalelemsP(nil)),inference(split_conjunct,[status(thm)],[79])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&segmentP(X4,X3))&?[X5]:(ssItem(X5)&?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&(app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X1&~(X5=X6)))))))&(singletonP(X3)|~(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)&segmentP(X12,X11))&?[X13]:(ssItem(X13)&?[X14]:(ssItem(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&(app(app(app(X15,cons(X13,nil)),cons(X14,nil)),X16)=X9&~(X13=X14)))))))&(singletonP(X11)|~(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)&segmentP(esk51_0,esk50_0))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0&~(esk52_0=esk53_0)))))))&(singletonP(esk50_0)|~(neq(esk51_0,nil)))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(singletonP(esk50_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(esk52_0!=esk53_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(573,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(580,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(583,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(584,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(585,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[584,579,theory(equality)])).
% cnf(586,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[583,580,theory(equality)])).
% cnf(589,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk50_0),inference(rw,[status(thm)],[573,579,theory(equality)])).
% cnf(630,plain,(equalelemsP(X1)|~ssItem(esk3_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[318,120,theory(equality)])).
% cnf(664,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[571,136,theory(equality)])).
% cnf(665,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[664,142,theory(equality)])).
% cnf(666,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[665,586,theory(equality)])).
% cnf(667,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil),inference(cn,[status(thm)],[666,theory(equality)])).
% cnf(693,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|~ssList(esk51_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[183,578,theory(equality)])).
% cnf(695,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[693,586,theory(equality)])).
% cnf(696,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|$false|$false),inference(rw,[status(thm)],[695,585,theory(equality)])).
% cnf(697,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)),inference(cn,[status(thm)],[696,theory(equality)])).
% cnf(931,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[589,214,theory(equality)])).
% cnf(942,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[931,575,theory(equality)])).
% cnf(943,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[942,theory(equality)])).
% cnf(1558,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[943,141,theory(equality)])).
% cnf(1559,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1558,142,theory(equality)])).
% cnf(1560,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))|$false|$false),inference(rw,[status(thm)],[1559,576,theory(equality)])).
% cnf(1561,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1560,theory(equality)])).
% cnf(1562,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1561,141,theory(equality)])).
% cnf(1563,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1562,142,theory(equality)])).
% cnf(1564,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1563,577,theory(equality)])).
% cnf(1565,negated_conjecture,(app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0)=esk50_0),inference(cn,[status(thm)],[1564,theory(equality)])).
% cnf(1583,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|~ssItem(esk52_0)),inference(spm,[status(thm)],[1565,210,theory(equality)])).
% cnf(1623,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[1583,577,theory(equality)])).
% cnf(1624,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[1623,theory(equality)])).
% cnf(1625,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1624,141,theory(equality)])).
% cnf(1626,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1625,142,theory(equality)])).
% cnf(1627,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1626,576,theory(equality)])).
% cnf(1628,negated_conjecture,(app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0)=esk50_0),inference(cn,[status(thm)],[1627,theory(equality)])).
% cnf(1643,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|~ssList(esk55_0)|~ssList(cons(esk52_0,cons(esk53_0,nil)))|~ssList(esk54_0)),inference(spm,[status(thm)],[214,1628,theory(equality)])).
% cnf(1675,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|$false|~ssList(cons(esk52_0,cons(esk53_0,nil)))|~ssList(esk54_0)),inference(rw,[status(thm)],[1643,574,theory(equality)])).
% cnf(1676,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|$false|~ssList(cons(esk52_0,cons(esk53_0,nil)))|$false),inference(rw,[status(thm)],[1675,575,theory(equality)])).
% cnf(1677,negated_conjecture,(esk50_0=app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))|~ssList(cons(esk52_0,cons(esk53_0,nil)))),inference(cn,[status(thm)],[1676,theory(equality)])).
% cnf(1685,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(cons(esk53_0,nil))|~ssItem(esk52_0)),inference(spm,[status(thm)],[1677,141,theory(equality)])).
% cnf(1686,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[1685,577,theory(equality)])).
% cnf(1687,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[1686,theory(equality)])).
% cnf(1688,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1687,141,theory(equality)])).
% cnf(1689,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1688,142,theory(equality)])).
% cnf(1690,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[1689,576,theory(equality)])).
% cnf(1691,negated_conjecture,(app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0))=esk50_0),inference(cn,[status(thm)],[1690,theory(equality)])).
% cnf(1706,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1691,171,theory(equality)])).
% cnf(1738,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1706,574,theory(equality)])).
% cnf(1739,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))|$false|$false),inference(rw,[status(thm)],[1738,577,theory(equality)])).
% cnf(1740,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[1739,theory(equality)])).
% cnf(1741,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1740,141,theory(equality)])).
% cnf(1742,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1741,142,theory(equality)])).
% cnf(1743,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0|$false|$false),inference(rw,[status(thm)],[1742,576,theory(equality)])).
% cnf(1744,negated_conjecture,(app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0)))=esk50_0),inference(cn,[status(thm)],[1743,theory(equality)])).
% cnf(1766,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0|~ssList(esk55_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1744,210,theory(equality)])).
% cnf(1819,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1766,574,theory(equality)])).
% cnf(1820,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0|$false|$false),inference(rw,[status(thm)],[1819,576,theory(equality)])).
% cnf(1821,negated_conjecture,(app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0)))=esk50_0),inference(cn,[status(thm)],[1820,theory(equality)])).
% cnf(1842,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[258,1821,theory(equality)])).
% cnf(1890,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1842,574,theory(equality)])).
% cnf(1891,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|$false|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[1890,575,theory(equality)])).
% cnf(1892,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|$false|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1891,576,theory(equality)])).
% cnf(1893,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[1892,577,theory(equality)])).
% cnf(1894,negated_conjecture,(esk52_0=esk53_0|esk50_0!=X1|~equalelemsP(X1)|~ssList(X1)),inference(cn,[status(thm)],[1893,theory(equality)])).
% cnf(1895,negated_conjecture,(esk50_0!=X1|~equalelemsP(X1)|~ssList(X1)),inference(sr,[status(thm)],[1894,572,theory(equality)])).
% cnf(2667,plain,(equalelemsP(X1)|~singletonP(X1)|~ssList(X1)),inference(csr,[status(thm)],[630,121])).
% cnf(2668,negated_conjecture,(equalelemsP(esk50_0)|esk51_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[2667,667,theory(equality)])).
% cnf(2669,negated_conjecture,(equalelemsP(esk50_0)|esk51_0=nil|$false),inference(rw,[status(thm)],[2668,585,theory(equality)])).
% cnf(2670,negated_conjecture,(equalelemsP(esk50_0)|esk51_0=nil),inference(cn,[status(thm)],[2669,theory(equality)])).
% cnf(3342,negated_conjecture,(~equalelemsP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[1895,theory(equality)])).
% cnf(3343,negated_conjecture,(~equalelemsP(esk50_0)|$false),inference(rw,[status(thm)],[3342,585,theory(equality)])).
% cnf(3344,negated_conjecture,(~equalelemsP(esk50_0)),inference(cn,[status(thm)],[3343,theory(equality)])).
% cnf(3345,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[2670,3344,theory(equality)])).
% cnf(3364,negated_conjecture,(esk50_0=nil|~segmentP(esk50_0,esk51_0)),inference(rw,[status(thm)],[697,3345,theory(equality)])).
% cnf(3365,negated_conjecture,(esk50_0=nil|~segmentP(esk50_0,nil)),inference(rw,[status(thm)],[3364,3345,theory(equality)])).
% cnf(3373,negated_conjecture,(esk50_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[3365,193,theory(equality)])).
% cnf(3374,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[3373,585,theory(equality)])).
% cnf(3375,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[3374,theory(equality)])).
% cnf(3376,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3344,3375,theory(equality)]),488,theory(equality)])).
% cnf(3377,negated_conjecture,($false),inference(cn,[status(thm)],[3376,theory(equality)])).
% cnf(3378,negated_conjecture,($false),3377,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 388
% # ...of these trivial : 2
% # ...subsumed : 31
% # ...remaining for further processing: 355
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 24
% # Backward-rewritten : 113
% # Generated clauses : 1171
% # ...of the previous two non-trivial : 1015
% # Contextual simplify-reflections : 24
% # Paramodulations : 1075
% # Factorizations : 0
% # Equation resolutions : 95
% # Current number of processed clauses: 211
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 183
% # Current number of unprocessed clauses: 441
% # ...number of literals in the above : 3156
% # Clause-clause subsumption calls (NU) : 2531
% # Rec. Clause-clause subsumption calls : 1630
% # Unit Clause-clause subsumption calls : 182
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 40
% # Indexed BW rewrite successes : 18
% # Backwards rewriting index: 237 leaves, 1.34+/-1.128 terms/leaf
% # Paramod-from index: 109 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 203 leaves, 1.23+/-0.968 terms/leaf
% # -------------------------------------------------
% # User time : 0.109 s
% # System time : 0.006 s
% # Total time : 0.115 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.34 WC
% FINAL PrfWatch: 0.25 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP29378/SWC193+1.tptp
%
%------------------------------------------------------------------------------