TSTP Solution File: NUM521+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM521+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 : art03.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:52:10 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP14786/NUM521+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14786/NUM521+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14786/NUM521+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 14882
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(10, axiom,![X1]:(aNaturalNumber0(X1)=>sdtlseqdt0(X1,X1)),file('/tmp/SRASS.s.p', mLERefl)).
% fof(13, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)|(~(X2=X1)&sdtlseqdt0(X2,X1)))),file('/tmp/SRASS.s.p', mLETotal)).
% fof(20, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(23, axiom,~(sdtlseqdt0(xp,xn)),file('/tmp/SRASS.s.p', m__1870)).
% fof(24, axiom,~(sdtlseqdt0(xp,xm)),file('/tmp/SRASS.s.p', m__2075)).
% fof(25, axiom,~((((~(xn=xp)&sdtlseqdt0(xn,xp))&~(xm=xp))&sdtlseqdt0(xm,xp))),file('/tmp/SRASS.s.p', m__2287)).
% fof(47, plain,~(sdtlseqdt0(xp,xn)),inference(fof_simplification,[status(thm)],[23,theory(equality)])).
% fof(48, plain,~(sdtlseqdt0(xp,xm)),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(87, plain,![X1]:(~(aNaturalNumber0(X1))|sdtlseqdt0(X1,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(88, plain,![X2]:(~(aNaturalNumber0(X2))|sdtlseqdt0(X2,X2)),inference(variable_rename,[status(thm)],[87])).
% cnf(89,plain,(sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[88])).
% fof(96, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(sdtlseqdt0(X1,X2)|(~(X2=X1)&sdtlseqdt0(X2,X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(97, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|(sdtlseqdt0(X3,X4)|(~(X4=X3)&sdtlseqdt0(X4,X3)))),inference(variable_rename,[status(thm)],[96])).
% fof(98, 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)],[97])).
% cnf(99,plain,(sdtlseqdt0(X2,X1)|sdtlseqdt0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(split_conjunct,[status(thm)],[98])).
% cnf(129,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[20])).
% cnf(130,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[20])).
% cnf(131,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[20])).
% cnf(137,plain,(~sdtlseqdt0(xp,xn)),inference(split_conjunct,[status(thm)],[47])).
% cnf(138,plain,(~sdtlseqdt0(xp,xm)),inference(split_conjunct,[status(thm)],[48])).
% fof(139, plain,(((xn=xp|~(sdtlseqdt0(xn,xp)))|xm=xp)|~(sdtlseqdt0(xm,xp))),inference(fof_nnf,[status(thm)],[25])).
% cnf(140,plain,(xm=xp|xn=xp|~sdtlseqdt0(xm,xp)|~sdtlseqdt0(xn,xp)),inference(split_conjunct,[status(thm)],[139])).
% cnf(270,plain,(xn=xp|xm=xp|sdtlseqdt0(xp,xn)|~sdtlseqdt0(xm,xp)|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[140,99,theory(equality)])).
% cnf(272,plain,(xn=xp|xm=xp|sdtlseqdt0(xp,xn)|~sdtlseqdt0(xm,xp)|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[270,129,theory(equality)])).
% cnf(273,plain,(xn=xp|xm=xp|sdtlseqdt0(xp,xn)|~sdtlseqdt0(xm,xp)|$false|$false),inference(rw,[status(thm)],[272,131,theory(equality)])).
% cnf(274,plain,(xn=xp|xm=xp|sdtlseqdt0(xp,xn)|~sdtlseqdt0(xm,xp)),inference(cn,[status(thm)],[273,theory(equality)])).
% cnf(275,plain,(xn=xp|xm=xp|~sdtlseqdt0(xm,xp)),inference(sr,[status(thm)],[274,137,theory(equality)])).
% cnf(770,plain,(xm=xp|xn=xp|sdtlseqdt0(xp,xm)|~aNaturalNumber0(xp)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[275,99,theory(equality)])).
% cnf(772,plain,(xm=xp|xn=xp|sdtlseqdt0(xp,xm)|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[770,129,theory(equality)])).
% cnf(773,plain,(xm=xp|xn=xp|sdtlseqdt0(xp,xm)|$false|$false),inference(rw,[status(thm)],[772,130,theory(equality)])).
% cnf(774,plain,(xm=xp|xn=xp|sdtlseqdt0(xp,xm)),inference(cn,[status(thm)],[773,theory(equality)])).
% cnf(775,plain,(xm=xp|xn=xp),inference(sr,[status(thm)],[774,138,theory(equality)])).
% cnf(781,plain,(xm=xp|~sdtlseqdt0(xp,xp)),inference(spm,[status(thm)],[137,775,theory(equality)])).
% cnf(816,plain,(xm=xp|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[781,89,theory(equality)])).
% cnf(817,plain,(xm=xp|$false),inference(rw,[status(thm)],[816,129,theory(equality)])).
% cnf(818,plain,(xm=xp),inference(cn,[status(thm)],[817,theory(equality)])).
% cnf(826,plain,(~sdtlseqdt0(xp,xp)),inference(rw,[status(thm)],[138,818,theory(equality)])).
% cnf(849,plain,(~aNaturalNumber0(xp)),inference(spm,[status(thm)],[826,89,theory(equality)])).
% cnf(850,plain,($false),inference(rw,[status(thm)],[849,129,theory(equality)])).
% cnf(851,plain,($false),inference(cn,[status(thm)],[850,theory(equality)])).
% cnf(852,plain,($false),851,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 164
% # ...of these trivial : 1
% # ...subsumed : 5
% # ...remaining for further processing: 158
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 9
% # Generated clauses : 314
% # ...of the previous two non-trivial : 286
% # Contextual simplify-reflections : 6
% # Paramodulations : 289
% # Factorizations : 2
% # Equation resolutions : 23
% # Current number of processed clauses: 73
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 59
% # Current number of unprocessed clauses: 248
% # ...number of literals in the above : 1221
% # Clause-clause subsumption calls (NU) : 514
% # Rec. Clause-clause subsumption calls : 156
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 63 leaves, 1.44+/-1.124 terms/leaf
% # Paramod-from index: 28 leaves, 1.18+/-0.467 terms/leaf
% # Paramod-into index: 45 leaves, 1.40+/-1.181 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.006 s
% # Total time : 0.042 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP14786/NUM521+1.tptp
%
%------------------------------------------------------------------------------