TSTP Solution File: NUM460+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM460+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:19:50 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP19473/NUM460+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19473/NUM460+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19473/NUM460+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 19569
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 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(3, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))),file('/tmp/SRASS.s.p', mAddAsso)).
% fof(8, axiom,((aNaturalNumber0(xm)&aNaturalNumber0(xn))&aNaturalNumber0(xl)),file('/tmp/SRASS.s.p', m__773)).
% fof(23, conjecture,((((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,X1)=xn)&sdtlseqdt0(xm,xn))&?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xn,X1)=xl))&sdtlseqdt0(xn,xl))=>(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,X1)=xl)|sdtlseqdt0(xm,xl))),file('/tmp/SRASS.s.p', m__)).
% fof(24, negated_conjecture,~(((((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,X1)=xn)&sdtlseqdt0(xm,xn))&?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xn,X1)=xl))&sdtlseqdt0(xn,xl))=>(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,X1)=xl)|sdtlseqdt0(xm,xl)))),inference(assume_negation,[status(cth)],[23])).
% fof(26, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(27, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(32, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(33, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|sdtpldt0(sdtpldt0(X4,X5),X6)=sdtpldt0(X4,sdtpldt0(X5,X6))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[33])).
% cnf(56,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[8])).
% fof(112, negated_conjecture,((((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,X1)=xn)&sdtlseqdt0(xm,xn))&?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xn,X1)=xl))&sdtlseqdt0(xn,xl))&(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xm,X1)=xl))&~(sdtlseqdt0(xm,xl)))),inference(fof_nnf,[status(thm)],[24])).
% fof(113, negated_conjecture,((((?[X2]:(aNaturalNumber0(X2)&sdtpldt0(xm,X2)=xn)&sdtlseqdt0(xm,xn))&?[X3]:(aNaturalNumber0(X3)&sdtpldt0(xn,X3)=xl))&sdtlseqdt0(xn,xl))&(![X4]:(~(aNaturalNumber0(X4))|~(sdtpldt0(xm,X4)=xl))&~(sdtlseqdt0(xm,xl)))),inference(variable_rename,[status(thm)],[112])).
% fof(114, negated_conjecture,(((((aNaturalNumber0(esk2_0)&sdtpldt0(xm,esk2_0)=xn)&sdtlseqdt0(xm,xn))&(aNaturalNumber0(esk3_0)&sdtpldt0(xn,esk3_0)=xl))&sdtlseqdt0(xn,xl))&(![X4]:(~(aNaturalNumber0(X4))|~(sdtpldt0(xm,X4)=xl))&~(sdtlseqdt0(xm,xl)))),inference(skolemize,[status(esa)],[113])).
% fof(115, negated_conjecture,![X4]:(((~(aNaturalNumber0(X4))|~(sdtpldt0(xm,X4)=xl))&~(sdtlseqdt0(xm,xl)))&((((aNaturalNumber0(esk2_0)&sdtpldt0(xm,esk2_0)=xn)&sdtlseqdt0(xm,xn))&(aNaturalNumber0(esk3_0)&sdtpldt0(xn,esk3_0)=xl))&sdtlseqdt0(xn,xl))),inference(shift_quantors,[status(thm)],[114])).
% cnf(117,negated_conjecture,(sdtpldt0(xn,esk3_0)=xl),inference(split_conjunct,[status(thm)],[115])).
% cnf(118,negated_conjecture,(aNaturalNumber0(esk3_0)),inference(split_conjunct,[status(thm)],[115])).
% cnf(120,negated_conjecture,(sdtpldt0(xm,esk2_0)=xn),inference(split_conjunct,[status(thm)],[115])).
% cnf(121,negated_conjecture,(aNaturalNumber0(esk2_0)),inference(split_conjunct,[status(thm)],[115])).
% cnf(123,negated_conjecture,(sdtpldt0(xm,X1)!=xl|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[115])).
% cnf(367,negated_conjecture,(sdtpldt0(xn,X1)=sdtpldt0(xm,sdtpldt0(esk2_0,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(esk2_0)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[34,120,theory(equality)])).
% cnf(378,negated_conjecture,(sdtpldt0(xn,X1)=sdtpldt0(xm,sdtpldt0(esk2_0,X1))|~aNaturalNumber0(X1)|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[367,121,theory(equality)])).
% cnf(379,negated_conjecture,(sdtpldt0(xn,X1)=sdtpldt0(xm,sdtpldt0(esk2_0,X1))|~aNaturalNumber0(X1)|$false|$false),inference(rw,[status(thm)],[378,56,theory(equality)])).
% cnf(380,negated_conjecture,(sdtpldt0(xn,X1)=sdtpldt0(xm,sdtpldt0(esk2_0,X1))|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[379,theory(equality)])).
% cnf(1067,negated_conjecture,(sdtpldt0(xn,X1)!=xl|~aNaturalNumber0(sdtpldt0(esk2_0,X1))|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[123,380,theory(equality)])).
% cnf(1198,negated_conjecture,(~aNaturalNumber0(sdtpldt0(esk2_0,esk3_0))|~aNaturalNumber0(esk3_0)),inference(spm,[status(thm)],[1067,117,theory(equality)])).
% cnf(1208,negated_conjecture,(~aNaturalNumber0(sdtpldt0(esk2_0,esk3_0))|$false),inference(rw,[status(thm)],[1198,118,theory(equality)])).
% cnf(1209,negated_conjecture,(~aNaturalNumber0(sdtpldt0(esk2_0,esk3_0))),inference(cn,[status(thm)],[1208,theory(equality)])).
% cnf(1212,negated_conjecture,(~aNaturalNumber0(esk3_0)|~aNaturalNumber0(esk2_0)),inference(spm,[status(thm)],[1209,28,theory(equality)])).
% cnf(1213,negated_conjecture,($false|~aNaturalNumber0(esk2_0)),inference(rw,[status(thm)],[1212,118,theory(equality)])).
% cnf(1214,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1213,121,theory(equality)])).
% cnf(1215,negated_conjecture,($false),inference(cn,[status(thm)],[1214,theory(equality)])).
% cnf(1216,negated_conjecture,($false),1215,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 150
% # ...of these trivial : 2
% # ...subsumed : 55
% # ...remaining for further processing: 93
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 7
% # Generated clauses : 389
% # ...of the previous two non-trivial : 342
% # Contextual simplify-reflections : 1
% # Paramodulations : 374
% # Factorizations : 0
% # Equation resolutions : 15
% # Current number of processed clauses: 85
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 60
% # Current number of unprocessed clauses: 211
% # ...number of literals in the above : 942
% # Clause-clause subsumption calls (NU) : 213
% # Rec. Clause-clause subsumption calls : 185
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 74 leaves, 1.26+/-0.973 terms/leaf
% # Paramod-from index: 38 leaves, 1.08+/-0.270 terms/leaf
% # Paramod-into index: 61 leaves, 1.21+/-0.852 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.004 s
% # Total time : 0.031 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP19473/NUM460+2.tptp
%
%------------------------------------------------------------------------------