TSTP Solution File: NUM574+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM574+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 20:15:14 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP32492/NUM574+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32492/NUM574+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32492/NUM574+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 32588
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(4, axiom,![X1]:(aSet0(X1)=>aSubsetOf0(X1,X1)),file('/tmp/SRASS.s.p', mSubRefl)).
% fof(7, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(8, axiom,aElementOf0(sz00,szNzAzT0),file('/tmp/SRASS.s.p', mZeroNum)).
% fof(11, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>(X1=sz00|?[X2]:(aElementOf0(X2,szNzAzT0)&X1=szszuzczcdt0(X2)))),file('/tmp/SRASS.s.p', mNatExtra)).
% fof(13, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>sdtlseqdt0(sz00,X1)),file('/tmp/SRASS.s.p', mZeroLess)).
% fof(18, 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,(aSubsetOf0(xS,szNzAzT0)&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(37, axiom,(((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)&![X1]:(aElementOf0(X1,szNzAzT0)=>((aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)&isCountable0(sdtlpdtrp0(xN,X1)))=>(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))))))),file('/tmp/SRASS.s.p', m__3623)).
% fof(39, axiom,(aElementOf0(xj,szNzAzT0)&aElementOf0(xi,szNzAzT0)),file('/tmp/SRASS.s.p', m__3786)).
% fof(41, axiom,((sdtlseqdt0(xj,xi)&?[X1]:(aElementOf0(X1,szNzAzT0)&szszuzczcdt0(X1)=xi))=>(sdtlseqdt0(xj,xi)=>aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)))),file('/tmp/SRASS.s.p', m__3786_02)).
% fof(86, conjecture,(sdtlseqdt0(xj,xi)=>aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))),file('/tmp/SRASS.s.p', m__)).
% fof(87, negated_conjecture,~((sdtlseqdt0(xj,xi)=>aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)))),inference(assume_negation,[status(cth)],[86])).
% fof(103, 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)],[2])).
% fof(104, 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)],[103])).
% fof(105, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[104])).
% fof(106, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk1_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk1_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[106])).
% cnf(110,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[107])).
% fof(116, plain,![X1]:(~(aSet0(X1))|aSubsetOf0(X1,X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(117, plain,![X2]:(~(aSet0(X2))|aSubsetOf0(X2,X2)),inference(variable_rename,[status(thm)],[116])).
% cnf(118,plain,(aSubsetOf0(X1,X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[117])).
% cnf(126,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(127,plain,(aElementOf0(sz00,szNzAzT0)),inference(split_conjunct,[status(thm)],[8])).
% fof(136, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|(X1=sz00|?[X2]:(aElementOf0(X2,szNzAzT0)&X1=szszuzczcdt0(X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(137, plain,![X3]:(~(aElementOf0(X3,szNzAzT0))|(X3=sz00|?[X4]:(aElementOf0(X4,szNzAzT0)&X3=szszuzczcdt0(X4)))),inference(variable_rename,[status(thm)],[136])).
% fof(138, plain,![X3]:(~(aElementOf0(X3,szNzAzT0))|(X3=sz00|(aElementOf0(esk2_1(X3),szNzAzT0)&X3=szszuzczcdt0(esk2_1(X3))))),inference(skolemize,[status(esa)],[137])).
% fof(139, plain,![X3]:(((aElementOf0(esk2_1(X3),szNzAzT0)|X3=sz00)|~(aElementOf0(X3,szNzAzT0)))&((X3=szszuzczcdt0(esk2_1(X3))|X3=sz00)|~(aElementOf0(X3,szNzAzT0)))),inference(distribute,[status(thm)],[138])).
% cnf(140,plain,(X1=sz00|X1=szszuzczcdt0(esk2_1(X1))|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[139])).
% cnf(141,plain,(X1=sz00|aElementOf0(esk2_1(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[139])).
% fof(145, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|sdtlseqdt0(sz00,X1)),inference(fof_nnf,[status(thm)],[13])).
% fof(146, plain,![X2]:(~(aElementOf0(X2,szNzAzT0))|sdtlseqdt0(sz00,X2)),inference(variable_rename,[status(thm)],[145])).
% cnf(147,plain,(sdtlseqdt0(sz00,X1)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[146])).
% fof(162, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[18])).
% fof(163, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|((~(sdtlseqdt0(X3,X4))|~(sdtlseqdt0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[162])).
% cnf(164,plain,(X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[163])).
% cnf(222,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[31])).
% fof(239, plain,(((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)&![X1]:(~(aElementOf0(X1,szNzAzT0))|((~(aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X1))))|(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))))))),inference(fof_nnf,[status(thm)],[37])).
% fof(240, plain,(((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)&![X2]:(~(aElementOf0(X2,szNzAzT0))|((~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2))))|(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2))))))),inference(variable_rename,[status(thm)],[239])).
% fof(241, plain,![X2]:((~(aElementOf0(X2,szNzAzT0))|((~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2))))|(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2))))))&((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)),inference(shift_quantors,[status(thm)],[240])).
% fof(242, plain,![X2]:((((aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))|(~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2)))))|~(aElementOf0(X2,szNzAzT0)))&((isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2)))|(~(aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0))|~(isCountable0(sdtlpdtrp0(xN,X2)))))|~(aElementOf0(X2,szNzAzT0))))&((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)),inference(distribute,[status(thm)],[241])).
% cnf(243,plain,(sdtlpdtrp0(xN,sz00)=xS),inference(split_conjunct,[status(thm)],[242])).
% cnf(253,plain,(aElementOf0(xi,szNzAzT0)),inference(split_conjunct,[status(thm)],[39])).
% cnf(254,plain,(aElementOf0(xj,szNzAzT0)),inference(split_conjunct,[status(thm)],[39])).
% fof(258, plain,((~(sdtlseqdt0(xj,xi))|![X1]:(~(aElementOf0(X1,szNzAzT0))|~(szszuzczcdt0(X1)=xi)))|(~(sdtlseqdt0(xj,xi))|aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)))),inference(fof_nnf,[status(thm)],[41])).
% fof(259, plain,((~(sdtlseqdt0(xj,xi))|![X2]:(~(aElementOf0(X2,szNzAzT0))|~(szszuzczcdt0(X2)=xi)))|(~(sdtlseqdt0(xj,xi))|aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)))),inference(variable_rename,[status(thm)],[258])).
% fof(260, plain,![X2]:(((~(aElementOf0(X2,szNzAzT0))|~(szszuzczcdt0(X2)=xi))|~(sdtlseqdt0(xj,xi)))|(~(sdtlseqdt0(xj,xi))|aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)))),inference(shift_quantors,[status(thm)],[259])).
% cnf(261,plain,(aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))|~sdtlseqdt0(xj,xi)|~sdtlseqdt0(xj,xi)|szszuzczcdt0(X1)!=xi|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[260])).
% fof(485, negated_conjecture,(sdtlseqdt0(xj,xi)&~(aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)))),inference(fof_nnf,[status(thm)],[87])).
% cnf(486,negated_conjecture,(~aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))),inference(split_conjunct,[status(thm)],[485])).
% cnf(487,negated_conjecture,(sdtlseqdt0(xj,xi)),inference(split_conjunct,[status(thm)],[485])).
% cnf(490,plain,(aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))|szszuzczcdt0(X1)!=xi|~aElementOf0(X1,szNzAzT0)|$false),inference(rw,[status(thm)],[261,487,theory(equality)])).
% cnf(491,plain,(aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))|szszuzczcdt0(X1)!=xi|~aElementOf0(X1,szNzAzT0)),inference(cn,[status(thm)],[490,theory(equality)])).
% cnf(492,plain,(szszuzczcdt0(X1)!=xi|~aElementOf0(X1,szNzAzT0)),inference(sr,[status(thm)],[491,486,theory(equality)])).
% cnf(540,plain,(aSet0(xS)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[110,222,theory(equality)])).
% cnf(543,plain,(aSet0(xS)|$false),inference(rw,[status(thm)],[540,126,theory(equality)])).
% cnf(544,plain,(aSet0(xS)),inference(cn,[status(thm)],[543,theory(equality)])).
% cnf(678,plain,(sz00=X1|X1!=xi|~aElementOf0(esk2_1(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[492,140,theory(equality)])).
% cnf(712,plain,(X1=sz00|~sdtlseqdt0(X1,sz00)|~aElementOf0(sz00,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[164,147,theory(equality)])).
% cnf(717,plain,(X1=sz00|~sdtlseqdt0(X1,sz00)|$false|~aElementOf0(X1,szNzAzT0)),inference(rw,[status(thm)],[712,127,theory(equality)])).
% cnf(718,plain,(X1=sz00|~sdtlseqdt0(X1,sz00)|~aElementOf0(X1,szNzAzT0)),inference(cn,[status(thm)],[717,theory(equality)])).
% cnf(2519,plain,(sz00=X1|X1!=xi|~aElementOf0(X1,szNzAzT0)),inference(csr,[status(thm)],[678,141])).
% cnf(2531,plain,(sz00=xi),inference(spm,[status(thm)],[2519,253,theory(equality)])).
% cnf(2613,negated_conjecture,(~aSubsetOf0(xS,sdtlpdtrp0(xN,xj))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[486,2531,theory(equality)]),243,theory(equality)])).
% cnf(2614,negated_conjecture,(sdtlseqdt0(xj,sz00)),inference(rw,[status(thm)],[487,2531,theory(equality)])).
% cnf(2640,negated_conjecture,(xj=sz00|~aElementOf0(xj,szNzAzT0)),inference(spm,[status(thm)],[718,2614,theory(equality)])).
% cnf(2647,negated_conjecture,(xj=sz00|$false),inference(rw,[status(thm)],[2640,254,theory(equality)])).
% cnf(2648,negated_conjecture,(xj=sz00),inference(cn,[status(thm)],[2647,theory(equality)])).
% cnf(2691,negated_conjecture,(~aSubsetOf0(xS,xS)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2613,2648,theory(equality)]),243,theory(equality)])).
% cnf(2692,negated_conjecture,(~aSet0(xS)),inference(spm,[status(thm)],[2691,118,theory(equality)])).
% cnf(2694,negated_conjecture,($false),inference(rw,[status(thm)],[2692,544,theory(equality)])).
% cnf(2695,negated_conjecture,($false),inference(cn,[status(thm)],[2694,theory(equality)])).
% cnf(2696,negated_conjecture,($false),2695,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 620
% # ...of these trivial : 12
% # ...subsumed : 108
% # ...remaining for further processing: 500
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 54
% # Generated clauses : 1140
% # ...of the previous two non-trivial : 1069
% # Contextual simplify-reflections : 96
% # Paramodulations : 1090
% # Factorizations : 0
% # Equation resolutions : 48
% # Current number of processed clauses: 272
% # Positive orientable unit clauses: 44
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 214
% # Current number of unprocessed clauses: 665
% # ...number of literals in the above : 3661
% # Clause-clause subsumption calls (NU) : 4053
% # Rec. Clause-clause subsumption calls : 1682
% # Unit Clause-clause subsumption calls : 688
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 274 leaves, 1.33+/-0.960 terms/leaf
% # Paramod-from index: 137 leaves, 1.02+/-0.146 terms/leaf
% # Paramod-into index: 239 leaves, 1.19+/-0.602 terms/leaf
% # -------------------------------------------------
% # User time : 0.123 s
% # System time : 0.007 s
% # Total time : 0.130 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.35 WC
% FINAL PrfWatch: 0.26 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP32492/NUM574+1.tptp
%
%------------------------------------------------------------------------------