TSTP Solution File: NUM550+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM550+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 : art05.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:03:33 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP27107/NUM550+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27107/NUM550+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27107/NUM550+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 27203
% 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(1, axiom,![X1]:(X1=slcrc0<=>(aSet0(X1)&~(?[X2]:aElementOf0(X2,X1)))),file('/tmp/SRASS.s.p', mDefEmp)).
% fof(10, axiom,![X1]:(aSet0(X1)=>(sbrdtbr0(X1)=sz00<=>X1=slcrc0)),file('/tmp/SRASS.s.p', mCardEmpty)).
% fof(15, axiom,((aSet0(xS)&aSet0(xT))&~(xk=sz00)),file('/tmp/SRASS.s.p', m__2202_02)).
% fof(18, axiom,((((aSet0(xQ)&![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),file('/tmp/SRASS.s.p', m__2270)).
% fof(67, conjecture,~((~(?[X1]:aElementOf0(X1,xQ))&xQ=slcrc0)),file('/tmp/SRASS.s.p', m__)).
% fof(68, negated_conjecture,~(~((~(?[X1]:aElementOf0(X1,xQ))&xQ=slcrc0))),inference(assume_negation,[status(cth)],[67])).
% fof(80, 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(81, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[81])).
% fof(83, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[82])).
% fof(84, 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)],[83])).
% cnf(86,plain,(aSet0(X1)|X1!=slcrc0),inference(split_conjunct,[status(thm)],[84])).
% fof(117, plain,![X1]:(~(aSet0(X1))|((~(sbrdtbr0(X1)=sz00)|X1=slcrc0)&(~(X1=slcrc0)|sbrdtbr0(X1)=sz00))),inference(fof_nnf,[status(thm)],[10])).
% fof(118, plain,![X2]:(~(aSet0(X2))|((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)&(~(X2=slcrc0)|sbrdtbr0(X2)=sz00))),inference(variable_rename,[status(thm)],[117])).
% fof(119, plain,![X2]:(((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)|~(aSet0(X2)))&((~(X2=slcrc0)|sbrdtbr0(X2)=sz00)|~(aSet0(X2)))),inference(distribute,[status(thm)],[118])).
% cnf(120,plain,(sbrdtbr0(X1)=sz00|~aSet0(X1)|X1!=slcrc0),inference(split_conjunct,[status(thm)],[119])).
% cnf(143,plain,(xk!=sz00),inference(split_conjunct,[status(thm)],[15])).
% fof(179, plain,((((aSet0(xQ)&![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(fof_nnf,[status(thm)],[18])).
% fof(180, plain,((((aSet0(xQ)&![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(variable_rename,[status(thm)],[179])).
% fof(181, plain,![X2]:(((((~(aElementOf0(X2,xQ))|aElementOf0(X2,xS))&aSet0(xQ))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(shift_quantors,[status(thm)],[180])).
% cnf(183,plain,(sbrdtbr0(xQ)=xk),inference(split_conjunct,[status(thm)],[181])).
% fof(393, negated_conjecture,(![X1]:~(aElementOf0(X1,xQ))&xQ=slcrc0),inference(fof_nnf,[status(thm)],[68])).
% fof(394, negated_conjecture,(![X2]:~(aElementOf0(X2,xQ))&xQ=slcrc0),inference(variable_rename,[status(thm)],[393])).
% fof(395, negated_conjecture,![X2]:(~(aElementOf0(X2,xQ))&xQ=slcrc0),inference(shift_quantors,[status(thm)],[394])).
% cnf(396,negated_conjecture,(xQ=slcrc0),inference(split_conjunct,[status(thm)],[395])).
% cnf(401,plain,(sbrdtbr0(slcrc0)=xk),inference(rw,[status(thm)],[183,396,theory(equality)])).
% cnf(408,plain,(sbrdtbr0(X1)=sz00|slcrc0!=X1),inference(csr,[status(thm)],[120,86])).
% cnf(439,plain,(sz00=xk),inference(spm,[status(thm)],[401,408,theory(equality)])).
% cnf(440,plain,($false),inference(sr,[status(thm)],[439,143,theory(equality)])).
% cnf(441,plain,($false),440,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 174
% # ...of these trivial : 3
% # ...subsumed : 5
% # ...remaining for further processing: 166
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 10
% # ...of the previous two non-trivial : 10
% # Contextual simplify-reflections : 19
% # Paramodulations : 6
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 24
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 120
% # ...number of literals in the above : 447
% # Clause-clause subsumption calls (NU) : 294
% # Rec. Clause-clause subsumption calls : 145
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 32 leaves, 1.03+/-0.174 terms/leaf
% # Paramod-from index: 14 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 28 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.040 s
% # System time : 0.004 s
% # Total time : 0.044 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP27107/NUM550+3.tptp
%
%------------------------------------------------------------------------------