TSTP Solution File: NUM477+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM477+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 : art09.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:27:03 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP2643/NUM477+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2643/NUM477+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2643/NUM477+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 2739
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', m_MulZero)).
% fof(22, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(~(X1=sz00)=>sdtlseqdt0(X2,sdtasdt0(X2,X1)))),file('/tmp/SRASS.s.p', mMonMul2)).
% fof(27, axiom,(aNaturalNumber0(xm)&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__1494)).
% fof(28, axiom,((?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xm,X1))&doDivides0(xm,xn))&~(xn=sz00)),file('/tmp/SRASS.s.p', m__1494_04)).
% fof(37, conjecture,(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,X1)=xn)|sdtlseqdt0(xm,xn)),file('/tmp/SRASS.s.p', m__)).
% fof(38, negated_conjecture,~((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,X1)=xn)|sdtlseqdt0(xm,xn))),inference(assume_negation,[status(cth)],[37])).
% fof(65, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[9])).
% fof(66, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[65])).
% fof(67, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aNaturalNumber0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[66])).
% cnf(69,plain,(sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[67])).
% fof(131, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(X1=sz00|sdtlseqdt0(X2,sdtasdt0(X2,X1)))),inference(fof_nnf,[status(thm)],[22])).
% fof(132, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|(X3=sz00|sdtlseqdt0(X4,sdtasdt0(X4,X3)))),inference(variable_rename,[status(thm)],[131])).
% cnf(133,plain,(sdtlseqdt0(X1,sdtasdt0(X1,X2))|X2=sz00|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(split_conjunct,[status(thm)],[132])).
% cnf(152,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[27])).
% fof(153, plain,((?[X2]:(aNaturalNumber0(X2)&xn=sdtasdt0(xm,X2))&doDivides0(xm,xn))&~(xn=sz00)),inference(variable_rename,[status(thm)],[28])).
% fof(154, plain,(((aNaturalNumber0(esk3_0)&xn=sdtasdt0(xm,esk3_0))&doDivides0(xm,xn))&~(xn=sz00)),inference(skolemize,[status(esa)],[153])).
% cnf(155,plain,(xn!=sz00),inference(split_conjunct,[status(thm)],[154])).
% cnf(157,plain,(xn=sdtasdt0(xm,esk3_0)),inference(split_conjunct,[status(thm)],[154])).
% cnf(158,plain,(aNaturalNumber0(esk3_0)),inference(split_conjunct,[status(thm)],[154])).
% fof(192, negated_conjecture,(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xm,X1)=xn))&~(sdtlseqdt0(xm,xn))),inference(fof_nnf,[status(thm)],[38])).
% fof(193, negated_conjecture,(![X2]:(~(aNaturalNumber0(X2))|~(sdtpldt0(xm,X2)=xn))&~(sdtlseqdt0(xm,xn))),inference(variable_rename,[status(thm)],[192])).
% fof(194, negated_conjecture,![X2]:((~(aNaturalNumber0(X2))|~(sdtpldt0(xm,X2)=xn))&~(sdtlseqdt0(xm,xn))),inference(shift_quantors,[status(thm)],[193])).
% cnf(195,negated_conjecture,(~sdtlseqdt0(xm,xn)),inference(split_conjunct,[status(thm)],[194])).
% cnf(376,plain,(sz00=esk3_0|sdtlseqdt0(xm,xn)|~aNaturalNumber0(esk3_0)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[133,157,theory(equality)])).
% cnf(383,plain,(sz00=esk3_0|sdtlseqdt0(xm,xn)|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[376,158,theory(equality)])).
% cnf(384,plain,(sz00=esk3_0|sdtlseqdt0(xm,xn)|$false|$false),inference(rw,[status(thm)],[383,152,theory(equality)])).
% cnf(385,plain,(sz00=esk3_0|sdtlseqdt0(xm,xn)),inference(cn,[status(thm)],[384,theory(equality)])).
% cnf(386,plain,(esk3_0=sz00),inference(sr,[status(thm)],[385,195,theory(equality)])).
% cnf(827,plain,(sdtasdt0(xm,sz00)=xn),inference(rw,[status(thm)],[157,386,theory(equality)])).
% cnf(918,plain,(xn=sz00|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[69,827,theory(equality)])).
% cnf(959,plain,(xn=sz00|$false),inference(rw,[status(thm)],[918,152,theory(equality)])).
% cnf(960,plain,(xn=sz00),inference(cn,[status(thm)],[959,theory(equality)])).
% cnf(961,plain,($false),inference(sr,[status(thm)],[960,155,theory(equality)])).
% cnf(962,plain,($false),961,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 83
% # ...of these trivial : 1
% # ...subsumed : 11
% # ...remaining for further processing: 71
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 325
% # ...of the previous two non-trivial : 296
% # Contextual simplify-reflections : 6
% # Paramodulations : 302
% # Factorizations : 2
% # Equation resolutions : 21
% # Current number of processed clauses: 66
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 49
% # Current number of unprocessed clauses: 252
% # ...number of literals in the above : 1159
% # Clause-clause subsumption calls (NU) : 238
% # Rec. Clause-clause subsumption calls : 89
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 55 leaves, 1.45+/-1.141 terms/leaf
% # Paramod-from index: 28 leaves, 1.18+/-0.467 terms/leaf
% # Paramod-into index: 40 leaves, 1.43+/-1.202 terms/leaf
% # -------------------------------------------------
% # User time : 0.032 s
% # System time : 0.006 s
% # Total time : 0.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.23 WC
% FINAL PrfWatch: 0.14 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP2643/NUM477+2.tptp
%
%------------------------------------------------------------------------------