TSTP Solution File: SWC307+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC307+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 : art09.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:44:50 EST 2010
% Result : Theorem 1.50s
% Output : Solution 1.50s
% 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/SystemOnTPTP12313/SWC307+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12313/SWC307+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12313/SWC307+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 12409
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.029 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(12, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(15, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)=>~(lt(X2,X1))))),file('/tmp/SRASS.s.p', ax33)).
% fof(19, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>((segmentP(X1,X2)&segmentP(X2,X1))=>X1=X2))),file('/tmp/SRASS.s.p', ax54)).
% fof(22, axiom,![X1]:(ssList(X1)=>segmentP(X1,nil)),file('/tmp/SRASS.s.p', ax57)).
% fof(26, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(27, 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(32, axiom,![X1]:(ssList(X1)=>(strictorderedP(X1)<=>![X2]:(ssItem(X2)=>![X3]:(ssItem(X3)=>![X4]:(ssList(X4)=>![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1=>lt(X2,X3))))))))),file('/tmp/SRASS.s.p', ax12)).
% fof(51, axiom,![X1]:(ssItem(X1)=>strictorderedP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax68)).
% fof(83, axiom,strictorderedP(nil),file('/tmp/SRASS.s.p', ax69)).
% 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)=>![X9]:(ssList(X9)=>(~(app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X1)|~(lt(X6,X5)))))))))|(~(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)=>![X9]:(ssList(X9)=>(~(app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X1)|~(lt(X6,X5)))))))))|(~(singletonP(X3))&neq(X4,nil)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)=>~(lt(X2,X1))))),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% 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)=>![X9]:(ssList(X9)=>(~(app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X1)|~(lt(X6,X5)))))))))|(~(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(164, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[12])).
% fof(165, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[164])).
% fof(166, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[165])).
% cnf(167,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[166])).
% fof(175, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|(~(lt(X1,X2))|~(lt(X2,X1))))),inference(fof_nnf,[status(thm)],[98])).
% fof(176, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))),inference(variable_rename,[status(thm)],[175])).
% fof(177, plain,![X3]:![X4]:((~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[176])).
% cnf(178,plain,(~ssItem(X1)|~lt(X2,X1)|~lt(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[177])).
% fof(188, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|~(segmentP(X2,X1)))|X1=X2))),inference(fof_nnf,[status(thm)],[19])).
% fof(189, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(segmentP(X3,X4))|~(segmentP(X4,X3)))|X3=X4))),inference(variable_rename,[status(thm)],[188])).
% fof(190, plain,![X3]:![X4]:((~(ssList(X4))|((~(segmentP(X3,X4))|~(segmentP(X4,X3)))|X3=X4))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[189])).
% cnf(191,plain,(X1=X2|~ssList(X1)|~segmentP(X2,X1)|~segmentP(X1,X2)|~ssList(X2)),inference(split_conjunct,[status(thm)],[190])).
% fof(199, plain,![X1]:(~(ssList(X1))|segmentP(X1,nil)),inference(fof_nnf,[status(thm)],[22])).
% fof(200, plain,![X2]:(~(ssList(X2))|segmentP(X2,nil)),inference(variable_rename,[status(thm)],[199])).
% cnf(201,plain,(segmentP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[200])).
% fof(215, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[26])).
% fof(216, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[215])).
% fof(217, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[216])).
% cnf(218,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[217])).
% fof(219, 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)],[27])).
% fof(220, 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)],[219])).
% fof(221, 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)],[220])).
% cnf(222,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[221])).
% fof(250, plain,![X1]:(~(ssList(X1))|((~(strictorderedP(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssItem(X3))|![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1)|lt(X2,X3))))))))&(?[X2]:(ssItem(X2)&?[X3]:(ssItem(X3)&?[X4]:(ssList(X4)&?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1&~(lt(X2,X3))))))))|strictorderedP(X1)))),inference(fof_nnf,[status(thm)],[32])).
% fof(251, plain,![X7]:(~(ssList(X7))|((~(strictorderedP(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssItem(X9))|![X10]:(~(ssList(X10))|![X11]:(~(ssList(X11))|![X12]:(~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|lt(X8,X9))))))))&(?[X13]:(ssItem(X13)&?[X14]:(ssItem(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&(app(app(X15,cons(X13,X16)),cons(X14,X17))=X7&~(lt(X13,X14))))))))|strictorderedP(X7)))),inference(variable_rename,[status(thm)],[250])).
% fof(252, plain,![X7]:(~(ssList(X7))|((~(strictorderedP(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssItem(X9))|![X10]:(~(ssList(X10))|![X11]:(~(ssList(X11))|![X12]:(~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|lt(X8,X9))))))))&((ssItem(esk13_1(X7))&(ssItem(esk14_1(X7))&(ssList(esk15_1(X7))&(ssList(esk16_1(X7))&(ssList(esk17_1(X7))&(app(app(esk15_1(X7),cons(esk13_1(X7),esk16_1(X7))),cons(esk14_1(X7),esk17_1(X7)))=X7&~(lt(esk13_1(X7),esk14_1(X7)))))))))|strictorderedP(X7)))),inference(skolemize,[status(esa)],[251])).
% fof(253, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|lt(X8,X9)))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(strictorderedP(X7)))&((ssItem(esk13_1(X7))&(ssItem(esk14_1(X7))&(ssList(esk15_1(X7))&(ssList(esk16_1(X7))&(ssList(esk17_1(X7))&(app(app(esk15_1(X7),cons(esk13_1(X7),esk16_1(X7))),cons(esk14_1(X7),esk17_1(X7)))=X7&~(lt(esk13_1(X7),esk14_1(X7)))))))))|strictorderedP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[252])).
% fof(254, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|lt(X8,X9)))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(strictorderedP(X7)))|~(ssList(X7)))&(((ssItem(esk13_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssItem(esk14_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk15_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk16_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk17_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((app(app(esk15_1(X7),cons(esk13_1(X7),esk16_1(X7))),cons(esk14_1(X7),esk17_1(X7)))=X7|strictorderedP(X7))|~(ssList(X7)))&((~(lt(esk13_1(X7),esk14_1(X7)))|strictorderedP(X7))|~(ssList(X7)))))))))),inference(distribute,[status(thm)],[253])).
% cnf(262,plain,(lt(X2,X3)|~ssList(X1)|~strictorderedP(X1)|~ssItem(X2)|~ssItem(X3)|~ssList(X4)|~ssList(X5)|app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssList(X6)),inference(split_conjunct,[status(thm)],[254])).
% fof(368, plain,![X1]:(~(ssItem(X1))|strictorderedP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[51])).
% fof(369, plain,![X2]:(~(ssItem(X2))|strictorderedP(cons(X2,nil))),inference(variable_rename,[status(thm)],[368])).
% cnf(370,plain,(strictorderedP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[369])).
% cnf(519,plain,(strictorderedP(nil)),inference(split_conjunct,[status(thm)],[83])).
% 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)&?[X9]:(ssList(X9)&(app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9)=X1<(X6,X5))))))))&(singletonP(X3)|~(neq(X4,nil)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&((((X11=X13&X10=X12)&segmentP(X13,X12))&?[X14]:(ssItem(X14)&?[X15]:(ssItem(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&(app(app(app(app(X16,cons(X14,nil)),X17),cons(X15,nil)),X18)=X10<(X15,X14))))))))&(singletonP(X12)|~(neq(X13,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)&(ssList(esk56_0)&(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0<(esk53_0,esk52_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,(lt(esk53_0,esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(573,negated_conjecture,(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(ssList(esk56_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(584,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(585,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(586,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[585,580,theory(equality)])).
% cnf(587,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[584,581,theory(equality)])).
% cnf(590,negated_conjecture,(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk50_0),inference(rw,[status(thm)],[573,580,theory(equality)])).
% cnf(628,negated_conjecture,(~lt(esk52_0,esk53_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[178,572,theory(equality)])).
% cnf(629,negated_conjecture,(~lt(esk52_0,esk53_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[628,577,theory(equality)])).
% cnf(630,negated_conjecture,(~lt(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[629,578,theory(equality)])).
% cnf(631,negated_conjecture,(~lt(esk52_0,esk53_0)),inference(cn,[status(thm)],[630,theory(equality)])).
% cnf(636,plain,(strictorderedP(X1)|~ssItem(esk3_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[370,120,theory(equality)])).
% cnf(669,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[571,136,theory(equality)])).
% cnf(670,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[669,142,theory(equality)])).
% cnf(671,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[670,587,theory(equality)])).
% cnf(672,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil),inference(cn,[status(thm)],[671,theory(equality)])).
% cnf(706,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|~ssList(esk51_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[191,579,theory(equality)])).
% cnf(708,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[706,587,theory(equality)])).
% cnf(709,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|$false|$false),inference(rw,[status(thm)],[708,586,theory(equality)])).
% cnf(710,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)),inference(cn,[status(thm)],[709,theory(equality)])).
% cnf(942,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(esk55_0)|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[590,222,theory(equality)])).
% cnf(954,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(rw,[status(thm)],[942,575,theory(equality)])).
% cnf(955,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[954,576,theory(equality)])).
% cnf(956,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[955,theory(equality)])).
% cnf(1626,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[956,141,theory(equality)])).
% cnf(1627,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1626,142,theory(equality)])).
% cnf(1628,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1627,578,theory(equality)])).
% cnf(1629,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0),inference(cn,[status(thm)],[1628,theory(equality)])).
% cnf(1647,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1629,218,theory(equality)])).
% cnf(1687,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1647,575,theory(equality)])).
% cnf(1688,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1687,578,theory(equality)])).
% cnf(1689,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0),inference(cn,[status(thm)],[1688,theory(equality)])).
% cnf(1706,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|~ssList(esk56_0)|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(spm,[status(thm)],[222,1689,theory(equality)])).
% cnf(1738,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|$false|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(rw,[status(thm)],[1706,574,theory(equality)])).
% cnf(1739,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(cn,[status(thm)],[1738,theory(equality)])).
% cnf(2515,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1739,141,theory(equality)])).
% cnf(2516,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2515,142,theory(equality)])).
% cnf(2517,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|$false|$false),inference(rw,[status(thm)],[2516,577,theory(equality)])).
% cnf(2518,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(cn,[status(thm)],[2517,theory(equality)])).
% cnf(2519,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk52_0,esk55_0))|~ssList(esk54_0)),inference(spm,[status(thm)],[2518,167,theory(equality)])).
% cnf(2520,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk52_0,esk55_0))|$false),inference(rw,[status(thm)],[2519,576,theory(equality)])).
% cnf(2521,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk52_0,esk55_0))),inference(cn,[status(thm)],[2520,theory(equality)])).
% cnf(2522,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2521,141,theory(equality)])).
% cnf(2523,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2522,575,theory(equality)])).
% cnf(2524,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2523,578,theory(equality)])).
% cnf(2525,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0),inference(cn,[status(thm)],[2524,theory(equality)])).
% cnf(2543,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0|~ssList(esk56_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2525,218,theory(equality)])).
% cnf(2556,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2543,574,theory(equality)])).
% cnf(2557,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2556,577,theory(equality)])).
% cnf(2558,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0),inference(cn,[status(thm)],[2557,theory(equality)])).
% cnf(2581,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[262,2558,theory(equality)])).
% cnf(2610,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2581,574,theory(equality)])).
% cnf(2611,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2610,575,theory(equality)])).
% cnf(2612,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2611,576,theory(equality)])).
% cnf(2613,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2612,577,theory(equality)])).
% cnf(2614,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2613,578,theory(equality)])).
% cnf(2615,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2614,theory(equality)])).
% cnf(2616,negated_conjecture,(esk50_0!=X1|~strictorderedP(X1)|~ssList(X1)),inference(sr,[status(thm)],[2615,631,theory(equality)])).
% cnf(3118,plain,(strictorderedP(X1)|~singletonP(X1)|~ssList(X1)),inference(csr,[status(thm)],[636,121])).
% cnf(3119,negated_conjecture,(strictorderedP(esk50_0)|esk51_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[3118,672,theory(equality)])).
% cnf(3120,negated_conjecture,(strictorderedP(esk50_0)|esk51_0=nil|$false),inference(rw,[status(thm)],[3119,586,theory(equality)])).
% cnf(3121,negated_conjecture,(strictorderedP(esk50_0)|esk51_0=nil),inference(cn,[status(thm)],[3120,theory(equality)])).
% cnf(6824,negated_conjecture,(~strictorderedP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[2616,theory(equality)])).
% cnf(6825,negated_conjecture,(~strictorderedP(esk50_0)|$false),inference(rw,[status(thm)],[6824,586,theory(equality)])).
% cnf(6826,negated_conjecture,(~strictorderedP(esk50_0)),inference(cn,[status(thm)],[6825,theory(equality)])).
% cnf(6827,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[3121,6826,theory(equality)])).
% cnf(6848,negated_conjecture,(esk50_0=nil|~segmentP(esk50_0,esk51_0)),inference(rw,[status(thm)],[710,6827,theory(equality)])).
% cnf(6849,negated_conjecture,(esk50_0=nil|~segmentP(esk50_0,nil)),inference(rw,[status(thm)],[6848,6827,theory(equality)])).
% cnf(6857,negated_conjecture,(esk50_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[6849,201,theory(equality)])).
% cnf(6858,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[6857,586,theory(equality)])).
% cnf(6859,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[6858,theory(equality)])).
% cnf(7059,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[6826,6859,theory(equality)]),519,theory(equality)])).
% cnf(7060,negated_conjecture,($false),inference(cn,[status(thm)],[7059,theory(equality)])).
% cnf(7061,negated_conjecture,($false),7060,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 723
% # ...of these trivial : 14
% # ...subsumed : 103
% # ...remaining for further processing: 606
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 77
% # Backward-rewritten : 281
% # Generated clauses : 2380
% # ...of the previous two non-trivial : 2200
% # Contextual simplify-reflections : 73
% # Paramodulations : 2284
% # Factorizations : 0
% # Equation resolutions : 95
% # Current number of processed clauses: 241
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 207
% # Current number of unprocessed clauses: 680
% # ...number of literals in the above : 4235
% # Clause-clause subsumption calls (NU) : 13144
% # Rec. Clause-clause subsumption calls : 10368
% # Unit Clause-clause subsumption calls : 381
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 231
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 265 leaves, 1.34+/-1.080 terms/leaf
% # Paramod-from index: 131 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 237 leaves, 1.20+/-0.899 terms/leaf
% # -------------------------------------------------
% # User time : 0.204 s
% # System time : 0.008 s
% # Total time : 0.212 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.40 CPU 0.49 WC
% FINAL PrfWatch: 0.40 CPU 0.49 WC
% SZS output end Solution for /tmp/SystemOnTPTP12313/SWC307+1.tptp
%
%------------------------------------------------------------------------------