TSTP Solution File: SWC165+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC165+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 : art07.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:15:23 EST 2010
% Result : Theorem 1.39s
% Output : Solution 1.39s
% 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/SystemOnTPTP30788/SWC165+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30788/SWC165+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30788/SWC165+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 30884
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax1)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(11, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(21, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(22, 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(25, axiom,![X1]:(ssItem(X1)=>~(lt(X1,X1))),file('/tmp/SRASS.s.p', ax90)).
% fof(27, 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(45, axiom,![X1]:(ssItem(X1)=>strictorderedP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax68)).
% fof(82, 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))|![X5]:(ssItem(X5)=>![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:(ssList(X8)=>(~(app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X1)|neq(X5,X6)))))))|(![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:(ssList(X11)=>(((~(cons(X9,nil)=X3)|~(app(app(X10,X3),X11)=X4))|?[X12]:((ssItem(X12)&memberP(X10,X12))<(X9,X12)))|?[X13]:((ssItem(X13)&memberP(X11,X13))<(X13,X9))))))&(~(nil=X4)|~(nil=X3)))))))),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]:(ssItem(X5)=>![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>![X8]:(ssList(X8)=>(~(app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X1)|neq(X5,X6)))))))|(![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:(ssList(X11)=>(((~(cons(X9,nil)=X3)|~(app(app(X10,X3),X11)=X4))|?[X12]:((ssItem(X12)&memberP(X10,X12))<(X9,X12)))|?[X13]:((ssItem(X13)&memberP(X11,X13))<(X13,X9))))))&(~(nil=X4)|~(nil=X3))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(100, plain,![X1]:(ssItem(X1)=>~(lt(X1,X1))),inference(fof_simplification,[status(thm)],[25,theory(equality)])).
% fof(103, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(104, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[103])).
% fof(105, plain,![X3]:![X4]:((~(ssItem(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssItem(X4)))|~(ssItem(X3)))&(((X3=X4|neq(X3,X4))|~(ssItem(X4)))|~(ssItem(X3)))),inference(distribute,[status(thm)],[105])).
% cnf(107,plain,(neq(X1,X2)|X1=X2|~ssItem(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[106])).
% fof(129, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(130, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[129])).
% fof(131, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[130])).
% cnf(132,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[131])).
% cnf(133,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% fof(155, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(156, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[155])).
% fof(157, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[156])).
% cnf(158,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[157])).
% fof(199, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[21])).
% fof(200, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[199])).
% fof(201, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[200])).
% cnf(202,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[201])).
% fof(203, 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)],[22])).
% fof(204, 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)],[203])).
% fof(205, 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)],[204])).
% cnf(206,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[205])).
% fof(217, plain,![X1]:(~(ssItem(X1))|~(lt(X1,X1))),inference(fof_nnf,[status(thm)],[100])).
% fof(218, plain,![X2]:(~(ssItem(X2))|~(lt(X2,X2))),inference(variable_rename,[status(thm)],[217])).
% cnf(219,plain,(~lt(X1,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[218])).
% fof(234, 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)],[27])).
% fof(235, 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)],[234])).
% fof(236, 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(esk12_1(X7))&(ssItem(esk13_1(X7))&(ssList(esk14_1(X7))&(ssList(esk15_1(X7))&(ssList(esk16_1(X7))&(app(app(esk14_1(X7),cons(esk12_1(X7),esk15_1(X7))),cons(esk13_1(X7),esk16_1(X7)))=X7&~(lt(esk12_1(X7),esk13_1(X7)))))))))|strictorderedP(X7)))),inference(skolemize,[status(esa)],[235])).
% fof(237, 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(esk12_1(X7))&(ssItem(esk13_1(X7))&(ssList(esk14_1(X7))&(ssList(esk15_1(X7))&(ssList(esk16_1(X7))&(app(app(esk14_1(X7),cons(esk12_1(X7),esk15_1(X7))),cons(esk13_1(X7),esk16_1(X7)))=X7&~(lt(esk12_1(X7),esk13_1(X7)))))))))|strictorderedP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[236])).
% fof(238, 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(esk12_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssItem(esk13_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk14_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk15_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk16_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((app(app(esk14_1(X7),cons(esk12_1(X7),esk15_1(X7))),cons(esk13_1(X7),esk16_1(X7)))=X7|strictorderedP(X7))|~(ssList(X7)))&((~(lt(esk12_1(X7),esk13_1(X7)))|strictorderedP(X7))|~(ssList(X7)))))))))),inference(distribute,[status(thm)],[237])).
% cnf(246,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)],[238])).
% fof(344, plain,![X1]:(~(ssItem(X1))|strictorderedP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[45])).
% fof(345, plain,![X2]:(~(ssItem(X2))|strictorderedP(cons(X2,nil))),inference(variable_rename,[status(thm)],[344])).
% cnf(346,plain,(strictorderedP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[345])).
% cnf(514,plain,(strictorderedP(nil)),inference(split_conjunct,[status(thm)],[82])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=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&~(neq(X5,X6))))))))&(?[X9]:(ssItem(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&(((cons(X9,nil)=X3&app(app(X10,X3),X11)=X4)&![X12]:((~(ssItem(X12))|~(memberP(X10,X12)))|~(lt(X9,X12))))&![X13]:((~(ssItem(X13))|~(memberP(X11,X13)))|~(lt(X13,X9)))))))|(nil=X4&nil=X3))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&(((X15=X17&X14=X16)&?[X18]:(ssItem(X18)&?[X19]:(ssItem(X19)&?[X20]:(ssList(X20)&?[X21]:(ssList(X21)&(app(app(app(X20,cons(X18,nil)),cons(X19,nil)),X21)=X14&~(neq(X18,X19))))))))&(?[X22]:(ssItem(X22)&?[X23]:(ssList(X23)&?[X24]:(ssList(X24)&(((cons(X22,nil)=X16&app(app(X23,X16),X24)=X17)&![X25]:((~(ssItem(X25))|~(memberP(X23,X25)))|~(lt(X22,X25))))&![X26]:((~(ssItem(X26))|~(memberP(X24,X26)))|~(lt(X26,X22)))))))|(nil=X17&nil=X16))))))),inference(variable_rename,[status(thm)],[567])).
% fof(569, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((esk49_0=esk51_0&esk48_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&~(neq(esk52_0,esk53_0))))))))&((ssItem(esk56_0)&(ssList(esk57_0)&(ssList(esk58_0)&(((cons(esk56_0,nil)=esk50_0&app(app(esk57_0,esk50_0),esk58_0)=esk51_0)&![X25]:((~(ssItem(X25))|~(memberP(esk57_0,X25)))|~(lt(esk56_0,X25))))&![X26]:((~(ssItem(X26))|~(memberP(esk58_0,X26)))|~(lt(X26,esk56_0)))))))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[568])).
% fof(570, negated_conjecture,![X25]:![X26]:((((((((((((~(ssItem(X26))|~(memberP(esk58_0,X26)))|~(lt(X26,esk56_0)))&(((~(ssItem(X25))|~(memberP(esk57_0,X25)))|~(lt(esk56_0,X25)))&(cons(esk56_0,nil)=esk50_0&app(app(esk57_0,esk50_0),esk58_0)=esk51_0)))&ssList(esk58_0))&ssList(esk57_0))&ssItem(esk56_0))|(nil=esk51_0&nil=esk50_0))&((esk49_0=esk51_0&esk48_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&~(neq(esk52_0,esk53_0)))))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[569])).
% fof(571, negated_conjecture,![X25]:![X26]:(((((((((((nil=esk51_0|((~(ssItem(X26))|~(memberP(esk58_0,X26)))|~(lt(X26,esk56_0))))&(nil=esk50_0|((~(ssItem(X26))|~(memberP(esk58_0,X26)))|~(lt(X26,esk56_0)))))&(((nil=esk51_0|((~(ssItem(X25))|~(memberP(esk57_0,X25)))|~(lt(esk56_0,X25))))&(nil=esk50_0|((~(ssItem(X25))|~(memberP(esk57_0,X25)))|~(lt(esk56_0,X25)))))&(((nil=esk51_0|cons(esk56_0,nil)=esk50_0)&(nil=esk50_0|cons(esk56_0,nil)=esk50_0))&((nil=esk51_0|app(app(esk57_0,esk50_0),esk58_0)=esk51_0)&(nil=esk50_0|app(app(esk57_0,esk50_0),esk58_0)=esk51_0)))))&((nil=esk51_0|ssList(esk58_0))&(nil=esk50_0|ssList(esk58_0))))&((nil=esk51_0|ssList(esk57_0))&(nil=esk50_0|ssList(esk57_0))))&((nil=esk51_0|ssItem(esk56_0))&(nil=esk50_0|ssItem(esk56_0))))&((esk49_0=esk51_0&esk48_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&~(neq(esk52_0,esk53_0)))))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(~neq(esk52_0,esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(ssItem(esk56_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(592,negated_conjecture,(cons(esk56_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(598,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,582,theory(equality)])).
% cnf(602,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk50_0),inference(rw,[status(thm)],[577,582,theory(equality)])).
% cnf(611,negated_conjecture,(strictorderedP(esk50_0)|esk50_0=nil|~ssItem(esk56_0)),inference(spm,[status(thm)],[346,592,theory(equality)])).
% cnf(732,negated_conjecture,(esk52_0=esk53_0|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[576,107,theory(equality)])).
% cnf(733,negated_conjecture,(esk52_0=esk53_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[732,580,theory(equality)])).
% cnf(734,negated_conjecture,(esk52_0=esk53_0|$false|$false),inference(rw,[status(thm)],[733,581,theory(equality)])).
% cnf(735,negated_conjecture,(esk52_0=esk53_0),inference(cn,[status(thm)],[734,theory(equality)])).
% cnf(1591,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,nil)),esk55_0)=esk50_0),inference(rw,[status(thm)],[602,735,theory(equality)])).
% cnf(1828,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))|~ssList(esk55_0)|~ssList(cons(esk52_0,nil))|~ssList(app(esk54_0,cons(esk52_0,nil)))),inference(spm,[status(thm)],[206,1591,theory(equality)])).
% cnf(1860,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))|$false|~ssList(cons(esk52_0,nil))|~ssList(app(esk54_0,cons(esk52_0,nil)))),inference(rw,[status(thm)],[1828,578,theory(equality)])).
% cnf(1861,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))|~ssList(cons(esk52_0,nil))|~ssList(app(esk54_0,cons(esk52_0,nil)))),inference(cn,[status(thm)],[1860,theory(equality)])).
% cnf(1870,negated_conjecture,(esk50_0=nil|strictorderedP(esk50_0)),inference(csr,[status(thm)],[611,584])).
% cnf(3131,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,nil)))|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1861,132,theory(equality)])).
% cnf(3132,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,nil)))|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3131,133,theory(equality)])).
% cnf(3133,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,nil)))|$false|$false),inference(rw,[status(thm)],[3132,581,theory(equality)])).
% cnf(3134,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,nil)))),inference(cn,[status(thm)],[3133,theory(equality)])).
% cnf(3135,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[3134,158,theory(equality)])).
% cnf(3136,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[3135,579,theory(equality)])).
% cnf(3137,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[3136,theory(equality)])).
% cnf(3138,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[3137,132,theory(equality)])).
% cnf(3139,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3138,133,theory(equality)])).
% cnf(3140,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[3139,581,theory(equality)])).
% cnf(3141,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0))=esk50_0),inference(cn,[status(thm)],[3140,theory(equality)])).
% cnf(3159,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0))=esk50_0|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[3141,202,theory(equality)])).
% cnf(3172,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[3159,578,theory(equality)])).
% cnf(3173,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[3172,581,theory(equality)])).
% cnf(3174,negated_conjecture,(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0))=esk50_0),inference(cn,[status(thm)],[3173,theory(equality)])).
% cnf(3197,negated_conjecture,(lt(esk52_0,esk52_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(esk55_0)|~ssList(nil)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[246,3174,theory(equality)])).
% cnf(3226,negated_conjecture,(lt(esk52_0,esk52_0)|esk50_0!=X1|~strictorderedP(X1)|$false|~ssList(nil)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[3197,578,theory(equality)])).
% cnf(3227,negated_conjecture,(lt(esk52_0,esk52_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[3226,133,theory(equality)])).
% cnf(3228,negated_conjecture,(lt(esk52_0,esk52_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[3227,579,theory(equality)])).
% cnf(3229,negated_conjecture,(lt(esk52_0,esk52_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[3228,581,theory(equality)])).
% cnf(3230,negated_conjecture,(lt(esk52_0,esk52_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[3229,theory(equality)])).
% cnf(4140,negated_conjecture,(lt(esk52_0,esk52_0)|~strictorderedP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[3230,theory(equality)])).
% cnf(4141,negated_conjecture,(lt(esk52_0,esk52_0)|~strictorderedP(esk50_0)|$false),inference(rw,[status(thm)],[4140,598,theory(equality)])).
% cnf(4142,negated_conjecture,(lt(esk52_0,esk52_0)|~strictorderedP(esk50_0)),inference(cn,[status(thm)],[4141,theory(equality)])).
% cnf(4143,negated_conjecture,(lt(esk52_0,esk52_0)|esk50_0=nil),inference(spm,[status(thm)],[4142,1870,theory(equality)])).
% cnf(4152,negated_conjecture,(esk50_0=nil|~ssItem(esk52_0)),inference(spm,[status(thm)],[219,4143,theory(equality)])).
% cnf(4157,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[4152,581,theory(equality)])).
% cnf(4158,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[4157,theory(equality)])).
% cnf(4168,negated_conjecture,(lt(esk52_0,esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4142,4158,theory(equality)]),514,theory(equality)])).
% cnf(4169,negated_conjecture,(lt(esk52_0,esk52_0)),inference(cn,[status(thm)],[4168,theory(equality)])).
% cnf(4381,negated_conjecture,(~ssItem(esk52_0)),inference(spm,[status(thm)],[219,4169,theory(equality)])).
% cnf(4386,negated_conjecture,($false),inference(rw,[status(thm)],[4381,581,theory(equality)])).
% cnf(4387,negated_conjecture,($false),inference(cn,[status(thm)],[4386,theory(equality)])).
% cnf(4388,negated_conjecture,($false),4387,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 480
% # ...of these trivial : 6
% # ...subsumed : 66
% # ...remaining for further processing: 408
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 26
% # Backward-rewritten : 163
% # Generated clauses : 1564
% # ...of the previous two non-trivial : 1453
% # Contextual simplify-reflections : 85
% # Paramodulations : 1467
% # Factorizations : 0
% # Equation resolutions : 97
% # Current number of processed clauses: 213
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 183
% # Current number of unprocessed clauses: 509
% # ...number of literals in the above : 3277
% # Clause-clause subsumption calls (NU) : 4717
% # Rec. Clause-clause subsumption calls : 2969
% # Unit Clause-clause subsumption calls : 91
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 42
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 242 leaves, 1.33+/-1.117 terms/leaf
% # Paramod-from index: 110 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 206 leaves, 1.23+/-0.961 terms/leaf
% # -------------------------------------------------
% # User time : 0.131 s
% # System time : 0.007 s
% # Total time : 0.138 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.28 CPU 0.38 WC
% FINAL PrfWatch: 0.28 CPU 0.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP30788/SWC165+1.tptp
%
%------------------------------------------------------------------------------