%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU210+1 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 01:50:53 EST 2010

% Result   : Theorem 146.01s
% Output   : Solution 148.32s
% 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/SystemOnTPTP25450/SEU210+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~t174_relat_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... reflexivity_r1_tarski:
%  CSA axiom reflexivity_r1_tarski found
% Looking for CSA axiom ... t6_boole:
%  CSA axiom t6_boole found
% Looking for CSA axiom ... fc4_relat_1:
%  CSA axiom fc4_relat_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... fc6_relat_1:
%  CSA axiom fc6_relat_1 found
% Looking for CSA axiom ... fc8_relat_1:
%  CSA axiom fc8_relat_1 found
% Looking for CSA axiom ... fc1_xboole_0:
% t8_boole:
% cc1_relat_1:
% rc1_relat_1:
% rc2_relat_1:
%  CSA axiom rc2_relat_1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... fc1_xboole_0:
% t8_boole:
% cc1_relat_1:
% rc1_relat_1:
% t166_relat_1:
%  CSA axiom t166_relat_1 found
% Looking for CSA axiom ... d5_relat_1:
%  CSA axiom d5_relat_1 found
% Looking for CSA axiom ... d3_tarski:
%  CSA axiom d3_tarski found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... fc1_xboole_0:
% t8_boole:
% cc1_relat_1:
% rc1_relat_1:
% antisymmetry_r2_hidden:
%  CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... rc1_xboole_0:
% rc2_xboole_0:
% commutativity_k2_tarski:
%  CSA axiom commutativity_k2_tarski found
% Looking for CSA axiom ... t3_subset:
%  CSA axiom t3_subset found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... fc1_xboole_0:
% t8_boole:
% cc1_relat_1:
% rc1_relat_1:
% rc1_xboole_0:
% rc2_xboole_0:
% existence_m1_subset_1:
%  CSA axiom existence_m1_subset_1 found
% Looking for CSA axiom ... fc3_subset_1:
%  CSA axiom fc3_subset_1 found
% Looking for CSA axiom ... fc1_zfmisc_1:
%  CSA axiom fc1_zfmisc_1 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... fc1_xboole_0:
% t8_boole:
% cc1_relat_1:
% rc1_relat_1:
% rc1_xboole_0:
% rc2_xboole_0:
% t7_boole:
%  CSA axiom t7_boole found
% Looking for CSA axiom ... t1_subset:
%  CSA axiom t1_subset found
% Looking for CSA axiom ... d5_tarski:
%  CSA axiom d5_tarski found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :d5_tarski:t1_subset:t7_boole:fc1_zfmisc_1:fc3_subset_1:existence_m1_subset_1:t3_subset:commutativity_k2_tarski:antisymmetry_r2_hidden:d3_tarski:d5_relat_1:t166_relat_1:rc2_relat_1:fc8_relat_1:fc6_relat_1:fc4_relat_1:t6_boole:reflexivity_r1_tarski (18)
% Unselected axioms are ... :fc1_xboole_0:t8_boole:cc1_relat_1:rc1_relat_1:rc1_xboole_0:rc2_xboole_0:fc2_subset_1:t4_subset:t2_subset:fc1_subset_1:t5_subset:rc1_subset_1:rc2_subset_1:dt_k10_relat_1:dt_k1_tarski:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_relat_1:dt_k2_tarski:dt_k4_tarski:dt_m1_subset_1 (21)
% SZS status THM for /tmp/SystemOnTPTP25450/SEU210+1.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP25450/SEU210+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC  time limit is 1200s
% TreeLimitedRun: PID is 32727
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.92 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(3, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(8, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(9, axiom,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),file('/tmp/SRASS.s.p', antisymmetry_r2_hidden)).
% fof(10, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(11, axiom,![X1]:(relation(X1)=>![X2]:(X2=relation_rng(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:in(ordered_pair(X4,X3),X1)))),file('/tmp/SRASS.s.p', d5_relat_1)).
% fof(12, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(X1,relation_inverse_image(X3,X2))<=>?[X4]:((in(X4,relation_rng(X3))&in(ordered_pair(X1,X4),X3))&in(X4,X2)))),file('/tmp/SRASS.s.p', t166_relat_1)).
% fof(14, axiom,![X1]:(empty(X1)=>(empty(relation_rng(X1))&relation(relation_rng(X1)))),file('/tmp/SRASS.s.p', fc8_relat_1)).
% fof(16, axiom,(empty(empty_set)&relation(empty_set)),file('/tmp/SRASS.s.p', fc4_relat_1)).
% fof(17, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(19, conjecture,![X1]:![X2]:(relation(X2)=>~(((~(X1=empty_set)&subset(X1,relation_rng(X2)))&relation_inverse_image(X2,X1)=empty_set))),file('/tmp/SRASS.s.p', t174_relat_1)).
% fof(20, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>~(((~(X1=empty_set)&subset(X1,relation_rng(X2)))&relation_inverse_image(X2,X1)=empty_set)))),inference(assume_negation,[status(cth)],[19])).
% fof(23, plain,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(26, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[1])).
% cnf(27,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(31, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(32, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(45, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(46,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X1]:![X2]:(~(in(X1,X2))|~(in(X2,X1))),inference(fof_nnf,[status(thm)],[23])).
% fof(48, plain,![X3]:![X4]:(~(in(X3,X4))|~(in(X4,X3))),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(~in(X1,X2)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(51, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[51])).
% fof(53, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[52])).
% fof(54, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[53])).
% cnf(56,plain,(subset(X1,X2)|in(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[54])).
% cnf(57,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[54])).
% fof(58, plain,![X1]:(~(relation(X1))|![X2]:((~(X2=relation_rng(X1))|![X3]:((~(in(X3,X2))|?[X4]:in(ordered_pair(X4,X3),X1))&(![X4]:~(in(ordered_pair(X4,X3),X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:~(in(ordered_pair(X4,X3),X1)))&(in(X3,X2)|?[X4]:in(ordered_pair(X4,X3),X1)))|X2=relation_rng(X1)))),inference(fof_nnf,[status(thm)],[11])).
% fof(59, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|?[X8]:in(ordered_pair(X8,X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:~(in(ordered_pair(X11,X10),X5)))&(in(X10,X6)|?[X12]:in(ordered_pair(X12,X10),X5)))|X6=relation_rng(X5)))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(esk3_3(X5,X6,X7),X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(((~(in(esk4_2(X5,X6),X6))|![X11]:~(in(ordered_pair(X11,esk4_2(X5,X6)),X5)))&(in(esk4_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk4_2(X5,X6)),X5)))|X6=relation_rng(X5)))),inference(skolemize,[status(esa)],[59])).
% fof(61, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk4_2(X5,X6)),X5))|~(in(esk4_2(X5,X6),X6)))&(in(esk4_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk4_2(X5,X6)),X5)))|X6=relation_rng(X5))&(((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(esk3_3(X5,X6,X7),X7),X5)))|~(X6=relation_rng(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk4_2(X5,X6)),X5))|~(in(esk4_2(X5,X6),X6)))|X6=relation_rng(X5))|~(relation(X5)))&(((in(esk4_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk4_2(X5,X6)),X5))|X6=relation_rng(X5))|~(relation(X5))))&((((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))|~(X6=relation_rng(X5)))|~(relation(X5)))&(((~(in(X7,X6))|in(ordered_pair(esk3_3(X5,X6,X7),X7),X5))|~(X6=relation_rng(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[61])).
% cnf(63,plain,(in(ordered_pair(esk3_3(X1,X2,X3),X3),X1)|~relation(X1)|X2!=relation_rng(X1)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,plain,(X2=relation_rng(X1)|in(ordered_pair(esk5_2(X1,X2),esk4_2(X1,X2)),X1)|in(esk4_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(67, plain,![X1]:![X2]:![X3]:(~(relation(X3))|((~(in(X1,relation_inverse_image(X3,X2)))|?[X4]:((in(X4,relation_rng(X3))&in(ordered_pair(X1,X4),X3))&in(X4,X2)))&(![X4]:((~(in(X4,relation_rng(X3)))|~(in(ordered_pair(X1,X4),X3)))|~(in(X4,X2)))|in(X1,relation_inverse_image(X3,X2))))),inference(fof_nnf,[status(thm)],[12])).
% fof(68, plain,![X5]:![X6]:![X7]:(~(relation(X7))|((~(in(X5,relation_inverse_image(X7,X6)))|?[X8]:((in(X8,relation_rng(X7))&in(ordered_pair(X5,X8),X7))&in(X8,X6)))&(![X9]:((~(in(X9,relation_rng(X7)))|~(in(ordered_pair(X5,X9),X7)))|~(in(X9,X6)))|in(X5,relation_inverse_image(X7,X6))))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X5]:![X6]:![X7]:(~(relation(X7))|((~(in(X5,relation_inverse_image(X7,X6)))|((in(esk6_3(X5,X6,X7),relation_rng(X7))&in(ordered_pair(X5,esk6_3(X5,X6,X7)),X7))&in(esk6_3(X5,X6,X7),X6)))&(![X9]:((~(in(X9,relation_rng(X7)))|~(in(ordered_pair(X5,X9),X7)))|~(in(X9,X6)))|in(X5,relation_inverse_image(X7,X6))))),inference(skolemize,[status(esa)],[68])).
% fof(70, plain,![X5]:![X6]:![X7]:![X9]:(((((~(in(X9,relation_rng(X7)))|~(in(ordered_pair(X5,X9),X7)))|~(in(X9,X6)))|in(X5,relation_inverse_image(X7,X6)))&(~(in(X5,relation_inverse_image(X7,X6)))|((in(esk6_3(X5,X6,X7),relation_rng(X7))&in(ordered_pair(X5,esk6_3(X5,X6,X7)),X7))&in(esk6_3(X5,X6,X7),X6))))|~(relation(X7))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,![X5]:![X6]:![X7]:![X9]:(((((~(in(X9,relation_rng(X7)))|~(in(ordered_pair(X5,X9),X7)))|~(in(X9,X6)))|in(X5,relation_inverse_image(X7,X6)))|~(relation(X7)))&((((in(esk6_3(X5,X6,X7),relation_rng(X7))|~(in(X5,relation_inverse_image(X7,X6))))|~(relation(X7)))&((in(ordered_pair(X5,esk6_3(X5,X6,X7)),X7)|~(in(X5,relation_inverse_image(X7,X6))))|~(relation(X7))))&((in(esk6_3(X5,X6,X7),X6)|~(in(X5,relation_inverse_image(X7,X6))))|~(relation(X7))))),inference(distribute,[status(thm)],[70])).
% cnf(75,plain,(in(X2,relation_inverse_image(X1,X3))|~relation(X1)|~in(X4,X3)|~in(ordered_pair(X2,X4),X1)|~in(X4,relation_rng(X1))),inference(split_conjunct,[status(thm)],[71])).
% fof(80, plain,![X1]:(~(empty(X1))|(empty(relation_rng(X1))&relation(relation_rng(X1)))),inference(fof_nnf,[status(thm)],[14])).
% fof(81, plain,![X2]:(~(empty(X2))|(empty(relation_rng(X2))&relation(relation_rng(X2)))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X2]:((empty(relation_rng(X2))|~(empty(X2)))&(relation(relation_rng(X2))|~(empty(X2)))),inference(distribute,[status(thm)],[81])).
% cnf(84,plain,(empty(relation_rng(X1))|~empty(X1)),inference(split_conjunct,[status(thm)],[82])).
% cnf(88,plain,(relation(empty_set)),inference(split_conjunct,[status(thm)],[16])).
% cnf(89,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[16])).
% fof(90, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[17])).
% fof(91, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[90])).
% cnf(92,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[91])).
% fof(95, negated_conjecture,?[X1]:?[X2]:(relation(X2)&((~(X1=empty_set)&subset(X1,relation_rng(X2)))&relation_inverse_image(X2,X1)=empty_set)),inference(fof_nnf,[status(thm)],[20])).
% fof(96, negated_conjecture,?[X3]:?[X4]:(relation(X4)&((~(X3=empty_set)&subset(X3,relation_rng(X4)))&relation_inverse_image(X4,X3)=empty_set)),inference(variable_rename,[status(thm)],[95])).
% fof(97, negated_conjecture,(relation(esk9_0)&((~(esk8_0=empty_set)&subset(esk8_0,relation_rng(esk9_0)))&relation_inverse_image(esk9_0,esk8_0)=empty_set)),inference(skolemize,[status(esa)],[96])).
% cnf(98,negated_conjecture,(relation_inverse_image(esk9_0,esk8_0)=empty_set),inference(split_conjunct,[status(thm)],[97])).
% cnf(99,negated_conjecture,(subset(esk8_0,relation_rng(esk9_0))),inference(split_conjunct,[status(thm)],[97])).
% cnf(100,negated_conjecture,(esk8_0!=empty_set),inference(split_conjunct,[status(thm)],[97])).
% cnf(101,negated_conjecture,(relation(esk9_0)),inference(split_conjunct,[status(thm)],[97])).
% cnf(102,plain,(relation_rng(X1)=X2|in(esk4_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk5_2(X1,X2),esk4_2(X1,X2)),singleton(esk5_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[65,27,theory(equality)]),['unfolding']).
% cnf(105,plain,(in(unordered_pair(unordered_pair(esk3_3(X1,X2,X3),X3),singleton(esk3_3(X1,X2,X3))),X1)|relation_rng(X1)!=X2|~relation(X1)|~in(X3,X2)),inference(rw,[status(thm)],[63,27,theory(equality)]),['unfolding']).
% cnf(107,plain,(in(X2,relation_inverse_image(X1,X3))|~relation(X1)|~in(X4,X3)|~in(X4,relation_rng(X1))|~in(unordered_pair(unordered_pair(X2,X4),singleton(X2)),X1)),inference(rw,[status(thm)],[75,27,theory(equality)]),['unfolding']).
% cnf(109,plain,(empty(relation_rng(empty_set))),inference(spm,[status(thm)],[84,89,theory(equality)])).
% cnf(121,negated_conjecture,(in(X1,relation_rng(esk9_0))|~in(X1,esk8_0)),inference(spm,[status(thm)],[57,99,theory(equality)])).
% cnf(136,plain,(relation_rng(X1)=X2|in(esk4_2(X1,X2),X2)|in(unordered_pair(singleton(esk5_2(X1,X2)),unordered_pair(esk4_2(X1,X2),esk5_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[102,46,theory(equality)]),46,theory(equality)])).
% cnf(139,plain,(relation_rng(empty_set)=X1|in(unordered_pair(singleton(esk5_2(empty_set,X1)),unordered_pair(esk4_2(empty_set,X1),esk5_2(empty_set,X1))),empty_set)|in(esk4_2(empty_set,X1),X1)),inference(spm,[status(thm)],[136,88,theory(equality)])).
% cnf(140,plain,(in(unordered_pair(unordered_pair(X3,esk3_3(X1,X2,X3)),singleton(esk3_3(X1,X2,X3))),X1)|relation_rng(X1)!=X2|~relation(X1)|~in(X3,X2)),inference(rw,[status(thm)],[105,46,theory(equality)])).
% cnf(146,plain,(in(X1,relation_inverse_image(X2,X3))|~relation(X2)|~in(unordered_pair(unordered_pair(X4,X1),singleton(X1)),X2)|~in(X4,relation_rng(X2))|~in(X4,X3)),inference(spm,[status(thm)],[107,46,theory(equality)])).
% cnf(158,plain,(empty_set=relation_rng(empty_set)),inference(spm,[status(thm)],[92,109,theory(equality)])).
% cnf(169,negated_conjecture,(in(esk2_2(esk8_0,X1),relation_rng(esk9_0))|subset(esk8_0,X1)),inference(spm,[status(thm)],[121,56,theory(equality)])).
% cnf(192,negated_conjecture,(in(unordered_pair(unordered_pair(esk2_2(esk8_0,X1),esk3_3(X2,relation_rng(esk9_0),esk2_2(esk8_0,X1))),singleton(esk3_3(X2,relation_rng(esk9_0),esk2_2(esk8_0,X1)))),X2)|subset(esk8_0,X1)|relation_rng(X2)!=relation_rng(esk9_0)|~relation(X2)),inference(spm,[status(thm)],[140,169,theory(equality)])).
% cnf(337,plain,(in(X1,relation_inverse_image(X2,X3))|~relation(X2)|~in(unordered_pair(singleton(X1),unordered_pair(X4,X1)),X2)|~in(X4,relation_rng(X2))|~in(X4,X3)),inference(spm,[status(thm)],[146,46,theory(equality)])).
% cnf(451,plain,(empty_set=X1|in(unordered_pair(singleton(esk5_2(empty_set,X1)),unordered_pair(esk4_2(empty_set,X1),esk5_2(empty_set,X1))),empty_set)|in(esk4_2(empty_set,X1),X1)),inference(rw,[status(thm)],[139,158,theory(equality)])).
% cnf(452,plain,(empty_set=X1|in(esk4_2(empty_set,X1),X1)|~empty(empty_set)),inference(spm,[status(thm)],[33,451,theory(equality)])).
% cnf(463,plain,(empty_set=X1|in(esk4_2(empty_set,X1),X1)|$false),inference(rw,[status(thm)],[452,89,theory(equality)])).
% cnf(464,plain,(empty_set=X1|in(esk4_2(empty_set,X1),X1)),inference(cn,[status(thm)],[463,theory(equality)])).
% cnf(514,plain,(empty_set=X1|~in(X1,esk4_2(empty_set,X1))),inference(spm,[status(thm)],[49,464,theory(equality)])).
% cnf(1434,negated_conjecture,(in(unordered_pair(singleton(esk3_3(X2,relation_rng(esk9_0),esk2_2(esk8_0,X1))),unordered_pair(esk2_2(esk8_0,X1),esk3_3(X2,relation_rng(esk9_0),esk2_2(esk8_0,X1)))),X2)|subset(esk8_0,X1)|relation_rng(X2)!=relation_rng(esk9_0)|~relation(X2)),inference(rw,[status(thm)],[192,46,theory(equality)])).
% cnf(1435,negated_conjecture,(subset(esk8_0,X1)|in(unordered_pair(singleton(esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1))),unordered_pair(esk2_2(esk8_0,X1),esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1)))),esk9_0)|~relation(esk9_0)),inference(er,[status(thm)],[1434,theory(equality)])).
% cnf(1436,negated_conjecture,(subset(esk8_0,X1)|in(unordered_pair(singleton(esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1))),unordered_pair(esk2_2(esk8_0,X1),esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1)))),esk9_0)|$false),inference(rw,[status(thm)],[1435,101,theory(equality)])).
% cnf(1437,negated_conjecture,(subset(esk8_0,X1)|in(unordered_pair(singleton(esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1))),unordered_pair(esk2_2(esk8_0,X1),esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1)))),esk9_0)),inference(cn,[status(thm)],[1436,theory(equality)])).
% cnf(26058,negated_conjecture,(in(esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1)),relation_inverse_image(esk9_0,X2))|subset(esk8_0,X1)|~relation(esk9_0)|~in(esk2_2(esk8_0,X1),relation_rng(esk9_0))|~in(esk2_2(esk8_0,X1),X2)),inference(spm,[status(thm)],[337,1437,theory(equality)])).
% cnf(26061,negated_conjecture,(in(esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1)),relation_inverse_image(esk9_0,X2))|subset(esk8_0,X1)|$false|~in(esk2_2(esk8_0,X1),relation_rng(esk9_0))|~in(esk2_2(esk8_0,X1),X2)),inference(rw,[status(thm)],[26058,101,theory(equality)])).
% cnf(26062,negated_conjecture,(in(esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1)),relation_inverse_image(esk9_0,X2))|subset(esk8_0,X1)|~in(esk2_2(esk8_0,X1),relation_rng(esk9_0))|~in(esk2_2(esk8_0,X1),X2)),inference(cn,[status(thm)],[26061,theory(equality)])).
% cnf(34352,negated_conjecture,(subset(esk8_0,X1)|in(esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1)),relation_inverse_image(esk9_0,X2))|~in(esk2_2(esk8_0,X1),X2)),inference(csr,[status(thm)],[26062,169])).
% cnf(34354,negated_conjecture,(subset(esk8_0,X1)|in(esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1)),relation_inverse_image(esk9_0,esk8_0))),inference(spm,[status(thm)],[34352,56,theory(equality)])).
% cnf(34355,negated_conjecture,(subset(esk8_0,X1)|in(esk3_3(esk9_0,relation_rng(esk9_0),esk2_2(esk8_0,X1)),empty_set)),inference(rw,[status(thm)],[34354,98,theory(equality)])).
% cnf(34356,negated_conjecture,(subset(esk8_0,X1)|~empty(empty_set)),inference(spm,[status(thm)],[33,34355,theory(equality)])).
% cnf(34423,negated_conjecture,(subset(esk8_0,X1)|$false),inference(rw,[status(thm)],[34356,89,theory(equality)])).
% cnf(34424,negated_conjecture,(subset(esk8_0,X1)),inference(cn,[status(thm)],[34423,theory(equality)])).
% cnf(34426,negated_conjecture,(in(X1,X2)|~in(X1,esk8_0)),inference(spm,[status(thm)],[57,34424,theory(equality)])).
% cnf(34486,negated_conjecture,(in(esk4_2(empty_set,esk8_0),X1)|empty_set=esk8_0),inference(spm,[status(thm)],[34426,464,theory(equality)])).
% cnf(34528,negated_conjecture,(in(esk4_2(empty_set,esk8_0),X1)),inference(sr,[status(thm)],[34486,100,theory(equality)])).
% cnf(34598,negated_conjecture,(empty_set=esk4_2(empty_set,esk8_0)),inference(spm,[status(thm)],[514,34528,theory(equality)])).
% cnf(34880,negated_conjecture,(in(empty_set,X1)),inference(rw,[status(thm)],[34528,34598,theory(equality)])).
% cnf(35528,negated_conjecture,(~empty(X1)),inference(spm,[status(thm)],[33,34880,theory(equality)])).
% cnf(36155,plain,($false),inference(sr,[status(thm)],[89,35528,theory(equality)])).
% cnf(36156,plain,($false),36155,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 2321
% # ...of these trivial                : 28
% # ...subsumed                        : 962
% # ...remaining for further processing: 1331
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 101
% # Backward-rewritten                 : 231
% # Generated clauses                  : 24293
% # ...of the previous two non-trivial : 19074
% # Contextual simplify-reflections    : 702
% # Paramodulations                    : 24257
% # Factorizations                     : 12
% # Equation resolutions               : 23
% # Current number of processed clauses: 998
% #    Positive orientable unit clauses: 58
% #    Positive unorientable unit clauses: 1
% #    Negative unit clauses           : 10
% #    Non-unit-clauses                : 929
% # Current number of unprocessed clauses: 9185
% # ...number of literals in the above : 32772
% # Clause-clause subsumption calls (NU) : 26720
% # Rec. Clause-clause subsumption calls : 19357
% # Unit Clause-clause subsumption calls : 1270
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 253
% # Indexed BW rewrite successes       : 39
% # Backwards rewriting index:   658 leaves,   2.43+/-3.968 terms/leaf
% # Paramod-from index:          227 leaves,   2.01+/-2.229 terms/leaf
% # Paramod-into index:          501 leaves,   2.20+/-3.081 terms/leaf
% # -------------------------------------------------
% # User time              : 1.260 s
% # System time            : 0.043 s
% # Total time             : 1.303 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.96 CPU 2.06 WC
% FINAL PrfWatch: 1.96 CPU 2.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP25450/SEU210+1.tptp
% 
%------------------------------------------------------------------------------