TSTP Solution File: NUM467+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM467+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 : art07.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:22:42 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP21322/NUM467+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21322/NUM467+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21322/NUM467+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 21418
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB)).
% fof(7, 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(11, axiom,((aNaturalNumber0(xl)&aNaturalNumber0(xm))&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__1240)).
% fof(12, 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,(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,xn)=sdtasdt0(xl,X1))|doDivides0(xl,sdtpldt0(xm,xn))),file('/tmp/SRASS.s.p', m__)).
% fof(36, negated_conjecture,~((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,xn)=sdtasdt0(xl,X1))|doDivides0(xl,sdtpldt0(xm,xn)))),inference(assume_negation,[status(cth)],[35])).
% fof(39, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(40, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(57, 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)],[7])).
% fof(58, 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)],[57])).
% fof(59, 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)],[58])).
% cnf(61,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[59])).
% cnf(80,plain,(aNaturalNumber0(xl)),inference(split_conjunct,[status(thm)],[11])).
% fof(81, 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)],[12])).
% fof(82, 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)],[81])).
% cnf(84,plain,(xn=sdtasdt0(xl,esk3_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(85,plain,(aNaturalNumber0(esk3_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(87,plain,(xm=sdtasdt0(xl,esk2_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(88,plain,(aNaturalNumber0(esk2_0)),inference(split_conjunct,[status(thm)],[82])).
% fof(187, negated_conjecture,(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xm,xn)=sdtasdt0(xl,X1)))&~(doDivides0(xl,sdtpldt0(xm,xn)))),inference(fof_nnf,[status(thm)],[36])).
% fof(188, negated_conjecture,(![X2]:(~(aNaturalNumber0(X2))|~(sdtpldt0(xm,xn)=sdtasdt0(xl,X2)))&~(doDivides0(xl,sdtpldt0(xm,xn)))),inference(variable_rename,[status(thm)],[187])).
% fof(189, negated_conjecture,![X2]:((~(aNaturalNumber0(X2))|~(sdtpldt0(xm,xn)=sdtasdt0(xl,X2)))&~(doDivides0(xl,sdtpldt0(xm,xn)))),inference(shift_quantors,[status(thm)],[188])).
% cnf(191,negated_conjecture,(sdtpldt0(xm,xn)!=sdtasdt0(xl,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[189])).
% cnf(605,plain,(sdtpldt0(sdtasdt0(xl,X1),xn)=sdtasdt0(xl,sdtpldt0(X1,esk3_0))|~aNaturalNumber0(xl)|~aNaturalNumber0(X1)|~aNaturalNumber0(esk3_0)),inference(spm,[status(thm)],[61,84,theory(equality)])).
% cnf(625,plain,(sdtpldt0(sdtasdt0(xl,X1),xn)=sdtasdt0(xl,sdtpldt0(X1,esk3_0))|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(esk3_0)),inference(rw,[status(thm)],[605,80,theory(equality)])).
% cnf(626,plain,(sdtpldt0(sdtasdt0(xl,X1),xn)=sdtasdt0(xl,sdtpldt0(X1,esk3_0))|$false|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[625,85,theory(equality)])).
% cnf(627,plain,(sdtpldt0(sdtasdt0(xl,X1),xn)=sdtasdt0(xl,sdtpldt0(X1,esk3_0))|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[626,theory(equality)])).
% cnf(1930,plain,(sdtpldt0(xm,xn)=sdtasdt0(xl,sdtpldt0(esk2_0,esk3_0))|~aNaturalNumber0(esk2_0)),inference(spm,[status(thm)],[627,87,theory(equality)])).
% cnf(1969,plain,(sdtpldt0(xm,xn)=sdtasdt0(xl,sdtpldt0(esk2_0,esk3_0))|$false),inference(rw,[status(thm)],[1930,88,theory(equality)])).
% cnf(1970,plain,(sdtpldt0(xm,xn)=sdtasdt0(xl,sdtpldt0(esk2_0,esk3_0))),inference(cn,[status(thm)],[1969,theory(equality)])).
% cnf(2118,negated_conjecture,(~aNaturalNumber0(sdtpldt0(esk2_0,esk3_0))),inference(spm,[status(thm)],[191,1970,theory(equality)])).
% cnf(2150,negated_conjecture,(~aNaturalNumber0(esk3_0)|~aNaturalNumber0(esk2_0)),inference(spm,[status(thm)],[2118,41,theory(equality)])).
% cnf(2151,negated_conjecture,($false|~aNaturalNumber0(esk2_0)),inference(rw,[status(thm)],[2150,85,theory(equality)])).
% cnf(2152,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2151,88,theory(equality)])).
% cnf(2153,negated_conjecture,($false),inference(cn,[status(thm)],[2152,theory(equality)])).
% cnf(2154,negated_conjecture,($false),2153,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 236
% # ...of these trivial : 0
% # ...subsumed : 81
% # ...remaining for further processing: 155
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 676
% # ...of the previous two non-trivial : 595
% # Contextual simplify-reflections : 28
% # Paramodulations : 651
% # Factorizations : 2
% # Equation resolutions : 23
% # Current number of processed clauses: 148
% # Positive orientable unit clauses: 26
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 117
% # Current number of unprocessed clauses: 395
% # ...number of literals in the above : 1754
% # Clause-clause subsumption calls (NU) : 477
% # Rec. Clause-clause subsumption calls : 273
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 119 leaves, 1.21+/-0.829 terms/leaf
% # Paramod-from index: 63 leaves, 1.08+/-0.324 terms/leaf
% # Paramod-into index: 96 leaves, 1.18+/-0.804 terms/leaf
% # -------------------------------------------------
% # User time : 0.048 s
% # System time : 0.004 s
% # Total time : 0.052 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.25 WC
% FINAL PrfWatch: 0.16 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP21322/NUM467+2.tptp
%
%------------------------------------------------------------------------------