TSTP Solution File: NUM464+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM464+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 : art07.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 19:21:24 EST 2010

% Result   : Theorem 0.93s
% Output   : Solution 0.93s
% 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/SystemOnTPTP20768/NUM464+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP20768/NUM464+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20768/NUM464+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 20864
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,(aNaturalNumber0(sz10)&~(sz10=sz00)),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(3, axiom,![X1]:(aNaturalNumber0(X1)=>sdtlseqdt0(X1,X1)),file('/tmp/SRASS.s.p', mLERefl)).
% fof(7, axiom,![X1]:(aNaturalNumber0(X1)=>((X1=sz00|X1=sz10)|(~(sz10=X1)&sdtlseqdt0(sz10,X1)))),file('/tmp/SRASS.s.p', mLENTr)).
% fof(8, axiom,(aNaturalNumber0(xm)&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__987)).
% fof(28, conjecture,(~(xm=sz00)=>sdtlseqdt0(sz10,xm)),file('/tmp/SRASS.s.p', m__)).
% fof(29, negated_conjecture,~((~(xm=sz00)=>sdtlseqdt0(sz10,xm))),inference(assume_negation,[status(cth)],[28])).
% cnf(33,plain,(aNaturalNumber0(sz10)),inference(split_conjunct,[status(thm)],[2])).
% fof(34, plain,![X1]:(~(aNaturalNumber0(X1))|sdtlseqdt0(X1,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(35, plain,![X2]:(~(aNaturalNumber0(X2))|sdtlseqdt0(X2,X2)),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(48, plain,![X1]:(~(aNaturalNumber0(X1))|((X1=sz00|X1=sz10)|(~(sz10=X1)&sdtlseqdt0(sz10,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(49, plain,![X2]:(~(aNaturalNumber0(X2))|((X2=sz00|X2=sz10)|(~(sz10=X2)&sdtlseqdt0(sz10,X2)))),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,![X2]:(((~(sz10=X2)|(X2=sz00|X2=sz10))|~(aNaturalNumber0(X2)))&((sdtlseqdt0(sz10,X2)|(X2=sz00|X2=sz10))|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[49])).
% cnf(51,plain,(X1=sz10|X1=sz00|sdtlseqdt0(sz10,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[50])).
% cnf(54,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[8])).
% fof(144, negated_conjecture,(~(xm=sz00)&~(sdtlseqdt0(sz10,xm))),inference(fof_nnf,[status(thm)],[29])).
% cnf(145,negated_conjecture,(~sdtlseqdt0(sz10,xm)),inference(split_conjunct,[status(thm)],[144])).
% cnf(146,negated_conjecture,(xm!=sz00),inference(split_conjunct,[status(thm)],[144])).
% cnf(153,negated_conjecture,(sz00=xm|sz10=xm|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[145,51,theory(equality)])).
% cnf(154,negated_conjecture,(sz00=xm|sz10=xm|$false),inference(rw,[status(thm)],[153,54,theory(equality)])).
% cnf(155,negated_conjecture,(sz00=xm|sz10=xm),inference(cn,[status(thm)],[154,theory(equality)])).
% cnf(156,negated_conjecture,(xm=sz10),inference(sr,[status(thm)],[155,146,theory(equality)])).
% cnf(618,negated_conjecture,(~sdtlseqdt0(sz10,sz10)),inference(rw,[status(thm)],[145,156,theory(equality)])).
% cnf(627,negated_conjecture,(~aNaturalNumber0(sz10)),inference(spm,[status(thm)],[618,36,theory(equality)])).
% cnf(628,negated_conjecture,($false),inference(rw,[status(thm)],[627,33,theory(equality)])).
% cnf(629,negated_conjecture,($false),inference(cn,[status(thm)],[628,theory(equality)])).
% cnf(630,negated_conjecture,($false),629,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 98
% # ...of these trivial                : 0
% # ...subsumed                        : 7
% # ...remaining for further processing: 91
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 3
% # Generated clauses                  : 268
% # ...of the previous two non-trivial : 246
% # Contextual simplify-reflections    : 5
% # Paramodulations                    : 253
% # Factorizations                     : 0
% # Equation resolutions               : 15
% # Current number of processed clauses: 44
% #    Positive orientable unit clauses: 4
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 38
% # Current number of unprocessed clauses: 238
% # ...number of literals in the above : 1305
% # Clause-clause subsumption calls (NU) : 394
% # Rec. Clause-clause subsumption calls : 143
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 1
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:    37 leaves,   1.57+/-1.326 terms/leaf
% # Paramod-from index:           24 leaves,   1.21+/-0.406 terms/leaf
% # Paramod-into index:           32 leaves,   1.47+/-1.145 terms/leaf
% # -------------------------------------------------
% # User time              : 0.028 s
% # System time            : 0.003 s
% # Total time             : 0.031 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP20768/NUM464+1.tptp
% 
%------------------------------------------------------------------------------