TSTP Solution File: NUM624+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM624+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 : 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 : Wed Dec 29 20:40:50 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP14720/NUM624+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14720/NUM624+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14720/NUM624+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 14816
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(X1=slcrc0<=>(aSet0(X1)&~(?[X2]:aElementOf0(X2,X1)))),file('/tmp/SRASS.s.p', mDefEmp)).
% fof(5, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(11, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(22, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>((sdtlseqdt0(X1,X2)&sdtlseqdt0(X2,X1))=>X1=X2)),file('/tmp/SRASS.s.p', mLessASymm)).
% fof(31, 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(70, axiom,(aSubsetOf0(xQ,xO)&~(xQ=slcrc0)),file('/tmp/SRASS.s.p', m__5093)).
% fof(71, axiom,aSubsetOf0(xQ,szNzAzT0),file('/tmp/SRASS.s.p', m__5106)).
% fof(73, axiom,xp=szmzizndt0(xQ),file('/tmp/SRASS.s.p', m__5147)).
% fof(84, axiom,(aElementOf0(xx,szNzAzT0)&aElementOf0(xx,xO)),file('/tmp/SRASS.s.p', m__5365)).
% fof(86, axiom,xx=szmzizndt0(sdtlpdtrp0(xN,xm)),file('/tmp/SRASS.s.p', m__5401)).
% fof(89, axiom,(aElementOf0(xp,sdtlpdtrp0(xN,xm))&aElementOf0(xx,xQ)),file('/tmp/SRASS.s.p', m__5481)).
% fof(90, axiom,(((aSubsetOf0(xQ,szNzAzT0)&aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0))&~(xQ=slcrc0))&~(sdtlpdtrp0(xN,xm)=slcrc0)),file('/tmp/SRASS.s.p', m__5518)).
% fof(121, conjecture,xp=xx,file('/tmp/SRASS.s.p', m__)).
% fof(122, negated_conjecture,~(xp=xx),inference(assume_negation,[status(cth)],[121])).
% fof(136, negated_conjecture,~(xp=xx),inference(fof_simplification,[status(thm)],[122,theory(equality)])).
% fof(137, plain,![X1]:((~(X1=slcrc0)|(aSet0(X1)&![X2]:~(aElementOf0(X2,X1))))&((~(aSet0(X1))|?[X2]:aElementOf0(X2,X1))|X1=slcrc0)),inference(fof_nnf,[status(thm)],[1])).
% fof(138, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[137])).
% fof(139, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[138])).
% fof(140, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[139])).
% fof(141, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))|~(X3=slcrc0))&(aSet0(X3)|~(X3=slcrc0)))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(distribute,[status(thm)],[140])).
% cnf(144,plain,(X1!=slcrc0|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[141])).
% fof(152, 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)],[5])).
% fof(153, 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)],[152])).
% fof(154, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[153])).
% fof(155, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[154])).
% fof(156, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk2_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk2_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[155])).
% cnf(160,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[156])).
% cnf(179,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[11])).
% fof(215, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[22])).
% fof(216, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|((~(sdtlseqdt0(X3,X4))|~(sdtlseqdt0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[215])).
% cnf(217,plain,(X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[216])).
% fof(251, 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)],[31])).
% fof(252, 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)],[251])).
% fof(253, 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(esk5_2(X4,X5),X4)&~(sdtlseqdt0(X5,esk5_2(X4,X5)))))|X5=szmzizndt0(X4)))),inference(skolemize,[status(esa)],[252])).
% fof(254, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X4))|sdtlseqdt0(X5,X6))&aElementOf0(X5,X4))|~(X5=szmzizndt0(X4)))&((~(aElementOf0(X5,X4))|(aElementOf0(esk5_2(X4,X5),X4)&~(sdtlseqdt0(X5,esk5_2(X4,X5)))))|X5=szmzizndt0(X4)))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)),inference(shift_quantors,[status(thm)],[253])).
% fof(255, 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(esk5_2(X4,X5),X4)|~(aElementOf0(X5,X4)))|X5=szmzizndt0(X4))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0))&(((~(sdtlseqdt0(X5,esk5_2(X4,X5)))|~(aElementOf0(X5,X4)))|X5=szmzizndt0(X4))|(~(aSubsetOf0(X4,szNzAzT0))|X4=slcrc0)))),inference(distribute,[status(thm)],[254])).
% cnf(258,plain,(X1=slcrc0|aElementOf0(X2,X1)|~aSubsetOf0(X1,szNzAzT0)|X2!=szmzizndt0(X1)),inference(split_conjunct,[status(thm)],[255])).
% cnf(259,plain,(X1=slcrc0|sdtlseqdt0(X2,X3)|~aSubsetOf0(X1,szNzAzT0)|X2!=szmzizndt0(X1)|~aElementOf0(X3,X1)),inference(split_conjunct,[status(thm)],[255])).
% cnf(432,plain,(xQ!=slcrc0),inference(split_conjunct,[status(thm)],[70])).
% cnf(434,plain,(aSubsetOf0(xQ,szNzAzT0)),inference(split_conjunct,[status(thm)],[71])).
% cnf(436,plain,(xp=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[73])).
% cnf(451,plain,(aElementOf0(xx,szNzAzT0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(454,plain,(xx=szmzizndt0(sdtlpdtrp0(xN,xm))),inference(split_conjunct,[status(thm)],[86])).
% cnf(457,plain,(aElementOf0(xx,xQ)),inference(split_conjunct,[status(thm)],[89])).
% cnf(458,plain,(aElementOf0(xp,sdtlpdtrp0(xN,xm))),inference(split_conjunct,[status(thm)],[89])).
% cnf(461,plain,(aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)),inference(split_conjunct,[status(thm)],[90])).
% cnf(614,negated_conjecture,(xp!=xx),inference(split_conjunct,[status(thm)],[136])).
% cnf(629,plain,(sdtlseqdt0(X2,X3)|szmzizndt0(X1)!=X2|~aSubsetOf0(X1,szNzAzT0)|~aElementOf0(X3,X1)),inference(csr,[status(thm)],[259,144])).
% cnf(875,plain,(slcrc0=xQ|aElementOf0(X1,xQ)|xp!=X1|~aSubsetOf0(xQ,szNzAzT0)),inference(spm,[status(thm)],[258,436,theory(equality)])).
% cnf(878,plain,(slcrc0=xQ|aElementOf0(X1,xQ)|xp!=X1|$false),inference(rw,[status(thm)],[875,434,theory(equality)])).
% cnf(879,plain,(slcrc0=xQ|aElementOf0(X1,xQ)|xp!=X1),inference(cn,[status(thm)],[878,theory(equality)])).
% cnf(880,plain,(aElementOf0(X1,xQ)|xp!=X1),inference(sr,[status(thm)],[879,432,theory(equality)])).
% cnf(944,plain,(aElementOf0(X1,szNzAzT0)|~aElementOf0(X1,xQ)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[160,434,theory(equality)])).
% cnf(957,plain,(aElementOf0(X1,szNzAzT0)|~aElementOf0(X1,xQ)|$false),inference(rw,[status(thm)],[944,179,theory(equality)])).
% cnf(958,plain,(aElementOf0(X1,szNzAzT0)|~aElementOf0(X1,xQ)),inference(cn,[status(thm)],[957,theory(equality)])).
% cnf(1053,plain,(sdtlseqdt0(X1,xx)|szmzizndt0(xQ)!=X1|~aSubsetOf0(xQ,szNzAzT0)),inference(spm,[status(thm)],[629,457,theory(equality)])).
% cnf(1061,plain,(sdtlseqdt0(X1,xp)|szmzizndt0(sdtlpdtrp0(xN,xm))!=X1|~aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)),inference(spm,[status(thm)],[629,458,theory(equality)])).
% cnf(1071,plain,(sdtlseqdt0(X1,xx)|xp!=X1|~aSubsetOf0(xQ,szNzAzT0)),inference(rw,[status(thm)],[1053,436,theory(equality)])).
% cnf(1072,plain,(sdtlseqdt0(X1,xx)|xp!=X1|$false),inference(rw,[status(thm)],[1071,434,theory(equality)])).
% cnf(1073,plain,(sdtlseqdt0(X1,xx)|xp!=X1),inference(cn,[status(thm)],[1072,theory(equality)])).
% cnf(1077,plain,(sdtlseqdt0(X1,xp)|xx!=X1|~aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)),inference(rw,[status(thm)],[1061,454,theory(equality)])).
% cnf(1078,plain,(sdtlseqdt0(X1,xp)|xx!=X1|$false),inference(rw,[status(thm)],[1077,461,theory(equality)])).
% cnf(1079,plain,(sdtlseqdt0(X1,xp)|xx!=X1),inference(cn,[status(thm)],[1078,theory(equality)])).
% cnf(2283,plain,(xx=X1|~sdtlseqdt0(xx,X1)|~aElementOf0(X1,szNzAzT0)|~aElementOf0(xx,szNzAzT0)|xp!=X1),inference(spm,[status(thm)],[217,1073,theory(equality)])).
% cnf(2290,plain,(xx=X1|~sdtlseqdt0(xx,X1)|~aElementOf0(X1,szNzAzT0)|$false|xp!=X1),inference(rw,[status(thm)],[2283,451,theory(equality)])).
% cnf(2291,plain,(xx=X1|~sdtlseqdt0(xx,X1)|~aElementOf0(X1,szNzAzT0)|xp!=X1),inference(cn,[status(thm)],[2290,theory(equality)])).
% cnf(2498,plain,(aElementOf0(X1,szNzAzT0)|xp!=X1),inference(spm,[status(thm)],[958,880,theory(equality)])).
% cnf(3025,plain,(xx=X1|xp!=X1|~sdtlseqdt0(xx,X1)),inference(csr,[status(thm)],[2291,2498])).
% cnf(3027,plain,(xx=xp),inference(spm,[status(thm)],[3025,1079,theory(equality)])).
% cnf(3031,plain,($false),inference(sr,[status(thm)],[3027,614,theory(equality)])).
% cnf(3032,plain,($false),3031,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 662
% # ...of these trivial : 13
% # ...subsumed : 64
% # ...remaining for further processing: 585
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 5
% # Generated clauses : 1353
% # ...of the previous two non-trivial : 1233
% # Contextual simplify-reflections : 33
% # Paramodulations : 1309
% # Factorizations : 0
% # Equation resolutions : 44
% # Current number of processed clauses: 349
% # Positive orientable unit clauses: 95
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 36
% # Non-unit-clauses : 218
% # Current number of unprocessed clauses: 1010
% # ...number of literals in the above : 5135
% # Clause-clause subsumption calls (NU) : 2925
% # Rec. Clause-clause subsumption calls : 1076
% # Unit Clause-clause subsumption calls : 1180
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 354 leaves, 1.26+/-0.867 terms/leaf
% # Paramod-from index: 181 leaves, 1.01+/-0.105 terms/leaf
% # Paramod-into index: 318 leaves, 1.14+/-0.540 terms/leaf
% # -------------------------------------------------
% # User time : 0.134 s
% # System time : 0.009 s
% # Total time : 0.143 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.28 CPU 0.37 WC
% FINAL PrfWatch: 0.28 CPU 0.37 WC
% SZS output end Solution for /tmp/SystemOnTPTP14720/NUM624+1.tptp
%
%------------------------------------------------------------------------------