%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM482+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 19:34:13 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP16854/NUM482+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16854/NUM482+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16854/NUM482+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 16986
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.020 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(6, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', m_MulUnit)).
% fof(10, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(doDivides0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))),file('/tmp/SRASS.s.p', mDefDiv)).
% fof(13, axiom,aNaturalNumber0(xk),file('/tmp/SRASS.s.p', m__1716)).
% fof(41, conjecture,((![X1]:((aNaturalNumber0(X1)&(?[X2]:(aNaturalNumber0(X2)&xk=sdtasdt0(X1,X2))|doDivides0(X1,xk)))=>(X1=sz10|X1=xk))&isPrime0(xk))=>?[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(42, negated_conjecture,~(((![X1]:((aNaturalNumber0(X1)&(?[X2]:(aNaturalNumber0(X2)&xk=sdtasdt0(X1,X2))|doDivides0(X1,xk)))=>(X1=sz10|X1=xk))&isPrime0(xk))=>?[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)],[41])).
% cnf(47,plain,(aNaturalNumber0(sz10)),inference(split_conjunct,[status(thm)],[2])).
% fof(57, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(58, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[57])).
% fof(59, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aNaturalNumber0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[58])).
% cnf(61,plain,(sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(76, 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)],[10])).
% fof(77, 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)],[76])).
% fof(78, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&X5=sdtasdt0(X4,esk1_2(X4,X5))))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(skolemize,[status(esa)],[77])).
% fof(79, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))&(~(doDivides0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&X5=sdtasdt0(X4,esk1_2(X4,X5)))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[78])).
% fof(80, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk1_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((X5=sdtasdt0(X4,esk1_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[79])).
% cnf(83,plain,(doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|X1!=sdtasdt0(X2,X3)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[80])).
% cnf(99,plain,(aNaturalNumber0(xk)),inference(split_conjunct,[status(thm)],[13])).
% fof(224, negated_conjecture,((![X1]:((~(aNaturalNumber0(X1))|(![X2]:(~(aNaturalNumber0(X2))|~(xk=sdtasdt0(X1,X2)))&~(doDivides0(X1,xk))))|(X1=sz10|X1=xk))&isPrime0(xk))&![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)],[42])).
% fof(225, negated_conjecture,((![X4]:((~(aNaturalNumber0(X4))|(![X5]:(~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))&~(doDivides0(X4,xk))))|(X4=sz10|X4=xk))&isPrime0(xk))&![X6]:((~(aNaturalNumber0(X6))|(![X7]:(~(aNaturalNumber0(X7))|~(xk=sdtasdt0(X6,X7)))&~(doDivides0(X6,xk))))|(((X6=sz00|X6=sz10)|?[X8]:(((aNaturalNumber0(X8)&?[X9]:(aNaturalNumber0(X9)&X6=sdtasdt0(X8,X9)))&doDivides0(X8,X6))&(~(X8=sz10)&~(X8=X6))))&~(isPrime0(X6))))),inference(variable_rename,[status(thm)],[224])).
% fof(226, negated_conjecture,((![X4]:((~(aNaturalNumber0(X4))|(![X5]:(~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))&~(doDivides0(X4,xk))))|(X4=sz10|X4=xk))&isPrime0(xk))&![X6]:((~(aNaturalNumber0(X6))|(![X7]:(~(aNaturalNumber0(X7))|~(xk=sdtasdt0(X6,X7)))&~(doDivides0(X6,xk))))|(((X6=sz00|X6=sz10)|(((aNaturalNumber0(esk6_1(X6))&(aNaturalNumber0(esk7_1(X6))&X6=sdtasdt0(esk6_1(X6),esk7_1(X6))))&doDivides0(esk6_1(X6),X6))&(~(esk6_1(X6)=sz10)&~(esk6_1(X6)=X6))))&~(isPrime0(X6))))),inference(skolemize,[status(esa)],[225])).
% fof(227, negated_conjecture,![X4]:![X5]:![X6]:![X7]:(((((~(aNaturalNumber0(X7))|~(xk=sdtasdt0(X6,X7)))&~(doDivides0(X6,xk)))|~(aNaturalNumber0(X6)))|(((X6=sz00|X6=sz10)|(((aNaturalNumber0(esk6_1(X6))&(aNaturalNumber0(esk7_1(X6))&X6=sdtasdt0(esk6_1(X6),esk7_1(X6))))&doDivides0(esk6_1(X6),X6))&(~(esk6_1(X6)=sz10)&~(esk6_1(X6)=X6))))&~(isPrime0(X6))))&(((((~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))&~(doDivides0(X4,xk)))|~(aNaturalNumber0(X4)))|(X4=sz10|X4=xk))&isPrime0(xk))),inference(shift_quantors,[status(thm)],[226])).
% fof(228, negated_conjecture,![X4]:![X5]:![X6]:![X7]:((((((((aNaturalNumber0(esk6_1(X6))|(X6=sz00|X6=sz10))|((~(aNaturalNumber0(X7))|~(xk=sdtasdt0(X6,X7)))|~(aNaturalNumber0(X6))))&(((aNaturalNumber0(esk7_1(X6))|(X6=sz00|X6=sz10))|((~(aNaturalNumber0(X7))|~(xk=sdtasdt0(X6,X7)))|~(aNaturalNumber0(X6))))&((X6=sdtasdt0(esk6_1(X6),esk7_1(X6))|(X6=sz00|X6=sz10))|((~(aNaturalNumber0(X7))|~(xk=sdtasdt0(X6,X7)))|~(aNaturalNumber0(X6))))))&((doDivides0(esk6_1(X6),X6)|(X6=sz00|X6=sz10))|((~(aNaturalNumber0(X7))|~(xk=sdtasdt0(X6,X7)))|~(aNaturalNumber0(X6)))))&(((~(esk6_1(X6)=sz10)|(X6=sz00|X6=sz10))|((~(aNaturalNumber0(X7))|~(xk=sdtasdt0(X6,X7)))|~(aNaturalNumber0(X6))))&((~(esk6_1(X6)=X6)|(X6=sz00|X6=sz10))|((~(aNaturalNumber0(X7))|~(xk=sdtasdt0(X6,X7)))|~(aNaturalNumber0(X6))))))&(~(isPrime0(X6))|((~(aNaturalNumber0(X7))|~(xk=sdtasdt0(X6,X7)))|~(aNaturalNumber0(X6)))))&((((((aNaturalNumber0(esk6_1(X6))|(X6=sz00|X6=sz10))|(~(doDivides0(X6,xk))|~(aNaturalNumber0(X6))))&(((aNaturalNumber0(esk7_1(X6))|(X6=sz00|X6=sz10))|(~(doDivides0(X6,xk))|~(aNaturalNumber0(X6))))&((X6=sdtasdt0(esk6_1(X6),esk7_1(X6))|(X6=sz00|X6=sz10))|(~(doDivides0(X6,xk))|~(aNaturalNumber0(X6))))))&((doDivides0(esk6_1(X6),X6)|(X6=sz00|X6=sz10))|(~(doDivides0(X6,xk))|~(aNaturalNumber0(X6)))))&(((~(esk6_1(X6)=sz10)|(X6=sz00|X6=sz10))|(~(doDivides0(X6,xk))|~(aNaturalNumber0(X6))))&((~(esk6_1(X6)=X6)|(X6=sz00|X6=sz10))|(~(doDivides0(X6,xk))|~(aNaturalNumber0(X6))))))&(~(isPrime0(X6))|(~(doDivides0(X6,xk))|~(aNaturalNumber0(X6))))))&(((((~(aNaturalNumber0(X5))|~(xk=sdtasdt0(X4,X5)))|~(aNaturalNumber0(X4)))|(X4=sz10|X4=xk))&((~(doDivides0(X4,xk))|~(aNaturalNumber0(X4)))|(X4=sz10|X4=xk)))&isPrime0(xk))),inference(distribute,[status(thm)],[227])).
% cnf(229,negated_conjecture,(isPrime0(xk)),inference(split_conjunct,[status(thm)],[228])).
% cnf(232,negated_conjecture,(~aNaturalNumber0(X1)|~doDivides0(X1,xk)|~isPrime0(X1)),inference(split_conjunct,[status(thm)],[228])).
% cnf(421,plain,(doDivides0(X1,X2)|X1!=X2|~aNaturalNumber0(sz10)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[83,61,theory(equality)])).
% cnf(431,plain,(doDivides0(X1,X2)|X1!=X2|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(rw,[status(thm)],[421,47,theory(equality)])).
% cnf(432,plain,(doDivides0(X1,X2)|X1!=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(cn,[status(thm)],[431,theory(equality)])).
% cnf(433,plain,(doDivides0(X1,X1)|~aNaturalNumber0(X1)),inference(er,[status(thm)],[432,theory(equality)])).
% cnf(1062,negated_conjecture,(~isPrime0(xk)|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[232,433,theory(equality)])).
% cnf(1064,negated_conjecture,($false|~aNaturalNumber0(xk)),inference(rw,[status(thm)],[1062,229,theory(equality)])).
% cnf(1065,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1064,99,theory(equality)])).
% cnf(1066,negated_conjecture,($false),inference(cn,[status(thm)],[1065,theory(equality)])).
% cnf(1067,negated_conjecture,($false),1066,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 186
% # ...of these trivial : 0
% # ...subsumed : 7
% # ...remaining for further processing: 179
% # Other redundant clauses eliminated : 17
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 491
% # ...of the previous two non-trivial : 441
% # Contextual simplify-reflections : 6
% # Paramodulations : 462
% # Factorizations : 0
% # Equation resolutions : 29
% # Current number of processed clauses: 90
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 83
% # Current number of unprocessed clauses: 436
% # ...number of literals in the above : 2692
% # Clause-clause subsumption calls (NU) : 594
% # Rec. Clause-clause subsumption calls : 151
% # 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: 65 leaves, 1.45+/-1.151 terms/leaf
% # Paramod-from index: 40 leaves, 1.15+/-0.357 terms/leaf
% # Paramod-into index: 57 leaves, 1.33+/-0.997 terms/leaf
% # -------------------------------------------------
% # User time : 0.045 s
% # System time : 0.006 s
% # Total time : 0.051 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.22 WC
% FINAL PrfWatch: 0.16 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP16854/NUM482+3.tptp
%
%------------------------------------------------------------------------------