TSTP Solution File: NUM500+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM500+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 : 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:38:01 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP4571/NUM500+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4571/NUM500+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4571/NUM500+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 4667
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(35, axiom,![X1]:(((aNaturalNumber0(X1)&~(X1=sz00))&~(X1=sz10))=>?[X2]:((aNaturalNumber0(X2)&doDivides0(X2,X1))&isPrime0(X2))),file('/tmp/SRASS.s.p', mPrimDiv)).
% 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(43, axiom,~((xk=sz00|xk=sz10)),file('/tmp/SRASS.s.p', m__2315)).
% fof(48, conjecture,?[X1]:((aNaturalNumber0(X1)&(?[X2]:(aNaturalNumber0(X2)&xk=sdtasdt0(X1,X2))|doDivides0(X1,xk)))&(((~(X1=sz00)&~(X1=sz10))&![X2]:(((aNaturalNumber0(X2)&?[X3]:(aNaturalNumber0(X3)&X1=sdtasdt0(X2,X3)))&doDivides0(X2,X1))=>(X2=sz10|X2=X1)))|isPrime0(X1))),file('/tmp/SRASS.s.p', m__)).
% fof(49, negated_conjecture,~(?[X1]:((aNaturalNumber0(X1)&(?[X2]:(aNaturalNumber0(X2)&xk=sdtasdt0(X1,X2))|doDivides0(X1,xk)))&(((~(X1=sz00)&~(X1=sz10))&![X2]:(((aNaturalNumber0(X2)&?[X3]:(aNaturalNumber0(X3)&X1=sdtasdt0(X2,X3)))&doDivides0(X2,X1))=>(X2=sz10|X2=X1)))|isPrime0(X1)))),inference(assume_negation,[status(cth)],[48])).
% fof(203, plain,![X1]:(((~(aNaturalNumber0(X1))|X1=sz00)|X1=sz10)|?[X2]:((aNaturalNumber0(X2)&doDivides0(X2,X1))&isPrime0(X2))),inference(fof_nnf,[status(thm)],[35])).
% fof(204, plain,![X3]:(((~(aNaturalNumber0(X3))|X3=sz00)|X3=sz10)|?[X4]:((aNaturalNumber0(X4)&doDivides0(X4,X3))&isPrime0(X4))),inference(variable_rename,[status(thm)],[203])).
% fof(205, plain,![X3]:(((~(aNaturalNumber0(X3))|X3=sz00)|X3=sz10)|((aNaturalNumber0(esk4_1(X3))&doDivides0(esk4_1(X3),X3))&isPrime0(esk4_1(X3)))),inference(skolemize,[status(esa)],[204])).
% fof(206, plain,![X3]:(((aNaturalNumber0(esk4_1(X3))|((~(aNaturalNumber0(X3))|X3=sz00)|X3=sz10))&(doDivides0(esk4_1(X3),X3)|((~(aNaturalNumber0(X3))|X3=sz00)|X3=sz10)))&(isPrime0(esk4_1(X3))|((~(aNaturalNumber0(X3))|X3=sz00)|X3=sz10))),inference(distribute,[status(thm)],[205])).
% cnf(207,plain,(X1=sz10|X1=sz00|isPrime0(esk4_1(X1))|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[206])).
% cnf(208,plain,(X1=sz10|X1=sz00|doDivides0(esk4_1(X1),X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[206])).
% cnf(209,plain,(X1=sz10|X1=sz00|aNaturalNumber0(esk4_1(X1))|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[206])).
% cnf(379,plain,(aNaturalNumber0(xk)),inference(split_conjunct,[status(thm)],[42])).
% fof(380, plain,(~(xk=sz00)&~(xk=sz10)),inference(fof_nnf,[status(thm)],[43])).
% cnf(381,plain,(xk!=sz10),inference(split_conjunct,[status(thm)],[380])).
% cnf(382,plain,(xk!=sz00),inference(split_conjunct,[status(thm)],[380])).
% fof(396, negated_conjecture,![X1]:((~(aNaturalNumber0(X1))|(![X2]:(~(aNaturalNumber0(X2))|~(xk=sdtasdt0(X1,X2)))&~(doDivides0(X1,xk))))|(((X1=sz00|X1=sz10)|?[X2]:(((aNaturalNumber0(X2)&?[X3]:(aNaturalNumber0(X3)&X1=sdtasdt0(X2,X3)))&doDivides0(X2,X1))&(~(X2=sz10)&~(X2=X1))))&~(isPrime0(X1)))),inference(fof_nnf,[status(thm)],[49])).
% fof(397, negated_conjecture,![X4]:((~(aNaturalNumber0(X4))|(![X5]:(~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))&~(doDivides0(X4,xk))))|(((X4=sz00|X4=sz10)|?[X6]:(((aNaturalNumber0(X6)&?[X7]:(aNaturalNumber0(X7)&X4=sdtasdt0(X6,X7)))&doDivides0(X6,X4))&(~(X6=sz10)&~(X6=X4))))&~(isPrime0(X4)))),inference(variable_rename,[status(thm)],[396])).
% fof(398, negated_conjecture,![X4]:((~(aNaturalNumber0(X4))|(![X5]:(~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))&~(doDivides0(X4,xk))))|(((X4=sz00|X4=sz10)|(((aNaturalNumber0(esk12_1(X4))&(aNaturalNumber0(esk13_1(X4))&X4=sdtasdt0(esk12_1(X4),esk13_1(X4))))&doDivides0(esk12_1(X4),X4))&(~(esk12_1(X4)=sz10)&~(esk12_1(X4)=X4))))&~(isPrime0(X4)))),inference(skolemize,[status(esa)],[397])).
% fof(399, negated_conjecture,![X4]:![X5]:((((~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))&~(doDivides0(X4,xk)))|~(aNaturalNumber0(X4)))|(((X4=sz00|X4=sz10)|(((aNaturalNumber0(esk12_1(X4))&(aNaturalNumber0(esk13_1(X4))&X4=sdtasdt0(esk12_1(X4),esk13_1(X4))))&doDivides0(esk12_1(X4),X4))&(~(esk12_1(X4)=sz10)&~(esk12_1(X4)=X4))))&~(isPrime0(X4)))),inference(shift_quantors,[status(thm)],[398])).
% fof(400, negated_conjecture,![X4]:![X5]:(((((((aNaturalNumber0(esk12_1(X4))|(X4=sz00|X4=sz10))|((~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))|~(aNaturalNumber0(X4))))&(((aNaturalNumber0(esk13_1(X4))|(X4=sz00|X4=sz10))|((~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))|~(aNaturalNumber0(X4))))&((X4=sdtasdt0(esk12_1(X4),esk13_1(X4))|(X4=sz00|X4=sz10))|((~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))|~(aNaturalNumber0(X4))))))&((doDivides0(esk12_1(X4),X4)|(X4=sz00|X4=sz10))|((~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))|~(aNaturalNumber0(X4)))))&(((~(esk12_1(X4)=sz10)|(X4=sz00|X4=sz10))|((~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))|~(aNaturalNumber0(X4))))&((~(esk12_1(X4)=X4)|(X4=sz00|X4=sz10))|((~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))|~(aNaturalNumber0(X4))))))&(~(isPrime0(X4))|((~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))|~(aNaturalNumber0(X4)))))&((((((aNaturalNumber0(esk12_1(X4))|(X4=sz00|X4=sz10))|(~(doDivides0(X4,xk))|~(aNaturalNumber0(X4))))&(((aNaturalNumber0(esk13_1(X4))|(X4=sz00|X4=sz10))|(~(doDivides0(X4,xk))|~(aNaturalNumber0(X4))))&((X4=sdtasdt0(esk12_1(X4),esk13_1(X4))|(X4=sz00|X4=sz10))|(~(doDivides0(X4,xk))|~(aNaturalNumber0(X4))))))&((doDivides0(esk12_1(X4),X4)|(X4=sz00|X4=sz10))|(~(doDivides0(X4,xk))|~(aNaturalNumber0(X4)))))&(((~(esk12_1(X4)=sz10)|(X4=sz00|X4=sz10))|(~(doDivides0(X4,xk))|~(aNaturalNumber0(X4))))&((~(esk12_1(X4)=X4)|(X4=sz00|X4=sz10))|(~(doDivides0(X4,xk))|~(aNaturalNumber0(X4))))))&(~(isPrime0(X4))|(~(doDivides0(X4,xk))|~(aNaturalNumber0(X4)))))),inference(distribute,[status(thm)],[399])).
% cnf(401,negated_conjecture,(~aNaturalNumber0(X1)|~doDivides0(X1,xk)|~isPrime0(X1)),inference(split_conjunct,[status(thm)],[400])).
% cnf(522,negated_conjecture,(sz10=xk|sz00=xk|~isPrime0(esk4_1(xk))|~aNaturalNumber0(esk4_1(xk))|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[401,208,theory(equality)])).
% cnf(527,negated_conjecture,(sz10=xk|sz00=xk|~isPrime0(esk4_1(xk))|~aNaturalNumber0(esk4_1(xk))|$false),inference(rw,[status(thm)],[522,379,theory(equality)])).
% cnf(528,negated_conjecture,(sz10=xk|sz00=xk|~isPrime0(esk4_1(xk))|~aNaturalNumber0(esk4_1(xk))),inference(cn,[status(thm)],[527,theory(equality)])).
% cnf(529,negated_conjecture,(xk=sz00|~isPrime0(esk4_1(xk))|~aNaturalNumber0(esk4_1(xk))),inference(sr,[status(thm)],[528,381,theory(equality)])).
% cnf(530,negated_conjecture,(~isPrime0(esk4_1(xk))|~aNaturalNumber0(esk4_1(xk))),inference(sr,[status(thm)],[529,382,theory(equality)])).
% cnf(5611,negated_conjecture,(sz10=xk|sz00=xk|~aNaturalNumber0(esk4_1(xk))|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[530,207,theory(equality)])).
% cnf(5612,negated_conjecture,(sz10=xk|sz00=xk|~aNaturalNumber0(esk4_1(xk))|$false),inference(rw,[status(thm)],[5611,379,theory(equality)])).
% cnf(5613,negated_conjecture,(sz10=xk|sz00=xk|~aNaturalNumber0(esk4_1(xk))),inference(cn,[status(thm)],[5612,theory(equality)])).
% cnf(5614,negated_conjecture,(xk=sz00|~aNaturalNumber0(esk4_1(xk))),inference(sr,[status(thm)],[5613,381,theory(equality)])).
% cnf(5615,negated_conjecture,(~aNaturalNumber0(esk4_1(xk))),inference(sr,[status(thm)],[5614,382,theory(equality)])).
% cnf(5616,negated_conjecture,(sz10=xk|sz00=xk|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[5615,209,theory(equality)])).
% cnf(5617,negated_conjecture,(sz10=xk|sz00=xk|$false),inference(rw,[status(thm)],[5616,379,theory(equality)])).
% cnf(5618,negated_conjecture,(sz10=xk|sz00=xk),inference(cn,[status(thm)],[5617,theory(equality)])).
% cnf(5619,negated_conjecture,(xk=sz00),inference(sr,[status(thm)],[5618,381,theory(equality)])).
% cnf(5620,negated_conjecture,($false),inference(sr,[status(thm)],[5619,382,theory(equality)])).
% cnf(5621,negated_conjecture,($false),5620,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 264
% # ...of these trivial : 1
% # ...subsumed : 18
% # ...remaining for further processing: 245
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 2057
% # ...of the previous two non-trivial : 1965
% # Contextual simplify-reflections : 6
% # Paramodulations : 1968
% # Factorizations : 2
% # Equation resolutions : 87
% # Current number of processed clauses: 243
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 207
% # Current number of unprocessed clauses: 1938
% # ...number of literals in the above : 16721
% # Clause-clause subsumption calls (NU) : 9986
% # Rec. Clause-clause subsumption calls : 520
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 113 leaves, 1.47+/-1.114 terms/leaf
% # Paramod-from index: 44 leaves, 1.11+/-0.382 terms/leaf
% # Paramod-into index: 76 leaves, 1.30+/-1.100 terms/leaf
% # -------------------------------------------------
% # User time : 0.190 s
% # System time : 0.007 s
% # Total time : 0.197 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.42 CPU 0.50 WC
% FINAL PrfWatch: 0.42 CPU 0.50 WC
% SZS output end Solution for /tmp/SystemOnTPTP4571/NUM500+3.tptp
%
%------------------------------------------------------------------------------