TSTP Solution File: NUM468+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM468+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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:23:00 EST 2010
% Result : Theorem 1.65s
% Output : Solution 1.65s
% 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/SystemOnTPTP24776/NUM468+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24776/NUM468+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24776/NUM468+2.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 24872
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(10, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),file('/tmp/SRASS.s.p', mAMDistr)).
% fof(12, axiom,![X1]:(aNaturalNumber0(X1)=>(~(X1=sz00)=>![X2]:![X3]:((aNaturalNumber0(X2)&aNaturalNumber0(X3))=>((sdtasdt0(X1,X2)=sdtasdt0(X1,X3)|sdtasdt0(X2,X1)=sdtasdt0(X3,X1))=>X2=X3)))),file('/tmp/SRASS.s.p', mMulCanc)).
% fof(18, axiom,((aNaturalNumber0(xl)&aNaturalNumber0(xm))&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__1240)).
% fof(19, axiom,(((?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xl,X1))&doDivides0(xl,xm))&?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xl,X1)))&doDivides0(xl,xn)),file('/tmp/SRASS.s.p', m__1240_04)).
% fof(35, conjecture,(~(xl=sz00)=>((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))=>((aNaturalNumber0(sdtsldt0(xn,xl))&xn=sdtasdt0(xl,sdtsldt0(xn,xl)))=>sdtpldt0(xm,xn)=sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))))),file('/tmp/SRASS.s.p', m__)).
% fof(36, negated_conjecture,~((~(xl=sz00)=>((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))=>((aNaturalNumber0(sdtsldt0(xn,xl))&xn=sdtasdt0(xl,sdtsldt0(xn,xl)))=>sdtpldt0(xm,xn)=sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))))))),inference(assume_negation,[status(cth)],[35])).
% fof(68, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(69, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|(sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))&sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4)))),inference(variable_rename,[status(thm)],[68])).
% fof(70, plain,![X4]:![X5]:![X6]:((sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))&(sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))),inference(distribute,[status(thm)],[69])).
% cnf(72,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[70])).
% fof(78, plain,![X1]:(~(aNaturalNumber0(X1))|(X1=sz00|![X2]:![X3]:((~(aNaturalNumber0(X2))|~(aNaturalNumber0(X3)))|((~(sdtasdt0(X1,X2)=sdtasdt0(X1,X3))&~(sdtasdt0(X2,X1)=sdtasdt0(X3,X1)))|X2=X3)))),inference(fof_nnf,[status(thm)],[12])).
% fof(79, plain,![X4]:(~(aNaturalNumber0(X4))|(X4=sz00|![X5]:![X6]:((~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6)))|((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))&~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4)))|X5=X6)))),inference(variable_rename,[status(thm)],[78])).
% fof(80, plain,![X4]:![X5]:![X6]:((((~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6)))|((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))&~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4)))|X5=X6))|X4=sz00)|~(aNaturalNumber0(X4))),inference(shift_quantors,[status(thm)],[79])).
% fof(81, plain,![X4]:![X5]:![X6]:(((((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))|X5=X6)|(~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6))))|X4=sz00)|~(aNaturalNumber0(X4)))&((((~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4))|X5=X6)|(~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6))))|X4=sz00)|~(aNaturalNumber0(X4)))),inference(distribute,[status(thm)],[80])).
% cnf(83,plain,(X1=sz00|X3=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|sdtasdt0(X1,X3)!=sdtasdt0(X1,X2)),inference(split_conjunct,[status(thm)],[81])).
% cnf(112,plain,(aNaturalNumber0(xl)),inference(split_conjunct,[status(thm)],[18])).
% fof(113, plain,(((?[X2]:(aNaturalNumber0(X2)&xm=sdtasdt0(xl,X2))&doDivides0(xl,xm))&?[X3]:(aNaturalNumber0(X3)&xn=sdtasdt0(xl,X3)))&doDivides0(xl,xn)),inference(variable_rename,[status(thm)],[19])).
% fof(114, plain,((((aNaturalNumber0(esk2_0)&xm=sdtasdt0(xl,esk2_0))&doDivides0(xl,xm))&(aNaturalNumber0(esk3_0)&xn=sdtasdt0(xl,esk3_0)))&doDivides0(xl,xn)),inference(skolemize,[status(esa)],[113])).
% cnf(116,plain,(xn=sdtasdt0(xl,esk3_0)),inference(split_conjunct,[status(thm)],[114])).
% cnf(117,plain,(aNaturalNumber0(esk3_0)),inference(split_conjunct,[status(thm)],[114])).
% cnf(119,plain,(xm=sdtasdt0(xl,esk2_0)),inference(split_conjunct,[status(thm)],[114])).
% cnf(120,plain,(aNaturalNumber0(esk2_0)),inference(split_conjunct,[status(thm)],[114])).
% fof(187, negated_conjecture,(~(xl=sz00)&((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))&((aNaturalNumber0(sdtsldt0(xn,xl))&xn=sdtasdt0(xl,sdtsldt0(xn,xl)))&~(sdtpldt0(xm,xn)=sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))))))),inference(fof_nnf,[status(thm)],[36])).
% cnf(188,negated_conjecture,(sdtpldt0(xm,xn)!=sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))),inference(split_conjunct,[status(thm)],[187])).
% cnf(189,negated_conjecture,(xn=sdtasdt0(xl,sdtsldt0(xn,xl))),inference(split_conjunct,[status(thm)],[187])).
% cnf(190,negated_conjecture,(aNaturalNumber0(sdtsldt0(xn,xl))),inference(split_conjunct,[status(thm)],[187])).
% cnf(191,negated_conjecture,(xm=sdtasdt0(xl,sdtsldt0(xm,xl))),inference(split_conjunct,[status(thm)],[187])).
% cnf(192,negated_conjecture,(aNaturalNumber0(sdtsldt0(xm,xl))),inference(split_conjunct,[status(thm)],[187])).
% cnf(193,negated_conjecture,(xl!=sz00),inference(split_conjunct,[status(thm)],[187])).
% cnf(543,plain,(sz00=xl|X1=esk3_0|sdtasdt0(xl,X1)!=xn|~aNaturalNumber0(esk3_0)|~aNaturalNumber0(X1)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[83,116,theory(equality)])).
% cnf(544,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|~aNaturalNumber0(esk2_0)|~aNaturalNumber0(X1)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[83,119,theory(equality)])).
% cnf(567,plain,(sz00=xl|X1=esk3_0|sdtasdt0(xl,X1)!=xn|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[543,117,theory(equality)])).
% cnf(568,plain,(sz00=xl|X1=esk3_0|sdtasdt0(xl,X1)!=xn|$false|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[567,112,theory(equality)])).
% cnf(569,plain,(sz00=xl|X1=esk3_0|sdtasdt0(xl,X1)!=xn|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[568,theory(equality)])).
% cnf(570,plain,(X1=esk3_0|sdtasdt0(xl,X1)!=xn|~aNaturalNumber0(X1)),inference(sr,[status(thm)],[569,193,theory(equality)])).
% cnf(571,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[544,120,theory(equality)])).
% cnf(572,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|$false|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[571,112,theory(equality)])).
% cnf(573,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[572,theory(equality)])).
% cnf(574,plain,(X1=esk2_0|sdtasdt0(xl,X1)!=xm|~aNaturalNumber0(X1)),inference(sr,[status(thm)],[573,193,theory(equality)])).
% cnf(731,plain,(sdtpldt0(sdtasdt0(xl,X1),xn)=sdtasdt0(xl,sdtpldt0(X1,esk3_0))|~aNaturalNumber0(xl)|~aNaturalNumber0(X1)|~aNaturalNumber0(esk3_0)),inference(spm,[status(thm)],[72,116,theory(equality)])).
% cnf(756,plain,(sdtpldt0(sdtasdt0(xl,X1),xn)=sdtasdt0(xl,sdtpldt0(X1,esk3_0))|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(esk3_0)),inference(rw,[status(thm)],[731,112,theory(equality)])).
% cnf(757,plain,(sdtpldt0(sdtasdt0(xl,X1),xn)=sdtasdt0(xl,sdtpldt0(X1,esk3_0))|$false|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[756,117,theory(equality)])).
% cnf(758,plain,(sdtpldt0(sdtasdt0(xl,X1),xn)=sdtasdt0(xl,sdtpldt0(X1,esk3_0))|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[757,theory(equality)])).
% cnf(2050,negated_conjecture,(sdtsldt0(xn,xl)=esk3_0|~aNaturalNumber0(sdtsldt0(xn,xl))),inference(spm,[status(thm)],[570,189,theory(equality)])).
% cnf(2070,negated_conjecture,(sdtsldt0(xn,xl)=esk3_0|$false),inference(rw,[status(thm)],[2050,190,theory(equality)])).
% cnf(2071,negated_conjecture,(sdtsldt0(xn,xl)=esk3_0),inference(cn,[status(thm)],[2070,theory(equality)])).
% cnf(2089,negated_conjecture,(sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),esk3_0))!=sdtpldt0(xm,xn)),inference(rw,[status(thm)],[188,2071,theory(equality)])).
% cnf(4066,negated_conjecture,(sdtsldt0(xm,xl)=esk2_0|~aNaturalNumber0(sdtsldt0(xm,xl))),inference(spm,[status(thm)],[574,191,theory(equality)])).
% cnf(4093,negated_conjecture,(sdtsldt0(xm,xl)=esk2_0|$false),inference(rw,[status(thm)],[4066,192,theory(equality)])).
% cnf(4094,negated_conjecture,(sdtsldt0(xm,xl)=esk2_0),inference(cn,[status(thm)],[4093,theory(equality)])).
% cnf(4127,negated_conjecture,(sdtasdt0(xl,sdtpldt0(esk2_0,esk3_0))!=sdtpldt0(xm,xn)),inference(rw,[status(thm)],[2089,4094,theory(equality)])).
% cnf(22479,plain,(sdtpldt0(xm,xn)=sdtasdt0(xl,sdtpldt0(esk2_0,esk3_0))|~aNaturalNumber0(esk2_0)),inference(spm,[status(thm)],[758,119,theory(equality)])).
% cnf(22637,plain,(sdtpldt0(xm,xn)=sdtasdt0(xl,sdtpldt0(esk2_0,esk3_0))|$false),inference(rw,[status(thm)],[22479,120,theory(equality)])).
% cnf(22638,plain,(sdtpldt0(xm,xn)=sdtasdt0(xl,sdtpldt0(esk2_0,esk3_0))),inference(cn,[status(thm)],[22637,theory(equality)])).
% cnf(22639,plain,($false),inference(sr,[status(thm)],[22638,4127,theory(equality)])).
% cnf(22640,plain,($false),22639,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1710
% # ...of these trivial : 126
% # ...subsumed : 970
% # ...remaining for further processing: 614
% # Other redundant clauses eliminated : 53
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 21
% # Backward-rewritten : 45
% # Generated clauses : 8631
% # ...of the previous two non-trivial : 7373
% # Contextual simplify-reflections : 699
% # Paramodulations : 8544
% # Factorizations : 0
% # Equation resolutions : 87
% # Current number of processed clauses: 484
% # Positive orientable unit clauses: 54
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 424
% # Current number of unprocessed clauses: 5493
% # ...number of literals in the above : 28870
% # Clause-clause subsumption calls (NU) : 24009
% # Rec. Clause-clause subsumption calls : 9961
% # Unit Clause-clause subsumption calls : 72
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 293 leaves, 1.25+/-1.019 terms/leaf
% # Paramod-from index: 179 leaves, 1.06+/-0.230 terms/leaf
% # Paramod-into index: 258 leaves, 1.23+/-0.988 terms/leaf
% # -------------------------------------------------
% # User time : 0.439 s
% # System time : 0.015 s
% # Total time : 0.454 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.85 CPU 0.95 WC
% FINAL PrfWatch: 0.85 CPU 0.95 WC
% SZS output end Solution for /tmp/SystemOnTPTP24776/NUM468+2.tptp
%
%------------------------------------------------------------------------------