TSTP Solution File: SWC379+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC379+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 : art03.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:59:56 EST 2010
% Result : Theorem 1.33s
% Output : Solution 1.33s
% 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/SystemOnTPTP30063/SWC379+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30063/SWC379+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30063/SWC379+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 30159
% 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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|?[X5]:(ssItem(X5)&(((~(memberP(X3,X5))&![X6]:(ssItem(X6)=>((~(memberP(X4,X6))|~(leq(X6,X5)))|X5=X6)))&memberP(X4,X5))|(memberP(X3,X5)&(~(memberP(X4,X5))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X6,X5)))))))|![X7]:(ssItem(X7)=>((~(memberP(X1,X7))&(~(memberP(X2,X7))|?[X8]:(((ssItem(X8)&~(X7=X8))&memberP(X2,X8))&leq(X8,X7))))|((![X8]:(ssItem(X8)=>((~(memberP(X2,X8))|~(leq(X8,X7)))|X7=X8))&memberP(X2,X7))&memberP(X1,X7))))))))),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)&(((~(memberP(X3,X5))&![X6]:(ssItem(X6)=>((~(memberP(X4,X6))|~(leq(X6,X5)))|X5=X6)))&memberP(X4,X5))|(memberP(X3,X5)&(~(memberP(X4,X5))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X6,X5)))))))|![X7]:(ssItem(X7)=>((~(memberP(X1,X7))&(~(memberP(X2,X7))|?[X8]:(((ssItem(X8)&~(X7=X8))&memberP(X2,X8))&leq(X8,X7))))|((![X8]:(ssItem(X8)=>((~(memberP(X2,X8))|~(leq(X8,X7)))|X7=X8))&memberP(X2,X7))&memberP(X1,X7)))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|?[X5]:(ssItem(X5)&(((~(memberP(X3,X5))&![X6]:(ssItem(X6)=>((~(memberP(X4,X6))|~(leq(X6,X5)))|X5=X6)))&memberP(X4,X5))|(memberP(X3,X5)&(~(memberP(X4,X5))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X6,X5)))))))|![X7]:(ssItem(X7)=>((~(memberP(X1,X7))&(~(memberP(X2,X7))|?[X8]:(((ssItem(X8)&~(X7=X8))&memberP(X2,X8))&leq(X8,X7))))|((![X8]:(ssItem(X8)=>((~(memberP(X2,X8))|~(leq(X8,X7)))|X7=X8))&memberP(X2,X7))&memberP(X1,X7)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&![X5]:(~(ssItem(X5))|(((memberP(X3,X5)|?[X6]:(ssItem(X6)&((memberP(X4,X6)&leq(X6,X5))&~(X5=X6))))|~(memberP(X4,X5)))&(~(memberP(X3,X5))|(memberP(X4,X5)&![X6]:(((~(ssItem(X6))|X5=X6)|~(memberP(X4,X6)))|~(leq(X6,X5))))))))&?[X7]:(ssItem(X7)&((memberP(X1,X7)|(memberP(X2,X7)&![X8]:(((~(ssItem(X8))|X7=X8)|~(memberP(X2,X8)))|~(leq(X8,X7)))))&((?[X8]:(ssItem(X8)&((memberP(X2,X8)&leq(X8,X7))&~(X7=X8)))|~(memberP(X2,X7)))|~(memberP(X1,X7)))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&(((X10=X12&X9=X11)&![X13]:(~(ssItem(X13))|(((memberP(X11,X13)|?[X14]:(ssItem(X14)&((memberP(X12,X14)&leq(X14,X13))&~(X13=X14))))|~(memberP(X12,X13)))&(~(memberP(X11,X13))|(memberP(X12,X13)&![X15]:(((~(ssItem(X15))|X13=X15)|~(memberP(X12,X15)))|~(leq(X15,X13))))))))&?[X16]:(ssItem(X16)&((memberP(X9,X16)|(memberP(X10,X16)&![X17]:(((~(ssItem(X17))|X16=X17)|~(memberP(X10,X17)))|~(leq(X17,X16)))))&((?[X18]:(ssItem(X18)&((memberP(X10,X18)&leq(X18,X16))&~(X16=X18)))|~(memberP(X10,X16)))|~(memberP(X9,X16)))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((esk49_0=esk51_0&esk48_0=esk50_0)&![X13]:(~(ssItem(X13))|(((memberP(esk50_0,X13)|(ssItem(esk52_1(X13))&((memberP(esk51_0,esk52_1(X13))&leq(esk52_1(X13),X13))&~(X13=esk52_1(X13)))))|~(memberP(esk51_0,X13)))&(~(memberP(esk50_0,X13))|(memberP(esk51_0,X13)&![X15]:(((~(ssItem(X15))|X13=X15)|~(memberP(esk51_0,X15)))|~(leq(X15,X13))))))))&(ssItem(esk53_0)&((memberP(esk48_0,esk53_0)|(memberP(esk49_0,esk53_0)&![X17]:(((~(ssItem(X17))|esk53_0=X17)|~(memberP(esk49_0,X17)))|~(leq(X17,esk53_0)))))&(((ssItem(esk54_0)&((memberP(esk49_0,esk54_0)&leq(esk54_0,esk53_0))&~(esk53_0=esk54_0)))|~(memberP(esk49_0,esk53_0)))|~(memberP(esk48_0,esk53_0)))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X15]:![X17]:((((((((((((~(ssItem(X17))|esk53_0=X17)|~(memberP(esk49_0,X17)))|~(leq(X17,esk53_0)))&memberP(esk49_0,esk53_0))|memberP(esk48_0,esk53_0))&(((ssItem(esk54_0)&((memberP(esk49_0,esk54_0)&leq(esk54_0,esk53_0))&~(esk53_0=esk54_0)))|~(memberP(esk49_0,esk53_0)))|~(memberP(esk48_0,esk53_0))))&ssItem(esk53_0))&((((((((~(ssItem(X15))|X13=X15)|~(memberP(esk51_0,X15)))|~(leq(X15,X13)))&memberP(esk51_0,X13))|~(memberP(esk50_0,X13)))&((memberP(esk50_0,X13)|(ssItem(esk52_1(X13))&((memberP(esk51_0,esk52_1(X13))&leq(esk52_1(X13),X13))&~(X13=esk52_1(X13)))))|~(memberP(esk51_0,X13))))|~(ssItem(X13)))&(esk49_0=esk51_0&esk48_0=esk50_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X13]:![X15]:![X17]:((((((((((((~(ssItem(X17))|esk53_0=X17)|~(memberP(esk49_0,X17)))|~(leq(X17,esk53_0)))|memberP(esk48_0,esk53_0))&(memberP(esk49_0,esk53_0)|memberP(esk48_0,esk53_0)))&(((ssItem(esk54_0)|~(memberP(esk49_0,esk53_0)))|~(memberP(esk48_0,esk53_0)))&((((memberP(esk49_0,esk54_0)|~(memberP(esk49_0,esk53_0)))|~(memberP(esk48_0,esk53_0)))&((leq(esk54_0,esk53_0)|~(memberP(esk49_0,esk53_0)))|~(memberP(esk48_0,esk53_0))))&((~(esk53_0=esk54_0)|~(memberP(esk49_0,esk53_0)))|~(memberP(esk48_0,esk53_0))))))&ssItem(esk53_0))&((((((((~(ssItem(X15))|X13=X15)|~(memberP(esk51_0,X15)))|~(leq(X15,X13)))|~(memberP(esk50_0,X13)))|~(ssItem(X13)))&((memberP(esk51_0,X13)|~(memberP(esk50_0,X13)))|~(ssItem(X13))))&((((ssItem(esk52_1(X13))|memberP(esk50_0,X13))|~(memberP(esk51_0,X13)))|~(ssItem(X13)))&(((((memberP(esk51_0,esk52_1(X13))|memberP(esk50_0,X13))|~(memberP(esk51_0,X13)))|~(ssItem(X13)))&(((leq(esk52_1(X13),X13)|memberP(esk50_0,X13))|~(memberP(esk51_0,X13)))|~(ssItem(X13))))&(((~(X13=esk52_1(X13))|memberP(esk50_0,X13))|~(memberP(esk51_0,X13)))|~(ssItem(X13))))))&(esk49_0=esk51_0&esk48_0=esk50_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(memberP(esk50_0,X1)|~ssItem(X1)|~memberP(esk51_0,X1)|X1!=esk52_1(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(memberP(esk50_0,X1)|leq(esk52_1(X1),X1)|~ssItem(X1)|~memberP(esk51_0,X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(memberP(esk50_0,X1)|memberP(esk51_0,esk52_1(X1))|~ssItem(X1)|~memberP(esk51_0,X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(memberP(esk50_0,X1)|ssItem(esk52_1(X1))|~ssItem(X1)|~memberP(esk51_0,X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(memberP(esk51_0,X1)|~ssItem(X1)|~memberP(esk50_0,X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(X1=X2|~ssItem(X1)|~memberP(esk50_0,X1)|~leq(X2,X1)|~memberP(esk51_0,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(~memberP(esk48_0,esk53_0)|~memberP(esk49_0,esk53_0)|esk53_0!=esk54_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(leq(esk54_0,esk53_0)|~memberP(esk48_0,esk53_0)|~memberP(esk49_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(memberP(esk49_0,esk54_0)|~memberP(esk48_0,esk53_0)|~memberP(esk49_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(ssItem(esk54_0)|~memberP(esk48_0,esk53_0)|~memberP(esk49_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(590,negated_conjecture,(memberP(esk48_0,esk53_0)|memberP(esk49_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(memberP(esk48_0,esk53_0)|esk53_0=X1|~leq(X1,esk53_0)|~memberP(esk49_0,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(595,negated_conjecture,(esk54_0!=esk53_0|~memberP(esk48_0,esk53_0)|~memberP(esk51_0,esk53_0)),inference(rw,[status(thm)],[586,578,theory(equality)])).
% cnf(596,negated_conjecture,(memberP(esk48_0,esk53_0)|memberP(esk51_0,esk53_0)),inference(rw,[status(thm)],[590,578,theory(equality)])).
% cnf(597,negated_conjecture,(ssItem(esk54_0)|~memberP(esk48_0,esk53_0)|~memberP(esk51_0,esk53_0)),inference(rw,[status(thm)],[589,578,theory(equality)])).
% cnf(599,negated_conjecture,(leq(esk54_0,esk53_0)|~memberP(esk48_0,esk53_0)|~memberP(esk51_0,esk53_0)),inference(rw,[status(thm)],[587,578,theory(equality)])).
% cnf(601,negated_conjecture,(memberP(esk51_0,esk54_0)|~memberP(esk48_0,esk53_0)|~memberP(esk49_0,esk53_0)),inference(rw,[status(thm)],[588,578,theory(equality)])).
% cnf(602,negated_conjecture,(memberP(esk51_0,esk54_0)|~memberP(esk48_0,esk53_0)|~memberP(esk51_0,esk53_0)),inference(rw,[status(thm)],[601,578,theory(equality)])).
% cnf(604,negated_conjecture,(memberP(esk51_0,X1)|~ssItem(X1)|~memberP(esk48_0,X1)),inference(rw,[status(thm)],[583,577,theory(equality)])).
% cnf(605,negated_conjecture,(memberP(esk51_0,esk53_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[604,596,theory(equality)])).
% cnf(606,negated_conjecture,(memberP(esk51_0,esk53_0)|$false),inference(rw,[status(thm)],[605,585,theory(equality)])).
% cnf(607,negated_conjecture,(memberP(esk51_0,esk53_0)),inference(cn,[status(thm)],[606,theory(equality)])).
% cnf(608,negated_conjecture,(esk53_0=X1|memberP(esk48_0,esk53_0)|~ssItem(X1)|~leq(X1,esk53_0)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[591,578,theory(equality)])).
% cnf(609,negated_conjecture,(ssItem(esk52_1(X1))|memberP(esk48_0,X1)|~ssItem(X1)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[582,577,theory(equality)])).
% cnf(610,negated_conjecture,(memberP(esk48_0,X1)|esk52_1(X1)!=X1|~ssItem(X1)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[579,577,theory(equality)])).
% cnf(611,negated_conjecture,(memberP(esk48_0,X1)|memberP(esk51_0,esk52_1(X1))|~ssItem(X1)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[581,577,theory(equality)])).
% cnf(633,negated_conjecture,(memberP(esk48_0,X1)|leq(esk52_1(X1),X1)|~ssItem(X1)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[580,577,theory(equality)])).
% cnf(653,negated_conjecture,(X1=X2|~ssItem(X2)|~ssItem(X1)|~leq(X2,X1)|~memberP(esk48_0,X1)|~memberP(esk51_0,X2)),inference(rw,[status(thm)],[584,577,theory(equality)])).
% cnf(1354,negated_conjecture,(memberP(esk48_0,esk53_0)|ssItem(esk52_1(esk53_0))|~ssItem(esk53_0)),inference(spm,[status(thm)],[609,607,theory(equality)])).
% cnf(1355,negated_conjecture,(memberP(esk51_0,esk52_1(esk53_0))|memberP(esk48_0,esk53_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[611,607,theory(equality)])).
% cnf(1356,negated_conjecture,(memberP(esk48_0,esk53_0)|leq(esk52_1(esk53_0),esk53_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[633,607,theory(equality)])).
% cnf(1357,negated_conjecture,(memberP(esk51_0,esk54_0)|~memberP(esk48_0,esk53_0)|$false),inference(rw,[status(thm)],[602,607,theory(equality)])).
% cnf(1358,negated_conjecture,(memberP(esk51_0,esk54_0)|~memberP(esk48_0,esk53_0)),inference(cn,[status(thm)],[1357,theory(equality)])).
% cnf(1359,negated_conjecture,(leq(esk54_0,esk53_0)|~memberP(esk48_0,esk53_0)|$false),inference(rw,[status(thm)],[599,607,theory(equality)])).
% cnf(1360,negated_conjecture,(leq(esk54_0,esk53_0)|~memberP(esk48_0,esk53_0)),inference(cn,[status(thm)],[1359,theory(equality)])).
% cnf(1361,negated_conjecture,(ssItem(esk54_0)|~memberP(esk48_0,esk53_0)|$false),inference(rw,[status(thm)],[597,607,theory(equality)])).
% cnf(1362,negated_conjecture,(ssItem(esk54_0)|~memberP(esk48_0,esk53_0)),inference(cn,[status(thm)],[1361,theory(equality)])).
% cnf(1363,negated_conjecture,(esk54_0!=esk53_0|~memberP(esk48_0,esk53_0)|$false),inference(rw,[status(thm)],[595,607,theory(equality)])).
% cnf(1364,negated_conjecture,(esk54_0!=esk53_0|~memberP(esk48_0,esk53_0)),inference(cn,[status(thm)],[1363,theory(equality)])).
% cnf(1384,negated_conjecture,(memberP(esk48_0,esk53_0)|ssItem(esk52_1(esk53_0))|$false),inference(rw,[status(thm)],[1354,585,theory(equality)])).
% cnf(1385,negated_conjecture,(memberP(esk48_0,esk53_0)|ssItem(esk52_1(esk53_0))),inference(cn,[status(thm)],[1384,theory(equality)])).
% cnf(1386,negated_conjecture,(memberP(esk51_0,esk52_1(esk53_0))|memberP(esk48_0,esk53_0)|$false),inference(rw,[status(thm)],[1355,585,theory(equality)])).
% cnf(1387,negated_conjecture,(memberP(esk51_0,esk52_1(esk53_0))|memberP(esk48_0,esk53_0)),inference(cn,[status(thm)],[1386,theory(equality)])).
% cnf(1388,negated_conjecture,(memberP(esk48_0,esk53_0)|leq(esk52_1(esk53_0),esk53_0)|$false),inference(rw,[status(thm)],[1356,585,theory(equality)])).
% cnf(1389,negated_conjecture,(memberP(esk48_0,esk53_0)|leq(esk52_1(esk53_0),esk53_0)),inference(cn,[status(thm)],[1388,theory(equality)])).
% cnf(1416,negated_conjecture,(esk53_0=esk52_1(esk53_0)|memberP(esk48_0,esk53_0)|~memberP(esk51_0,esk52_1(esk53_0))|~ssItem(esk52_1(esk53_0))),inference(spm,[status(thm)],[608,1389,theory(equality)])).
% cnf(1428,negated_conjecture,(esk52_1(esk53_0)=esk53_0|memberP(esk48_0,esk53_0)|~memberP(esk51_0,esk52_1(esk53_0))),inference(csr,[status(thm)],[1416,1385])).
% cnf(1429,negated_conjecture,(esk52_1(esk53_0)=esk53_0|memberP(esk48_0,esk53_0)),inference(csr,[status(thm)],[1428,1387])).
% cnf(1430,negated_conjecture,(memberP(esk48_0,esk53_0)|~memberP(esk51_0,esk53_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[610,1429,theory(equality)])).
% cnf(1434,negated_conjecture,(memberP(esk48_0,esk53_0)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[1430,607,theory(equality)])).
% cnf(1435,negated_conjecture,(memberP(esk48_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[1434,585,theory(equality)])).
% cnf(1436,negated_conjecture,(memberP(esk48_0,esk53_0)),inference(cn,[status(thm)],[1435,theory(equality)])).
% cnf(1446,negated_conjecture,(esk53_0=X1|~memberP(esk51_0,X1)|~leq(X1,esk53_0)|~ssItem(X1)|~ssItem(esk53_0)),inference(spm,[status(thm)],[653,1436,theory(equality)])).
% cnf(1452,negated_conjecture,(memberP(esk51_0,esk54_0)|$false),inference(rw,[status(thm)],[1358,1436,theory(equality)])).
% cnf(1453,negated_conjecture,(memberP(esk51_0,esk54_0)),inference(cn,[status(thm)],[1452,theory(equality)])).
% cnf(1454,negated_conjecture,(leq(esk54_0,esk53_0)|$false),inference(rw,[status(thm)],[1360,1436,theory(equality)])).
% cnf(1455,negated_conjecture,(leq(esk54_0,esk53_0)),inference(cn,[status(thm)],[1454,theory(equality)])).
% cnf(1456,negated_conjecture,(ssItem(esk54_0)|$false),inference(rw,[status(thm)],[1362,1436,theory(equality)])).
% cnf(1457,negated_conjecture,(ssItem(esk54_0)),inference(cn,[status(thm)],[1456,theory(equality)])).
% cnf(1458,negated_conjecture,(esk54_0!=esk53_0|$false),inference(rw,[status(thm)],[1364,1436,theory(equality)])).
% cnf(1459,negated_conjecture,(esk54_0!=esk53_0),inference(cn,[status(thm)],[1458,theory(equality)])).
% cnf(1481,negated_conjecture,(esk53_0=X1|~memberP(esk51_0,X1)|~leq(X1,esk53_0)|~ssItem(X1)|$false),inference(rw,[status(thm)],[1446,585,theory(equality)])).
% cnf(1482,negated_conjecture,(esk53_0=X1|~memberP(esk51_0,X1)|~leq(X1,esk53_0)|~ssItem(X1)),inference(cn,[status(thm)],[1481,theory(equality)])).
% cnf(1858,negated_conjecture,(esk53_0=esk54_0|~leq(esk54_0,esk53_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[1482,1453,theory(equality)])).
% cnf(1863,negated_conjecture,(esk53_0=esk54_0|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1858,1455,theory(equality)])).
% cnf(1864,negated_conjecture,(esk53_0=esk54_0|$false|$false),inference(rw,[status(thm)],[1863,1457,theory(equality)])).
% cnf(1865,negated_conjecture,(esk53_0=esk54_0),inference(cn,[status(thm)],[1864,theory(equality)])).
% cnf(1866,negated_conjecture,($false),inference(sr,[status(thm)],[1865,1459,theory(equality)])).
% cnf(1867,negated_conjecture,($false),1866,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 293
% # ...of these trivial : 2
% # ...subsumed : 14
% # ...remaining for further processing: 277
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 14
% # Generated clauses : 709
% # ...of the previous two non-trivial : 598
% # Contextual simplify-reflections : 50
% # Paramodulations : 618
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 256
% # Positive orientable unit clauses: 36
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 213
% # Current number of unprocessed clauses: 491
% # ...number of literals in the above : 3419
% # Clause-clause subsumption calls (NU) : 1332
% # Rec. Clause-clause subsumption calls : 294
% # Unit Clause-clause subsumption calls : 55
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 306 leaves, 1.30+/-1.016 terms/leaf
% # Paramod-from index: 136 leaves, 1.04+/-0.268 terms/leaf
% # Paramod-into index: 264 leaves, 1.21+/-0.874 terms/leaf
% # -------------------------------------------------
% # User time : 0.079 s
% # System time : 0.004 s
% # Total time : 0.083 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.30 WC
% FINAL PrfWatch: 0.22 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP30063/SWC379+1.tptp
%
%------------------------------------------------------------------------------