%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM539+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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 : Wed Dec 29 19:58:24 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP19267/NUM539+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19267/NUM539+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19267/NUM539+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 19363
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(((aSubsetOf0(xS,szNzAzT0)&aSubsetOf0(xT,szNzAzT0))&~(xS=slcrc0))&~(xT=slcrc0)),file('/tmp/SRASS.s.p', m__1779)).
% fof(2, axiom,(aElementOf0(szmzizndt0(xS),xT)&aElementOf0(szmzizndt0(xT),xS)),file('/tmp/SRASS.s.p', m__1802)).
% fof(3, axiom,![X1]:((aSubsetOf0(X1,szNzAzT0)&~(X1=slcrc0))=>![X2]:(X2=szmzizndt0(X1)<=>(aElementOf0(X2,X1)&![X3]:(aElementOf0(X3,X1)=>sdtlseqdt0(X2,X3))))),file('/tmp/SRASS.s.p', mDefMin)).
% fof(4, axiom,![X1]:(X1=slcrc0<=>(aSet0(X1)&~(?[X2]:aElementOf0(X2,X1)))),file('/tmp/SRASS.s.p', mDefEmp)).
% fof(6, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(7, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>((sdtlseqdt0(X1,X2)&sdtlseqdt0(X2,X1))=>X1=X2)),file('/tmp/SRASS.s.p', mLessASymm)).
% fof(22, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(51, conjecture,szmzizndt0(xS)=szmzizndt0(xT),file('/tmp/SRASS.s.p', m__)).
% fof(52, negated_conjecture,~(szmzizndt0(xS)=szmzizndt0(xT)),inference(assume_negation,[status(cth)],[51])).
% fof(63, negated_conjecture,~(szmzizndt0(xS)=szmzizndt0(xT)),inference(fof_simplification,[status(thm)],[52,theory(equality)])).
% cnf(64,plain,(xT!=slcrc0),inference(split_conjunct,[status(thm)],[1])).
% cnf(66,plain,(aSubsetOf0(xT,szNzAzT0)),inference(split_conjunct,[status(thm)],[1])).
% cnf(67,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[1])).
% cnf(68,plain,(aElementOf0(szmzizndt0(xT),xS)),inference(split_conjunct,[status(thm)],[2])).
% cnf(69,plain,(aElementOf0(szmzizndt0(xS),xT)),inference(split_conjunct,[status(thm)],[2])).
% fof(70, plain,![X1]:((~(aSubsetOf0(X1,szNzAzT0))|X1=slcrc0)|![X2]:((~(X2=szmzizndt0(X1))|(aElementOf0(X2,X1)&![X3]:(~(aElementOf0(X3,X1))|sdtlseqdt0(X2,X3))))&((~(aElementOf0(X2,X1))|?[X3]:(aElementOf0(X3,X1)&~(sdtlseqdt0(X2,X3))))|X2=szmzizndt0(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(71, plain,![X4]:((~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)|![X5]:((~(X5=szmzizndt0(X4))|(aElementOf0(X5,X4)&![X6]:(~(aElementOf0(X6,X4))|sdtlseqdt0(X5,X6))))&((~(aElementOf0(X5,X4))|?[X7]:(aElementOf0(X7,X4)&~(sdtlseqdt0(X5,X7))))|X5=szmzizndt0(X4)))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,![X4]:((~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)|![X5]:((~(X5=szmzizndt0(X4))|(aElementOf0(X5,X4)&![X6]:(~(aElementOf0(X6,X4))|sdtlseqdt0(X5,X6))))&((~(aElementOf0(X5,X4))|(aElementOf0(esk1_2(X4,X5),X4)&~(sdtlseqdt0(X5,esk1_2(X4,X5)))))|X5=szmzizndt0(X4)))),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X4))|sdtlseqdt0(X5,X6))&aElementOf0(X5,X4))|~(X5=szmzizndt0(X4)))&((~(aElementOf0(X5,X4))|(aElementOf0(esk1_2(X4,X5),X4)&~(sdtlseqdt0(X5,esk1_2(X4,X5)))))|X5=szmzizndt0(X4)))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)),inference(shift_quantors,[status(thm)],[72])).
% fof(74, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X4))|sdtlseqdt0(X5,X6))|~(X5=szmzizndt0(X4)))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0))&((aElementOf0(X5,X4)|~(X5=szmzizndt0(X4)))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)))&((((aElementOf0(esk1_2(X4,X5),X4)|~(aElementOf0(X5,X4)))|X5=szmzizndt0(X4))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0))&(((~(sdtlseqdt0(X5,esk1_2(X4,X5)))|~(aElementOf0(X5,X4)))|X5=szmzizndt0(X4))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)))),inference(distribute,[status(thm)],[73])).
% cnf(77,plain,(X1=slcrc0|aElementOf0(X2,X1)|~aSubsetOf0(X1,szNzAzT0)|X2!=szmzizndt0(X1)),inference(split_conjunct,[status(thm)],[74])).
% cnf(78,plain,(X1=slcrc0|sdtlseqdt0(X2,X3)|~aSubsetOf0(X1,szNzAzT0)|X2!=szmzizndt0(X1)|~aElementOf0(X3,X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(79, plain,![X1]:((~(X1=slcrc0)|(aSet0(X1)&![X2]:~(aElementOf0(X2,X1))))&((~(aSet0(X1))|?[X2]:aElementOf0(X2,X1))|X1=slcrc0)),inference(fof_nnf,[status(thm)],[4])).
% fof(80, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[79])).
% fof(81, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk2_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[80])).
% fof(82, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk2_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[81])).
% fof(83, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))|~(X3=slcrc0))&(aSet0(X3)|~(X3=slcrc0)))&((~(aSet0(X3))|aElementOf0(esk2_1(X3),X3))|X3=slcrc0)),inference(distribute,[status(thm)],[82])).
% cnf(86,plain,(X1!=slcrc0|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[83])).
% fof(90, plain,![X1]:(~(aSet0(X1))|![X2]:((~(aSubsetOf0(X2,X1))|(aSet0(X2)&![X3]:(~(aElementOf0(X3,X2))|aElementOf0(X3,X1))))&((~(aSet0(X2))|?[X3]:(aElementOf0(X3,X2)&~(aElementOf0(X3,X1))))|aSubsetOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(91, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|?[X7]:(aElementOf0(X7,X5)&~(aElementOf0(X7,X4))))|aSubsetOf0(X5,X4)))),inference(variable_rename,[status(thm)],[90])).
% fof(92, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk3_2(X4,X5),X5)&~(aElementOf0(esk3_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[91])).
% fof(93, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk3_2(X4,X5),X5)&~(aElementOf0(esk3_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[92])).
% fof(94, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk3_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk3_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[93])).
% cnf(98,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[94])).
% fof(99, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(100, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|((~(sdtlseqdt0(X3,X4))|~(sdtlseqdt0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[99])).
% cnf(101,plain,(X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[100])).
% cnf(157,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[22])).
% cnf(272,negated_conjecture,(szmzizndt0(xS)!=szmzizndt0(xT)),inference(split_conjunct,[status(thm)],[63])).
% cnf(275,plain,(sdtlseqdt0(X2,X3)|szmzizndt0(X1)!=X2|~aElementOf0(X3,X1)|~aSubsetOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[78,86])).
% cnf(310,plain,(slcrc0=X1|aElementOf0(szmzizndt0(X1),X1)|~aSubsetOf0(X1,szNzAzT0)),inference(er,[status(thm)],[77,theory(equality)])).
% cnf(335,plain,(sdtlseqdt0(X1,szmzizndt0(xS))|szmzizndt0(xT)!=X1|~aSubsetOf0(xT,szNzAzT0)),inference(spm,[status(thm)],[275,69,theory(equality)])).
% cnf(336,plain,(sdtlseqdt0(X1,szmzizndt0(xT))|szmzizndt0(xS)!=X1|~aSubsetOf0(xS,szNzAzT0)),inference(spm,[status(thm)],[275,68,theory(equality)])).
% cnf(337,plain,(sdtlseqdt0(X1,szmzizndt0(xS))|szmzizndt0(xT)!=X1|$false),inference(rw,[status(thm)],[335,66,theory(equality)])).
% cnf(338,plain,(sdtlseqdt0(X1,szmzizndt0(xS))|szmzizndt0(xT)!=X1),inference(cn,[status(thm)],[337,theory(equality)])).
% cnf(339,plain,(sdtlseqdt0(X1,szmzizndt0(xT))|szmzizndt0(xS)!=X1|$false),inference(rw,[status(thm)],[336,67,theory(equality)])).
% cnf(340,plain,(sdtlseqdt0(X1,szmzizndt0(xT))|szmzizndt0(xS)!=X1),inference(cn,[status(thm)],[339,theory(equality)])).
% cnf(363,plain,(aElementOf0(X1,szNzAzT0)|~aSet0(szNzAzT0)|~aElementOf0(X1,xT)),inference(spm,[status(thm)],[98,66,theory(equality)])).
% cnf(366,plain,(aElementOf0(X1,szNzAzT0)|$false|~aElementOf0(X1,xT)),inference(rw,[status(thm)],[363,157,theory(equality)])).
% cnf(367,plain,(aElementOf0(X1,szNzAzT0)|~aElementOf0(X1,xT)),inference(cn,[status(thm)],[366,theory(equality)])).
% cnf(520,plain,(szmzizndt0(xS)=X1|~sdtlseqdt0(szmzizndt0(xS),X1)|~aElementOf0(X1,szNzAzT0)|~aElementOf0(szmzizndt0(xS),szNzAzT0)|szmzizndt0(xT)!=X1),inference(spm,[status(thm)],[101,338,theory(equality)])).
% cnf(560,plain,(aElementOf0(szmzizndt0(xT),szNzAzT0)|slcrc0=xT|~aSubsetOf0(xT,szNzAzT0)),inference(spm,[status(thm)],[367,310,theory(equality)])).
% cnf(561,plain,(aElementOf0(szmzizndt0(xS),szNzAzT0)),inference(spm,[status(thm)],[367,69,theory(equality)])).
% cnf(573,plain,(aElementOf0(szmzizndt0(xT),szNzAzT0)|slcrc0=xT|$false),inference(rw,[status(thm)],[560,66,theory(equality)])).
% cnf(574,plain,(aElementOf0(szmzizndt0(xT),szNzAzT0)|slcrc0=xT),inference(cn,[status(thm)],[573,theory(equality)])).
% cnf(575,plain,(aElementOf0(szmzizndt0(xT),szNzAzT0)),inference(sr,[status(thm)],[574,64,theory(equality)])).
% cnf(892,plain,(szmzizndt0(xS)=X1|~sdtlseqdt0(szmzizndt0(xS),X1)|~aElementOf0(X1,szNzAzT0)|$false|szmzizndt0(xT)!=X1),inference(rw,[status(thm)],[520,561,theory(equality)])).
% cnf(893,plain,(szmzizndt0(xS)=X1|~sdtlseqdt0(szmzizndt0(xS),X1)|~aElementOf0(X1,szNzAzT0)|szmzizndt0(xT)!=X1),inference(cn,[status(thm)],[892,theory(equality)])).
% cnf(902,plain,(szmzizndt0(xS)=szmzizndt0(xT)|~aElementOf0(szmzizndt0(xT),szNzAzT0)),inference(spm,[status(thm)],[893,340,theory(equality)])).
% cnf(915,plain,(szmzizndt0(xS)=szmzizndt0(xT)|$false),inference(rw,[status(thm)],[902,575,theory(equality)])).
% cnf(916,plain,(szmzizndt0(xS)=szmzizndt0(xT)),inference(cn,[status(thm)],[915,theory(equality)])).
% cnf(917,plain,($false),inference(sr,[status(thm)],[916,272,theory(equality)])).
% cnf(918,plain,($false),917,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 290
% # ...of these trivial : 4
% # ...subsumed : 43
% # ...remaining for further processing: 243
% # Other redundant clauses eliminated : 12
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 407
% # ...of the previous two non-trivial : 350
% # Contextual simplify-reflections : 48
% # Paramodulations : 380
% # Factorizations : 0
% # Equation resolutions : 27
% # Current number of processed clauses: 155
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 131
% # Current number of unprocessed clauses: 224
% # ...number of literals in the above : 1339
% # Clause-clause subsumption calls (NU) : 498
% # Rec. Clause-clause subsumption calls : 322
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 131 leaves, 1.31+/-0.900 terms/leaf
% # Paramod-from index: 84 leaves, 1.04+/-0.186 terms/leaf
% # Paramod-into index: 125 leaves, 1.19+/-0.701 terms/leaf
% # -------------------------------------------------
% # User time : 0.052 s
% # System time : 0.004 s
% # Total time : 0.056 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP19267/NUM539+1.tptp
%
%------------------------------------------------------------------------------