TSTP Solution File: NUM615+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM615+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 : art02.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:38:13 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP11384/NUM615+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11384/NUM615+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11384/NUM615+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 11480
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(67, axiom,![X1]:(aElementOf0(X1,xO)=>?[X2]:((aElementOf0(X2,szNzAzT0)&aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,X2)=X1)),file('/tmp/SRASS.s.p', m__4982)).
% fof(76, axiom,aElementOf0(xp,xO),file('/tmp/SRASS.s.p', m__5182)).
% fof(111, conjecture,?[X1]:(aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))&sdtlpdtrp0(xe,X1)=xp),file('/tmp/SRASS.s.p', m__)).
% fof(112, negated_conjecture,~(?[X1]:(aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))&sdtlpdtrp0(xe,X1)=xp)),inference(assume_negation,[status(cth)],[111])).
% fof(411, plain,![X1]:(~(aElementOf0(X1,xO))|?[X2]:((aElementOf0(X2,szNzAzT0)&aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,X2)=X1)),inference(fof_nnf,[status(thm)],[67])).
% fof(412, plain,![X3]:(~(aElementOf0(X3,xO))|?[X4]:((aElementOf0(X4,szNzAzT0)&aElementOf0(X4,sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,X4)=X3)),inference(variable_rename,[status(thm)],[411])).
% fof(413, plain,![X3]:(~(aElementOf0(X3,xO))|((aElementOf0(esk18_1(X3),szNzAzT0)&aElementOf0(esk18_1(X3),sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,esk18_1(X3))=X3)),inference(skolemize,[status(esa)],[412])).
% fof(414, plain,![X3]:(((aElementOf0(esk18_1(X3),szNzAzT0)|~(aElementOf0(X3,xO)))&(aElementOf0(esk18_1(X3),sdtlbdtrb0(xd,szDzizrdt0(xd)))|~(aElementOf0(X3,xO))))&(sdtlpdtrp0(xe,esk18_1(X3))=X3|~(aElementOf0(X3,xO)))),inference(distribute,[status(thm)],[413])).
% cnf(415,plain,(sdtlpdtrp0(xe,esk18_1(X1))=X1|~aElementOf0(X1,xO)),inference(split_conjunct,[status(thm)],[414])).
% cnf(416,plain,(aElementOf0(esk18_1(X1),sdtlbdtrb0(xd,szDzizrdt0(xd)))|~aElementOf0(X1,xO)),inference(split_conjunct,[status(thm)],[414])).
% cnf(428,plain,(aElementOf0(xp,xO)),inference(split_conjunct,[status(thm)],[76])).
% fof(584, negated_conjecture,![X1]:(~(aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))))|~(sdtlpdtrp0(xe,X1)=xp)),inference(fof_nnf,[status(thm)],[112])).
% fof(585, negated_conjecture,![X2]:(~(aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))))|~(sdtlpdtrp0(xe,X2)=xp)),inference(variable_rename,[status(thm)],[584])).
% cnf(586,negated_conjecture,(sdtlpdtrp0(xe,X1)!=xp|~aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))),inference(split_conjunct,[status(thm)],[585])).
% cnf(778,negated_conjecture,(sdtlpdtrp0(xe,esk18_1(X1))!=xp|~aElementOf0(X1,xO)),inference(spm,[status(thm)],[586,416,theory(equality)])).
% cnf(2121,negated_conjecture,(X1!=xp|~aElementOf0(X1,xO)),inference(spm,[status(thm)],[778,415,theory(equality)])).
% cnf(2173,negated_conjecture,($false),inference(spm,[status(thm)],[2121,428,theory(equality)])).
% cnf(2181,negated_conjecture,($false),2173,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 489
% # ...of these trivial : 5
% # ...subsumed : 16
% # ...remaining for further processing: 468
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 917
% # ...of the previous two non-trivial : 852
% # Contextual simplify-reflections : 24
% # Paramodulations : 876
% # Factorizations : 0
% # Equation resolutions : 41
% # Current number of processed clauses: 259
% # Positive orientable unit clauses: 63
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 20
% # Non-unit-clauses : 176
% # Current number of unprocessed clauses: 777
% # ...number of literals in the above : 4025
% # Clause-clause subsumption calls (NU) : 3365
% # Rec. Clause-clause subsumption calls : 850
% # Unit Clause-clause subsumption calls : 1449
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 284 leaves, 1.32+/-0.933 terms/leaf
% # Paramod-from index: 138 leaves, 1.01+/-0.120 terms/leaf
% # Paramod-into index: 250 leaves, 1.17+/-0.578 terms/leaf
% # -------------------------------------------------
% # User time : 0.114 s
% # System time : 0.004 s
% # Total time : 0.118 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.33 WC
% FINAL PrfWatch: 0.24 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP11384/NUM615+1.tptp
%
%------------------------------------------------------------------------------