TSTP Solution File: NUM458+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM458+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:18:03 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP18919/NUM458+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP18919/NUM458+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18919/NUM458+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 19015
% 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(6, axiom,aNaturalNumber0(xm),file('/tmp/SRASS.s.p', m__718)).
% fof(9, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', m_AddZero)).
% fof(11, axiom,aNaturalNumber0(sz00),file('/tmp/SRASS.s.p', mSortsC)).
% fof(21, conjecture,(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,X1)=xm)|sdtlseqdt0(xm,xm)),file('/tmp/SRASS.s.p', m__)).
% fof(22, negated_conjecture,~((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,X1)=xm)|sdtlseqdt0(xm,xm))),inference(assume_negation,[status(cth)],[21])).
% cnf(46,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[6])).
% fof(59, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[9])).
% fof(60, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aNaturalNumber0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[60])).
% cnf(63,plain,(sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[61])).
% cnf(69,plain,(aNaturalNumber0(sz00)),inference(split_conjunct,[status(thm)],[11])).
% fof(102, negated_conjecture,(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xm,X1)=xm))&~(sdtlseqdt0(xm,xm))),inference(fof_nnf,[status(thm)],[22])).
% fof(103, negated_conjecture,(![X2]:(~(aNaturalNumber0(X2))|~(sdtpldt0(xm,X2)=xm))&~(sdtlseqdt0(xm,xm))),inference(variable_rename,[status(thm)],[102])).
% fof(104, negated_conjecture,![X2]:((~(aNaturalNumber0(X2))|~(sdtpldt0(xm,X2)=xm))&~(sdtlseqdt0(xm,xm))),inference(shift_quantors,[status(thm)],[103])).
% cnf(106,negated_conjecture,(sdtpldt0(xm,X1)!=xm|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[104])).
% cnf(108,negated_conjecture,(~aNaturalNumber0(sz00)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[106,63,theory(equality)])).
% cnf(109,negated_conjecture,($false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[108,69,theory(equality)])).
% cnf(110,negated_conjecture,($false|$false),inference(rw,[status(thm)],[109,46,theory(equality)])).
% cnf(111,negated_conjecture,($false),inference(cn,[status(thm)],[110,theory(equality)])).
% cnf(112,negated_conjecture,($false),111,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 40
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 40
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 1
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 7
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 26
% # ...number of literals in the above : 101
% # Clause-clause subsumption calls (NU) : 67
% # Rec. Clause-clause subsumption calls : 49
% # 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: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 9 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.004 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP18919/NUM458+2.tptp
%
%------------------------------------------------------------------------------