TSTP Solution File: NUM612+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM612+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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:37:38 EST 2010
% Result : Theorem 14.59s
% Output : Solution 14.59s
% 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/SystemOnTPTP22338/NUM612+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22338/NUM612+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22338/NUM612+3.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 22434
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.02 WC
% PrfWatch: 7.91 CPU 8.03 WC
% PrfWatch: 9.91 CPU 10.03 WC
% # Preprocessing time : 0.619 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.90 CPU 12.04 WC
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:((aSet0(X1)&isFinite0(X1))=>![X2]:(aSubsetOf0(X2,X1)=>isFinite0(X2))),file('/tmp/SRASS.s.p', mSubFSet)).
% fof(35, axiom,![X1]:(aSet0(X1)=>(aElementOf0(sbrdtbr0(X1),szNzAzT0)<=>isFinite0(X1))),file('/tmp/SRASS.s.p', mCardNum)).
% fof(38, axiom,![X1]:(aSet0(X1)=>![X2]:((isFinite0(X1)&aElementOf0(X2,X1))=>szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1))),file('/tmp/SRASS.s.p', mCardDiff)).
% fof(58, axiom,aElementOf0(xK,szNzAzT0),file('/tmp/SRASS.s.p', m__3418)).
% fof(83, axiom,((((aSet0(xQ)&![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),file('/tmp/SRASS.s.p', m__5078)).
% fof(87, axiom,((aElementOf0(xp,xQ)&![X1]:(aElementOf0(X1,xQ)=>sdtlseqdt0(xp,X1)))&xp=szmzizndt0(xQ)),file('/tmp/SRASS.s.p', m__5147)).
% fof(88, axiom,(((aSet0(xP)&![X1]:(aElementOf0(X1,xQ)=>sdtlseqdt0(szmzizndt0(xQ),X1)))&![X1]:(aElementOf0(X1,xP)<=>((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=szmzizndt0(xQ)))))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),file('/tmp/SRASS.s.p', m__5164)).
% fof(91, axiom,(![X1]:(aElementOf0(X1,xP)=>aElementOf0(X1,xQ))&aSubsetOf0(xP,xQ)),file('/tmp/SRASS.s.p', m__5195)).
% fof(109, conjecture,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)&aElementOf0(sbrdtbr0(xP),szNzAzT0)),file('/tmp/SRASS.s.p', m__)).
% fof(110, negated_conjecture,~((szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)&aElementOf0(sbrdtbr0(xP),szNzAzT0))),inference(assume_negation,[status(cth)],[109])).
% fof(159, plain,![X1]:((~(aSet0(X1))|~(isFinite0(X1)))|![X2]:(~(aSubsetOf0(X2,X1))|isFinite0(X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(160, plain,![X3]:((~(aSet0(X3))|~(isFinite0(X3)))|![X4]:(~(aSubsetOf0(X4,X3))|isFinite0(X4))),inference(variable_rename,[status(thm)],[159])).
% fof(161, plain,![X3]:![X4]:((~(aSubsetOf0(X4,X3))|isFinite0(X4))|(~(aSet0(X3))|~(isFinite0(X3)))),inference(shift_quantors,[status(thm)],[160])).
% cnf(162,plain,(isFinite0(X2)|~isFinite0(X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[161])).
% fof(275, plain,![X1]:(~(aSet0(X1))|((~(aElementOf0(sbrdtbr0(X1),szNzAzT0))|isFinite0(X1))&(~(isFinite0(X1))|aElementOf0(sbrdtbr0(X1),szNzAzT0)))),inference(fof_nnf,[status(thm)],[35])).
% fof(276, plain,![X2]:(~(aSet0(X2))|((~(aElementOf0(sbrdtbr0(X2),szNzAzT0))|isFinite0(X2))&(~(isFinite0(X2))|aElementOf0(sbrdtbr0(X2),szNzAzT0)))),inference(variable_rename,[status(thm)],[275])).
% fof(277, plain,![X2]:(((~(aElementOf0(sbrdtbr0(X2),szNzAzT0))|isFinite0(X2))|~(aSet0(X2)))&((~(isFinite0(X2))|aElementOf0(sbrdtbr0(X2),szNzAzT0))|~(aSet0(X2)))),inference(distribute,[status(thm)],[276])).
% cnf(278,plain,(aElementOf0(sbrdtbr0(X1),szNzAzT0)|~aSet0(X1)|~isFinite0(X1)),inference(split_conjunct,[status(thm)],[277])).
% cnf(279,plain,(isFinite0(X1)|~aSet0(X1)|~aElementOf0(sbrdtbr0(X1),szNzAzT0)),inference(split_conjunct,[status(thm)],[277])).
% fof(289, plain,![X1]:(~(aSet0(X1))|![X2]:((~(isFinite0(X1))|~(aElementOf0(X2,X1)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1))),inference(fof_nnf,[status(thm)],[38])).
% fof(290, plain,![X3]:(~(aSet0(X3))|![X4]:((~(isFinite0(X3))|~(aElementOf0(X4,X3)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4)))=sbrdtbr0(X3))),inference(variable_rename,[status(thm)],[289])).
% fof(291, plain,![X3]:![X4]:(((~(isFinite0(X3))|~(aElementOf0(X4,X3)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4)))=sbrdtbr0(X3))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[290])).
% cnf(292,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1)|~aSet0(X1)|~aElementOf0(X2,X1)|~isFinite0(X1)),inference(split_conjunct,[status(thm)],[291])).
% cnf(405,plain,(aElementOf0(xK,szNzAzT0)),inference(split_conjunct,[status(thm)],[58])).
% fof(4586, plain,((((aSet0(xQ)&![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(fof_nnf,[status(thm)],[83])).
% fof(4587, plain,((((aSet0(xQ)&![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(variable_rename,[status(thm)],[4586])).
% fof(4588, plain,![X2]:(((((~(aElementOf0(X2,xQ))|aElementOf0(X2,xO))&aSet0(xQ))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(shift_quantors,[status(thm)],[4587])).
% cnf(4590,plain,(sbrdtbr0(xQ)=xK),inference(split_conjunct,[status(thm)],[4588])).
% cnf(4592,plain,(aSet0(xQ)),inference(split_conjunct,[status(thm)],[4588])).
% fof(4614, plain,((aElementOf0(xp,xQ)&![X1]:(~(aElementOf0(X1,xQ))|sdtlseqdt0(xp,X1)))&xp=szmzizndt0(xQ)),inference(fof_nnf,[status(thm)],[87])).
% fof(4615, plain,((aElementOf0(xp,xQ)&![X2]:(~(aElementOf0(X2,xQ))|sdtlseqdt0(xp,X2)))&xp=szmzizndt0(xQ)),inference(variable_rename,[status(thm)],[4614])).
% fof(4616, plain,![X2]:(((~(aElementOf0(X2,xQ))|sdtlseqdt0(xp,X2))&aElementOf0(xp,xQ))&xp=szmzizndt0(xQ)),inference(shift_quantors,[status(thm)],[4615])).
% cnf(4617,plain,(xp=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[4616])).
% cnf(4618,plain,(aElementOf0(xp,xQ)),inference(split_conjunct,[status(thm)],[4616])).
% fof(4620, plain,(((aSet0(xP)&![X1]:(~(aElementOf0(X1,xQ))|sdtlseqdt0(szmzizndt0(xQ),X1)))&![X1]:((~(aElementOf0(X1,xP))|((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=szmzizndt0(xQ))))&(((~(aElement0(X1))|~(aElementOf0(X1,xQ)))|X1=szmzizndt0(xQ))|aElementOf0(X1,xP))))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(fof_nnf,[status(thm)],[88])).
% fof(4621, plain,(((aSet0(xP)&![X2]:(~(aElementOf0(X2,xQ))|sdtlseqdt0(szmzizndt0(xQ),X2)))&![X3]:((~(aElementOf0(X3,xP))|((aElement0(X3)&aElementOf0(X3,xQ))&~(X3=szmzizndt0(xQ))))&(((~(aElement0(X3))|~(aElementOf0(X3,xQ)))|X3=szmzizndt0(xQ))|aElementOf0(X3,xP))))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(variable_rename,[status(thm)],[4620])).
% fof(4622, plain,![X2]:![X3]:((((~(aElementOf0(X3,xP))|((aElement0(X3)&aElementOf0(X3,xQ))&~(X3=szmzizndt0(xQ))))&(((~(aElement0(X3))|~(aElementOf0(X3,xQ)))|X3=szmzizndt0(xQ))|aElementOf0(X3,xP)))&((~(aElementOf0(X2,xQ))|sdtlseqdt0(szmzizndt0(xQ),X2))&aSet0(xP)))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(shift_quantors,[status(thm)],[4621])).
% fof(4623, plain,![X2]:![X3]:((((((aElement0(X3)|~(aElementOf0(X3,xP)))&(aElementOf0(X3,xQ)|~(aElementOf0(X3,xP))))&(~(X3=szmzizndt0(xQ))|~(aElementOf0(X3,xP))))&(((~(aElement0(X3))|~(aElementOf0(X3,xQ)))|X3=szmzizndt0(xQ))|aElementOf0(X3,xP)))&((~(aElementOf0(X2,xQ))|sdtlseqdt0(szmzizndt0(xQ),X2))&aSet0(xP)))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(distribute,[status(thm)],[4622])).
% cnf(4624,plain,(xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(split_conjunct,[status(thm)],[4623])).
% cnf(4625,plain,(aSet0(xP)),inference(split_conjunct,[status(thm)],[4623])).
% fof(4636, plain,(![X1]:(~(aElementOf0(X1,xP))|aElementOf0(X1,xQ))&aSubsetOf0(xP,xQ)),inference(fof_nnf,[status(thm)],[91])).
% fof(4637, plain,(![X2]:(~(aElementOf0(X2,xP))|aElementOf0(X2,xQ))&aSubsetOf0(xP,xQ)),inference(variable_rename,[status(thm)],[4636])).
% fof(4638, plain,![X2]:((~(aElementOf0(X2,xP))|aElementOf0(X2,xQ))&aSubsetOf0(xP,xQ)),inference(shift_quantors,[status(thm)],[4637])).
% cnf(4639,plain,(aSubsetOf0(xP,xQ)),inference(split_conjunct,[status(thm)],[4638])).
% fof(4715, negated_conjecture,(~(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ))|~(aElementOf0(sbrdtbr0(xP),szNzAzT0))),inference(fof_nnf,[status(thm)],[110])).
% cnf(4716,negated_conjecture,(~aElementOf0(sbrdtbr0(xP),szNzAzT0)|szszuzczcdt0(sbrdtbr0(xP))!=sbrdtbr0(xQ)),inference(split_conjunct,[status(thm)],[4715])).
% cnf(5370,plain,(sdtmndt0(xQ,xp)=xP),inference(rw,[status(thm)],[4624,4617,theory(equality)])).
% cnf(5373,negated_conjecture,(szszuzczcdt0(sbrdtbr0(xP))!=xK|~aElementOf0(sbrdtbr0(xP),szNzAzT0)),inference(rw,[status(thm)],[4716,4590,theory(equality)])).
% cnf(8824,plain,(isFinite0(xP)|~isFinite0(xQ)|~aSet0(xQ)),inference(spm,[status(thm)],[162,4639,theory(equality)])).
% cnf(8835,plain,(isFinite0(xP)|~isFinite0(xQ)|$false),inference(rw,[status(thm)],[8824,4592,theory(equality)])).
% cnf(8836,plain,(isFinite0(xP)|~isFinite0(xQ)),inference(cn,[status(thm)],[8835,theory(equality)])).
% cnf(9100,plain,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)|~isFinite0(xQ)|~aElementOf0(xp,xQ)|~aSet0(xQ)),inference(spm,[status(thm)],[292,5370,theory(equality)])).
% cnf(9102,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK|~isFinite0(xQ)|~aElementOf0(xp,xQ)|~aSet0(xQ)),inference(rw,[status(thm)],[9100,4590,theory(equality)])).
% cnf(9103,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK|~isFinite0(xQ)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[9102,4618,theory(equality)])).
% cnf(9104,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK|~isFinite0(xQ)|$false|$false),inference(rw,[status(thm)],[9103,4592,theory(equality)])).
% cnf(9105,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK|~isFinite0(xQ)),inference(cn,[status(thm)],[9104,theory(equality)])).
% cnf(84632,negated_conjecture,(~aElementOf0(sbrdtbr0(xP),szNzAzT0)|~isFinite0(xQ)),inference(spm,[status(thm)],[5373,9105,theory(equality)])).
% cnf(84680,negated_conjecture,(~aElementOf0(sbrdtbr0(xP),szNzAzT0)|~aElementOf0(sbrdtbr0(xQ),szNzAzT0)|~aSet0(xQ)),inference(spm,[status(thm)],[84632,279,theory(equality)])).
% cnf(84681,negated_conjecture,(~aElementOf0(sbrdtbr0(xP),szNzAzT0)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[84680,4590,theory(equality)]),405,theory(equality)])).
% cnf(84682,negated_conjecture,(~aElementOf0(sbrdtbr0(xP),szNzAzT0)|$false|$false),inference(rw,[status(thm)],[84681,4592,theory(equality)])).
% cnf(84683,negated_conjecture,(~aElementOf0(sbrdtbr0(xP),szNzAzT0)),inference(cn,[status(thm)],[84682,theory(equality)])).
% cnf(85251,plain,(isFinite0(xP)|~aElementOf0(sbrdtbr0(xQ),szNzAzT0)|~aSet0(xQ)),inference(spm,[status(thm)],[8836,279,theory(equality)])).
% cnf(85252,plain,(isFinite0(xP)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[85251,4590,theory(equality)]),405,theory(equality)])).
% cnf(85253,plain,(isFinite0(xP)|$false|$false),inference(rw,[status(thm)],[85252,4592,theory(equality)])).
% cnf(85254,plain,(isFinite0(xP)),inference(cn,[status(thm)],[85253,theory(equality)])).
% cnf(85255,plain,(aElementOf0(sbrdtbr0(xP),szNzAzT0)|~aSet0(xP)),inference(spm,[status(thm)],[278,85254,theory(equality)])).
% cnf(85258,plain,(aElementOf0(sbrdtbr0(xP),szNzAzT0)|$false),inference(rw,[status(thm)],[85255,4625,theory(equality)])).
% cnf(85259,plain,(aElementOf0(sbrdtbr0(xP),szNzAzT0)),inference(cn,[status(thm)],[85258,theory(equality)])).
% cnf(85260,plain,($false),inference(sr,[status(thm)],[85259,84683,theory(equality)])).
% cnf(85261,plain,($false),85260,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6801
% # ...of these trivial : 11
% # ...subsumed : 597
% # ...remaining for further processing: 6193
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 18
% # Generated clauses : 59098
% # ...of the previous two non-trivial : 50335
% # Contextual simplify-reflections : 3072
% # Paramodulations : 59047
% # Factorizations : 0
% # Equation resolutions : 46
% # Current number of processed clauses: 3117
% # Positive orientable unit clauses: 78
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 23
% # Non-unit-clauses : 3016
% # Current number of unprocessed clauses: 49856
% # ...number of literals in the above : 736552
% # Clause-clause subsumption calls (NU) : 1941947
% # Rec. Clause-clause subsumption calls : 46044
% # Unit Clause-clause subsumption calls : 43709
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 421 leaves, 2.10+/-2.764 terms/leaf
% # Paramod-from index: 199 leaves, 1.01+/-0.100 terms/leaf
% # Paramod-into index: 376 leaves, 1.53+/-1.476 terms/leaf
% # -------------------------------------------------
% # User time : 10.436 s
% # System time : 0.197 s
% # Total time : 10.633 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.51 CPU 13.65 WC
% FINAL PrfWatch: 13.51 CPU 13.65 WC
% SZS output end Solution for /tmp/SystemOnTPTP22338/NUM612+3.tptp
%
%------------------------------------------------------------------------------