TSTP Solution File: NUM620+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM620+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 : art02.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:39:39 EST 2010
% Result : Theorem 2.90s
% Output : Solution 2.90s
% 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/SystemOnTPTP11902/NUM620+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11902/NUM620+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11902/NUM620+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 11998
% 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(4, axiom,![X1]:((aSet0(X1)&isCountable0(X1))=>~(X1=slcrc0)),file('/tmp/SRASS.s.p', mCountNFin_01)).
% 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(13, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>(aElementOf0(szszuzczcdt0(X1),szNzAzT0)&~(szszuzczcdt0(X1)=sz00))),file('/tmp/SRASS.s.p', mSuccNum)).
% 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(52, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X1)))),file('/tmp/SRASS.s.p', m__3671)).
% fof(61, axiom,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X1]:(aElementOf0(X1,szNzAzT0)=>sdtlpdtrp0(xe,X1)=szmzizndt0(sdtlpdtrp0(xN,X1)))),file('/tmp/SRASS.s.p', m__4660)).
% fof(81, axiom,((aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))&aElementOf0(xn,szNzAzT0))&sdtlpdtrp0(xe,xn)=xp),file('/tmp/SRASS.s.p', m__5309)).
% fof(85, axiom,(aElementOf0(xm,szNzAzT0)&xx=sdtlpdtrp0(xe,xm)),file('/tmp/SRASS.s.p', m__5389)).
% fof(117, conjecture,(aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))=>aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn)))),file('/tmp/SRASS.s.p', m__)).
% fof(118, negated_conjecture,~((aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))=>aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))))),inference(assume_negation,[status(cth)],[117])).
% fof(131, 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(132, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[132])).
% fof(134, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[133])).
% fof(135, 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)],[134])).
% cnf(137,plain,(aSet0(X1)|X1!=slcrc0),inference(split_conjunct,[status(thm)],[135])).
% fof(143, plain,![X1]:((~(aSet0(X1))|~(isCountable0(X1)))|~(X1=slcrc0)),inference(fof_nnf,[status(thm)],[4])).
% fof(144, plain,![X2]:((~(aSet0(X2))|~(isCountable0(X2)))|~(X2=slcrc0)),inference(variable_rename,[status(thm)],[143])).
% cnf(145,plain,(X1!=slcrc0|~isCountable0(X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[144])).
% fof(146, 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(147, 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)],[146])).
% fof(148, 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)],[147])).
% fof(149, 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)],[148])).
% fof(150, 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)],[149])).
% cnf(153,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[150])).
% cnf(154,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[150])).
% cnf(173,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[11])).
% fof(175, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|(aElementOf0(szszuzczcdt0(X1),szNzAzT0)&~(szszuzczcdt0(X1)=sz00))),inference(fof_nnf,[status(thm)],[13])).
% fof(176, plain,![X2]:(~(aElementOf0(X2,szNzAzT0))|(aElementOf0(szszuzczcdt0(X2),szNzAzT0)&~(szszuzczcdt0(X2)=sz00))),inference(variable_rename,[status(thm)],[175])).
% fof(177, plain,![X2]:((aElementOf0(szszuzczcdt0(X2),szNzAzT0)|~(aElementOf0(X2,szNzAzT0)))&(~(szszuzczcdt0(X2)=sz00)|~(aElementOf0(X2,szNzAzT0)))),inference(distribute,[status(thm)],[176])).
% cnf(179,plain,(aElementOf0(szszuzczcdt0(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[177])).
% fof(245, 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(246, 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)],[245])).
% fof(247, 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)],[246])).
% fof(248, 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)],[247])).
% fof(249, 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)],[248])).
% cnf(252,plain,(X1=slcrc0|aElementOf0(X2,X1)|~aSubsetOf0(X1,szNzAzT0)|X2!=szmzizndt0(X1)),inference(split_conjunct,[status(thm)],[249])).
% fof(351, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X1)))),inference(fof_nnf,[status(thm)],[52])).
% fof(352, plain,![X2]:(~(aElementOf0(X2,szNzAzT0))|(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X2)))),inference(variable_rename,[status(thm)],[351])).
% fof(353, plain,![X2]:((aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)|~(aElementOf0(X2,szNzAzT0)))&(isCountable0(sdtlpdtrp0(xN,X2))|~(aElementOf0(X2,szNzAzT0)))),inference(distribute,[status(thm)],[352])).
% cnf(354,plain,(isCountable0(sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[353])).
% cnf(355,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[353])).
% fof(398, plain,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X1]:(~(aElementOf0(X1,szNzAzT0))|sdtlpdtrp0(xe,X1)=szmzizndt0(sdtlpdtrp0(xN,X1)))),inference(fof_nnf,[status(thm)],[61])).
% fof(399, plain,((aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)&![X2]:(~(aElementOf0(X2,szNzAzT0))|sdtlpdtrp0(xe,X2)=szmzizndt0(sdtlpdtrp0(xN,X2)))),inference(variable_rename,[status(thm)],[398])).
% fof(400, plain,![X2]:((~(aElementOf0(X2,szNzAzT0))|sdtlpdtrp0(xe,X2)=szmzizndt0(sdtlpdtrp0(xN,X2)))&(aFunction0(xe)&szDzozmdt0(xe)=szNzAzT0)),inference(shift_quantors,[status(thm)],[399])).
% cnf(403,plain,(sdtlpdtrp0(xe,X1)=szmzizndt0(sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[400])).
% cnf(440,plain,(aElementOf0(xn,szNzAzT0)),inference(split_conjunct,[status(thm)],[81])).
% cnf(446,plain,(xx=sdtlpdtrp0(xe,xm)),inference(split_conjunct,[status(thm)],[85])).
% cnf(447,plain,(aElementOf0(xm,szNzAzT0)),inference(split_conjunct,[status(thm)],[85])).
% fof(600, negated_conjecture,(aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))&~(aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))))),inference(fof_nnf,[status(thm)],[118])).
% cnf(601,negated_conjecture,(~aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn)))),inference(split_conjunct,[status(thm)],[600])).
% cnf(602,negated_conjecture,(aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))),inference(split_conjunct,[status(thm)],[600])).
% cnf(712,plain,(slcrc0!=sdtlpdtrp0(xN,X1)|~aSet0(sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[145,354,theory(equality)])).
% cnf(741,plain,(aSet0(sdtlpdtrp0(xN,X1))|~aSet0(szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[153,355,theory(equality)])).
% cnf(743,plain,(aSet0(sdtlpdtrp0(xN,X1))|$false|~aElementOf0(X1,szNzAzT0)),inference(rw,[status(thm)],[741,173,theory(equality)])).
% cnf(744,plain,(aSet0(sdtlpdtrp0(xN,X1))|~aElementOf0(X1,szNzAzT0)),inference(cn,[status(thm)],[743,theory(equality)])).
% cnf(939,plain,(slcrc0=sdtlpdtrp0(xN,X1)|aElementOf0(X2,sdtlpdtrp0(xN,X1))|sdtlpdtrp0(xe,X1)!=X2|~aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[252,403,theory(equality)])).
% cnf(949,negated_conjecture,(aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))|~aElementOf0(X1,sdtlpdtrp0(xN,xm))|~aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xn)))),inference(spm,[status(thm)],[154,602,theory(equality)])).
% cnf(2264,plain,(sdtlpdtrp0(xN,X1)!=slcrc0|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[712,137])).
% cnf(4057,plain,(sdtlpdtrp0(xN,X1)=slcrc0|aElementOf0(X2,sdtlpdtrp0(xN,X1))|sdtlpdtrp0(xe,X1)!=X2|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[939,355])).
% cnf(4058,plain,(aElementOf0(X2,sdtlpdtrp0(xN,X1))|sdtlpdtrp0(xe,X1)!=X2|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[4057,2264])).
% cnf(4304,negated_conjecture,(aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))|~aElementOf0(X1,sdtlpdtrp0(xN,xm))|~aElementOf0(szszuzczcdt0(xn),szNzAzT0)),inference(spm,[status(thm)],[949,744,theory(equality)])).
% cnf(27728,negated_conjecture,(~aElementOf0(xx,sdtlpdtrp0(xN,xm))|~aElementOf0(szszuzczcdt0(xn),szNzAzT0)),inference(spm,[status(thm)],[601,4304,theory(equality)])).
% cnf(27808,negated_conjecture,(~aElementOf0(xx,sdtlpdtrp0(xN,xm))|~aElementOf0(xn,szNzAzT0)),inference(spm,[status(thm)],[27728,179,theory(equality)])).
% cnf(27811,negated_conjecture,(~aElementOf0(xx,sdtlpdtrp0(xN,xm))|$false),inference(rw,[status(thm)],[27808,440,theory(equality)])).
% cnf(27812,negated_conjecture,(~aElementOf0(xx,sdtlpdtrp0(xN,xm))),inference(cn,[status(thm)],[27811,theory(equality)])).
% cnf(27815,negated_conjecture,(sdtlpdtrp0(xe,xm)!=xx|~aElementOf0(xm,szNzAzT0)),inference(spm,[status(thm)],[27812,4058,theory(equality)])).
% cnf(27822,negated_conjecture,($false|~aElementOf0(xm,szNzAzT0)),inference(rw,[status(thm)],[27815,446,theory(equality)])).
% cnf(27823,negated_conjecture,($false|$false),inference(rw,[status(thm)],[27822,447,theory(equality)])).
% cnf(27824,negated_conjecture,($false),inference(cn,[status(thm)],[27823,theory(equality)])).
% cnf(27825,negated_conjecture,($false),27824,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4718
% # ...of these trivial : 126
% # ...subsumed : 2521
% # ...remaining for further processing: 2071
% # Other redundant clauses eliminated : 19
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 104
% # Backward-rewritten : 22
% # Generated clauses : 14245
% # ...of the previous two non-trivial : 13287
% # Contextual simplify-reflections : 1255
% # Paramodulations : 14116
% # Factorizations : 0
% # Equation resolutions : 128
% # Current number of processed clauses: 1724
% # Positive orientable unit clauses: 187
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 107
% # Non-unit-clauses : 1430
% # Current number of unprocessed clauses: 8282
% # ...number of literals in the above : 47082
% # Clause-clause subsumption calls (NU) : 242016
% # Rec. Clause-clause subsumption calls : 87392
% # Unit Clause-clause subsumption calls : 8637
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 18
% # Indexed BW rewrite successes : 16
% # Backwards rewriting index: 1380 leaves, 1.22+/-0.781 terms/leaf
% # Paramod-from index: 573 leaves, 1.02+/-0.154 terms/leaf
% # Paramod-into index: 1064 leaves, 1.17+/-0.629 terms/leaf
% # -------------------------------------------------
% # User time : 1.349 s
% # System time : 0.047 s
% # Total time : 1.396 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.89 CPU 1.97 WC
% FINAL PrfWatch: 1.89 CPU 1.97 WC
% SZS output end Solution for /tmp/SystemOnTPTP11902/NUM620+1.tptp
%
%------------------------------------------------------------------------------