TSTP Solution File: NUM458+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM458+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:17:42 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP18660/NUM458+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP18660/NUM458+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18660/NUM458+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 18756
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aNaturalNumber0(xm),file('/tmp/SRASS.s.p', m__718)).
% fof(2, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))),file('/tmp/SRASS.s.p', mDefLE)).
% fof(7, axiom,aNaturalNumber0(sz00),file('/tmp/SRASS.s.p', mSortsC)).
% fof(13, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', m_AddZero)).
% fof(21, conjecture,sdtlseqdt0(xm,xm),file('/tmp/SRASS.s.p', m__)).
% fof(22, negated_conjecture,~(sdtlseqdt0(xm,xm)),inference(assume_negation,[status(cth)],[21])).
% fof(24, negated_conjecture,~(sdtlseqdt0(xm,xm)),inference(fof_simplification,[status(thm)],[22,theory(equality)])).
% cnf(25,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[1])).
% fof(26, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(sdtlseqdt0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&(![X3]:(~(aNaturalNumber0(X3))|~(sdtpldt0(X1,X3)=X2))|sdtlseqdt0(X1,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(27, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(sdtlseqdt0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&(![X7]:(~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5)))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(sdtlseqdt0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&sdtpldt0(X4,esk1_2(X4,X5))=X5))&(![X7]:(~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5)))),inference(skolemize,[status(esa)],[27])).
% fof(29, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5))&(~(sdtlseqdt0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&sdtpldt0(X4,esk1_2(X4,X5))=X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk1_2(X4,X5))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((sdtpldt0(X4,esk1_2(X4,X5))=X5|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[29])).
% cnf(33,plain,(sdtlseqdt0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|sdtpldt0(X2,X3)!=X1|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[30])).
% cnf(48,plain,(aNaturalNumber0(sz00)),inference(split_conjunct,[status(thm)],[7])).
% fof(70, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(71, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aNaturalNumber0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[71])).
% cnf(74,plain,(sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[72])).
% cnf(103,negated_conjecture,(~sdtlseqdt0(xm,xm)),inference(split_conjunct,[status(thm)],[24])).
% cnf(192,plain,(sdtlseqdt0(X1,X2)|X1!=X2|~aNaturalNumber0(sz00)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[33,74,theory(equality)])).
% cnf(199,plain,(sdtlseqdt0(X1,X2)|X1!=X2|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(rw,[status(thm)],[192,48,theory(equality)])).
% cnf(200,plain,(sdtlseqdt0(X1,X2)|X1!=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(cn,[status(thm)],[199,theory(equality)])).
% cnf(201,plain,(sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1)),inference(er,[status(thm)],[200,theory(equality)])).
% cnf(477,negated_conjecture,(~aNaturalNumber0(xm)),inference(spm,[status(thm)],[103,201,theory(equality)])).
% cnf(478,negated_conjecture,($false),inference(rw,[status(thm)],[477,25,theory(equality)])).
% cnf(479,negated_conjecture,($false),inference(cn,[status(thm)],[478,theory(equality)])).
% cnf(480,negated_conjecture,($false),479,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 69
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 68
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 203
% # ...of the previous two non-trivial : 174
% # Contextual simplify-reflections : 1
% # Paramodulations : 187
% # Factorizations : 0
% # Equation resolutions : 16
% # Current number of processed clauses: 36
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 169
% # ...number of literals in the above : 818
% # Clause-clause subsumption calls (NU) : 144
% # Rec. Clause-clause subsumption calls : 105
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 32 leaves, 1.56+/-1.345 terms/leaf
% # Paramod-from index: 20 leaves, 1.15+/-0.357 terms/leaf
% # Paramod-into index: 26 leaves, 1.42+/-1.214 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.003 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP18660/NUM458+1.tptp
%
%------------------------------------------------------------------------------