TSTP Solution File: RNG099+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG099+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 : art02.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:34:08 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/SystemOnTPTP4798/RNG099+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4798/RNG099+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4798/RNG099+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 4928
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB)).
% fof(4, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(13, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aElement0(X2))&aIdeal0(X3))=>(sdteqdtlpzmzozddtrp0(X1,X2,X3)<=>aElementOf0(sdtpldt0(X1,smndt0(X2)),X3))),file('/tmp/SRASS.s.p', mDefMod)).
% fof(14, axiom,(aIdeal0(xI)&aIdeal0(xJ)),file('/tmp/SRASS.s.p', m__1205)).
% fof(16, axiom,(aElement0(xx)&aElement0(xy)),file('/tmp/SRASS.s.p', m__1217)).
% fof(17, axiom,((aElementOf0(xa,xI)&aElementOf0(xb,xJ))&sdtpldt0(xa,xb)=sz10),file('/tmp/SRASS.s.p', m__1294)).
% fof(18, axiom,xw=sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),file('/tmp/SRASS.s.p', m__1319)).
% fof(19, axiom,aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),file('/tmp/SRASS.s.p', m__1332)).
% fof(20, axiom,aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),file('/tmp/SRASS.s.p', m__1409)).
% fof(21, 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(29, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(35, conjecture,?[X1]:((aElement0(X1)&sdteqdtlpzmzozddtrp0(X1,xx,xI))&sdteqdtlpzmzozddtrp0(X1,xy,xJ)),file('/tmp/SRASS.s.p', m__)).
% fof(36, negated_conjecture,~(?[X1]:((aElement0(X1)&sdteqdtlpzmzozddtrp0(X1,xx,xI))&sdteqdtlpzmzozddtrp0(X1,xy,xJ))),inference(assume_negation,[status(cth)],[35])).
% fof(43, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(44, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[43])).
% cnf(45,plain,(aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(47, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(79, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aElement0(X2)))|~(aIdeal0(X3)))|((~(sdteqdtlpzmzozddtrp0(X1,X2,X3))|aElementOf0(sdtpldt0(X1,smndt0(X2)),X3))&(~(aElementOf0(sdtpldt0(X1,smndt0(X2)),X3))|sdteqdtlpzmzozddtrp0(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[13])).
% fof(80, plain,![X4]:![X5]:![X6]:(((~(aElement0(X4))|~(aElement0(X5)))|~(aIdeal0(X6)))|((~(sdteqdtlpzmzozddtrp0(X4,X5,X6))|aElementOf0(sdtpldt0(X4,smndt0(X5)),X6))&(~(aElementOf0(sdtpldt0(X4,smndt0(X5)),X6))|sdteqdtlpzmzozddtrp0(X4,X5,X6)))),inference(variable_rename,[status(thm)],[79])).
% fof(81, plain,![X4]:![X5]:![X6]:(((~(sdteqdtlpzmzozddtrp0(X4,X5,X6))|aElementOf0(sdtpldt0(X4,smndt0(X5)),X6))|((~(aElement0(X4))|~(aElement0(X5)))|~(aIdeal0(X6))))&((~(aElementOf0(sdtpldt0(X4,smndt0(X5)),X6))|sdteqdtlpzmzozddtrp0(X4,X5,X6))|((~(aElement0(X4))|~(aElement0(X5)))|~(aIdeal0(X6))))),inference(distribute,[status(thm)],[80])).
% cnf(82,plain,(sdteqdtlpzmzozddtrp0(X3,X2,X1)|~aIdeal0(X1)|~aElement0(X2)|~aElement0(X3)|~aElementOf0(sdtpldt0(X3,smndt0(X2)),X1)),inference(split_conjunct,[status(thm)],[81])).
% cnf(84,plain,(aIdeal0(xJ)),inference(split_conjunct,[status(thm)],[14])).
% cnf(85,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[14])).
% cnf(89,plain,(aElement0(xy)),inference(split_conjunct,[status(thm)],[16])).
% cnf(90,plain,(aElement0(xx)),inference(split_conjunct,[status(thm)],[16])).
% cnf(92,plain,(aElementOf0(xb,xJ)),inference(split_conjunct,[status(thm)],[17])).
% cnf(93,plain,(aElementOf0(xa,xI)),inference(split_conjunct,[status(thm)],[17])).
% cnf(94,plain,(xw=sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb))),inference(split_conjunct,[status(thm)],[18])).
% cnf(95,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)),inference(split_conjunct,[status(thm)],[19])).
% cnf(96,plain,(aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ)),inference(split_conjunct,[status(thm)],[20])).
% fof(97, 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)],[21])).
% fof(98, 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)],[97])).
% fof(99, 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(esk1_1(X4),X4)&((aElementOf0(esk2_1(X4),X4)&~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|(aElement0(esk3_1(X4))&~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[98])).
% fof(100, 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(esk1_1(X4),X4)&((aElementOf0(esk2_1(X4),X4)&~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|(aElement0(esk3_1(X4))&~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[99])).
% fof(101, 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(esk1_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk3_1(X4))|aElementOf0(esk2_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))|aElementOf0(esk2_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk3_1(X4))|~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[100])).
% cnf(107,plain,(aSet0(X1)|~aIdeal0(X1)),inference(split_conjunct,[status(thm)],[101])).
% fof(151, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[29])).
% fof(152, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[151])).
% fof(153, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[152])).
% cnf(154,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[153])).
% fof(175, negated_conjecture,![X1]:((~(aElement0(X1))|~(sdteqdtlpzmzozddtrp0(X1,xx,xI)))|~(sdteqdtlpzmzozddtrp0(X1,xy,xJ))),inference(fof_nnf,[status(thm)],[36])).
% fof(176, negated_conjecture,![X2]:((~(aElement0(X2))|~(sdteqdtlpzmzozddtrp0(X2,xx,xI)))|~(sdteqdtlpzmzozddtrp0(X2,xy,xJ))),inference(variable_rename,[status(thm)],[175])).
% cnf(177,negated_conjecture,(~sdteqdtlpzmzozddtrp0(X1,xy,xJ)|~sdteqdtlpzmzozddtrp0(X1,xx,xI)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[176])).
% cnf(178,plain,(aSet0(xJ)),inference(spm,[status(thm)],[107,84,theory(equality)])).
% cnf(179,plain,(aSet0(xI)),inference(spm,[status(thm)],[107,85,theory(equality)])).
% cnf(180,plain,(aElement0(xb)|~aSet0(xJ)),inference(spm,[status(thm)],[154,92,theory(equality)])).
% cnf(181,plain,(aElement0(xa)|~aSet0(xI)),inference(spm,[status(thm)],[154,93,theory(equality)])).
% cnf(299,negated_conjecture,(~sdteqdtlpzmzozddtrp0(X1,xx,xI)|~aElement0(X1)|~aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)|~aIdeal0(xJ)|~aElement0(xy)),inference(spm,[status(thm)],[177,82,theory(equality)])).
% cnf(300,negated_conjecture,(~sdteqdtlpzmzozddtrp0(X1,xx,xI)|~aElement0(X1)|~aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)|$false|~aElement0(xy)),inference(rw,[status(thm)],[299,84,theory(equality)])).
% cnf(301,negated_conjecture,(~sdteqdtlpzmzozddtrp0(X1,xx,xI)|~aElement0(X1)|~aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)|$false|$false),inference(rw,[status(thm)],[300,89,theory(equality)])).
% cnf(302,negated_conjecture,(~sdteqdtlpzmzozddtrp0(X1,xx,xI)|~aElement0(X1)|~aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)),inference(cn,[status(thm)],[301,theory(equality)])).
% cnf(312,plain,(aElement0(xw)|~aElement0(sdtasdt0(xx,xb))|~aElement0(sdtasdt0(xy,xa))),inference(spm,[status(thm)],[45,94,theory(equality)])).
% cnf(502,plain,(aElement0(xb)|$false),inference(rw,[status(thm)],[180,178,theory(equality)])).
% cnf(503,plain,(aElement0(xb)),inference(cn,[status(thm)],[502,theory(equality)])).
% cnf(504,plain,(aElement0(xa)|$false),inference(rw,[status(thm)],[181,179,theory(equality)])).
% cnf(505,plain,(aElement0(xa)),inference(cn,[status(thm)],[504,theory(equality)])).
% cnf(526,negated_conjecture,(~aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)|~aElement0(X1)|~aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)|~aIdeal0(xI)|~aElement0(xx)),inference(spm,[status(thm)],[302,82,theory(equality)])).
% cnf(527,negated_conjecture,(~aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)|~aElement0(X1)|~aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)|$false|~aElement0(xx)),inference(rw,[status(thm)],[526,85,theory(equality)])).
% cnf(528,negated_conjecture,(~aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)|~aElement0(X1)|~aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)|$false|$false),inference(rw,[status(thm)],[527,90,theory(equality)])).
% cnf(529,negated_conjecture,(~aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)|~aElement0(X1)|~aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)),inference(cn,[status(thm)],[528,theory(equality)])).
% cnf(716,plain,(aElement0(xw)|~aElement0(sdtasdt0(xx,xb))|~aElement0(xa)|~aElement0(xy)),inference(spm,[status(thm)],[312,48,theory(equality)])).
% cnf(717,plain,(aElement0(xw)|~aElement0(sdtasdt0(xx,xb))|$false|~aElement0(xy)),inference(rw,[status(thm)],[716,505,theory(equality)])).
% cnf(718,plain,(aElement0(xw)|~aElement0(sdtasdt0(xx,xb))|$false|$false),inference(rw,[status(thm)],[717,89,theory(equality)])).
% cnf(719,plain,(aElement0(xw)|~aElement0(sdtasdt0(xx,xb))),inference(cn,[status(thm)],[718,theory(equality)])).
% cnf(720,plain,(aElement0(xw)|~aElement0(xb)|~aElement0(xx)),inference(spm,[status(thm)],[719,48,theory(equality)])).
% cnf(721,plain,(aElement0(xw)|$false|~aElement0(xx)),inference(rw,[status(thm)],[720,503,theory(equality)])).
% cnf(722,plain,(aElement0(xw)|$false|$false),inference(rw,[status(thm)],[721,90,theory(equality)])).
% cnf(723,plain,(aElement0(xw)),inference(cn,[status(thm)],[722,theory(equality)])).
% cnf(19929,negated_conjecture,(~aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)|~aElement0(xw)),inference(spm,[status(thm)],[529,96,theory(equality)])).
% cnf(19947,negated_conjecture,($false|~aElement0(xw)),inference(rw,[status(thm)],[19929,95,theory(equality)])).
% cnf(19948,negated_conjecture,($false|$false),inference(rw,[status(thm)],[19947,723,theory(equality)])).
% cnf(19949,negated_conjecture,($false),inference(cn,[status(thm)],[19948,theory(equality)])).
% cnf(19950,negated_conjecture,($false),19949,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 972
% # ...of these trivial : 10
% # ...subsumed : 577
% # ...remaining for further processing: 385
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 3
% # Generated clauses : 9606
% # ...of the previous two non-trivial : 8742
% # Contextual simplify-reflections : 136
% # Paramodulations : 9584
% # Factorizations : 0
% # Equation resolutions : 22
% # Current number of processed clauses: 378
% # Positive orientable unit clauses: 37
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 340
% # Current number of unprocessed clauses: 7768
% # ...number of literals in the above : 40486
% # Clause-clause subsumption calls (NU) : 7589
% # Rec. Clause-clause subsumption calls : 5847
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 397 leaves, 1.52+/-1.671 terms/leaf
% # Paramod-from index: 221 leaves, 1.19+/-0.788 terms/leaf
% # Paramod-into index: 343 leaves, 1.34+/-1.012 terms/leaf
% # -------------------------------------------------
% # User time : 0.355 s
% # System time : 0.018 s
% # Total time : 0.373 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.71 CPU 0.79 WC
% FINAL PrfWatch: 0.71 CPU 0.79 WC
% SZS output end Solution for /tmp/SystemOnTPTP4798/RNG099+1.tptp
%
%------------------------------------------------------------------------------