%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM436+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 : art01.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 18:59:50 EST 2010
% Result : Theorem 1.33s
% Output : Solution 1.33s
% 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/SystemOnTPTP4585/NUM436+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4585/NUM436+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4585/NUM436+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 4681
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>aInteger0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mIntMult)).
% fof(17, axiom,(((((aInteger0(xa)&aInteger0(xb))&aInteger0(xp))&~(xp=sz00))&aInteger0(xq))&~(xq=sz00)),file('/tmp/SRASS.s.p', m__979)).
% fof(19, axiom,(aInteger0(xm)&sdtasdt0(sdtasdt0(xp,xq),xm)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__1032)).
% fof(20, axiom,(sdtasdt0(xp,sdtasdt0(xq,xm))=sdtpldt0(xa,smndt0(xb))&sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,sdtasdt0(xp,xm))),file('/tmp/SRASS.s.p', m__1071)).
% fof(21, axiom,![X1]:![X2]:![X3]:((((aInteger0(X1)&aInteger0(X2))&aInteger0(X3))&~(X3=sz00))=>(sdteqdtlpzmzozddtrp0(X1,X2,X3)<=>aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))))),file('/tmp/SRASS.s.p', mEquMod)).
% fof(23, axiom,![X1]:(aInteger0(X1)=>![X2]:(aDivisorOf0(X2,X1)<=>((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1)))),file('/tmp/SRASS.s.p', mDivisor)).
% fof(27, conjecture,(sdteqdtlpzmzozddtrp0(xa,xb,xp)&sdteqdtlpzmzozddtrp0(xa,xb,xq)),file('/tmp/SRASS.s.p', m__)).
% fof(28, negated_conjecture,~((sdteqdtlpzmzozddtrp0(xa,xb,xp)&sdteqdtlpzmzozddtrp0(xa,xb,xq))),inference(assume_negation,[status(cth)],[27])).
% fof(37, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(38, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[38])).
% cnf(84,plain,(xq!=sz00),inference(split_conjunct,[status(thm)],[17])).
% cnf(85,plain,(aInteger0(xq)),inference(split_conjunct,[status(thm)],[17])).
% cnf(86,plain,(xp!=sz00),inference(split_conjunct,[status(thm)],[17])).
% cnf(87,plain,(aInteger0(xp)),inference(split_conjunct,[status(thm)],[17])).
% cnf(88,plain,(aInteger0(xb)),inference(split_conjunct,[status(thm)],[17])).
% cnf(89,plain,(aInteger0(xa)),inference(split_conjunct,[status(thm)],[17])).
% cnf(92,plain,(aInteger0(xm)),inference(split_conjunct,[status(thm)],[19])).
% cnf(93,plain,(sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(split_conjunct,[status(thm)],[20])).
% cnf(94,plain,(sdtasdt0(xp,sdtasdt0(xq,xm))=sdtpldt0(xa,smndt0(xb))),inference(split_conjunct,[status(thm)],[20])).
% fof(95, plain,![X1]:![X2]:![X3]:((((~(aInteger0(X1))|~(aInteger0(X2)))|~(aInteger0(X3)))|X3=sz00)|((~(sdteqdtlpzmzozddtrp0(X1,X2,X3))|aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))))&(~(aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))))|sdteqdtlpzmzozddtrp0(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[21])).
% fof(96, plain,![X4]:![X5]:![X6]:((((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|X6=sz00)|((~(sdteqdtlpzmzozddtrp0(X4,X5,X6))|aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))&(~(aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))|sdteqdtlpzmzozddtrp0(X4,X5,X6)))),inference(variable_rename,[status(thm)],[95])).
% fof(97, plain,![X4]:![X5]:![X6]:(((~(sdteqdtlpzmzozddtrp0(X4,X5,X6))|aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))|(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|X6=sz00))&((~(aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))|sdteqdtlpzmzozddtrp0(X4,X5,X6))|(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|X6=sz00))),inference(distribute,[status(thm)],[96])).
% cnf(98,plain,(X1=sz00|sdteqdtlpzmzozddtrp0(X3,X2,X1)|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)|~aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2)))),inference(split_conjunct,[status(thm)],[97])).
% fof(105, plain,![X1]:(~(aInteger0(X1))|![X2]:((~(aDivisorOf0(X2,X1))|((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1)))&(((~(aInteger0(X2))|X2=sz00)|![X3]:(~(aInteger0(X3))|~(sdtasdt0(X2,X3)=X1)))|aDivisorOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[23])).
% fof(106, plain,![X4]:(~(aInteger0(X4))|![X5]:((~(aDivisorOf0(X5,X4))|((aInteger0(X5)&~(X5=sz00))&?[X6]:(aInteger0(X6)&sdtasdt0(X5,X6)=X4)))&(((~(aInteger0(X5))|X5=sz00)|![X7]:(~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4)))|aDivisorOf0(X5,X4)))),inference(variable_rename,[status(thm)],[105])).
% fof(107, plain,![X4]:(~(aInteger0(X4))|![X5]:((~(aDivisorOf0(X5,X4))|((aInteger0(X5)&~(X5=sz00))&(aInteger0(esk1_2(X4,X5))&sdtasdt0(X5,esk1_2(X4,X5))=X4)))&(((~(aInteger0(X5))|X5=sz00)|![X7]:(~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4)))|aDivisorOf0(X5,X4)))),inference(skolemize,[status(esa)],[106])).
% fof(108, plain,![X4]:![X5]:![X7]:(((((~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4))|(~(aInteger0(X5))|X5=sz00))|aDivisorOf0(X5,X4))&(~(aDivisorOf0(X5,X4))|((aInteger0(X5)&~(X5=sz00))&(aInteger0(esk1_2(X4,X5))&sdtasdt0(X5,esk1_2(X4,X5))=X4))))|~(aInteger0(X4))),inference(shift_quantors,[status(thm)],[107])).
% fof(109, plain,![X4]:![X5]:![X7]:(((((~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4))|(~(aInteger0(X5))|X5=sz00))|aDivisorOf0(X5,X4))|~(aInteger0(X4)))&((((aInteger0(X5)|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))&((~(X5=sz00)|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4))))&(((aInteger0(esk1_2(X4,X5))|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))&((sdtasdt0(X5,esk1_2(X4,X5))=X4|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))))),inference(distribute,[status(thm)],[108])).
% cnf(114,plain,(aDivisorOf0(X2,X1)|X2=sz00|~aInteger0(X1)|~aInteger0(X2)|sdtasdt0(X2,X3)!=X1|~aInteger0(X3)),inference(split_conjunct,[status(thm)],[109])).
% fof(123, negated_conjecture,(~(sdteqdtlpzmzozddtrp0(xa,xb,xp))|~(sdteqdtlpzmzozddtrp0(xa,xb,xq))),inference(fof_nnf,[status(thm)],[28])).
% cnf(124,negated_conjecture,(~sdteqdtlpzmzozddtrp0(xa,xb,xq)|~sdteqdtlpzmzozddtrp0(xa,xb,xp)),inference(split_conjunct,[status(thm)],[123])).
% cnf(125,plain,(sdtasdt0(xq,sdtasdt0(xp,xm))=sdtasdt0(xp,sdtasdt0(xq,xm))),inference(rw,[status(thm)],[93,94,theory(equality)])).
% cnf(244,plain,(sz00=X1|aDivisorOf0(X1,sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(sdtasdt0(X1,X2))),inference(er,[status(thm)],[114,theory(equality)])).
% cnf(246,plain,(sz00=xq|aDivisorOf0(xq,X1)|sdtasdt0(xp,sdtasdt0(xq,xm))!=X1|~aInteger0(sdtasdt0(xp,xm))|~aInteger0(xq)|~aInteger0(X1)),inference(spm,[status(thm)],[114,125,theory(equality)])).
% cnf(257,plain,(sz00=xq|aDivisorOf0(xq,X1)|sdtasdt0(xp,sdtasdt0(xq,xm))!=X1|~aInteger0(sdtasdt0(xp,xm))|$false|~aInteger0(X1)),inference(rw,[status(thm)],[246,85,theory(equality)])).
% cnf(258,plain,(sz00=xq|aDivisorOf0(xq,X1)|sdtasdt0(xp,sdtasdt0(xq,xm))!=X1|~aInteger0(sdtasdt0(xp,xm))|~aInteger0(X1)),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(259,plain,(aDivisorOf0(xq,X1)|sdtasdt0(xp,sdtasdt0(xq,xm))!=X1|~aInteger0(sdtasdt0(xp,xm))|~aInteger0(X1)),inference(sr,[status(thm)],[258,84,theory(equality)])).
% cnf(328,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xa,xb,X1)|~aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))|~aInteger0(xa)|~aInteger0(xb)|~aInteger0(X1)),inference(spm,[status(thm)],[98,94,theory(equality)])).
% cnf(335,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xa,xb,X1)|~aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))|$false|~aInteger0(xb)|~aInteger0(X1)),inference(rw,[status(thm)],[328,89,theory(equality)])).
% cnf(336,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xa,xb,X1)|~aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))|$false|$false|~aInteger0(X1)),inference(rw,[status(thm)],[335,88,theory(equality)])).
% cnf(337,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xa,xb,X1)|~aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))|~aInteger0(X1)),inference(cn,[status(thm)],[336,theory(equality)])).
% cnf(455,plain,(aDivisorOf0(xq,X1)|sdtasdt0(xp,sdtasdt0(xq,xm))!=X1|~aInteger0(X1)|~aInteger0(xm)|~aInteger0(xp)),inference(spm,[status(thm)],[259,39,theory(equality)])).
% cnf(456,plain,(aDivisorOf0(xq,X1)|sdtasdt0(xp,sdtasdt0(xq,xm))!=X1|~aInteger0(X1)|$false|~aInteger0(xp)),inference(rw,[status(thm)],[455,92,theory(equality)])).
% cnf(457,plain,(aDivisorOf0(xq,X1)|sdtasdt0(xp,sdtasdt0(xq,xm))!=X1|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[456,87,theory(equality)])).
% cnf(458,plain,(aDivisorOf0(xq,X1)|sdtasdt0(xp,sdtasdt0(xq,xm))!=X1|~aInteger0(X1)),inference(cn,[status(thm)],[457,theory(equality)])).
% cnf(459,plain,(aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))|~aInteger0(sdtasdt0(xp,sdtasdt0(xq,xm)))),inference(er,[status(thm)],[458,theory(equality)])).
% cnf(460,plain,(aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))|~aInteger0(sdtasdt0(xq,xm))|~aInteger0(xp)),inference(spm,[status(thm)],[459,39,theory(equality)])).
% cnf(461,plain,(aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))|~aInteger0(sdtasdt0(xq,xm))|$false),inference(rw,[status(thm)],[460,87,theory(equality)])).
% cnf(462,plain,(aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))|~aInteger0(sdtasdt0(xq,xm))),inference(cn,[status(thm)],[461,theory(equality)])).
% cnf(463,plain,(aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))|~aInteger0(xm)|~aInteger0(xq)),inference(spm,[status(thm)],[462,39,theory(equality)])).
% cnf(464,plain,(aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))|$false|~aInteger0(xq)),inference(rw,[status(thm)],[463,92,theory(equality)])).
% cnf(465,plain,(aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))|$false|$false),inference(rw,[status(thm)],[464,85,theory(equality)])).
% cnf(466,plain,(aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))),inference(cn,[status(thm)],[465,theory(equality)])).
% cnf(2410,plain,(sz00=X1|aDivisorOf0(X1,sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(csr,[status(thm)],[244,39])).
% cnf(10222,plain,(sz00=xq|sdteqdtlpzmzozddtrp0(xa,xb,xq)|~aInteger0(xq)),inference(spm,[status(thm)],[337,466,theory(equality)])).
% cnf(10224,plain,(sz00=xp|sdteqdtlpzmzozddtrp0(xa,xb,xp)|~aInteger0(xp)|~aInteger0(sdtasdt0(xq,xm))),inference(spm,[status(thm)],[337,2410,theory(equality)])).
% cnf(10228,plain,(sz00=xq|sdteqdtlpzmzozddtrp0(xa,xb,xq)|$false),inference(rw,[status(thm)],[10222,85,theory(equality)])).
% cnf(10229,plain,(sz00=xq|sdteqdtlpzmzozddtrp0(xa,xb,xq)),inference(cn,[status(thm)],[10228,theory(equality)])).
% cnf(10230,plain,(sdteqdtlpzmzozddtrp0(xa,xb,xq)),inference(sr,[status(thm)],[10229,84,theory(equality)])).
% cnf(10233,plain,(sz00=xp|sdteqdtlpzmzozddtrp0(xa,xb,xp)|$false|~aInteger0(sdtasdt0(xq,xm))),inference(rw,[status(thm)],[10224,87,theory(equality)])).
% cnf(10234,plain,(sz00=xp|sdteqdtlpzmzozddtrp0(xa,xb,xp)|~aInteger0(sdtasdt0(xq,xm))),inference(cn,[status(thm)],[10233,theory(equality)])).
% cnf(10235,plain,(sdteqdtlpzmzozddtrp0(xa,xb,xp)|~aInteger0(sdtasdt0(xq,xm))),inference(sr,[status(thm)],[10234,86,theory(equality)])).
% cnf(10239,negated_conjecture,(~sdteqdtlpzmzozddtrp0(xa,xb,xp)|$false),inference(rw,[status(thm)],[124,10230,theory(equality)])).
% cnf(10240,negated_conjecture,(~sdteqdtlpzmzozddtrp0(xa,xb,xp)),inference(cn,[status(thm)],[10239,theory(equality)])).
% cnf(10390,plain,(~aInteger0(sdtasdt0(xq,xm))),inference(sr,[status(thm)],[10235,10240,theory(equality)])).
% cnf(10391,plain,(~aInteger0(xm)|~aInteger0(xq)),inference(spm,[status(thm)],[10390,39,theory(equality)])).
% cnf(10393,plain,($false|~aInteger0(xq)),inference(rw,[status(thm)],[10391,92,theory(equality)])).
% cnf(10394,plain,($false|$false),inference(rw,[status(thm)],[10393,85,theory(equality)])).
% cnf(10395,plain,($false),inference(cn,[status(thm)],[10394,theory(equality)])).
% cnf(10396,plain,($false),10395,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 613
% # ...of these trivial : 25
% # ...subsumed : 274
% # ...remaining for further processing: 314
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 24
% # Generated clauses : 3426
% # ...of the previous two non-trivial : 2708
% # Contextual simplify-reflections : 53
% # Paramodulations : 3407
% # Factorizations : 0
% # Equation resolutions : 19
% # Current number of processed clauses: 237
% # Positive orientable unit clauses: 77
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 155
% # Current number of unprocessed clauses: 2087
% # ...number of literals in the above : 8425
% # Clause-clause subsumption calls (NU) : 2001
% # Rec. Clause-clause subsumption calls : 1466
% # Unit Clause-clause subsumption calls : 24
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 268 leaves, 1.22+/-0.764 terms/leaf
% # Paramod-from index: 175 leaves, 1.10+/-0.349 terms/leaf
% # Paramod-into index: 239 leaves, 1.18+/-0.616 terms/leaf
% # -------------------------------------------------
% # User time : 0.147 s
% # System time : 0.008 s
% # Total time : 0.155 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.37 CPU 0.47 WC
% FINAL PrfWatch: 0.37 CPU 0.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP4585/NUM436+1.tptp
%
%------------------------------------------------------------------------------