TSTP Solution File: NUM615+3 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM615+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:38:19 EST 2010

% Result   : Theorem 5.30s
% Output   : Solution 5.30s
% 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/SystemOnTPTP22597/NUM615+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP22597/NUM615+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22597/NUM615+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 22693
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time     : 0.624 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.92 CPU 4.01 WC
% # SZS output start CNFRefutation.
% fof(90, axiom,?[X1]:(aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))&sdtlpdtrp0(xe,X1)=xp),file('/tmp/SRASS.s.p', m__5182)).
% fof(111, conjecture,?[X1]:(((aElementOf0(X1,szDzozmdt0(xd))&sdtlpdtrp0(xd,X1)=szDzizrdt0(xd))|aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,X1)=xp),file('/tmp/SRASS.s.p', m__)).
% fof(112, negated_conjecture,~(?[X1]:(((aElementOf0(X1,szDzozmdt0(xd))&sdtlpdtrp0(xd,X1)=szDzizrdt0(xd))|aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))))&sdtlpdtrp0(xe,X1)=xp)),inference(assume_negation,[status(cth)],[111])).
% fof(4634, plain,?[X2]:(aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))&sdtlpdtrp0(xe,X2)=xp),inference(variable_rename,[status(thm)],[90])).
% fof(4635, plain,(aElementOf0(esk36_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))&sdtlpdtrp0(xe,esk36_0)=xp),inference(skolemize,[status(esa)],[4634])).
% cnf(4636,plain,(sdtlpdtrp0(xe,esk36_0)=xp),inference(split_conjunct,[status(thm)],[4635])).
% cnf(4637,plain,(aElementOf0(esk36_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))),inference(split_conjunct,[status(thm)],[4635])).
% fof(4719, negated_conjecture,![X1]:(((~(aElementOf0(X1,szDzozmdt0(xd)))|~(sdtlpdtrp0(xd,X1)=szDzizrdt0(xd)))&~(aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))))|~(sdtlpdtrp0(xe,X1)=xp)),inference(fof_nnf,[status(thm)],[112])).
% fof(4720, negated_conjecture,![X2]:(((~(aElementOf0(X2,szDzozmdt0(xd)))|~(sdtlpdtrp0(xd,X2)=szDzizrdt0(xd)))&~(aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))))|~(sdtlpdtrp0(xe,X2)=xp)),inference(variable_rename,[status(thm)],[4719])).
% fof(4721, negated_conjecture,![X2]:(((~(aElementOf0(X2,szDzozmdt0(xd)))|~(sdtlpdtrp0(xd,X2)=szDzizrdt0(xd)))|~(sdtlpdtrp0(xe,X2)=xp))&(~(aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))))|~(sdtlpdtrp0(xe,X2)=xp))),inference(distribute,[status(thm)],[4720])).
% cnf(4722,negated_conjecture,(sdtlpdtrp0(xe,X1)!=xp|~aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))),inference(split_conjunct,[status(thm)],[4721])).
% cnf(8531,negated_conjecture,(sdtlpdtrp0(xe,esk36_0)!=xp),inference(spm,[status(thm)],[4722,4637,theory(equality)])).
% cnf(8532,negated_conjecture,($false),inference(rw,[status(thm)],[8531,4636,theory(equality)])).
% cnf(8533,negated_conjecture,($false),inference(cn,[status(thm)],[8532,theory(equality)])).
% cnf(8534,negated_conjecture,($false),8533,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 3666
% # ...of these trivial                : 4
% # ...subsumed                        : 531
% # ...remaining for further processing: 3131
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 4
% # Backward-rewritten                 : 0
% # Generated clauses                  : 37
% # ...of the previous two non-trivial : 31
% # Contextual simplify-reflections    : 3069
% # Paramodulations                    : 29
% # Factorizations                     : 0
% # Equation resolutions               : 3
% # Current number of processed clauses: 76
% #    Positive orientable unit clauses: 48
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 26
% # Current number of unprocessed clauses: 2993
% # ...number of literals in the above : 33632
% # Clause-clause subsumption calls (NU) : 966543
% # Rec. Clause-clause subsumption calls : 25670
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    96 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:           61 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           91 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 3.234 s
% # System time            : 0.039 s
% # Total time             : 3.273 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.23 CPU 4.34 WC
% FINAL PrfWatch: 4.23 CPU 4.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP22597/NUM615+3.tptp
% 
%------------------------------------------------------------------------------