TSTP Solution File: NUM602+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM602+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:34:48 EST 2010
% Result : Theorem 1.42s
% Output : Solution 1.42s
% 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/SystemOnTPTP14414/NUM602+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14414/NUM602+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14414/NUM602+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 14510
% 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(54, 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(55, axiom,aElementOf0(xx,xO),file('/tmp/SRASS.s.p', m__5009)).
% fof(99, conjecture,?[X1]:(aElementOf0(X1,szNzAzT0)&sdtlpdtrp0(xe,X1)=xx),file('/tmp/SRASS.s.p', m__)).
% fof(100, negated_conjecture,~(?[X1]:(aElementOf0(X1,szNzAzT0)&sdtlpdtrp0(xe,X1)=xx)),inference(assume_negation,[status(cth)],[99])).
% fof(331, plain,![X1]:(~(aElementOf0(X1,xO))|?[X2]:((aElementOf0(X2,szNzAzT0)&aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,X2)=X1)),inference(fof_nnf,[status(thm)],[54])).
% fof(332, plain,![X3]:(~(aElementOf0(X3,xO))|?[X4]:((aElementOf0(X4,szNzAzT0)&aElementOf0(X4,sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,X4)=X3)),inference(variable_rename,[status(thm)],[331])).
% fof(333, plain,![X3]:(~(aElementOf0(X3,xO))|((aElementOf0(esk14_1(X3),szNzAzT0)&aElementOf0(esk14_1(X3),sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,esk14_1(X3))=X3)),inference(skolemize,[status(esa)],[332])).
% fof(334, plain,![X3]:(((aElementOf0(esk14_1(X3),szNzAzT0)|~(aElementOf0(X3,xO)))&(aElementOf0(esk14_1(X3),sdtlbdtrb0(xd,szDzizrdt0(xd)))|~(aElementOf0(X3,xO))))&(sdtlpdtrp0(xe,esk14_1(X3))=X3|~(aElementOf0(X3,xO)))),inference(distribute,[status(thm)],[333])).
% cnf(335,plain,(sdtlpdtrp0(xe,esk14_1(X1))=X1|~aElementOf0(X1,xO)),inference(split_conjunct,[status(thm)],[334])).
% cnf(337,plain,(aElementOf0(esk14_1(X1),szNzAzT0)|~aElementOf0(X1,xO)),inference(split_conjunct,[status(thm)],[334])).
% cnf(338,plain,(aElementOf0(xx,xO)),inference(split_conjunct,[status(thm)],[55])).
% fof(558, negated_conjecture,![X1]:(~(aElementOf0(X1,szNzAzT0))|~(sdtlpdtrp0(xe,X1)=xx)),inference(fof_nnf,[status(thm)],[100])).
% fof(559, negated_conjecture,![X2]:(~(aElementOf0(X2,szNzAzT0))|~(sdtlpdtrp0(xe,X2)=xx)),inference(variable_rename,[status(thm)],[558])).
% cnf(560,negated_conjecture,(sdtlpdtrp0(xe,X1)!=xx|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[559])).
% cnf(645,negated_conjecture,(X1!=xx|~aElementOf0(esk14_1(X1),szNzAzT0)|~aElementOf0(X1,xO)),inference(spm,[status(thm)],[560,335,theory(equality)])).
% cnf(1954,negated_conjecture,(X1!=xx|~aElementOf0(X1,xO)),inference(csr,[status(thm)],[645,337])).
% cnf(1962,negated_conjecture,($false),inference(spm,[status(thm)],[1954,338,theory(equality)])).
% cnf(1970,negated_conjecture,($false),1962,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 436
% # ...of these trivial : 1
% # ...subsumed : 16
% # ...remaining for further processing: 419
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 815
% # ...of the previous two non-trivial : 758
% # Contextual simplify-reflections : 26
% # Paramodulations : 774
% # Factorizations : 0
% # Equation resolutions : 41
% # Current number of processed clauses: 224
% # Positive orientable unit clauses: 47
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 166
% # Current number of unprocessed clauses: 708
% # ...number of literals in the above : 3787
% # Clause-clause subsumption calls (NU) : 2647
% # Rec. Clause-clause subsumption calls : 778
% # Unit Clause-clause subsumption calls : 814
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 258 leaves, 1.35+/-0.974 terms/leaf
% # Paramod-from index: 117 leaves, 1.01+/-0.092 terms/leaf
% # Paramod-into index: 224 leaves, 1.19+/-0.591 terms/leaf
% # -------------------------------------------------
% # User time : 0.105 s
% # System time : 0.005 s
% # Total time : 0.110 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.31 WC
% FINAL PrfWatch: 0.26 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP14414/NUM602+1.tptp
%
%------------------------------------------------------------------------------