TSTP Solution File: NUM482+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM482+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 : art07.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:29:23 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/SystemOnTPTP25706/NUM482+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25706/NUM482+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25706/NUM482+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 25802
% 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(2, axiom,(aNaturalNumber0(sz10)&~(sz10=sz00)),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(5, axiom,aNaturalNumber0(xk),file('/tmp/SRASS.s.p', m__1716)).
% fof(10, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', m_MulUnit)).
% fof(12, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(doDivides0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))),file('/tmp/SRASS.s.p', mDefDiv)).
% fof(41, conjecture,(isPrime0(xk)=>?[X1]:((aNaturalNumber0(X1)&doDivides0(X1,xk))&isPrime0(X1))),file('/tmp/SRASS.s.p', m__)).
% fof(42, negated_conjecture,~((isPrime0(xk)=>?[X1]:((aNaturalNumber0(X1)&doDivides0(X1,xk))&isPrime0(X1)))),inference(assume_negation,[status(cth)],[41])).
% cnf(47,plain,(aNaturalNumber0(sz10)),inference(split_conjunct,[status(thm)],[2])).
% cnf(63,plain,(aNaturalNumber0(xk)),inference(split_conjunct,[status(thm)],[5])).
% fof(81, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[10])).
% fof(82, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aNaturalNumber0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[82])).
% cnf(85,plain,(sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[83])).
% fof(89, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(doDivides0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))&(![X3]:(~(aNaturalNumber0(X3))|~(X2=sdtasdt0(X1,X3)))|doDivides0(X1,X2)))),inference(fof_nnf,[status(thm)],[12])).
% fof(90, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(variable_rename,[status(thm)],[89])).
% fof(91, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|(aNaturalNumber0(esk3_2(X4,X5))&X5=sdtasdt0(X4,esk3_2(X4,X5))))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(skolemize,[status(esa)],[90])).
% fof(92, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))&(~(doDivides0(X4,X5))|(aNaturalNumber0(esk3_2(X4,X5))&X5=sdtasdt0(X4,esk3_2(X4,X5)))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[91])).
% fof(93, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk3_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((X5=sdtasdt0(X4,esk3_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[92])).
% cnf(96,plain,(doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|X1!=sdtasdt0(X2,X3)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[93])).
% fof(217, negated_conjecture,(isPrime0(xk)&![X1]:((~(aNaturalNumber0(X1))|~(doDivides0(X1,xk)))|~(isPrime0(X1)))),inference(fof_nnf,[status(thm)],[42])).
% fof(218, negated_conjecture,(isPrime0(xk)&![X2]:((~(aNaturalNumber0(X2))|~(doDivides0(X2,xk)))|~(isPrime0(X2)))),inference(variable_rename,[status(thm)],[217])).
% fof(219, negated_conjecture,![X2]:(((~(aNaturalNumber0(X2))|~(doDivides0(X2,xk)))|~(isPrime0(X2)))&isPrime0(xk)),inference(shift_quantors,[status(thm)],[218])).
% cnf(220,negated_conjecture,(isPrime0(xk)),inference(split_conjunct,[status(thm)],[219])).
% cnf(221,negated_conjecture,(~isPrime0(X1)|~doDivides0(X1,xk)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[219])).
% cnf(235,negated_conjecture,(~doDivides0(xk,xk)|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[221,220,theory(equality)])).
% cnf(236,negated_conjecture,(~doDivides0(xk,xk)|$false),inference(rw,[status(thm)],[235,63,theory(equality)])).
% cnf(237,negated_conjecture,(~doDivides0(xk,xk)),inference(cn,[status(thm)],[236,theory(equality)])).
% cnf(351,plain,(doDivides0(X1,X2)|X1!=X2|~aNaturalNumber0(sz10)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[96,85,theory(equality)])).
% cnf(361,plain,(doDivides0(X1,X2)|X1!=X2|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(rw,[status(thm)],[351,47,theory(equality)])).
% cnf(362,plain,(doDivides0(X1,X2)|X1!=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(cn,[status(thm)],[361,theory(equality)])).
% cnf(363,plain,(doDivides0(X1,X1)|~aNaturalNumber0(X1)),inference(er,[status(thm)],[362,theory(equality)])).
% cnf(859,negated_conjecture,(~aNaturalNumber0(xk)),inference(spm,[status(thm)],[237,363,theory(equality)])).
% cnf(863,negated_conjecture,($false),inference(rw,[status(thm)],[859,63,theory(equality)])).
% cnf(864,negated_conjecture,($false),inference(cn,[status(thm)],[863,theory(equality)])).
% cnf(865,negated_conjecture,($false),864,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 147
% # ...of these trivial : 0
% # ...subsumed : 8
% # ...remaining for further processing: 139
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 374
% # ...of the previous two non-trivial : 331
% # Contextual simplify-reflections : 6
% # Paramodulations : 347
% # Factorizations : 0
% # Equation resolutions : 27
% # Current number of processed clauses: 71
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 63
% # Current number of unprocessed clauses: 323
% # ...number of literals in the above : 1842
% # Clause-clause subsumption calls (NU) : 479
% # Rec. Clause-clause subsumption calls : 152
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 57 leaves, 1.51+/-1.216 terms/leaf
% # Paramod-from index: 37 leaves, 1.14+/-0.342 terms/leaf
% # Paramod-into index: 49 leaves, 1.41+/-1.105 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.004 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/SystemOnTPTP25706/NUM482+1.tptp
%
%------------------------------------------------------------------------------