TSTP Solution File: NUM490+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM490+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 : 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:32:05 EST 2010
% Result : Theorem 1.53s
% Output : Solution 1.53s
% 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/SystemOnTPTP28709/NUM490+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28709/NUM490+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28709/NUM490+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 28805
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.020 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(2, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(9, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))),file('/tmp/SRASS.s.p', mDefLE)).
% fof(10, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)=>![X3]:(X3=sdtmndt0(X2,X1)<=>(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2)))),file('/tmp/SRASS.s.p', mDefDiff)).
% fof(21, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(24, axiom,sdtlseqdt0(xp,xn),file('/tmp/SRASS.s.p', m__1870)).
% fof(25, axiom,xr=sdtmndt0(xn,xp),file('/tmp/SRASS.s.p', m__1883)).
% fof(28, axiom,sdtasdt0(xn,xm)=sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),file('/tmp/SRASS.s.p', m__1951)).
% fof(47, conjecture,sdtasdt0(xr,xm)=sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),file('/tmp/SRASS.s.p', m__)).
% fof(48, negated_conjecture,~(sdtasdt0(xr,xm)=sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))),inference(assume_negation,[status(cth)],[47])).
% fof(51, negated_conjecture,~(sdtasdt0(xr,xm)=sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))),inference(fof_simplification,[status(thm)],[48,theory(equality)])).
% fof(52, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(53, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(55, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(56, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(80, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(sdtlseqdt0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&(![X3]:(~(aNaturalNumber0(X3))|~(sdtpldt0(X1,X3)=X2))|sdtlseqdt0(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(81, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(sdtlseqdt0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&(![X7]:(~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5)))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(sdtlseqdt0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&sdtpldt0(X4,esk1_2(X4,X5))=X5))&(![X7]:(~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5)))),inference(skolemize,[status(esa)],[81])).
% fof(83, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5))&(~(sdtlseqdt0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&sdtpldt0(X4,esk1_2(X4,X5))=X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[82])).
% fof(84, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk1_2(X4,X5))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((sdtpldt0(X4,esk1_2(X4,X5))=X5|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[83])).
% cnf(87,plain,(sdtlseqdt0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|sdtpldt0(X2,X3)!=X1|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[84])).
% fof(88, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(~(sdtlseqdt0(X1,X2))|![X3]:((~(X3=sdtmndt0(X2,X1))|(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&((~(aNaturalNumber0(X3))|~(sdtpldt0(X1,X3)=X2))|X3=sdtmndt0(X2,X1))))),inference(fof_nnf,[status(thm)],[10])).
% fof(89, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|(~(sdtlseqdt0(X4,X5))|![X6]:((~(X6=sdtmndt0(X5,X4))|(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4))))),inference(variable_rename,[status(thm)],[88])).
% fof(90, plain,![X4]:![X5]:![X6]:((((~(X6=sdtmndt0(X5,X4))|(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[89])).
% fof(91, plain,![X4]:![X5]:![X6]:(((((aNaturalNumber0(X6)|~(X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((sdtpldt0(X4,X6)=X5|~(X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))&((((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))),inference(distribute,[status(thm)],[90])).
% cnf(92,plain,(X3=sdtmndt0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~sdtlseqdt0(X2,X1)|sdtpldt0(X2,X3)!=X1|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[91])).
% cnf(94,plain,(aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~sdtlseqdt0(X2,X1)|X3!=sdtmndt0(X1,X2)),inference(split_conjunct,[status(thm)],[91])).
% cnf(137,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[21])).
% cnf(138,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[21])).
% cnf(139,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[21])).
% cnf(145,plain,(sdtlseqdt0(xp,xn)),inference(split_conjunct,[status(thm)],[24])).
% cnf(146,plain,(xr=sdtmndt0(xn,xp)),inference(split_conjunct,[status(thm)],[25])).
% cnf(150,plain,(sdtasdt0(xn,xm)=sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))),inference(split_conjunct,[status(thm)],[28])).
% cnf(235,negated_conjecture,(sdtasdt0(xr,xm)!=sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))),inference(split_conjunct,[status(thm)],[51])).
% cnf(237,plain,(sdtmndt0(X1,X2)=X3|sdtpldt0(X2,X3)!=X1|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[92,87])).
% cnf(446,plain,(aNaturalNumber0(X1)|xr!=X1|~sdtlseqdt0(xp,xn)|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[94,146,theory(equality)])).
% cnf(447,plain,(aNaturalNumber0(X1)|xr!=X1|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[446,145,theory(equality)])).
% cnf(448,plain,(aNaturalNumber0(X1)|xr!=X1|$false|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[447,137,theory(equality)])).
% cnf(449,plain,(aNaturalNumber0(X1)|xr!=X1|$false|$false|$false),inference(rw,[status(thm)],[448,139,theory(equality)])).
% cnf(450,plain,(aNaturalNumber0(X1)|xr!=X1),inference(cn,[status(thm)],[449,theory(equality)])).
% cnf(627,plain,(sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(sdtpldt0(X1,X2))),inference(er,[status(thm)],[237,theory(equality)])).
% cnf(938,plain,(aNaturalNumber0(xr)),inference(er,[status(thm)],[450,theory(equality)])).
% cnf(19093,plain,(sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[627,54])).
% cnf(19117,plain,(sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))=sdtasdt0(xr,xm)|~aNaturalNumber0(sdtasdt0(xr,xm))|~aNaturalNumber0(sdtasdt0(xp,xm))),inference(spm,[status(thm)],[19093,150,theory(equality)])).
% cnf(19186,plain,(~aNaturalNumber0(sdtasdt0(xr,xm))|~aNaturalNumber0(sdtasdt0(xp,xm))),inference(sr,[status(thm)],[19117,235,theory(equality)])).
% cnf(19192,plain,(~aNaturalNumber0(sdtasdt0(xp,xm))|~aNaturalNumber0(xm)|~aNaturalNumber0(xr)),inference(spm,[status(thm)],[19186,57,theory(equality)])).
% cnf(19199,plain,(~aNaturalNumber0(sdtasdt0(xp,xm))|$false|~aNaturalNumber0(xr)),inference(rw,[status(thm)],[19192,138,theory(equality)])).
% cnf(19200,plain,(~aNaturalNumber0(sdtasdt0(xp,xm))|$false|$false),inference(rw,[status(thm)],[19199,938,theory(equality)])).
% cnf(19201,plain,(~aNaturalNumber0(sdtasdt0(xp,xm))),inference(cn,[status(thm)],[19200,theory(equality)])).
% cnf(19204,plain,(~aNaturalNumber0(xm)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[19201,57,theory(equality)])).
% cnf(19211,plain,($false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[19204,138,theory(equality)])).
% cnf(19212,plain,($false|$false),inference(rw,[status(thm)],[19211,137,theory(equality)])).
% cnf(19213,plain,($false),inference(cn,[status(thm)],[19212,theory(equality)])).
% cnf(19214,plain,($false),19213,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1218
% # ...of these trivial : 37
% # ...subsumed : 559
% # ...remaining for further processing: 622
% # Other redundant clauses eliminated : 44
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 34
% # Backward-rewritten : 30
% # Generated clauses : 6436
% # ...of the previous two non-trivial : 5462
% # Contextual simplify-reflections : 135
% # Paramodulations : 6332
% # Factorizations : 4
% # Equation resolutions : 100
% # Current number of processed clauses: 482
% # Positive orientable unit clauses: 88
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 386
% # Current number of unprocessed clauses: 4047
% # ...number of literals in the above : 19683
% # Clause-clause subsumption calls (NU) : 4465
% # Rec. Clause-clause subsumption calls : 2911
% # Unit Clause-clause subsumption calls : 158
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 49
% # Indexed BW rewrite successes : 24
% # Backwards rewriting index: 404 leaves, 1.19+/-0.783 terms/leaf
% # Paramod-from index: 274 leaves, 1.11+/-0.533 terms/leaf
% # Paramod-into index: 377 leaves, 1.15+/-0.733 terms/leaf
% # -------------------------------------------------
% # User time : 0.331 s
% # System time : 0.009 s
% # Total time : 0.340 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.68 CPU 0.76 WC
% FINAL PrfWatch: 0.68 CPU 0.76 WC
% SZS output end Solution for /tmp/SystemOnTPTP28709/NUM490+1.tptp
%
%------------------------------------------------------------------------------