TSTP Solution File: RNG106+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : RNG106+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 : art06.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:38:07 EST 2010

% Result   : Theorem 1.00s
% Output   : Solution 1.00s
% 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/SystemOnTPTP5540/RNG106+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP5540/RNG106+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5540/RNG106+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 5636
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,aElement0(xc),file('/tmp/SRASS.s.p', m__1905)).
% fof(9, 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(10, axiom,![X1]:(aElement0(X1)=>![X2]:(X2=slsdtgt0(X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)<=>?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))))),file('/tmp/SRASS.s.p', mDefPrIdeal)).
% fof(21, axiom,aElement0(sz10),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(39, conjecture,(![X1]:![X2]:![X3]:(((aElementOf0(X1,slsdtgt0(xc))&aElementOf0(X2,slsdtgt0(xc)))&aElement0(X3))=>?[X4]:((aElement0(X4)&sdtasdt0(xc,X4)=X1)&?[X5]:(((((aElement0(X5)&sdtasdt0(xc,X5)=X2)&sdtpldt0(X1,X2)=sdtasdt0(xc,sdtpldt0(X4,X5)))&sdtasdt0(X3,X1)=sdtasdt0(xc,sdtasdt0(X4,X3)))&aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc)))&aElementOf0(sdtasdt0(X3,X1),slsdtgt0(xc)))))=>aIdeal0(slsdtgt0(xc))),file('/tmp/SRASS.s.p', m__)).
% fof(40, negated_conjecture,~((![X1]:![X2]:![X3]:(((aElementOf0(X1,slsdtgt0(xc))&aElementOf0(X2,slsdtgt0(xc)))&aElement0(X3))=>?[X4]:((aElement0(X4)&sdtasdt0(xc,X4)=X1)&?[X5]:(((((aElement0(X5)&sdtasdt0(xc,X5)=X2)&sdtpldt0(X1,X2)=sdtasdt0(xc,sdtpldt0(X4,X5)))&sdtasdt0(X3,X1)=sdtasdt0(xc,sdtasdt0(X4,X3)))&aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc)))&aElementOf0(sdtasdt0(X3,X1),slsdtgt0(xc)))))=>aIdeal0(slsdtgt0(xc)))),inference(assume_negation,[status(cth)],[39])).
% cnf(68,plain,(aElement0(xc)),inference(split_conjunct,[status(thm)],[8])).
% fof(69, 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)],[9])).
% fof(70, 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)],[69])).
% fof(71, 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)],[70])).
% fof(72, 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)],[71])).
% fof(73, 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)],[72])).
% cnf(74,plain,(aIdeal0(X1)|~aSet0(X1)|~aElementOf0(sdtpldt0(esk1_1(X1),esk2_1(X1)),X1)|~aElementOf0(sdtasdt0(esk3_1(X1),esk1_1(X1)),X1)),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,plain,(aIdeal0(X1)|aElement0(esk3_1(X1))|~aSet0(X1)|~aElementOf0(sdtpldt0(esk1_1(X1),esk2_1(X1)),X1)),inference(split_conjunct,[status(thm)],[73])).
% cnf(76,plain,(aIdeal0(X1)|aElementOf0(esk2_1(X1),X1)|~aSet0(X1)|~aElementOf0(sdtasdt0(esk3_1(X1),esk1_1(X1)),X1)),inference(split_conjunct,[status(thm)],[73])).
% cnf(77,plain,(aIdeal0(X1)|aElementOf0(esk2_1(X1),X1)|aElement0(esk3_1(X1))|~aSet0(X1)),inference(split_conjunct,[status(thm)],[73])).
% cnf(78,plain,(aIdeal0(X1)|aElementOf0(esk1_1(X1),X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[73])).
% fof(82, plain,![X1]:(~(aElement0(X1))|![X2]:((~(X2=slsdtgt0(X1))|(aSet0(X2)&![X3]:((~(aElementOf0(X3,X2))|?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))&(![X4]:(~(aElement0(X4))|~(sdtasdt0(X1,X4)=X3))|aElementOf0(X3,X2)))))&((~(aSet0(X2))|?[X3]:((~(aElementOf0(X3,X2))|![X4]:(~(aElement0(X4))|~(sdtasdt0(X1,X4)=X3)))&(aElementOf0(X3,X2)|?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))))|X2=slsdtgt0(X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(83, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|?[X8]:(aElement0(X8)&sdtasdt0(X5,X8)=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|?[X10]:((~(aElementOf0(X10,X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=X10)))&(aElementOf0(X10,X6)|?[X12]:(aElement0(X12)&sdtasdt0(X5,X12)=X10))))|X6=slsdtgt0(X5)))),inference(variable_rename,[status(thm)],[82])).
% fof(84, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|(aElement0(esk4_3(X5,X6,X7))&sdtasdt0(X5,esk4_3(X5,X6,X7))=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|((~(aElementOf0(esk5_2(X5,X6),X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk5_2(X5,X6))))&(aElementOf0(esk5_2(X5,X6),X6)|(aElement0(esk6_2(X5,X6))&sdtasdt0(X5,esk6_2(X5,X6))=esk5_2(X5,X6)))))|X6=slsdtgt0(X5)))),inference(skolemize,[status(esa)],[83])).
% fof(85, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk5_2(X5,X6)))|~(aElementOf0(esk5_2(X5,X6),X6)))&(aElementOf0(esk5_2(X5,X6),X6)|(aElement0(esk6_2(X5,X6))&sdtasdt0(X5,esk6_2(X5,X6))=esk5_2(X5,X6))))|~(aSet0(X6)))|X6=slsdtgt0(X5))&(((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))&(~(aElementOf0(X7,X6))|(aElement0(esk4_3(X5,X6,X7))&sdtasdt0(X5,esk4_3(X5,X6,X7))=X7)))&aSet0(X6))|~(X6=slsdtgt0(X5))))|~(aElement0(X5))),inference(shift_quantors,[status(thm)],[84])).
% fof(86, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk5_2(X5,X6)))|~(aElementOf0(esk5_2(X5,X6),X6)))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&(((((aElement0(esk6_2(X5,X6))|aElementOf0(esk5_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&((((sdtasdt0(X5,esk6_2(X5,X6))=esk5_2(X5,X6)|aElementOf0(esk5_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))))&((((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&((((aElement0(esk4_3(X5,X6,X7))|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&(((sdtasdt0(X5,esk4_3(X5,X6,X7))=X7|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))))&((aSet0(X6)|~(X6=slsdtgt0(X5)))|~(aElement0(X5))))),inference(distribute,[status(thm)],[85])).
% cnf(87,plain,(aSet0(X2)|~aElement0(X1)|X2!=slsdtgt0(X1)),inference(split_conjunct,[status(thm)],[86])).
% cnf(152,plain,(aElement0(sz10)),inference(split_conjunct,[status(thm)],[21])).
% fof(238, negated_conjecture,(![X1]:![X2]:![X3]:(((~(aElementOf0(X1,slsdtgt0(xc)))|~(aElementOf0(X2,slsdtgt0(xc))))|~(aElement0(X3)))|?[X4]:((aElement0(X4)&sdtasdt0(xc,X4)=X1)&?[X5]:(((((aElement0(X5)&sdtasdt0(xc,X5)=X2)&sdtpldt0(X1,X2)=sdtasdt0(xc,sdtpldt0(X4,X5)))&sdtasdt0(X3,X1)=sdtasdt0(xc,sdtasdt0(X4,X3)))&aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc)))&aElementOf0(sdtasdt0(X3,X1),slsdtgt0(xc)))))&~(aIdeal0(slsdtgt0(xc)))),inference(fof_nnf,[status(thm)],[40])).
% fof(239, negated_conjecture,(![X6]:![X7]:![X8]:(((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8)))|?[X9]:((aElement0(X9)&sdtasdt0(xc,X9)=X6)&?[X10]:(((((aElement0(X10)&sdtasdt0(xc,X10)=X7)&sdtpldt0(X6,X7)=sdtasdt0(xc,sdtpldt0(X9,X10)))&sdtasdt0(X8,X6)=sdtasdt0(xc,sdtasdt0(X9,X8)))&aElementOf0(sdtpldt0(X6,X7),slsdtgt0(xc)))&aElementOf0(sdtasdt0(X8,X6),slsdtgt0(xc)))))&~(aIdeal0(slsdtgt0(xc)))),inference(variable_rename,[status(thm)],[238])).
% fof(240, negated_conjecture,(![X6]:![X7]:![X8]:(((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8)))|((aElement0(esk21_3(X6,X7,X8))&sdtasdt0(xc,esk21_3(X6,X7,X8))=X6)&(((((aElement0(esk22_3(X6,X7,X8))&sdtasdt0(xc,esk22_3(X6,X7,X8))=X7)&sdtpldt0(X6,X7)=sdtasdt0(xc,sdtpldt0(esk21_3(X6,X7,X8),esk22_3(X6,X7,X8))))&sdtasdt0(X8,X6)=sdtasdt0(xc,sdtasdt0(esk21_3(X6,X7,X8),X8)))&aElementOf0(sdtpldt0(X6,X7),slsdtgt0(xc)))&aElementOf0(sdtasdt0(X8,X6),slsdtgt0(xc)))))&~(aIdeal0(slsdtgt0(xc)))),inference(skolemize,[status(esa)],[239])).
% fof(241, negated_conjecture,![X6]:![X7]:![X8]:((((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8)))|((aElement0(esk21_3(X6,X7,X8))&sdtasdt0(xc,esk21_3(X6,X7,X8))=X6)&(((((aElement0(esk22_3(X6,X7,X8))&sdtasdt0(xc,esk22_3(X6,X7,X8))=X7)&sdtpldt0(X6,X7)=sdtasdt0(xc,sdtpldt0(esk21_3(X6,X7,X8),esk22_3(X6,X7,X8))))&sdtasdt0(X8,X6)=sdtasdt0(xc,sdtasdt0(esk21_3(X6,X7,X8),X8)))&aElementOf0(sdtpldt0(X6,X7),slsdtgt0(xc)))&aElementOf0(sdtasdt0(X8,X6),slsdtgt0(xc)))))&~(aIdeal0(slsdtgt0(xc)))),inference(shift_quantors,[status(thm)],[240])).
% fof(242, negated_conjecture,![X6]:![X7]:![X8]:((((aElement0(esk21_3(X6,X7,X8))|((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8))))&(sdtasdt0(xc,esk21_3(X6,X7,X8))=X6|((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8)))))&((((((aElement0(esk22_3(X6,X7,X8))|((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8))))&(sdtasdt0(xc,esk22_3(X6,X7,X8))=X7|((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8)))))&(sdtpldt0(X6,X7)=sdtasdt0(xc,sdtpldt0(esk21_3(X6,X7,X8),esk22_3(X6,X7,X8)))|((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8)))))&(sdtasdt0(X8,X6)=sdtasdt0(xc,sdtasdt0(esk21_3(X6,X7,X8),X8))|((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8)))))&(aElementOf0(sdtpldt0(X6,X7),slsdtgt0(xc))|((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8)))))&(aElementOf0(sdtasdt0(X8,X6),slsdtgt0(xc))|((~(aElementOf0(X6,slsdtgt0(xc)))|~(aElementOf0(X7,slsdtgt0(xc))))|~(aElement0(X8))))))&~(aIdeal0(slsdtgt0(xc)))),inference(distribute,[status(thm)],[241])).
% cnf(243,negated_conjecture,(~aIdeal0(slsdtgt0(xc))),inference(split_conjunct,[status(thm)],[242])).
% cnf(244,negated_conjecture,(aElementOf0(sdtasdt0(X1,X3),slsdtgt0(xc))|~aElement0(X1)|~aElementOf0(X2,slsdtgt0(xc))|~aElementOf0(X3,slsdtgt0(xc))),inference(split_conjunct,[status(thm)],[242])).
% cnf(245,negated_conjecture,(aElementOf0(sdtpldt0(X3,X2),slsdtgt0(xc))|~aElement0(X1)|~aElementOf0(X2,slsdtgt0(xc))|~aElementOf0(X3,slsdtgt0(xc))),inference(split_conjunct,[status(thm)],[242])).
% fof(252, plain,(~(epred1_0)<=>![X2]:![X3]:((aElementOf0(sdtpldt0(X3,X2),slsdtgt0(xc))|~(aElementOf0(X2,slsdtgt0(xc))))|~(aElementOf0(X3,slsdtgt0(xc))))),introduced(definition),['split']).
% cnf(253,plain,(epred1_0|aElementOf0(sdtpldt0(X3,X2),slsdtgt0(xc))|~aElementOf0(X2,slsdtgt0(xc))|~aElementOf0(X3,slsdtgt0(xc))),inference(split_equiv,[status(thm)],[252])).
% fof(254, plain,(~(epred2_0)<=>![X1]:~(aElement0(X1))),introduced(definition),['split']).
% cnf(255,plain,(epred2_0|~aElement0(X1)),inference(split_equiv,[status(thm)],[254])).
% cnf(256,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[245,252,theory(equality)]),254,theory(equality)]),['split']).
% fof(257, plain,(~(epred3_0)<=>![X3]:![X1]:((aElementOf0(sdtasdt0(X1,X3),slsdtgt0(xc))|~(aElementOf0(X3,slsdtgt0(xc))))|~(aElement0(X1)))),introduced(definition),['split']).
% cnf(258,plain,(epred3_0|aElementOf0(sdtasdt0(X1,X3),slsdtgt0(xc))|~aElement0(X1)|~aElementOf0(X3,slsdtgt0(xc))),inference(split_equiv,[status(thm)],[257])).
% fof(259, plain,(~(epred4_0)<=>![X2]:~(aElementOf0(X2,slsdtgt0(xc)))),introduced(definition),['split']).
% cnf(260,plain,(epred4_0|~aElementOf0(X2,slsdtgt0(xc))),inference(split_equiv,[status(thm)],[259])).
% cnf(261,negated_conjecture,(~epred4_0|~epred3_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[244,257,theory(equality)]),259,theory(equality)]),['split']).
% cnf(263,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[255,152,theory(equality)])).
% cnf(288,plain,(aSet0(slsdtgt0(X1))|~aElement0(X1)),inference(er,[status(thm)],[87,theory(equality)])).
% cnf(327,negated_conjecture,(epred4_0|aIdeal0(slsdtgt0(xc))|~aSet0(slsdtgt0(xc))),inference(spm,[status(thm)],[260,78,theory(equality)])).
% cnf(329,negated_conjecture,(epred4_0|~aSet0(slsdtgt0(xc))),inference(sr,[status(thm)],[327,243,theory(equality)])).
% cnf(771,negated_conjecture,(aIdeal0(slsdtgt0(xc))|aElement0(esk3_1(slsdtgt0(xc)))|epred1_0|~aSet0(slsdtgt0(xc))|~aElementOf0(esk2_1(slsdtgt0(xc)),slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))),inference(spm,[status(thm)],[75,253,theory(equality)])).
% cnf(773,negated_conjecture,(aElement0(esk3_1(slsdtgt0(xc)))|epred1_0|~aSet0(slsdtgt0(xc))|~aElementOf0(esk2_1(slsdtgt0(xc)),slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))),inference(sr,[status(thm)],[771,243,theory(equality)])).
% cnf(791,negated_conjecture,(aElementOf0(esk2_1(slsdtgt0(xc)),slsdtgt0(xc))|aIdeal0(slsdtgt0(xc))|epred3_0|~aSet0(slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))|~aElement0(esk3_1(slsdtgt0(xc)))),inference(spm,[status(thm)],[76,258,theory(equality)])).
% cnf(793,negated_conjecture,(aElementOf0(esk2_1(slsdtgt0(xc)),slsdtgt0(xc))|epred3_0|~aSet0(slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))|~aElement0(esk3_1(slsdtgt0(xc)))),inference(sr,[status(thm)],[791,243,theory(equality)])).
% cnf(835,negated_conjecture,(aIdeal0(slsdtgt0(xc))|epred1_0|~aElementOf0(sdtasdt0(esk3_1(slsdtgt0(xc)),esk1_1(slsdtgt0(xc))),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))|~aElementOf0(esk2_1(slsdtgt0(xc)),slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))),inference(spm,[status(thm)],[74,253,theory(equality)])).
% cnf(837,negated_conjecture,(epred1_0|~aElementOf0(sdtasdt0(esk3_1(slsdtgt0(xc)),esk1_1(slsdtgt0(xc))),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))|~aElementOf0(esk2_1(slsdtgt0(xc)),slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))),inference(sr,[status(thm)],[835,243,theory(equality)])).
% cnf(867,negated_conjecture,(epred1_0|aElement0(esk3_1(slsdtgt0(xc)))|aIdeal0(slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))),inference(spm,[status(thm)],[773,77,theory(equality)])).
% cnf(868,negated_conjecture,(epred1_0|aElement0(esk3_1(slsdtgt0(xc)))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))),inference(sr,[status(thm)],[867,243,theory(equality)])).
% cnf(869,negated_conjecture,(epred1_0|aElement0(esk3_1(slsdtgt0(xc)))|aIdeal0(slsdtgt0(xc))|~aSet0(slsdtgt0(xc))),inference(spm,[status(thm)],[868,78,theory(equality)])).
% cnf(870,negated_conjecture,(epred1_0|aElement0(esk3_1(slsdtgt0(xc)))|~aSet0(slsdtgt0(xc))),inference(sr,[status(thm)],[869,243,theory(equality)])).
% cnf(871,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[256,263,theory(equality)])).
% cnf(872,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[871,theory(equality)])).
% cnf(881,negated_conjecture,(epred4_0|~aElement0(xc)),inference(spm,[status(thm)],[329,288,theory(equality)])).
% cnf(882,negated_conjecture,(epred4_0|$false),inference(rw,[status(thm)],[881,68,theory(equality)])).
% cnf(883,negated_conjecture,(epred4_0),inference(cn,[status(thm)],[882,theory(equality)])).
% cnf(885,negated_conjecture,($false|~epred3_0),inference(rw,[status(thm)],[261,883,theory(equality)])).
% cnf(886,negated_conjecture,(~epred3_0),inference(cn,[status(thm)],[885,theory(equality)])).
% cnf(888,negated_conjecture,(aElement0(esk3_1(slsdtgt0(xc)))|~aSet0(slsdtgt0(xc))),inference(sr,[status(thm)],[870,872,theory(equality)])).
% cnf(889,negated_conjecture,(aElementOf0(esk2_1(slsdtgt0(xc)),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))|~aElement0(esk3_1(slsdtgt0(xc)))),inference(sr,[status(thm)],[793,886,theory(equality)])).
% cnf(890,negated_conjecture,(aElementOf0(esk2_1(slsdtgt0(xc)),slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))),inference(csr,[status(thm)],[889,888])).
% cnf(958,negated_conjecture,(~aElementOf0(sdtasdt0(esk3_1(slsdtgt0(xc)),esk1_1(slsdtgt0(xc))),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))|~aElementOf0(esk2_1(slsdtgt0(xc)),slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))),inference(sr,[status(thm)],[837,872,theory(equality)])).
% cnf(959,negated_conjecture,(~aElementOf0(sdtasdt0(esk3_1(slsdtgt0(xc)),esk1_1(slsdtgt0(xc))),slsdtgt0(xc))|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))),inference(csr,[status(thm)],[958,890])).
% cnf(963,negated_conjecture,(epred3_0|~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))|~aElement0(esk3_1(slsdtgt0(xc)))),inference(spm,[status(thm)],[959,258,theory(equality)])).
% cnf(964,negated_conjecture,(~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))|~aElement0(esk3_1(slsdtgt0(xc)))),inference(sr,[status(thm)],[963,886,theory(equality)])).
% cnf(974,negated_conjecture,(~aElementOf0(esk1_1(slsdtgt0(xc)),slsdtgt0(xc))|~aSet0(slsdtgt0(xc))),inference(csr,[status(thm)],[964,888])).
% cnf(975,negated_conjecture,(aIdeal0(slsdtgt0(xc))|~aSet0(slsdtgt0(xc))),inference(spm,[status(thm)],[974,78,theory(equality)])).
% cnf(976,negated_conjecture,(~aSet0(slsdtgt0(xc))),inference(sr,[status(thm)],[975,243,theory(equality)])).
% cnf(977,negated_conjecture,(~aElement0(xc)),inference(spm,[status(thm)],[976,288,theory(equality)])).
% cnf(978,negated_conjecture,($false),inference(rw,[status(thm)],[977,68,theory(equality)])).
% cnf(979,negated_conjecture,($false),inference(cn,[status(thm)],[978,theory(equality)])).
% cnf(980,negated_conjecture,($false),979,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 245
% # ...of these trivial                : 2
% # ...subsumed                        : 11
% # ...remaining for further processing: 232
% # Other redundant clauses eliminated : 18
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 5
% # Backward-rewritten                 : 6
% # Generated clauses                  : 427
% # ...of the previous two non-trivial : 372
% # Contextual simplify-reflections    : 4
% # Paramodulations                    : 394
% # Factorizations                     : 0
% # Equation resolutions               : 27
% # Current number of processed clauses: 117
% #    Positive orientable unit clauses: 7
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 5
% #    Non-unit-clauses                : 105
% # Current number of unprocessed clauses: 305
% # ...number of literals in the above : 1613
% # Clause-clause subsumption calls (NU) : 606
% # Rec. Clause-clause subsumption calls : 305
% # Unit Clause-clause subsumption calls : 57
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 3
% # Indexed BW rewrite successes       : 3
% # Backwards rewriting index:   149 leaves,   1.37+/-1.161 terms/leaf
% # Paramod-from index:           67 leaves,   1.09+/-0.286 terms/leaf
% # Paramod-into index:          129 leaves,   1.19+/-0.567 terms/leaf
% # -------------------------------------------------
% # User time              : 0.055 s
% # System time            : 0.004 s
% # Total time             : 0.059 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.25 WC
% FINAL PrfWatch: 0.16 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP5540/RNG106+1.tptp
% 
%------------------------------------------------------------------------------