TSTP Solution File: RNG120+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG120+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 : art09.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 22:47:34 EST 2010
% Result : Theorem 1.01s
% Output : Solution 1.01s
% 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/SystemOnTPTP16681/RNG120+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16681/RNG120+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16681/RNG120+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 16777
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(aElement0(X1)=>aElement0(smndt0(X1))),file('/tmp/SRASS.s.p', mSortsU)).
% fof(4, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(23, axiom,(aIdeal0(xI)&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2174)).
% fof(26, axiom,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),file('/tmp/SRASS.s.p', m__2273)).
% fof(31, axiom,(((aElement0(xq)&aElement0(xr))&xb=sdtpldt0(sdtasdt0(xq,xu),xr))&(xr=sz00|iLess0(sbrdtbr0(xr),sbrdtbr0(xu)))),file('/tmp/SRASS.s.p', m__2666)).
% fof(33, axiom,![X1]:(aIdeal0(X1)<=>(aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>(![X3]:(aElementOf0(X3,X1)=>aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(aElement0(X3)=>aElementOf0(sdtasdt0(X3,X2),X1)))))),file('/tmp/SRASS.s.p', mDefIdeal)).
% fof(38, axiom,![X1]:(aElement0(X1)=>(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),file('/tmp/SRASS.s.p', mMulMnOne)).
% fof(43, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(44, axiom,aElement0(sz10),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(52, conjecture,aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),file('/tmp/SRASS.s.p', m__)).
% fof(53, negated_conjecture,~(aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)),inference(assume_negation,[status(cth)],[52])).
% fof(54, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_simplification,[status(thm)],[26,theory(equality)])).
% fof(61, negated_conjecture,~(aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)),inference(fof_simplification,[status(thm)],[53,theory(equality)])).
% fof(63, plain,![X1]:(~(aElement0(X1))|aElement0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(64, plain,![X2]:(~(aElement0(X2))|aElement0(smndt0(X2))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(aElement0(smndt0(X1))|~aElement0(X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(69, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(70, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[69])).
% cnf(71,plain,(aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[70])).
% cnf(152,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[23])).
% fof(161, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((~(aElementOf0(X1,xI))|X1=sz00)|~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_nnf,[status(thm)],[54])).
% fof(162, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X2]:((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))),inference(variable_rename,[status(thm)],[161])).
% fof(163, plain,![X2]:(((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))&(aElementOf0(xu,xI)&~(xu=sz00))),inference(shift_quantors,[status(thm)],[162])).
% cnf(165,plain,(aElementOf0(xu,xI)),inference(split_conjunct,[status(thm)],[163])).
% cnf(179,plain,(aElement0(xq)),inference(split_conjunct,[status(thm)],[31])).
% fof(181, plain,![X1]:((~(aIdeal0(X1))|(aSet0(X1)&![X2]:(~(aElementOf0(X2,X1))|(![X3]:(~(aElementOf0(X3,X1))|aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(~(aElement0(X3))|aElementOf0(sdtasdt0(X3,X2),X1))))))&((~(aSet0(X1))|?[X2]:(aElementOf0(X2,X1)&(?[X3]:(aElementOf0(X3,X1)&~(aElementOf0(sdtpldt0(X2,X3),X1)))|?[X3]:(aElement0(X3)&~(aElementOf0(sdtasdt0(X3,X2),X1))))))|aIdeal0(X1))),inference(fof_nnf,[status(thm)],[33])).
% fof(182, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|?[X8]:(aElementOf0(X8,X4)&(?[X9]:(aElementOf0(X9,X4)&~(aElementOf0(sdtpldt0(X8,X9),X4)))|?[X10]:(aElement0(X10)&~(aElementOf0(sdtasdt0(X10,X8),X4))))))|aIdeal0(X4))),inference(variable_rename,[status(thm)],[181])).
% fof(183, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|(aElementOf0(esk8_1(X4),X4)&((aElementOf0(esk9_1(X4),X4)&~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|(aElement0(esk10_1(X4))&~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[182])).
% fof(184, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))&(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4)))|~(aElementOf0(X5,X4)))&aSet0(X4))|~(aIdeal0(X4)))&((~(aSet0(X4))|(aElementOf0(esk8_1(X4),X4)&((aElementOf0(esk9_1(X4),X4)&~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|(aElement0(esk10_1(X4))&~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[183])).
% fof(185, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4)))&(((~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4))))&(aSet0(X4)|~(aIdeal0(X4))))&(((aElementOf0(esk8_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk10_1(X4))|aElementOf0(esk9_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))|aElementOf0(esk9_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk10_1(X4))|~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[184])).
% cnf(191,plain,(aSet0(X1)|~aIdeal0(X1)),inference(split_conjunct,[status(thm)],[185])).
% cnf(193,plain,(aElementOf0(sdtasdt0(X3,X2),X1)|~aIdeal0(X1)|~aElementOf0(X2,X1)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[185])).
% fof(236, plain,![X1]:(~(aElement0(X1))|(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),inference(fof_nnf,[status(thm)],[38])).
% fof(237, plain,![X2]:(~(aElement0(X2))|(sdtasdt0(smndt0(sz10),X2)=smndt0(X2)&smndt0(X2)=sdtasdt0(X2,smndt0(sz10)))),inference(variable_rename,[status(thm)],[236])).
% fof(238, plain,![X2]:((sdtasdt0(smndt0(sz10),X2)=smndt0(X2)|~(aElement0(X2)))&(smndt0(X2)=sdtasdt0(X2,smndt0(sz10))|~(aElement0(X2)))),inference(distribute,[status(thm)],[237])).
% cnf(240,plain,(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[238])).
% fof(258, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[43])).
% fof(259, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[258])).
% fof(260, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[259])).
% cnf(261,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[260])).
% cnf(262,plain,(aElement0(sz10)),inference(split_conjunct,[status(thm)],[44])).
% cnf(291,negated_conjecture,(~aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)),inference(split_conjunct,[status(thm)],[61])).
% cnf(292,plain,(aSet0(xI)),inference(spm,[status(thm)],[191,152,theory(equality)])).
% cnf(293,plain,(aElement0(xu)|~aSet0(xI)),inference(spm,[status(thm)],[261,165,theory(equality)])).
% cnf(379,plain,(aElementOf0(smndt0(X1),X2)|~aElementOf0(X1,X2)|~aIdeal0(X2)|~aElement0(smndt0(sz10))|~aElement0(X1)),inference(spm,[status(thm)],[193,240,theory(equality)])).
% cnf(772,plain,(aElement0(xu)|$false),inference(rw,[status(thm)],[293,292,theory(equality)])).
% cnf(773,plain,(aElement0(xu)),inference(cn,[status(thm)],[772,theory(equality)])).
% cnf(1143,negated_conjecture,(~aElementOf0(sdtasdt0(xq,xu),xI)|~aIdeal0(xI)|~aElement0(smndt0(sz10))|~aElement0(sdtasdt0(xq,xu))),inference(spm,[status(thm)],[291,379,theory(equality)])).
% cnf(1146,negated_conjecture,(~aElementOf0(sdtasdt0(xq,xu),xI)|$false|~aElement0(smndt0(sz10))|~aElement0(sdtasdt0(xq,xu))),inference(rw,[status(thm)],[1143,152,theory(equality)])).
% cnf(1147,negated_conjecture,(~aElementOf0(sdtasdt0(xq,xu),xI)|~aElement0(smndt0(sz10))|~aElement0(sdtasdt0(xq,xu))),inference(cn,[status(thm)],[1146,theory(equality)])).
% cnf(1286,negated_conjecture,(~aElementOf0(sdtasdt0(xq,xu),xI)|~aElement0(sdtasdt0(xq,xu))|~aElement0(sz10)),inference(spm,[status(thm)],[1147,65,theory(equality)])).
% cnf(1287,negated_conjecture,(~aElementOf0(sdtasdt0(xq,xu),xI)|~aElement0(sdtasdt0(xq,xu))|$false),inference(rw,[status(thm)],[1286,262,theory(equality)])).
% cnf(1288,negated_conjecture,(~aElementOf0(sdtasdt0(xq,xu),xI)|~aElement0(sdtasdt0(xq,xu))),inference(cn,[status(thm)],[1287,theory(equality)])).
% cnf(1291,negated_conjecture,(~aElement0(sdtasdt0(xq,xu))|~aElementOf0(xu,xI)|~aIdeal0(xI)|~aElement0(xq)),inference(spm,[status(thm)],[1288,193,theory(equality)])).
% cnf(1299,negated_conjecture,(~aElement0(sdtasdt0(xq,xu))|$false|~aIdeal0(xI)|~aElement0(xq)),inference(rw,[status(thm)],[1291,165,theory(equality)])).
% cnf(1300,negated_conjecture,(~aElement0(sdtasdt0(xq,xu))|$false|$false|~aElement0(xq)),inference(rw,[status(thm)],[1299,152,theory(equality)])).
% cnf(1301,negated_conjecture,(~aElement0(sdtasdt0(xq,xu))|$false|$false|$false),inference(rw,[status(thm)],[1300,179,theory(equality)])).
% cnf(1302,negated_conjecture,(~aElement0(sdtasdt0(xq,xu))),inference(cn,[status(thm)],[1301,theory(equality)])).
% cnf(1312,negated_conjecture,(~aElement0(xu)|~aElement0(xq)),inference(spm,[status(thm)],[1302,71,theory(equality)])).
% cnf(1320,negated_conjecture,($false|~aElement0(xq)),inference(rw,[status(thm)],[1312,773,theory(equality)])).
% cnf(1321,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1320,179,theory(equality)])).
% cnf(1322,negated_conjecture,($false),inference(cn,[status(thm)],[1321,theory(equality)])).
% cnf(1323,negated_conjecture,($false),1322,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 229
% # ...of these trivial : 7
% # ...subsumed : 47
% # ...remaining for further processing: 175
% # Other redundant clauses eliminated : 12
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 3
% # Generated clauses : 566
% # ...of the previous two non-trivial : 475
% # Contextual simplify-reflections : 9
% # Paramodulations : 541
% # Factorizations : 0
% # Equation resolutions : 25
% # Current number of processed clauses: 171
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 127
% # Current number of unprocessed clauses: 362
% # ...number of literals in the above : 1894
% # Clause-clause subsumption calls (NU) : 423
% # Rec. Clause-clause subsumption calls : 283
% # Unit Clause-clause subsumption calls : 42
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 195 leaves, 1.31+/-1.061 terms/leaf
% # Paramod-from index: 95 leaves, 1.09+/-0.293 terms/leaf
% # Paramod-into index: 176 leaves, 1.19+/-0.548 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.15 CPU 0.24 WC
% FINAL PrfWatch: 0.15 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP16681/RNG120+1.tptp
%
%------------------------------------------------------------------------------