TSTP Solution File: NUM505+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM505+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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:41:15 EST 2010
% Result : Theorem 1.33s
% Output : Solution 1.33s
% 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/SystemOnTPTP3202/NUM505+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3202/NUM505+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3202/NUM505+3.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 3298
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(18, axiom,![X1]:(aNaturalNumber0(X1)=>sdtlseqdt0(X1,X1)),file('/tmp/SRASS.s.p', mLERefl)).
% fof(21, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)|(~(X2=X1)&sdtlseqdt0(X2,X1)))),file('/tmp/SRASS.s.p', mLETotal)).
% fof(36, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(42, axiom,((aNaturalNumber0(xk)&sdtasdt0(xn,xm)=sdtasdt0(xp,xk))&xk=sdtsldt0(sdtasdt0(xn,xm),xp)),file('/tmp/SRASS.s.p', m__2306)).
% fof(50, conjecture,(~((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xp,X1)=xk)|sdtlseqdt0(xp,xk)))=>(~(xk=xp)&(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xk,X1)=xp)|sdtlseqdt0(xk,xp)))),file('/tmp/SRASS.s.p', m__)).
% fof(51, negated_conjecture,~((~((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xp,X1)=xk)|sdtlseqdt0(xp,xk)))=>(~(xk=xp)&(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xk,X1)=xp)|sdtlseqdt0(xk,xp))))),inference(assume_negation,[status(cth)],[50])).
% fof(122, plain,![X1]:(~(aNaturalNumber0(X1))|sdtlseqdt0(X1,X1)),inference(fof_nnf,[status(thm)],[18])).
% fof(123, plain,![X2]:(~(aNaturalNumber0(X2))|sdtlseqdt0(X2,X2)),inference(variable_rename,[status(thm)],[122])).
% cnf(124,plain,(sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[123])).
% fof(131, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(sdtlseqdt0(X1,X2)|(~(X2=X1)&sdtlseqdt0(X2,X1)))),inference(fof_nnf,[status(thm)],[21])).
% fof(132, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|(sdtlseqdt0(X3,X4)|(~(X4=X3)&sdtlseqdt0(X4,X3)))),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,![X3]:![X4]:(((~(X4=X3)|sdtlseqdt0(X3,X4))|(~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4))))&((sdtlseqdt0(X4,X3)|sdtlseqdt0(X3,X4))|(~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4))))),inference(distribute,[status(thm)],[132])).
% cnf(134,plain,(sdtlseqdt0(X2,X1)|sdtlseqdt0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(split_conjunct,[status(thm)],[133])).
% cnf(212,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[36])).
% cnf(381,plain,(aNaturalNumber0(xk)),inference(split_conjunct,[status(thm)],[42])).
% fof(419, negated_conjecture,((![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xp,X1)=xk))&~(sdtlseqdt0(xp,xk)))&(xk=xp|(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xk,X1)=xp))&~(sdtlseqdt0(xk,xp))))),inference(fof_nnf,[status(thm)],[51])).
% fof(420, negated_conjecture,((![X2]:(~(aNaturalNumber0(X2))|~(sdtpldt0(xp,X2)=xk))&~(sdtlseqdt0(xp,xk)))&(xk=xp|(![X3]:(~(aNaturalNumber0(X3))|~(sdtpldt0(xk,X3)=xp))&~(sdtlseqdt0(xk,xp))))),inference(variable_rename,[status(thm)],[419])).
% fof(421, negated_conjecture,![X2]:![X3]:((((~(aNaturalNumber0(X3))|~(sdtpldt0(xk,X3)=xp))&~(sdtlseqdt0(xk,xp)))|xk=xp)&((~(aNaturalNumber0(X2))|~(sdtpldt0(xp,X2)=xk))&~(sdtlseqdt0(xp,xk)))),inference(shift_quantors,[status(thm)],[420])).
% fof(422, negated_conjecture,![X2]:![X3]:((((~(aNaturalNumber0(X3))|~(sdtpldt0(xk,X3)=xp))|xk=xp)&(~(sdtlseqdt0(xk,xp))|xk=xp))&((~(aNaturalNumber0(X2))|~(sdtpldt0(xp,X2)=xk))&~(sdtlseqdt0(xp,xk)))),inference(distribute,[status(thm)],[421])).
% cnf(423,negated_conjecture,(~sdtlseqdt0(xp,xk)),inference(split_conjunct,[status(thm)],[422])).
% cnf(425,negated_conjecture,(xk=xp|~sdtlseqdt0(xk,xp)),inference(split_conjunct,[status(thm)],[422])).
% cnf(492,negated_conjecture,(xk=xp|sdtlseqdt0(xp,xk)|~aNaturalNumber0(xk)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[425,134,theory(equality)])).
% cnf(494,negated_conjecture,(xk=xp|sdtlseqdt0(xp,xk)|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[492,381,theory(equality)])).
% cnf(495,negated_conjecture,(xk=xp|sdtlseqdt0(xp,xk)|$false|$false),inference(rw,[status(thm)],[494,212,theory(equality)])).
% cnf(496,negated_conjecture,(xk=xp|sdtlseqdt0(xp,xk)),inference(cn,[status(thm)],[495,theory(equality)])).
% cnf(497,negated_conjecture,(xk=xp),inference(sr,[status(thm)],[496,423,theory(equality)])).
% cnf(7613,negated_conjecture,(~sdtlseqdt0(xp,xp)),inference(rw,[status(thm)],[423,497,theory(equality)])).
% cnf(7620,negated_conjecture,(~aNaturalNumber0(xp)),inference(spm,[status(thm)],[7613,124,theory(equality)])).
% cnf(7621,negated_conjecture,($false),inference(rw,[status(thm)],[7620,212,theory(equality)])).
% cnf(7622,negated_conjecture,($false),inference(cn,[status(thm)],[7621,theory(equality)])).
% cnf(7623,negated_conjecture,($false),7622,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 245
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 239
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 18
% # Generated clauses : 2451
% # ...of the previous two non-trivial : 2352
% # Contextual simplify-reflections : 6
% # Paramodulations : 2363
% # Factorizations : 2
% # Equation resolutions : 86
% # Current number of processed clauses: 220
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 191
% # Current number of unprocessed clauses: 1490
% # ...number of literals in the above : 13465
% # Clause-clause subsumption calls (NU) : 11009
% # Rec. Clause-clause subsumption calls : 519
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 98 leaves, 1.54+/-1.179 terms/leaf
% # Paramod-from index: 40 leaves, 1.12+/-0.399 terms/leaf
% # Paramod-into index: 66 leaves, 1.35+/-1.174 terms/leaf
% # -------------------------------------------------
% # User time : 0.214 s
% # System time : 0.012 s
% # Total time : 0.226 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.48 CPU 0.55 WC
% FINAL PrfWatch: 0.48 CPU 0.55 WC
% SZS output end Solution for /tmp/SystemOnTPTP3202/NUM505+3.tptp
%
%------------------------------------------------------------------------------