TSTP Solution File: NUM605+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM605+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:35:36 EST 2010
% Result : Theorem 1.70s
% Output : Solution 1.70s
% 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/SystemOnTPTP14971/NUM605+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14971/NUM605+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14971/NUM605+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 15067
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(12, axiom,aElementOf0(sz00,szNzAzT0),file('/tmp/SRASS.s.p', mZeroNum)).
% fof(38, axiom,aElementOf0(xK,szNzAzT0),file('/tmp/SRASS.s.p', m__3418)).
% fof(42, axiom,~(xK=sz00),file('/tmp/SRASS.s.p', m__3462)).
% fof(59, axiom,(aSet0(xO)&xO=sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))),file('/tmp/SRASS.s.p', m__4891)).
% fof(63, axiom,aElementOf0(xQ,slbdtsldtrb0(xO,xK)),file('/tmp/SRASS.s.p', m__5078)).
% fof(73, axiom,![X1]:![X2]:((aSet0(X1)&aElementOf0(X2,szNzAzT0))=>![X3]:(X3=slbdtsldtrb0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))))),file('/tmp/SRASS.s.p', mDefSel)).
% fof(84, axiom,slbdtrb0(sz00)=slcrc0,file('/tmp/SRASS.s.p', mSegZero)).
% fof(97, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>sbrdtbr0(slbdtrb0(X1))=X1),file('/tmp/SRASS.s.p', mCardSeg)).
% fof(100, conjecture,~(xQ=slcrc0),file('/tmp/SRASS.s.p', m__)).
% fof(101, negated_conjecture,~(~(xQ=slcrc0)),inference(assume_negation,[status(cth)],[100])).
% fof(114, negated_conjecture,xQ=slcrc0,inference(fof_simplification,[status(thm)],[101,theory(equality)])).
% cnf(158,plain,(aElementOf0(sz00,szNzAzT0)),inference(split_conjunct,[status(thm)],[12])).
% cnf(271,plain,(aElementOf0(xK,szNzAzT0)),inference(split_conjunct,[status(thm)],[38])).
% cnf(286,plain,(xK!=sz00),inference(split_conjunct,[status(thm)],[42])).
% cnf(362,plain,(aSet0(xO)),inference(split_conjunct,[status(thm)],[59])).
% cnf(373,plain,(aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(split_conjunct,[status(thm)],[63])).
% fof(438, plain,![X1]:![X2]:((~(aSet0(X1))|~(aElementOf0(X2,szNzAzT0)))|![X3]:((~(X3=slbdtsldtrb0(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))&((~(aSubsetOf0(X4,X1))|~(sbrdtbr0(X4)=X2))|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|(~(aSubsetOf0(X4,X1))|~(sbrdtbr0(X4)=X2)))&(aElementOf0(X4,X3)|(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))))|X3=slbdtsldtrb0(X1,X2)))),inference(fof_nnf,[status(thm)],[73])).
% fof(439, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))|![X7]:((~(X7=slbdtsldtrb0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))))&((~(aSet0(X7))|?[X9]:((~(aElementOf0(X9,X7))|(~(aSubsetOf0(X9,X5))|~(sbrdtbr0(X9)=X6)))&(aElementOf0(X9,X7)|(aSubsetOf0(X9,X5)&sbrdtbr0(X9)=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(variable_rename,[status(thm)],[438])).
% fof(440, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))|![X7]:((~(X7=slbdtsldtrb0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))))&((~(aSet0(X7))|((~(aElementOf0(esk22_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk22_3(X5,X6,X7),X5))|~(sbrdtbr0(esk22_3(X5,X6,X7))=X6)))&(aElementOf0(esk22_3(X5,X6,X7),X7)|(aSubsetOf0(esk22_3(X5,X6,X7),X5)&sbrdtbr0(esk22_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(skolemize,[status(esa)],[439])).
% fof(441, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))&aSet0(X7))|~(X7=slbdtsldtrb0(X5,X6)))&((~(aSet0(X7))|((~(aElementOf0(esk22_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk22_3(X5,X6,X7),X5))|~(sbrdtbr0(esk22_3(X5,X6,X7))=X6)))&(aElementOf0(esk22_3(X5,X6,X7),X7)|(aSubsetOf0(esk22_3(X5,X6,X7),X5)&sbrdtbr0(esk22_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))),inference(shift_quantors,[status(thm)],[440])).
% fof(442, plain,![X5]:![X6]:![X7]:![X8]:(((((((aSubsetOf0(X8,X5)|~(aElementOf0(X8,X7)))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((sbrdtbr0(X8)=X6|~(aElementOf0(X8,X7)))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&((((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&((aSet0(X7)|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&(((((~(aElementOf0(esk22_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk22_3(X5,X6,X7),X5))|~(sbrdtbr0(esk22_3(X5,X6,X7))=X6)))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((((aSubsetOf0(esk22_3(X5,X6,X7),X5)|aElementOf0(esk22_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&((((sbrdtbr0(esk22_3(X5,X6,X7))=X6|aElementOf0(esk22_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))))),inference(distribute,[status(thm)],[441])).
% cnf(448,plain,(sbrdtbr0(X4)=X1|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[442])).
% cnf(512,plain,(slbdtrb0(sz00)=slcrc0),inference(split_conjunct,[status(thm)],[84])).
% fof(554, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|sbrdtbr0(slbdtrb0(X1))=X1),inference(fof_nnf,[status(thm)],[97])).
% fof(555, plain,![X2]:(~(aElementOf0(X2,szNzAzT0))|sbrdtbr0(slbdtrb0(X2))=X2),inference(variable_rename,[status(thm)],[554])).
% cnf(556,plain,(sbrdtbr0(slbdtrb0(X1))=X1|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[555])).
% cnf(561,negated_conjecture,(xQ=slcrc0),inference(split_conjunct,[status(thm)],[114])).
% cnf(564,plain,(aElementOf0(slcrc0,slbdtsldtrb0(xO,xK))),inference(rw,[status(thm)],[373,561,theory(equality)])).
% cnf(625,plain,(sbrdtbr0(slcrc0)=sz00|~aElementOf0(sz00,szNzAzT0)),inference(spm,[status(thm)],[556,512,theory(equality)])).
% cnf(626,plain,(sbrdtbr0(slcrc0)=sz00|$false),inference(rw,[status(thm)],[625,158,theory(equality)])).
% cnf(627,plain,(sbrdtbr0(slcrc0)=sz00),inference(cn,[status(thm)],[626,theory(equality)])).
% cnf(987,plain,(sbrdtbr0(X1)=X2|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,slbdtsldtrb0(X3,X2))|~aSet0(X3)),inference(er,[status(thm)],[448,theory(equality)])).
% cnf(6884,plain,(sbrdtbr0(slcrc0)=xK|~aElementOf0(xK,szNzAzT0)|~aSet0(xO)),inference(spm,[status(thm)],[987,564,theory(equality)])).
% cnf(6890,plain,(sz00=xK|~aElementOf0(xK,szNzAzT0)|~aSet0(xO)),inference(rw,[status(thm)],[6884,627,theory(equality)])).
% cnf(6891,plain,(sz00=xK|$false|~aSet0(xO)),inference(rw,[status(thm)],[6890,271,theory(equality)])).
% cnf(6892,plain,(sz00=xK|$false|$false),inference(rw,[status(thm)],[6891,362,theory(equality)])).
% cnf(6893,plain,(sz00=xK),inference(cn,[status(thm)],[6892,theory(equality)])).
% cnf(6894,plain,($false),inference(sr,[status(thm)],[6893,286,theory(equality)])).
% cnf(6895,plain,($false),6894,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1512
% # ...of these trivial : 16
% # ...subsumed : 637
% # ...remaining for further processing: 859
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 40
% # Backward-rewritten : 7
% # Generated clauses : 3273
% # ...of the previous two non-trivial : 3037
% # Contextual simplify-reflections : 600
% # Paramodulations : 3207
% # Factorizations : 0
% # Equation resolutions : 66
% # Current number of processed clauses: 616
% # Positive orientable unit clauses: 77
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 37
% # Non-unit-clauses : 502
% # Current number of unprocessed clauses: 1814
% # ...number of literals in the above : 10445
% # Clause-clause subsumption calls (NU) : 17682
% # Rec. Clause-clause subsumption calls : 7083
% # Unit Clause-clause subsumption calls : 2830
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 565 leaves, 1.23+/-0.772 terms/leaf
% # Paramod-from index: 256 leaves, 1.02+/-0.138 terms/leaf
% # Paramod-into index: 480 leaves, 1.15+/-0.535 terms/leaf
% # -------------------------------------------------
% # User time : 0.310 s
% # System time : 0.009 s
% # Total time : 0.319 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.53 CPU 0.58 WC
% FINAL PrfWatch: 0.53 CPU 0.58 WC
% SZS output end Solution for /tmp/SystemOnTPTP14971/NUM605+1.tptp
%
%------------------------------------------------------------------------------