%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM538+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:11 EST 2010
% Result : Theorem 1.67s
% Output : Solution 1.67s
% 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/SystemOnTPTP18749/NUM538+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18749/NUM538+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18749/NUM538+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 18845
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aSet0(xS),file('/tmp/SRASS.s.p', m__1522)).
% fof(2, axiom,(isFinite0(xS)&aElementOf0(xx,xS)),file('/tmp/SRASS.s.p', m__1522_02)).
% fof(4, axiom,![X1]:![X2]:((aSet0(X1)&aElement0(X2))=>![X3]:(X3=sdtmndt0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))))),file('/tmp/SRASS.s.p', mDefDiff)).
% fof(7, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>sdtpldt0(sdtmndt0(X1,X2),X2)=X1)),file('/tmp/SRASS.s.p', mConsDiff)).
% fof(8, axiom,![X1]:(aElement0(X1)=>![X2]:((aSet0(X2)&isFinite0(X2))=>isFinite0(sdtmndt0(X2,X1)))),file('/tmp/SRASS.s.p', mFDiffSet)).
% fof(9, axiom,![X1]:((aSet0(X1)&isFinite0(X1))=>![X2]:(aElement0(X2)=>(~(aElementOf0(X2,X1))=>sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))))),file('/tmp/SRASS.s.p', mCardCons)).
% fof(19, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(46, conjecture,szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS),file('/tmp/SRASS.s.p', m__)).
% fof(47, negated_conjecture,~(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)),inference(assume_negation,[status(cth)],[46])).
% fof(48, plain,![X1]:((aSet0(X1)&isFinite0(X1))=>![X2]:(aElement0(X2)=>(~(aElementOf0(X2,X1))=>sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(58, negated_conjecture,~(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)),inference(fof_simplification,[status(thm)],[47,theory(equality)])).
% cnf(59,plain,(aSet0(xS)),inference(split_conjunct,[status(thm)],[1])).
% cnf(60,plain,(aElementOf0(xx,xS)),inference(split_conjunct,[status(thm)],[2])).
% cnf(61,plain,(isFinite0(xS)),inference(split_conjunct,[status(thm)],[2])).
% fof(67, plain,![X1]:![X2]:((~(aSet0(X1))|~(aElement0(X2)))|![X3]:((~(X3=sdtmndt0(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))&(((~(aElement0(X4))|~(aElementOf0(X4,X1)))|X4=X2)|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|((~(aElement0(X4))|~(aElementOf0(X4,X1)))|X4=X2))&(aElementOf0(X4,X3)|((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))))|X3=sdtmndt0(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(68, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElement0(X6)))|![X7]:((~(X7=sdtmndt0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))))&((~(aSet0(X7))|?[X9]:((~(aElementOf0(X9,X7))|((~(aElement0(X9))|~(aElementOf0(X9,X5)))|X9=X6))&(aElementOf0(X9,X7)|((aElement0(X9)&aElementOf0(X9,X5))&~(X9=X6)))))|X7=sdtmndt0(X5,X6)))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElement0(X6)))|![X7]:((~(X7=sdtmndt0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))))&((~(aSet0(X7))|((~(aElementOf0(esk1_3(X5,X6,X7),X7))|((~(aElement0(esk1_3(X5,X6,X7)))|~(aElementOf0(esk1_3(X5,X6,X7),X5)))|esk1_3(X5,X6,X7)=X6))&(aElementOf0(esk1_3(X5,X6,X7),X7)|((aElement0(esk1_3(X5,X6,X7))&aElementOf0(esk1_3(X5,X6,X7),X5))&~(esk1_3(X5,X6,X7)=X6)))))|X7=sdtmndt0(X5,X6)))),inference(skolemize,[status(esa)],[68])).
% fof(70, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))&aSet0(X7))|~(X7=sdtmndt0(X5,X6)))&((~(aSet0(X7))|((~(aElementOf0(esk1_3(X5,X6,X7),X7))|((~(aElement0(esk1_3(X5,X6,X7)))|~(aElementOf0(esk1_3(X5,X6,X7),X5)))|esk1_3(X5,X6,X7)=X6))&(aElementOf0(esk1_3(X5,X6,X7),X7)|((aElement0(esk1_3(X5,X6,X7))&aElementOf0(esk1_3(X5,X6,X7),X5))&~(esk1_3(X5,X6,X7)=X6)))))|X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,![X5]:![X6]:![X7]:![X8]:((((((((aElement0(X8)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6))))&(((aElementOf0(X8,X5)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((~(X8=X6)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&((aSet0(X7)|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((~(aElementOf0(esk1_3(X5,X6,X7),X7))|((~(aElement0(esk1_3(X5,X6,X7)))|~(aElementOf0(esk1_3(X5,X6,X7),X5)))|esk1_3(X5,X6,X7)=X6))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&((((((aElement0(esk1_3(X5,X6,X7))|aElementOf0(esk1_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&((((aElementOf0(esk1_3(X5,X6,X7),X5)|aElementOf0(esk1_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6)))))&((((~(esk1_3(X5,X6,X7)=X6)|aElementOf0(esk1_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))))),inference(distribute,[status(thm)],[70])).
% cnf(76,plain,(aSet0(X3)|~aElement0(X1)|~aSet0(X2)|X3!=sdtmndt0(X2,X1)),inference(split_conjunct,[status(thm)],[71])).
% cnf(78,plain,(~aElement0(X1)|~aSet0(X2)|X3!=sdtmndt0(X2,X1)|~aElementOf0(X4,X3)|X4!=X1),inference(split_conjunct,[status(thm)],[71])).
% fof(87, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|sdtpldt0(sdtmndt0(X1,X2),X2)=X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(88, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|sdtpldt0(sdtmndt0(X3,X4),X4)=X3)),inference(variable_rename,[status(thm)],[87])).
% fof(89, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|sdtpldt0(sdtmndt0(X3,X4),X4)=X3)|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[88])).
% cnf(90,plain,(sdtpldt0(sdtmndt0(X1,X2),X2)=X1|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[89])).
% fof(91, plain,![X1]:(~(aElement0(X1))|![X2]:((~(aSet0(X2))|~(isFinite0(X2)))|isFinite0(sdtmndt0(X2,X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(92, plain,![X3]:(~(aElement0(X3))|![X4]:((~(aSet0(X4))|~(isFinite0(X4)))|isFinite0(sdtmndt0(X4,X3)))),inference(variable_rename,[status(thm)],[91])).
% fof(93, plain,![X3]:![X4]:(((~(aSet0(X4))|~(isFinite0(X4)))|isFinite0(sdtmndt0(X4,X3)))|~(aElement0(X3))),inference(shift_quantors,[status(thm)],[92])).
% cnf(94,plain,(isFinite0(sdtmndt0(X2,X1))|~aElement0(X1)|~isFinite0(X2)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[93])).
% fof(95, plain,![X1]:((~(aSet0(X1))|~(isFinite0(X1)))|![X2]:(~(aElement0(X2))|(aElementOf0(X2,X1)|sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))))),inference(fof_nnf,[status(thm)],[48])).
% fof(96, plain,![X3]:((~(aSet0(X3))|~(isFinite0(X3)))|![X4]:(~(aElement0(X4))|(aElementOf0(X4,X3)|sbrdtbr0(sdtpldt0(X3,X4))=szszuzczcdt0(sbrdtbr0(X3))))),inference(variable_rename,[status(thm)],[95])).
% fof(97, plain,![X3]:![X4]:((~(aElement0(X4))|(aElementOf0(X4,X3)|sbrdtbr0(sdtpldt0(X3,X4))=szszuzczcdt0(sbrdtbr0(X3))))|(~(aSet0(X3))|~(isFinite0(X3)))),inference(shift_quantors,[status(thm)],[96])).
% cnf(98,plain,(sbrdtbr0(sdtpldt0(X1,X2))=szszuzczcdt0(sbrdtbr0(X1))|aElementOf0(X2,X1)|~isFinite0(X1)|~aSet0(X1)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[97])).
% fof(136, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[19])).
% fof(137, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[136])).
% fof(138, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[137])).
% cnf(139,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[138])).
% cnf(232,negated_conjecture,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))!=sbrdtbr0(xS)),inference(split_conjunct,[status(thm)],[58])).
% cnf(237,plain,(sdtmndt0(X1,X2)!=X3|~aElement0(X2)|~aElementOf0(X2,X3)|~aSet0(X1)),inference(er,[status(thm)],[78,theory(equality)])).
% cnf(269,plain,(aElement0(xx)|~aSet0(xS)),inference(spm,[status(thm)],[139,60,theory(equality)])).
% cnf(274,plain,(aElement0(xx)|$false),inference(rw,[status(thm)],[269,59,theory(equality)])).
% cnf(275,plain,(aElement0(xx)),inference(cn,[status(thm)],[274,theory(equality)])).
% cnf(288,plain,(aSet0(sdtmndt0(X1,X2))|~aElement0(X2)|~aSet0(X1)),inference(er,[status(thm)],[76,theory(equality)])).
% cnf(299,plain,(~aElement0(X1)|~aElementOf0(X1,sdtmndt0(X2,X1))|~aSet0(X2)),inference(er,[status(thm)],[237,theory(equality)])).
% cnf(336,plain,(sbrdtbr0(X1)=szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))|aElementOf0(X2,sdtmndt0(X1,X2))|~aElement0(X2)|~isFinite0(sdtmndt0(X1,X2))|~aSet0(sdtmndt0(X1,X2))|~aElementOf0(X2,X1)|~aSet0(X1)),inference(spm,[status(thm)],[98,90,theory(equality)])).
% cnf(1232,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1)|aElementOf0(X2,sdtmndt0(X1,X2))|~aElement0(X2)|~aElementOf0(X2,X1)|~isFinite0(sdtmndt0(X1,X2))|~aSet0(X1)),inference(csr,[status(thm)],[336,288])).
% cnf(1233,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1)|aElementOf0(X2,sdtmndt0(X1,X2))|~aElementOf0(X2,X1)|~isFinite0(sdtmndt0(X1,X2))|~aSet0(X1)),inference(csr,[status(thm)],[1232,139])).
% cnf(1236,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1)|aElementOf0(X2,sdtmndt0(X1,X2))|~aElementOf0(X2,X1)|~aSet0(X1)|~aElement0(X2)|~isFinite0(X1)),inference(spm,[status(thm)],[1233,94,theory(equality)])).
% cnf(14959,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1)|aElementOf0(X2,sdtmndt0(X1,X2))|~aElementOf0(X2,X1)|~isFinite0(X1)|~aSet0(X1)),inference(csr,[status(thm)],[1236,139])).
% cnf(15003,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)|aElementOf0(xx,sdtmndt0(xS,xx))|~isFinite0(xS)|~aSet0(xS)),inference(spm,[status(thm)],[14959,60,theory(equality)])).
% cnf(15058,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)|aElementOf0(xx,sdtmndt0(xS,xx))|$false|~aSet0(xS)),inference(rw,[status(thm)],[15003,61,theory(equality)])).
% cnf(15059,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)|aElementOf0(xx,sdtmndt0(xS,xx))|$false|$false),inference(rw,[status(thm)],[15058,59,theory(equality)])).
% cnf(15060,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx)))=sbrdtbr0(xS)|aElementOf0(xx,sdtmndt0(xS,xx))),inference(cn,[status(thm)],[15059,theory(equality)])).
% cnf(15061,plain,(aElementOf0(xx,sdtmndt0(xS,xx))),inference(sr,[status(thm)],[15060,232,theory(equality)])).
% cnf(15068,plain,(~aElement0(xx)|~aSet0(xS)),inference(spm,[status(thm)],[299,15061,theory(equality)])).
% cnf(15086,plain,($false|~aSet0(xS)),inference(rw,[status(thm)],[15068,275,theory(equality)])).
% cnf(15087,plain,($false|$false),inference(rw,[status(thm)],[15086,59,theory(equality)])).
% cnf(15088,plain,($false),inference(cn,[status(thm)],[15087,theory(equality)])).
% cnf(15089,plain,($false),15088,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1810
% # ...of these trivial : 27
% # ...subsumed : 966
% # ...remaining for further processing: 817
% # Other redundant clauses eliminated : 18
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 44
% # Backward-rewritten : 50
% # Generated clauses : 7369
% # ...of the previous two non-trivial : 6606
% # Contextual simplify-reflections : 1143
% # Paramodulations : 7303
% # Factorizations : 3
% # Equation resolutions : 50
% # Current number of processed clauses: 649
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 19
% # Non-unit-clauses : 598
% # Current number of unprocessed clauses: 3967
% # ...number of literals in the above : 26954
% # Clause-clause subsumption calls (NU) : 27145
% # Rec. Clause-clause subsumption calls : 15414
% # Unit Clause-clause subsumption calls : 2114
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 24
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 361 leaves, 1.80+/-1.572 terms/leaf
% # Paramod-from index: 152 leaves, 1.42+/-1.029 terms/leaf
% # Paramod-into index: 235 leaves, 1.72+/-1.349 terms/leaf
% # -------------------------------------------------
% # User time : 0.509 s
% # System time : 0.021 s
% # Total time : 0.530 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.84 CPU 0.92 WC
% FINAL PrfWatch: 0.84 CPU 0.92 WC
% SZS output end Solution for /tmp/SystemOnTPTP18749/NUM538+1.tptp
%
%------------------------------------------------------------------------------