TSTP Solution File: NUM566+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM566+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 : art01.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:07:56 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP26412/NUM566+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26412/NUM566+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26412/NUM566+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 26508
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(7, axiom,![X1]:(aSet0(X1)=>aSubsetOf0(X1,X1)),file('/tmp/SRASS.s.p', mSubRefl)).
% fof(10, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(19, axiom,![X1]:(aFunction0(X1)=>![X2]:(aElementOf0(X2,szDzozmdt0(X1))=>aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))))),file('/tmp/SRASS.s.p', mImgRng)).
% fof(21, axiom,(aSet0(xT)&isFinite0(xT)),file('/tmp/SRASS.s.p', m__3291)).
% fof(23, axiom,(aSubsetOf0(xS,szNzAzT0)&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(24, axiom,((aFunction0(xc)&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),file('/tmp/SRASS.s.p', m__3453)).
% fof(26, axiom,xK=sz00,file('/tmp/SRASS.s.p', m__3462)).
% fof(27, axiom,aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),file('/tmp/SRASS.s.p', m__3476)).
% fof(28, axiom,![X1]:(aElementOf0(X1,slbdtsldtrb0(xS,sz00))=>sdtlpdtrp0(xc,X1)=sdtlpdtrp0(xc,slcrc0)),file('/tmp/SRASS.s.p', m__3507)).
% fof(81, conjecture,?[X1]:(aElementOf0(X1,xT)&?[X2]:((aSubsetOf0(X2,xS)&isCountable0(X2))&![X3]:(aElementOf0(X3,slbdtsldtrb0(X2,xK))=>sdtlpdtrp0(xc,X3)=X1))),file('/tmp/SRASS.s.p', m__)).
% fof(82, negated_conjecture,~(?[X1]:(aElementOf0(X1,xT)&?[X2]:((aSubsetOf0(X2,xS)&isCountable0(X2))&![X3]:(aElementOf0(X3,slbdtsldtrb0(X2,xK))=>sdtlpdtrp0(xc,X3)=X1)))),inference(assume_negation,[status(cth)],[81])).
% fof(110, 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(111, 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)],[110])).
% fof(112, 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)],[111])).
% fof(113, 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)],[112])).
% fof(114, 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)],[113])).
% cnf(117,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[114])).
% cnf(118,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[114])).
% fof(123, plain,![X1]:(~(aSet0(X1))|aSubsetOf0(X1,X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(124, plain,![X2]:(~(aSet0(X2))|aSubsetOf0(X2,X2)),inference(variable_rename,[status(thm)],[123])).
% cnf(125,plain,(aSubsetOf0(X1,X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[124])).
% cnf(133,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[10])).
% fof(174, plain,![X1]:(~(aFunction0(X1))|![X2]:(~(aElementOf0(X2,szDzozmdt0(X1)))|aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))))),inference(fof_nnf,[status(thm)],[19])).
% fof(175, plain,![X3]:(~(aFunction0(X3))|![X4]:(~(aElementOf0(X4,szDzozmdt0(X3)))|aElementOf0(sdtlpdtrp0(X3,X4),sdtlcdtrc0(X3,szDzozmdt0(X3))))),inference(variable_rename,[status(thm)],[174])).
% fof(176, plain,![X3]:![X4]:((~(aElementOf0(X4,szDzozmdt0(X3)))|aElementOf0(sdtlpdtrp0(X3,X4),sdtlcdtrc0(X3,szDzozmdt0(X3))))|~(aFunction0(X3))),inference(shift_quantors,[status(thm)],[175])).
% cnf(177,plain,(aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1)))|~aFunction0(X1)|~aElementOf0(X2,szDzozmdt0(X1))),inference(split_conjunct,[status(thm)],[176])).
% cnf(188,plain,(aSet0(xT)),inference(split_conjunct,[status(thm)],[21])).
% cnf(190,plain,(isCountable0(xS)),inference(split_conjunct,[status(thm)],[23])).
% cnf(191,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(192,plain,(aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),inference(split_conjunct,[status(thm)],[24])).
% cnf(193,plain,(szDzozmdt0(xc)=slbdtsldtrb0(xS,xK)),inference(split_conjunct,[status(thm)],[24])).
% cnf(194,plain,(aFunction0(xc)),inference(split_conjunct,[status(thm)],[24])).
% cnf(204,plain,(xK=sz00),inference(split_conjunct,[status(thm)],[26])).
% cnf(205,plain,(aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00))),inference(split_conjunct,[status(thm)],[27])).
% fof(206, plain,![X1]:(~(aElementOf0(X1,slbdtsldtrb0(xS,sz00)))|sdtlpdtrp0(xc,X1)=sdtlpdtrp0(xc,slcrc0)),inference(fof_nnf,[status(thm)],[28])).
% fof(207, plain,![X2]:(~(aElementOf0(X2,slbdtsldtrb0(xS,sz00)))|sdtlpdtrp0(xc,X2)=sdtlpdtrp0(xc,slcrc0)),inference(variable_rename,[status(thm)],[206])).
% cnf(208,plain,(sdtlpdtrp0(xc,X1)=sdtlpdtrp0(xc,slcrc0)|~aElementOf0(X1,slbdtsldtrb0(xS,sz00))),inference(split_conjunct,[status(thm)],[207])).
% fof(458, negated_conjecture,![X1]:(~(aElementOf0(X1,xT))|![X2]:((~(aSubsetOf0(X2,xS))|~(isCountable0(X2)))|?[X3]:(aElementOf0(X3,slbdtsldtrb0(X2,xK))&~(sdtlpdtrp0(xc,X3)=X1)))),inference(fof_nnf,[status(thm)],[82])).
% fof(459, negated_conjecture,![X4]:(~(aElementOf0(X4,xT))|![X5]:((~(aSubsetOf0(X5,xS))|~(isCountable0(X5)))|?[X6]:(aElementOf0(X6,slbdtsldtrb0(X5,xK))&~(sdtlpdtrp0(xc,X6)=X4)))),inference(variable_rename,[status(thm)],[458])).
% fof(460, negated_conjecture,![X4]:(~(aElementOf0(X4,xT))|![X5]:((~(aSubsetOf0(X5,xS))|~(isCountable0(X5)))|(aElementOf0(esk22_2(X4,X5),slbdtsldtrb0(X5,xK))&~(sdtlpdtrp0(xc,esk22_2(X4,X5))=X4)))),inference(skolemize,[status(esa)],[459])).
% fof(461, negated_conjecture,![X4]:![X5]:(((~(aSubsetOf0(X5,xS))|~(isCountable0(X5)))|(aElementOf0(esk22_2(X4,X5),slbdtsldtrb0(X5,xK))&~(sdtlpdtrp0(xc,esk22_2(X4,X5))=X4)))|~(aElementOf0(X4,xT))),inference(shift_quantors,[status(thm)],[460])).
% fof(462, negated_conjecture,![X4]:![X5]:(((aElementOf0(esk22_2(X4,X5),slbdtsldtrb0(X5,xK))|(~(aSubsetOf0(X5,xS))|~(isCountable0(X5))))|~(aElementOf0(X4,xT)))&((~(sdtlpdtrp0(xc,esk22_2(X4,X5))=X4)|(~(aSubsetOf0(X5,xS))|~(isCountable0(X5))))|~(aElementOf0(X4,xT)))),inference(distribute,[status(thm)],[461])).
% cnf(463,negated_conjecture,(~aElementOf0(X1,xT)|~isCountable0(X2)|~aSubsetOf0(X2,xS)|sdtlpdtrp0(xc,esk22_2(X1,X2))!=X1),inference(split_conjunct,[status(thm)],[462])).
% cnf(464,negated_conjecture,(aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,xK))|~aElementOf0(X1,xT)|~isCountable0(X2)|~aSubsetOf0(X2,xS)),inference(split_conjunct,[status(thm)],[462])).
% cnf(466,plain,(slbdtsldtrb0(xS,sz00)=szDzozmdt0(xc)),inference(rw,[status(thm)],[193,204,theory(equality)])).
% cnf(468,plain,(aElementOf0(slcrc0,szDzozmdt0(xc))),inference(rw,[status(thm)],[205,466,theory(equality)])).
% cnf(471,plain,(sdtlpdtrp0(xc,slcrc0)=sdtlpdtrp0(xc,X1)|~aElementOf0(X1,szDzozmdt0(xc))),inference(rw,[status(thm)],[208,466,theory(equality)])).
% cnf(472,negated_conjecture,(aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,sz00))|~isCountable0(X2)|~aElementOf0(X1,xT)|~aSubsetOf0(X2,xS)),inference(rw,[status(thm)],[464,204,theory(equality)])).
% cnf(507,plain,(aSet0(xS)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[117,191,theory(equality)])).
% cnf(510,plain,(aSet0(xS)|$false),inference(rw,[status(thm)],[507,133,theory(equality)])).
% cnf(511,plain,(aSet0(xS)),inference(cn,[status(thm)],[510,theory(equality)])).
% cnf(556,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aSubsetOf0(X2,xS)|~isCountable0(X2)|~aElementOf0(X1,xT)|~aElementOf0(esk22_2(X1,X2),szDzozmdt0(xc))),inference(spm,[status(thm)],[463,471,theory(equality)])).
% cnf(580,negated_conjecture,(aElementOf0(esk22_2(X1,xS),szDzozmdt0(xc))|~aSubsetOf0(xS,xS)|~isCountable0(xS)|~aElementOf0(X1,xT)),inference(spm,[status(thm)],[472,466,theory(equality)])).
% cnf(581,negated_conjecture,(aElementOf0(esk22_2(X1,xS),szDzozmdt0(xc))|~aSubsetOf0(xS,xS)|$false|~aElementOf0(X1,xT)),inference(rw,[status(thm)],[580,190,theory(equality)])).
% cnf(582,negated_conjecture,(aElementOf0(esk22_2(X1,xS),szDzozmdt0(xc))|~aSubsetOf0(xS,xS)|~aElementOf0(X1,xT)),inference(cn,[status(thm)],[581,theory(equality)])).
% cnf(594,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))|~aSet0(xT)),inference(spm,[status(thm)],[118,192,theory(equality)])).
% cnf(598,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))|$false),inference(rw,[status(thm)],[594,188,theory(equality)])).
% cnf(599,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))),inference(cn,[status(thm)],[598,theory(equality)])).
% cnf(1532,plain,(aElementOf0(sdtlpdtrp0(xc,X1),xT)|~aFunction0(xc)|~aElementOf0(X1,szDzozmdt0(xc))),inference(spm,[status(thm)],[599,177,theory(equality)])).
% cnf(1541,plain,(aElementOf0(sdtlpdtrp0(xc,X1),xT)|$false|~aElementOf0(X1,szDzozmdt0(xc))),inference(rw,[status(thm)],[1532,194,theory(equality)])).
% cnf(1542,plain,(aElementOf0(sdtlpdtrp0(xc,X1),xT)|~aElementOf0(X1,szDzozmdt0(xc))),inference(cn,[status(thm)],[1541,theory(equality)])).
% cnf(1552,plain,(aElementOf0(sdtlpdtrp0(xc,slcrc0),xT)|~aElementOf0(X1,szDzozmdt0(xc))),inference(spm,[status(thm)],[1542,471,theory(equality)])).
% cnf(1580,plain,(aElementOf0(sdtlpdtrp0(xc,slcrc0),xT)),inference(spm,[status(thm)],[1552,468,theory(equality)])).
% cnf(1643,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aSubsetOf0(xS,xS)|~isCountable0(xS)|~aElementOf0(X1,xT)),inference(spm,[status(thm)],[556,582,theory(equality)])).
% cnf(1644,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aSubsetOf0(xS,xS)|$false|~aElementOf0(X1,xT)),inference(rw,[status(thm)],[1643,190,theory(equality)])).
% cnf(1645,negated_conjecture,(sdtlpdtrp0(xc,slcrc0)!=X1|~aSubsetOf0(xS,xS)|~aElementOf0(X1,xT)),inference(cn,[status(thm)],[1644,theory(equality)])).
% cnf(1646,negated_conjecture,(~aSubsetOf0(xS,xS)|~aElementOf0(sdtlpdtrp0(xc,slcrc0),xT)),inference(er,[status(thm)],[1645,theory(equality)])).
% cnf(1651,negated_conjecture,(~aSubsetOf0(xS,xS)|$false),inference(rw,[status(thm)],[1646,1580,theory(equality)])).
% cnf(1652,negated_conjecture,(~aSubsetOf0(xS,xS)),inference(cn,[status(thm)],[1651,theory(equality)])).
% cnf(1659,negated_conjecture,(~aSet0(xS)),inference(spm,[status(thm)],[1652,125,theory(equality)])).
% cnf(1661,negated_conjecture,($false),inference(rw,[status(thm)],[1659,511,theory(equality)])).
% cnf(1662,negated_conjecture,($false),inference(cn,[status(thm)],[1661,theory(equality)])).
% cnf(1663,negated_conjecture,($false),1662,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 426
% # ...of these trivial : 6
% # ...subsumed : 52
% # ...remaining for further processing: 368
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 2
% # Generated clauses : 778
% # ...of the previous two non-trivial : 711
% # Contextual simplify-reflections : 45
% # Paramodulations : 735
% # Factorizations : 0
% # Equation resolutions : 43
% # Current number of processed clauses: 209
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 175
% # Current number of unprocessed clauses: 578
% # ...number of literals in the above : 3288
% # Clause-clause subsumption calls (NU) : 1022
% # Rec. Clause-clause subsumption calls : 439
% # Unit Clause-clause subsumption calls : 125
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 211 leaves, 1.41+/-1.060 terms/leaf
% # Paramod-from index: 102 leaves, 1.03+/-0.169 terms/leaf
% # Paramod-into index: 184 leaves, 1.23+/-0.669 terms/leaf
% # -------------------------------------------------
% # User time : 0.092 s
% # System time : 0.003 s
% # Total time : 0.095 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.29 WC
% FINAL PrfWatch: 0.23 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP26412/NUM566+1.tptp
%
%------------------------------------------------------------------------------