TSTP Solution File: NUM423+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM423+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 : 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:00:24 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP27816/NUM423+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27816/NUM423+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27816/NUM423+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 27948
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aInteger0(sz00),file('/tmp/SRASS.s.p', mIntZero)).
% fof(2, axiom,((aInteger0(xa)&aInteger0(xq))&~(xq=sz00)),file('/tmp/SRASS.s.p', m__671)).
% fof(3, axiom,![X1]:(aInteger0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', mMulZero)).
% fof(12, 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(15, axiom,![X1]:(aInteger0(X1)=>(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),file('/tmp/SRASS.s.p', mAddNeg)).
% fof(17, 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(21, conjecture,sdteqdtlpzmzozddtrp0(xa,xa,xq),file('/tmp/SRASS.s.p', m__)).
% fof(22, negated_conjecture,~(sdteqdtlpzmzozddtrp0(xa,xa,xq)),inference(assume_negation,[status(cth)],[21])).
% fof(24, negated_conjecture,~(sdteqdtlpzmzozddtrp0(xa,xa,xq)),inference(fof_simplification,[status(thm)],[22,theory(equality)])).
% cnf(25,plain,(aInteger0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% cnf(26,plain,(xq!=sz00),inference(split_conjunct,[status(thm)],[2])).
% cnf(27,plain,(aInteger0(xq)),inference(split_conjunct,[status(thm)],[2])).
% cnf(28,plain,(aInteger0(xa)),inference(split_conjunct,[status(thm)],[2])).
% fof(29, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(30, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aInteger0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[30])).
% cnf(33,plain,(sdtasdt0(X1,sz00)=sz00|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(60, 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)],[12])).
% fof(61, 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)],[60])).
% fof(62, 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)],[61])).
% cnf(63,plain,(X1=sz00|sdteqdtlpzmzozddtrp0(X3,X2,X1)|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)|~aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2)))),inference(split_conjunct,[status(thm)],[62])).
% fof(69, plain,![X1]:(~(aInteger0(X1))|(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(70, plain,![X2]:(~(aInteger0(X2))|(sdtpldt0(X2,smndt0(X2))=sz00&sz00=sdtpldt0(smndt0(X2),X2))),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,![X2]:((sdtpldt0(X2,smndt0(X2))=sz00|~(aInteger0(X2)))&(sz00=sdtpldt0(smndt0(X2),X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[70])).
% cnf(73,plain,(sdtpldt0(X1,smndt0(X1))=sz00|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(79, 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)],[17])).
% fof(80, 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)],[79])).
% fof(81, 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)],[80])).
% fof(82, 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)],[81])).
% fof(83, 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)],[82])).
% cnf(88,plain,(aDivisorOf0(X2,X1)|X2=sz00|~aInteger0(X1)|~aInteger0(X2)|sdtasdt0(X2,X3)!=X1|~aInteger0(X3)),inference(split_conjunct,[status(thm)],[83])).
% cnf(101,negated_conjecture,(~sdteqdtlpzmzozddtrp0(xa,xa,xq)),inference(split_conjunct,[status(thm)],[24])).
% cnf(207,plain,(sz00=X1|aDivisorOf0(X1,X2)|sz00!=X2|~aInteger0(sz00)|~aInteger0(X1)|~aInteger0(X2)),inference(spm,[status(thm)],[88,33,theory(equality)])).
% cnf(217,plain,(sz00=X1|aDivisorOf0(X1,X2)|sz00!=X2|$false|~aInteger0(X1)|~aInteger0(X2)),inference(rw,[status(thm)],[207,25,theory(equality)])).
% cnf(218,plain,(sz00=X1|aDivisorOf0(X1,X2)|sz00!=X2|~aInteger0(X1)|~aInteger0(X2)),inference(cn,[status(thm)],[217,theory(equality)])).
% cnf(242,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(X2,X2,X1)|~aDivisorOf0(X1,sz00)|~aInteger0(X2)|~aInteger0(X1)),inference(spm,[status(thm)],[63,73,theory(equality)])).
% cnf(422,negated_conjecture,(sz00=xq|~aDivisorOf0(xq,sz00)|~aInteger0(xa)|~aInteger0(xq)),inference(spm,[status(thm)],[101,242,theory(equality)])).
% cnf(423,negated_conjecture,(sz00=xq|~aDivisorOf0(xq,sz00)|$false|~aInteger0(xq)),inference(rw,[status(thm)],[422,28,theory(equality)])).
% cnf(424,negated_conjecture,(sz00=xq|~aDivisorOf0(xq,sz00)|$false|$false),inference(rw,[status(thm)],[423,27,theory(equality)])).
% cnf(425,negated_conjecture,(sz00=xq|~aDivisorOf0(xq,sz00)),inference(cn,[status(thm)],[424,theory(equality)])).
% cnf(426,negated_conjecture,(~aDivisorOf0(xq,sz00)),inference(sr,[status(thm)],[425,26,theory(equality)])).
% cnf(427,negated_conjecture,(sz00=xq|~aInteger0(xq)|~aInteger0(sz00)),inference(spm,[status(thm)],[426,218,theory(equality)])).
% cnf(428,negated_conjecture,(sz00=xq|$false|~aInteger0(sz00)),inference(rw,[status(thm)],[427,27,theory(equality)])).
% cnf(429,negated_conjecture,(sz00=xq|$false|$false),inference(rw,[status(thm)],[428,25,theory(equality)])).
% cnf(430,negated_conjecture,(sz00=xq),inference(cn,[status(thm)],[429,theory(equality)])).
% cnf(431,negated_conjecture,($false),inference(sr,[status(thm)],[430,26,theory(equality)])).
% cnf(432,negated_conjecture,($false),431,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 96
% # ...of these trivial : 3
% # ...subsumed : 19
% # ...remaining for further processing: 74
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 175
% # ...of the previous two non-trivial : 146
% # Contextual simplify-reflections : 2
% # Paramodulations : 171
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 40
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 116
% # ...number of literals in the above : 546
% # Clause-clause subsumption calls (NU) : 251
% # Rec. Clause-clause subsumption calls : 162
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 46 leaves, 1.35+/-0.840 terms/leaf
% # Paramod-from index: 30 leaves, 1.13+/-0.340 terms/leaf
% # Paramod-into index: 39 leaves, 1.23+/-0.576 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.001 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP27816/NUM423+1.tptp
%
%------------------------------------------------------------------------------