TSTP Solution File: NUM464+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM464+2 : 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:36 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP21029/NUM464+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21029/NUM464+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21029/NUM464+2.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 21159
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 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(10, axiom,![X1]:(aNaturalNumber0(X1)=>sdtlseqdt0(X1,X1)),file('/tmp/SRASS.s.p', mLERefl)).
% fof(15, axiom,![X1]:(aNaturalNumber0(X1)=>((X1=sz00|X1=sz10)|(~(sz10=X1)&sdtlseqdt0(sz10,X1)))),file('/tmp/SRASS.s.p', mLENTr)).
% fof(16, axiom,(aNaturalNumber0(xm)&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__987)).
% fof(28, conjecture,(~(xm=sz00)=>(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(sz10,X1)=xm)|sdtlseqdt0(sz10,xm))),file('/tmp/SRASS.s.p', m__)).
% fof(29, negated_conjecture,~((~(xm=sz00)=>(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(sz10,X1)=xm)|sdtlseqdt0(sz10,xm)))),inference(assume_negation,[status(cth)],[28])).
% cnf(33,plain,(aNaturalNumber0(sz10)),inference(split_conjunct,[status(thm)],[2])).
% fof(66, plain,![X1]:(~(aNaturalNumber0(X1))|sdtlseqdt0(X1,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(67, plain,![X2]:(~(aNaturalNumber0(X2))|sdtlseqdt0(X2,X2)),inference(variable_rename,[status(thm)],[66])).
% cnf(68,plain,(sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[67])).
% fof(88, plain,![X1]:(~(aNaturalNumber0(X1))|((X1=sz00|X1=sz10)|(~(sz10=X1)&sdtlseqdt0(sz10,X1)))),inference(fof_nnf,[status(thm)],[15])).
% fof(89, plain,![X2]:(~(aNaturalNumber0(X2))|((X2=sz00|X2=sz10)|(~(sz10=X2)&sdtlseqdt0(sz10,X2)))),inference(variable_rename,[status(thm)],[88])).
% fof(90, plain,![X2]:(((~(sz10=X2)|(X2=sz00|X2=sz10))|~(aNaturalNumber0(X2)))&((sdtlseqdt0(sz10,X2)|(X2=sz00|X2=sz10))|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[89])).
% cnf(91,plain,(X1=sz10|X1=sz00|sdtlseqdt0(sz10,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[90])).
% cnf(94,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[16])).
% fof(144, negated_conjecture,(~(xm=sz00)&(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(sz10,X1)=xm))&~(sdtlseqdt0(sz10,xm)))),inference(fof_nnf,[status(thm)],[29])).
% fof(145, negated_conjecture,(~(xm=sz00)&(![X2]:(~(aNaturalNumber0(X2))|~(sdtpldt0(sz10,X2)=xm))&~(sdtlseqdt0(sz10,xm)))),inference(variable_rename,[status(thm)],[144])).
% fof(146, negated_conjecture,![X2]:(((~(aNaturalNumber0(X2))|~(sdtpldt0(sz10,X2)=xm))&~(sdtlseqdt0(sz10,xm)))&~(xm=sz00)),inference(shift_quantors,[status(thm)],[145])).
% cnf(147,negated_conjecture,(xm!=sz00),inference(split_conjunct,[status(thm)],[146])).
% cnf(148,negated_conjecture,(~sdtlseqdt0(sz10,xm)),inference(split_conjunct,[status(thm)],[146])).
% cnf(160,negated_conjecture,(sz00=xm|sz10=xm|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[148,91,theory(equality)])).
% cnf(161,negated_conjecture,(sz00=xm|sz10=xm|$false),inference(rw,[status(thm)],[160,94,theory(equality)])).
% cnf(162,negated_conjecture,(sz00=xm|sz10=xm),inference(cn,[status(thm)],[161,theory(equality)])).
% cnf(163,negated_conjecture,(xm=sz10),inference(sr,[status(thm)],[162,147,theory(equality)])).
% cnf(635,negated_conjecture,(~sdtlseqdt0(sz10,sz10)),inference(rw,[status(thm)],[148,163,theory(equality)])).
% cnf(644,negated_conjecture,(~aNaturalNumber0(sz10)),inference(spm,[status(thm)],[635,68,theory(equality)])).
% cnf(645,negated_conjecture,($false),inference(rw,[status(thm)],[644,33,theory(equality)])).
% cnf(646,negated_conjecture,($false),inference(cn,[status(thm)],[645,theory(equality)])).
% cnf(647,negated_conjecture,($false),646,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 98
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 92
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 272
% # ...of the previous two non-trivial : 251
% # Contextual simplify-reflections : 5
% # Paramodulations : 257
% # Factorizations : 0
% # Equation resolutions : 15
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 37
% # Current number of unprocessed clauses: 241
% # ...number of literals in the above : 1311
% # Clause-clause subsumption calls (NU) : 392
% # Rec. Clause-clause subsumption calls : 141
% # 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: 36 leaves, 1.58+/-1.341 terms/leaf
% # Paramod-from index: 24 leaves, 1.21+/-0.406 terms/leaf
% # Paramod-into index: 31 leaves, 1.48+/-1.160 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.003 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP21029/NUM464+2.tptp
%
%------------------------------------------------------------------------------