TSTP Solution File: NUM472+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM472+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 : art04.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:24:09 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP27891/NUM472+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27891/NUM472+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27891/NUM472+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 27987
% 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,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB)).
% fof(8, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))),file('/tmp/SRASS.s.p', mDefLE)).
% fof(16, axiom,((aNaturalNumber0(xl)&aNaturalNumber0(xm))&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__1324)).
% fof(39, conjecture,sdtlseqdt0(xm,sdtpldt0(xm,xn)),file('/tmp/SRASS.s.p', m__)).
% fof(40, negated_conjecture,~(sdtlseqdt0(xm,sdtpldt0(xm,xn))),inference(assume_negation,[status(cth)],[39])).
% fof(43, negated_conjecture,~(sdtlseqdt0(xm,sdtpldt0(xm,xn))),inference(fof_simplification,[status(thm)],[40,theory(equality)])).
% fof(45, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(46, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(69, 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)],[8])).
% fof(70, 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)],[69])).
% fof(71, 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)],[70])).
% fof(72, 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)],[71])).
% fof(73, 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)],[72])).
% cnf(76,plain,(sdtlseqdt0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|sdtpldt0(X2,X3)!=X1|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[73])).
% cnf(105,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[16])).
% cnf(106,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[16])).
% cnf(192,negated_conjecture,(~sdtlseqdt0(xm,sdtpldt0(xm,xn))),inference(split_conjunct,[status(thm)],[43])).
% cnf(251,plain,(sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(sdtpldt0(X1,X2))),inference(er,[status(thm)],[76,theory(equality)])).
% cnf(2008,plain,(sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[251,47])).
% cnf(2009,negated_conjecture,(~aNaturalNumber0(xn)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[192,2008,theory(equality)])).
% cnf(2034,negated_conjecture,($false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[2009,105,theory(equality)])).
% cnf(2035,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2034,106,theory(equality)])).
% cnf(2036,negated_conjecture,($false),inference(cn,[status(thm)],[2035,theory(equality)])).
% cnf(2037,negated_conjecture,($false),2036,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 209
% # ...of these trivial : 2
% # ...subsumed : 56
% # ...remaining for further processing: 151
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 9
% # Generated clauses : 651
% # ...of the previous two non-trivial : 552
% # Contextual simplify-reflections : 13
% # Paramodulations : 623
% # Factorizations : 2
% # Equation resolutions : 26
% # Current number of processed clauses: 135
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 107
% # Current number of unprocessed clauses: 357
% # ...number of literals in the above : 1608
% # Clause-clause subsumption calls (NU) : 487
% # Rec. Clause-clause subsumption calls : 271
% # Unit Clause-clause subsumption calls : 30
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 107 leaves, 1.27+/-0.902 terms/leaf
% # Paramod-from index: 60 leaves, 1.10+/-0.351 terms/leaf
% # Paramod-into index: 88 leaves, 1.23+/-0.876 terms/leaf
% # -------------------------------------------------
% # User time : 0.049 s
% # System time : 0.000 s
% # Total time : 0.049 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.24 WC
% FINAL PrfWatch: 0.15 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP27891/NUM472+1.tptp
%
%------------------------------------------------------------------------------