TSTP Solution File: NUM489+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM489+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 : 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:31:35 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/SystemOnTPTP28649/NUM489+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28649/NUM489+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28649/NUM489+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 28745
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)=>![X3]:(X3=sdtmndt0(X2,X1)<=>(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2)))),file('/tmp/SRASS.s.p', mDefDiff)).
% fof(21, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(24, axiom,sdtlseqdt0(xp,xn),file('/tmp/SRASS.s.p', m__1870)).
% fof(25, axiom,xr=sdtmndt0(xn,xp),file('/tmp/SRASS.s.p', m__1883)).
% fof(45, conjecture,xn=sdtpldt0(xp,xr),file('/tmp/SRASS.s.p', m__)).
% fof(46, negated_conjecture,~(xn=sdtpldt0(xp,xr)),inference(assume_negation,[status(cth)],[45])).
% fof(49, negated_conjecture,~(xn=sdtpldt0(xp,xr)),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(86, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(~(sdtlseqdt0(X1,X2))|![X3]:((~(X3=sdtmndt0(X2,X1))|(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&((~(aNaturalNumber0(X3))|~(sdtpldt0(X1,X3)=X2))|X3=sdtmndt0(X2,X1))))),inference(fof_nnf,[status(thm)],[10])).
% fof(87, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|(~(sdtlseqdt0(X4,X5))|![X6]:((~(X6=sdtmndt0(X5,X4))|(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4))))),inference(variable_rename,[status(thm)],[86])).
% fof(88, plain,![X4]:![X5]:![X6]:((((~(X6=sdtmndt0(X5,X4))|(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[87])).
% fof(89, plain,![X4]:![X5]:![X6]:(((((aNaturalNumber0(X6)|~(X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((sdtpldt0(X4,X6)=X5|~(X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))&((((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))),inference(distribute,[status(thm)],[88])).
% cnf(91,plain,(sdtpldt0(X2,X3)=X1|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~sdtlseqdt0(X2,X1)|X3!=sdtmndt0(X1,X2)),inference(split_conjunct,[status(thm)],[89])).
% cnf(135,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[21])).
% cnf(137,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[21])).
% cnf(143,plain,(sdtlseqdt0(xp,xn)),inference(split_conjunct,[status(thm)],[24])).
% cnf(144,plain,(xr=sdtmndt0(xn,xp)),inference(split_conjunct,[status(thm)],[25])).
% cnf(231,negated_conjecture,(xn!=sdtpldt0(xp,xr)),inference(split_conjunct,[status(thm)],[49])).
% cnf(499,plain,(sdtpldt0(xp,X1)=xn|xr!=X1|~sdtlseqdt0(xp,xn)|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[91,144,theory(equality)])).
% cnf(500,plain,(sdtpldt0(xp,X1)=xn|xr!=X1|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[499,143,theory(equality)])).
% cnf(501,plain,(sdtpldt0(xp,X1)=xn|xr!=X1|$false|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[500,135,theory(equality)])).
% cnf(502,plain,(sdtpldt0(xp,X1)=xn|xr!=X1|$false|$false|$false),inference(rw,[status(thm)],[501,137,theory(equality)])).
% cnf(503,plain,(sdtpldt0(xp,X1)=xn|xr!=X1),inference(cn,[status(thm)],[502,theory(equality)])).
% cnf(860,plain,(sdtpldt0(xp,xr)=xn),inference(er,[status(thm)],[503,theory(equality)])).
% cnf(861,plain,($false),inference(sr,[status(thm)],[860,231,theory(equality)])).
% cnf(862,plain,($false),861,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 159
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 153
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 318
% # ...of the previous two non-trivial : 285
% # Contextual simplify-reflections : 6
% # Paramodulations : 292
% # Factorizations : 2
% # Equation resolutions : 24
% # Current number of processed clauses: 79
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 63
% # Current number of unprocessed clauses: 277
% # ...number of literals in the above : 1344
% # 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 : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 75 leaves, 1.39+/-1.044 terms/leaf
% # Paramod-from index: 32 leaves, 1.16+/-0.441 terms/leaf
% # Paramod-into index: 51 leaves, 1.35+/-1.117 terms/leaf
% # -------------------------------------------------
% # User time : 0.039 s
% # System time : 0.003 s
% # Total time : 0.042 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP28649/NUM489+1.tptp
%
%------------------------------------------------------------------------------