TSTP Solution File: RNG125+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG125+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 22:49:12 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/SystemOnTPTP16973/RNG125+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16973/RNG125+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16973/RNG125+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 17069
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(15, axiom,![X1]:(aElement0(X1)=>![X2]:(aDivisorOf0(X2,X1)<=>(aElement0(X2)&doDivides0(X2,X1)))),file('/tmp/SRASS.s.p', mDefDvs)).
% fof(18, axiom,(aElement0(xa)&aElement0(xb)),file('/tmp/SRASS.s.p', m__2091)).
% fof(21, axiom,(aIdeal0(xI)&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2174)).
% fof(24, 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(25, axiom,~((aDivisorOf0(xu,xa)&aDivisorOf0(xu,xb))),file('/tmp/SRASS.s.p', m__2383)).
% fof(27, axiom,~(~(doDivides0(xu,xa))),file('/tmp/SRASS.s.p', m__2479)).
% fof(28, axiom,~(~(doDivides0(xu,xb))),file('/tmp/SRASS.s.p', m__2612)).
% fof(29, 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(39, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(52, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(53, plain,doDivides0(xu,xa),inference(fof_simplification,[status(thm)],[27,theory(equality)])).
% fof(54, plain,doDivides0(xu,xb),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% fof(116, plain,![X1]:(~(aElement0(X1))|![X2]:((~(aDivisorOf0(X2,X1))|(aElement0(X2)&doDivides0(X2,X1)))&((~(aElement0(X2))|~(doDivides0(X2,X1)))|aDivisorOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[15])).
% fof(117, plain,![X3]:(~(aElement0(X3))|![X4]:((~(aDivisorOf0(X4,X3))|(aElement0(X4)&doDivides0(X4,X3)))&((~(aElement0(X4))|~(doDivides0(X4,X3)))|aDivisorOf0(X4,X3)))),inference(variable_rename,[status(thm)],[116])).
% fof(118, plain,![X3]:![X4]:(((~(aDivisorOf0(X4,X3))|(aElement0(X4)&doDivides0(X4,X3)))&((~(aElement0(X4))|~(doDivides0(X4,X3)))|aDivisorOf0(X4,X3)))|~(aElement0(X3))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X3]:![X4]:((((aElement0(X4)|~(aDivisorOf0(X4,X3)))|~(aElement0(X3)))&((doDivides0(X4,X3)|~(aDivisorOf0(X4,X3)))|~(aElement0(X3))))&(((~(aElement0(X4))|~(doDivides0(X4,X3)))|aDivisorOf0(X4,X3))|~(aElement0(X3)))),inference(distribute,[status(thm)],[118])).
% cnf(120,plain,(aDivisorOf0(X2,X1)|~aElement0(X1)|~doDivides0(X2,X1)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[119])).
% cnf(137,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[18])).
% cnf(138,plain,(aElement0(xa)),inference(split_conjunct,[status(thm)],[18])).
% cnf(142,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[21])).
% fof(151, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((~(aElementOf0(X1,xI))|X1=sz00)|~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_nnf,[status(thm)],[52])).
% fof(152, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X2]:((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))),inference(variable_rename,[status(thm)],[151])).
% fof(153, plain,![X2]:(((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))&(aElementOf0(xu,xI)&~(xu=sz00))),inference(shift_quantors,[status(thm)],[152])).
% cnf(155,plain,(aElementOf0(xu,xI)),inference(split_conjunct,[status(thm)],[153])).
% fof(157, plain,(~(aDivisorOf0(xu,xa))|~(aDivisorOf0(xu,xb))),inference(fof_nnf,[status(thm)],[25])).
% cnf(158,plain,(~aDivisorOf0(xu,xb)|~aDivisorOf0(xu,xa)),inference(split_conjunct,[status(thm)],[157])).
% cnf(164,plain,(doDivides0(xu,xa)),inference(split_conjunct,[status(thm)],[53])).
% cnf(165,plain,(doDivides0(xu,xb)),inference(split_conjunct,[status(thm)],[54])).
% fof(166, 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)],[29])).
% fof(167, 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)],[166])).
% fof(168, 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)],[167])).
% fof(169, 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)],[168])).
% fof(170, 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)],[169])).
% cnf(176,plain,(aSet0(X1)|~aIdeal0(X1)),inference(split_conjunct,[status(thm)],[170])).
% fof(243, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[39])).
% fof(244, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[243])).
% fof(245, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[244])).
% cnf(246,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[245])).
% cnf(286,plain,(aSet0(xI)),inference(spm,[status(thm)],[176,142,theory(equality)])).
% cnf(292,plain,(aElement0(xu)|~aSet0(xI)),inference(spm,[status(thm)],[246,155,theory(equality)])).
% cnf(343,plain,(aDivisorOf0(xu,xb)|~aElement0(xu)|~aElement0(xb)),inference(spm,[status(thm)],[120,165,theory(equality)])).
% cnf(344,plain,(aDivisorOf0(xu,xa)|~aElement0(xu)|~aElement0(xa)),inference(spm,[status(thm)],[120,164,theory(equality)])).
% cnf(346,plain,(aDivisorOf0(xu,xb)|~aElement0(xu)|$false),inference(rw,[status(thm)],[343,137,theory(equality)])).
% cnf(347,plain,(aDivisorOf0(xu,xb)|~aElement0(xu)),inference(cn,[status(thm)],[346,theory(equality)])).
% cnf(348,plain,(aDivisorOf0(xu,xa)|~aElement0(xu)|$false),inference(rw,[status(thm)],[344,138,theory(equality)])).
% cnf(349,plain,(aDivisorOf0(xu,xa)|~aElement0(xu)),inference(cn,[status(thm)],[348,theory(equality)])).
% cnf(761,plain,(aElement0(xu)|$false),inference(rw,[status(thm)],[292,286,theory(equality)])).
% cnf(762,plain,(aElement0(xu)),inference(cn,[status(thm)],[761,theory(equality)])).
% cnf(838,plain,(aDivisorOf0(xu,xb)|$false),inference(rw,[status(thm)],[347,762,theory(equality)])).
% cnf(839,plain,(aDivisorOf0(xu,xb)),inference(cn,[status(thm)],[838,theory(equality)])).
% cnf(841,plain,(~aDivisorOf0(xu,xa)|$false),inference(rw,[status(thm)],[158,839,theory(equality)])).
% cnf(842,plain,(~aDivisorOf0(xu,xa)),inference(cn,[status(thm)],[841,theory(equality)])).
% cnf(889,plain,(aDivisorOf0(xu,xa)|$false),inference(rw,[status(thm)],[349,762,theory(equality)])).
% cnf(890,plain,(aDivisorOf0(xu,xa)),inference(cn,[status(thm)],[889,theory(equality)])).
% cnf(891,plain,($false),inference(sr,[status(thm)],[890,842,theory(equality)])).
% cnf(892,plain,($false),891,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 260
% # ...of these trivial : 2
% # ...subsumed : 14
% # ...remaining for further processing: 244
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 3
% # Generated clauses : 356
% # ...of the previous two non-trivial : 299
% # Contextual simplify-reflections : 4
% # Paramodulations : 333
% # Factorizations : 0
% # Equation resolutions : 23
% # Current number of processed clauses: 128
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 97
% # Current number of unprocessed clauses: 259
% # ...number of literals in the above : 1307
% # Clause-clause subsumption calls (NU) : 527
% # Rec. Clause-clause subsumption calls : 302
% # Unit Clause-clause subsumption calls : 36
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 162 leaves, 1.32+/-1.087 terms/leaf
% # Paramod-from index: 79 leaves, 1.06+/-0.243 terms/leaf
% # Paramod-into index: 143 leaves, 1.16+/-0.537 terms/leaf
% # -------------------------------------------------
% # User time : 0.048 s
% # System time : 0.006 s
% # Total time : 0.054 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/SystemOnTPTP16973/RNG125+1.tptp
%
%------------------------------------------------------------------------------