TSTP Solution File: SWC264+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC264+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 : art05.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:30:50 EST 2010
% Result : Theorem 169.85s
% Output : Solution 170.07s
% 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/SystemOnTPTP5134/SWC264+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~co1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... ax66:
% CSA axiom ax66 found
% Looking for CSA axiom ... ax69:
% CSA axiom ax69 found
% Looking for CSA axiom ... ax79:
% CSA axiom ax79 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax80:
% CSA axiom ax80 found
% Looking for CSA axiom ... ax82:
% CSA axiom ax82 found
% Looking for CSA axiom ... ax2:
% CSA axiom ax2 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax26: CSA axiom ax26 found
% Looking for CSA axiom ... ax30:
% CSA axiom ax30 found
% Looking for CSA axiom ... ax31:
% CSA axiom ax31 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax33:
% CSA axiom ax33 found
% Looking for CSA axiom ... ax34:
% CSA axiom ax34 found
% Looking for CSA axiom ... ax40:
% CSA axiom ax40 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax42:
% CSA axiom ax42 found
% Looking for CSA axiom ... ax47:
% CSA axiom ax47 found
% Looking for CSA axiom ... ax49:
% CSA axiom ax49 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ... yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax53:
% CSA axiom ax53 found
% Looking for CSA axiom ... ax55:
% CSA axiom ax55 found
% Looking for CSA axiom ... ax90:
% ax41:
% CSA axiom ax41 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax90:
% ax48:
% CSA axiom ax48 found
% Looking for CSA axiom ... ax54:
% CSA axiom ax54 found
% Looking for CSA axiom ... ax15:
% CSA axiom ax15 found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT ... yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax90:
% ax18:
% CSA axiom ax18 found
% Looking for CSA axiom ... ax19:
% CSA axiom ax19 found
% Looking for CSA axiom ... ax11:
% CSA axiom ax11 found
% ---- Iteration 9 (24 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax90:
% ax12:
% CSA axiom ax12 found
% Looking for CSA axiom ... ax28:
% CSA axiom ax28 found
% Looking for CSA axiom ... ax83:
% CSA axiom ax83 found
% ---- Iteration 10 (27 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax90:
% ax84:
% CSA axiom ax84 found
% Looking for CSA axiom ... ax24:
% CSA axiom ax24 found
% Looking for CSA axiom ... ax46:
% CSA axiom ax46 found
% ---- Iteration 11 (30 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax90:
% ax52:
% CSA axiom ax52 found
% Looking for CSA axiom ... ax58:
% CSA axiom ax58 found
% Looking for CSA axiom ... ax76:
% ax45:
% CSA axiom ax45 found
% ---- Iteration 12 (33 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax90:
% ax76:
% ax51:
% CSA axiom ax51 found
% Looking for CSA axiom ... ax57:
% CSA axiom ax57 found
% Looking for CSA axiom ... ax67:
% CSA axiom ax67 found
% ---- Iteration 13 (36 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax90:
% ax76:
% ax70:
% CSA axiom ax70 found
% Looking for CSA axiom ... ax88:
% CSA axiom ax88 found
% Looking for CSA axiom ... ax89:
% CSA axiom ax89 found
% ---- Iteration 14 (39 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax90:
% ax76:
% ax92:
% CSA axiom ax92 found
% Looking for CSA axiom ... ax93:
% CSA axiom ax93 found
% Looking for CSA axiom ... ax20:
% CSA axiom ax20 found
% ---- Iteration 15 (42 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :ax20:ax93:ax92:ax89:ax88:ax70:ax67:ax57:ax51:ax45:ax58:ax52:ax46:ax24:ax84:ax83:ax28:ax12:ax11:ax19:ax18:ax15:ax54:ax48:ax41:ax55:ax53:ax49:ax47:ax42:ax40:ax34:ax33:ax31:ax30:ax26:ax2:ax82:ax80:ax79:ax69:ax66 (42)
% Unselected axioms are ... :ax90:ax76:ax21:ax5:ax6:ax7:ax17:ax22:ax44:ax75:ax91:ax27:ax32:ax35:ax65:ax68:ax4:ax23:ax25:ax37:ax43:ax50:ax56:ax29:ax16:ax85:ax86:ax87:ax1:ax81:ax8:ax9:ax10:ax36:ax77:ax3:ax13:ax14:ax59:ax61:ax63:ax71:ax73:ax39:ax60:ax62:ax64:ax72:ax74:ax78:ax38:ax94:ax95 (53)
% SZS status THM for /tmp/SystemOnTPTP5134/SWC264+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP5134/SWC264+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 13495
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)<=>(~(X1=X2)&leq(X1,X2))))),file('/tmp/SRASS.s.p', ax93)).
% fof(18, 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(19, axiom,![X1]:(ssList(X1)=>(totalorderedP(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=>leq(X2,X3))))))))),file('/tmp/SRASS.s.p', ax11)).
% fof(43, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|~(strictorderedP(X3)))|totalorderedP(X1))))),file('/tmp/SRASS.s.p', co1)).
% fof(44, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|~(strictorderedP(X3)))|totalorderedP(X1)))))),inference(assume_negation,[status(cth)],[43])).
% fof(46, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|~(strictorderedP(X3)))|totalorderedP(X1)))))),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(54, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|((~(lt(X1,X2))|(~(X1=X2)&leq(X1,X2)))&((X1=X2|~(leq(X1,X2)))|lt(X1,X2))))),inference(fof_nnf,[status(thm)],[2])).
% fof(55, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|((~(lt(X3,X4))|(~(X3=X4)&leq(X3,X4)))&((X3=X4|~(leq(X3,X4)))|lt(X3,X4))))),inference(variable_rename,[status(thm)],[54])).
% fof(56, plain,![X3]:![X4]:((~(ssItem(X4))|((~(lt(X3,X4))|(~(X3=X4)&leq(X3,X4)))&((X3=X4|~(leq(X3,X4)))|lt(X3,X4))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[55])).
% fof(57, plain,![X3]:![X4]:(((((~(X3=X4)|~(lt(X3,X4)))|~(ssItem(X4)))|~(ssItem(X3)))&(((leq(X3,X4)|~(lt(X3,X4)))|~(ssItem(X4)))|~(ssItem(X3))))&((((X3=X4|~(leq(X3,X4)))|lt(X3,X4))|~(ssItem(X4)))|~(ssItem(X3)))),inference(distribute,[status(thm)],[56])).
% cnf(59,plain,(leq(X1,X2)|~ssItem(X1)|~ssItem(X2)|~lt(X1,X2)),inference(split_conjunct,[status(thm)],[57])).
% fof(130, 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)],[18])).
% fof(131, 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)],[130])).
% fof(132, 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(esk3_1(X7))&(ssItem(esk4_1(X7))&(ssList(esk5_1(X7))&(ssList(esk6_1(X7))&(ssList(esk7_1(X7))&(app(app(esk5_1(X7),cons(esk3_1(X7),esk6_1(X7))),cons(esk4_1(X7),esk7_1(X7)))=X7&~(lt(esk3_1(X7),esk4_1(X7)))))))))|strictorderedP(X7)))),inference(skolemize,[status(esa)],[131])).
% fof(133, 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(esk3_1(X7))&(ssItem(esk4_1(X7))&(ssList(esk5_1(X7))&(ssList(esk6_1(X7))&(ssList(esk7_1(X7))&(app(app(esk5_1(X7),cons(esk3_1(X7),esk6_1(X7))),cons(esk4_1(X7),esk7_1(X7)))=X7&~(lt(esk3_1(X7),esk4_1(X7)))))))))|strictorderedP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[132])).
% fof(134, 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(esk3_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssItem(esk4_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk5_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk6_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk7_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((app(app(esk5_1(X7),cons(esk3_1(X7),esk6_1(X7))),cons(esk4_1(X7),esk7_1(X7)))=X7|strictorderedP(X7))|~(ssList(X7)))&((~(lt(esk3_1(X7),esk4_1(X7)))|strictorderedP(X7))|~(ssList(X7)))))))))),inference(distribute,[status(thm)],[133])).
% cnf(142,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)],[134])).
% fof(143, plain,![X1]:(~(ssList(X1))|((~(totalorderedP(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)|leq(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&~(leq(X2,X3))))))))|totalorderedP(X1)))),inference(fof_nnf,[status(thm)],[19])).
% fof(144, plain,![X7]:(~(ssList(X7))|((~(totalorderedP(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)|leq(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&~(leq(X13,X14))))))))|totalorderedP(X7)))),inference(variable_rename,[status(thm)],[143])).
% fof(145, plain,![X7]:(~(ssList(X7))|((~(totalorderedP(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)|leq(X8,X9))))))))&((ssItem(esk8_1(X7))&(ssItem(esk9_1(X7))&(ssList(esk10_1(X7))&(ssList(esk11_1(X7))&(ssList(esk12_1(X7))&(app(app(esk10_1(X7),cons(esk8_1(X7),esk11_1(X7))),cons(esk9_1(X7),esk12_1(X7)))=X7&~(leq(esk8_1(X7),esk9_1(X7)))))))))|totalorderedP(X7)))),inference(skolemize,[status(esa)],[144])).
% fof(146, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|leq(X8,X9)))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(totalorderedP(X7)))&((ssItem(esk8_1(X7))&(ssItem(esk9_1(X7))&(ssList(esk10_1(X7))&(ssList(esk11_1(X7))&(ssList(esk12_1(X7))&(app(app(esk10_1(X7),cons(esk8_1(X7),esk11_1(X7))),cons(esk9_1(X7),esk12_1(X7)))=X7&~(leq(esk8_1(X7),esk9_1(X7)))))))))|totalorderedP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[145])).
% fof(147, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|leq(X8,X9)))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(totalorderedP(X7)))|~(ssList(X7)))&(((ssItem(esk8_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssItem(esk9_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk10_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk11_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((ssList(esk12_1(X7))|totalorderedP(X7))|~(ssList(X7)))&(((app(app(esk10_1(X7),cons(esk8_1(X7),esk11_1(X7))),cons(esk9_1(X7),esk12_1(X7)))=X7|totalorderedP(X7))|~(ssList(X7)))&((~(leq(esk8_1(X7),esk9_1(X7)))|totalorderedP(X7))|~(ssList(X7)))))))))),inference(distribute,[status(thm)],[146])).
% cnf(148,plain,(totalorderedP(X1)|~ssList(X1)|~leq(esk8_1(X1),esk9_1(X1))),inference(split_conjunct,[status(thm)],[147])).
% cnf(149,plain,(totalorderedP(X1)|app(app(esk10_1(X1),cons(esk8_1(X1),esk11_1(X1))),cons(esk9_1(X1),esk12_1(X1)))=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[147])).
% cnf(150,plain,(totalorderedP(X1)|ssList(esk12_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[147])).
% cnf(151,plain,(totalorderedP(X1)|ssList(esk11_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[147])).
% cnf(152,plain,(totalorderedP(X1)|ssList(esk10_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[147])).
% cnf(153,plain,(totalorderedP(X1)|ssItem(esk9_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[147])).
% cnf(154,plain,(totalorderedP(X1)|ssItem(esk8_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[147])).
% fof(243, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:((((ssList(X4)&X2=X4)&X1=X3)&strictorderedP(X3))&~(totalorderedP(X1)))))),inference(fof_nnf,[status(thm)],[46])).
% fof(244, negated_conjecture,?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:((((ssList(X8)&X6=X8)&X5=X7)&strictorderedP(X7))&~(totalorderedP(X5)))))),inference(variable_rename,[status(thm)],[243])).
% fof(245, negated_conjecture,(ssList(esk15_0)&(ssList(esk16_0)&(ssList(esk17_0)&((((ssList(esk18_0)&esk16_0=esk18_0)&esk15_0=esk17_0)&strictorderedP(esk17_0))&~(totalorderedP(esk15_0)))))),inference(skolemize,[status(esa)],[244])).
% cnf(246,negated_conjecture,(~totalorderedP(esk15_0)),inference(split_conjunct,[status(thm)],[245])).
% cnf(247,negated_conjecture,(strictorderedP(esk17_0)),inference(split_conjunct,[status(thm)],[245])).
% cnf(248,negated_conjecture,(esk15_0=esk17_0),inference(split_conjunct,[status(thm)],[245])).
% cnf(253,negated_conjecture,(ssList(esk15_0)),inference(split_conjunct,[status(thm)],[245])).
% cnf(257,negated_conjecture,(strictorderedP(esk15_0)),inference(rw,[status(thm)],[247,248,theory(equality)])).
% cnf(354,plain,(lt(esk8_1(X1),esk9_1(X1))|totalorderedP(X1)|X1!=X2|~strictorderedP(X2)|~ssItem(esk9_1(X1))|~ssItem(esk8_1(X1))|~ssList(esk12_1(X1))|~ssList(esk11_1(X1))|~ssList(esk10_1(X1))|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[142,149,theory(equality)])).
% cnf(356,plain,(lt(esk8_1(X1),esk9_1(X1))|totalorderedP(X1)|~strictorderedP(X1)|~ssItem(esk9_1(X1))|~ssItem(esk8_1(X1))|~ssList(esk12_1(X1))|~ssList(esk11_1(X1))|~ssList(esk10_1(X1))|~ssList(X1)),inference(er,[status(thm)],[354,theory(equality)])).
% cnf(565,plain,(totalorderedP(X1)|lt(esk8_1(X1),esk9_1(X1))|~strictorderedP(X1)|~ssItem(esk9_1(X1))|~ssItem(esk8_1(X1))|~ssList(esk12_1(X1))|~ssList(esk11_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[356,152])).
% cnf(566,plain,(totalorderedP(X1)|lt(esk8_1(X1),esk9_1(X1))|~strictorderedP(X1)|~ssItem(esk9_1(X1))|~ssItem(esk8_1(X1))|~ssList(esk12_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[565,151])).
% cnf(567,plain,(totalorderedP(X1)|lt(esk8_1(X1),esk9_1(X1))|~strictorderedP(X1)|~ssItem(esk9_1(X1))|~ssItem(esk8_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[566,150])).
% cnf(568,plain,(totalorderedP(X1)|lt(esk8_1(X1),esk9_1(X1))|~strictorderedP(X1)|~ssItem(esk9_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[567,154])).
% cnf(569,plain,(totalorderedP(X1)|lt(esk8_1(X1),esk9_1(X1))|~strictorderedP(X1)|~ssList(X1)),inference(csr,[status(thm)],[568,153])).
% cnf(570,plain,(leq(esk8_1(X1),esk9_1(X1))|totalorderedP(X1)|~ssItem(esk9_1(X1))|~ssItem(esk8_1(X1))|~strictorderedP(X1)|~ssList(X1)),inference(spm,[status(thm)],[59,569,theory(equality)])).
% cnf(575,plain,(totalorderedP(X1)|leq(esk8_1(X1),esk9_1(X1))|~strictorderedP(X1)|~ssItem(esk9_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[570,154])).
% cnf(576,plain,(totalorderedP(X1)|leq(esk8_1(X1),esk9_1(X1))|~strictorderedP(X1)|~ssList(X1)),inference(csr,[status(thm)],[575,153])).
% cnf(577,plain,(totalorderedP(X1)|~strictorderedP(X1)|~ssList(X1)),inference(csr,[status(thm)],[576,148])).
% cnf(578,negated_conjecture,(~strictorderedP(esk15_0)|~ssList(esk15_0)),inference(spm,[status(thm)],[246,577,theory(equality)])).
% cnf(581,negated_conjecture,($false|~ssList(esk15_0)),inference(rw,[status(thm)],[578,257,theory(equality)])).
% cnf(582,negated_conjecture,($false|$false),inference(rw,[status(thm)],[581,253,theory(equality)])).
% cnf(583,negated_conjecture,($false),inference(cn,[status(thm)],[582,theory(equality)])).
% cnf(584,negated_conjecture,($false),583,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 179
% # ...of these trivial : 2
% # ...subsumed : 43
% # ...remaining for further processing: 134
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 223
% # ...of the previous two non-trivial : 189
% # Contextual simplify-reflections : 100
% # Paramodulations : 200
% # Factorizations : 0
% # Equation resolutions : 23
% # Current number of processed clauses: 130
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 119
% # Current number of unprocessed clauses: 92
% # ...number of literals in the above : 754
% # Clause-clause subsumption calls (NU) : 3218
% # Rec. Clause-clause subsumption calls : 761
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 113 leaves, 1.67+/-1.565 terms/leaf
% # Paramod-from index: 47 leaves, 1.02+/-0.144 terms/leaf
% # Paramod-into index: 95 leaves, 1.42+/-1.419 terms/leaf
% # -------------------------------------------------
% # User time : 0.044 s
% # System time : 0.004 s
% # Total time : 0.048 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.23 WC
% FINAL PrfWatch: 0.14 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP5134/SWC264+1.tptp
%
%------------------------------------------------------------------------------