%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU266+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 : 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 : Thu Dec 30 02:42:57 EST 2010
% Result : Theorem 1.48s
% Output : Solution 1.48s
% 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/SystemOnTPTP31315/SEU266+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31315/SEU266+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31315/SEU266+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 31411
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)<=>in(X3,X2))=>X1=X2),file('/tmp/SRASS.s.p', t2_tarski)).
% fof(4, 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(7, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)<=>relation_of2(X3,X1,X2)),file('/tmp/SRASS.s.p', redefinition_m2_relset_1)).
% fof(9, axiom,![X1]:?[X2]:element(X2,X1),file('/tmp/SRASS.s.p', existence_m1_subset_1)).
% fof(13, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(14, axiom,![X1]:![X2]:![X3]:(relation_of2(X3,X1,X2)=>relation_rng_as_subset(X1,X2,X3)=relation_rng(X3)),file('/tmp/SRASS.s.p', redefinition_k5_relset_1)).
% fof(15, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(16, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(17, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(ordered_pair(X1,X2),X3)=>(in(X1,relation_dom(X3))&in(X2,relation_rng(X3))))),file('/tmp/SRASS.s.p', t20_relat_1)).
% fof(18, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(19, axiom,![X1]:![X2]:![X3]:((in(X1,X2)&element(X2,powerset(X3)))=>element(X1,X3)),file('/tmp/SRASS.s.p', t4_subset)).
% fof(20, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(21, axiom,![X1]:![X2]:![X3]:(relation_of2(X3,X1,X2)=>element(relation_rng_as_subset(X1,X2,X3),powerset(X2))),file('/tmp/SRASS.s.p', dt_k5_relset_1)).
% fof(22, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)=>element(X3,powerset(cartesian_product2(X1,X2)))),file('/tmp/SRASS.s.p', dt_m2_relset_1)).
% fof(24, axiom,![X1]:![X2]:![X3]:~(((in(X1,X2)&element(X2,powerset(X3)))&empty(X3))),file('/tmp/SRASS.s.p', t5_subset)).
% fof(25, axiom,empty(empty_set),file('/tmp/SRASS.s.p', fc1_xboole_0)).
% fof(27, axiom,![X1]:![X2]:![X3]:(element(X3,powerset(cartesian_product2(X1,X2)))=>relation(X3)),file('/tmp/SRASS.s.p', cc1_relset_1)).
% fof(38, conjecture,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)=>(![X4]:~((in(X4,X2)&![X5]:~(in(ordered_pair(X5,X4),X3))))<=>relation_rng_as_subset(X1,X2,X3)=X2)),file('/tmp/SRASS.s.p', t23_relset_1)).
% fof(39, negated_conjecture,~(![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)=>(![X4]:~((in(X4,X2)&![X5]:~(in(ordered_pair(X5,X4),X3))))<=>relation_rng_as_subset(X1,X2,X3)=X2))),inference(assume_negation,[status(cth)],[38])).
% fof(43, negated_conjecture,~(![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)=>(![X4]:~((in(X4,X2)&![X5]:~(in(ordered_pair(X5,X4),X3))))<=>relation_rng_as_subset(X1,X2,X3)=X2))),inference(fof_simplification,[status(thm)],[39,theory(equality)])).
% fof(50, plain,![X1]:![X2]:(?[X3]:((~(in(X3,X1))|~(in(X3,X2)))&(in(X3,X1)|in(X3,X2)))|X1=X2),inference(fof_nnf,[status(thm)],[3])).
% fof(51, plain,![X4]:![X5]:(?[X6]:((~(in(X6,X4))|~(in(X6,X5)))&(in(X6,X4)|in(X6,X5)))|X4=X5),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:(((~(in(esk2_2(X4,X5),X4))|~(in(esk2_2(X4,X5),X5)))&(in(esk2_2(X4,X5),X4)|in(esk2_2(X4,X5),X5)))|X4=X5),inference(skolemize,[status(esa)],[51])).
% fof(53, plain,![X4]:![X5]:(((~(in(esk2_2(X4,X5),X4))|~(in(esk2_2(X4,X5),X5)))|X4=X5)&((in(esk2_2(X4,X5),X4)|in(esk2_2(X4,X5),X5))|X4=X5)),inference(distribute,[status(thm)],[52])).
% cnf(54,plain,(X1=X2|in(esk2_2(X1,X2),X2)|in(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(X1=X2|~in(esk2_2(X1,X2),X2)|~in(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(56, 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)],[4])).
% fof(57, 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)],[56])).
% fof(58, 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)],[57])).
% fof(59, 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)],[58])).
% fof(60, 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)],[59])).
% cnf(61,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)],[60])).
% fof(70, plain,![X1]:![X2]:![X3]:((~(relation_of2_as_subset(X3,X1,X2))|relation_of2(X3,X1,X2))&(~(relation_of2(X3,X1,X2))|relation_of2_as_subset(X3,X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(71, plain,![X4]:![X5]:![X6]:((~(relation_of2_as_subset(X6,X4,X5))|relation_of2(X6,X4,X5))&(~(relation_of2(X6,X4,X5))|relation_of2_as_subset(X6,X4,X5))),inference(variable_rename,[status(thm)],[70])).
% cnf(73,plain,(relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[71])).
% fof(77, plain,![X3]:?[X4]:element(X4,X3),inference(variable_rename,[status(thm)],[9])).
% fof(78, plain,![X3]:element(esk7_1(X3),X3),inference(skolemize,[status(esa)],[77])).
% cnf(79,plain,(element(esk7_1(X1),X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(89, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(90, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[89])).
% cnf(91,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[90])).
% fof(92, plain,![X1]:![X2]:![X3]:(~(relation_of2(X3,X1,X2))|relation_rng_as_subset(X1,X2,X3)=relation_rng(X3)),inference(fof_nnf,[status(thm)],[14])).
% fof(93, plain,![X4]:![X5]:![X6]:(~(relation_of2(X6,X4,X5))|relation_rng_as_subset(X4,X5,X6)=relation_rng(X6)),inference(variable_rename,[status(thm)],[92])).
% cnf(94,plain,(relation_rng_as_subset(X1,X2,X3)=relation_rng(X3)|~relation_of2(X3,X1,X2)),inference(split_conjunct,[status(thm)],[93])).
% fof(95, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[15])).
% cnf(96,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[95])).
% fof(97, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[16])).
% cnf(98,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[97])).
% fof(99, plain,![X1]:![X2]:![X3]:(~(relation(X3))|(~(in(ordered_pair(X1,X2),X3))|(in(X1,relation_dom(X3))&in(X2,relation_rng(X3))))),inference(fof_nnf,[status(thm)],[17])).
% fof(100, plain,![X4]:![X5]:![X6]:(~(relation(X6))|(~(in(ordered_pair(X4,X5),X6))|(in(X4,relation_dom(X6))&in(X5,relation_rng(X6))))),inference(variable_rename,[status(thm)],[99])).
% fof(101, plain,![X4]:![X5]:![X6]:(((in(X4,relation_dom(X6))|~(in(ordered_pair(X4,X5),X6)))|~(relation(X6)))&((in(X5,relation_rng(X6))|~(in(ordered_pair(X4,X5),X6)))|~(relation(X6)))),inference(distribute,[status(thm)],[100])).
% cnf(102,plain,(in(X3,relation_rng(X1))|~relation(X1)|~in(ordered_pair(X2,X3),X1)),inference(split_conjunct,[status(thm)],[101])).
% fof(104, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(105, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[104])).
% cnf(106,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[105])).
% fof(107, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|element(X1,X3)),inference(fof_nnf,[status(thm)],[19])).
% fof(108, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|element(X4,X6)),inference(variable_rename,[status(thm)],[107])).
% cnf(109,plain,(element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3)),inference(split_conjunct,[status(thm)],[108])).
% fof(110, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[20])).
% fof(111, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[110])).
% cnf(112,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[111])).
% fof(113, plain,![X1]:![X2]:![X3]:(~(relation_of2(X3,X1,X2))|element(relation_rng_as_subset(X1,X2,X3),powerset(X2))),inference(fof_nnf,[status(thm)],[21])).
% fof(114, plain,![X4]:![X5]:![X6]:(~(relation_of2(X6,X4,X5))|element(relation_rng_as_subset(X4,X5,X6),powerset(X5))),inference(variable_rename,[status(thm)],[113])).
% cnf(115,plain,(element(relation_rng_as_subset(X1,X2,X3),powerset(X2))|~relation_of2(X3,X1,X2)),inference(split_conjunct,[status(thm)],[114])).
% fof(116, plain,![X1]:![X2]:![X3]:(~(relation_of2_as_subset(X3,X1,X2))|element(X3,powerset(cartesian_product2(X1,X2)))),inference(fof_nnf,[status(thm)],[22])).
% fof(117, plain,![X4]:![X5]:![X6]:(~(relation_of2_as_subset(X6,X4,X5))|element(X6,powerset(cartesian_product2(X4,X5)))),inference(variable_rename,[status(thm)],[116])).
% cnf(118,plain,(element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[117])).
% fof(121, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|~(empty(X3))),inference(fof_nnf,[status(thm)],[24])).
% fof(122, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|~(empty(X6))),inference(variable_rename,[status(thm)],[121])).
% cnf(123,plain,(~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2)),inference(split_conjunct,[status(thm)],[122])).
% cnf(124,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[25])).
% fof(129, plain,![X1]:![X2]:![X3]:(~(element(X3,powerset(cartesian_product2(X1,X2))))|relation(X3)),inference(fof_nnf,[status(thm)],[27])).
% fof(130, plain,![X4]:![X5]:![X6]:(~(element(X6,powerset(cartesian_product2(X4,X5))))|relation(X6)),inference(variable_rename,[status(thm)],[129])).
% cnf(131,plain,(relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3)))),inference(split_conjunct,[status(thm)],[130])).
% fof(142, negated_conjecture,?[X1]:?[X2]:?[X3]:(relation_of2_as_subset(X3,X1,X2)&((?[X4]:(in(X4,X2)&![X5]:~(in(ordered_pair(X5,X4),X3)))|~(relation_rng_as_subset(X1,X2,X3)=X2))&(![X4]:(~(in(X4,X2))|?[X5]:in(ordered_pair(X5,X4),X3))|relation_rng_as_subset(X1,X2,X3)=X2))),inference(fof_nnf,[status(thm)],[43])).
% fof(143, negated_conjecture,?[X6]:?[X7]:?[X8]:(relation_of2_as_subset(X8,X6,X7)&((?[X9]:(in(X9,X7)&![X10]:~(in(ordered_pair(X10,X9),X8)))|~(relation_rng_as_subset(X6,X7,X8)=X7))&(![X11]:(~(in(X11,X7))|?[X12]:in(ordered_pair(X12,X11),X8))|relation_rng_as_subset(X6,X7,X8)=X7))),inference(variable_rename,[status(thm)],[142])).
% fof(144, negated_conjecture,(relation_of2_as_subset(esk12_0,esk10_0,esk11_0)&(((in(esk13_0,esk11_0)&![X10]:~(in(ordered_pair(X10,esk13_0),esk12_0)))|~(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0))&(![X11]:(~(in(X11,esk11_0))|in(ordered_pair(esk14_1(X11),X11),esk12_0))|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0))),inference(skolemize,[status(esa)],[143])).
% fof(145, negated_conjecture,![X10]:![X11]:((((~(in(X11,esk11_0))|in(ordered_pair(esk14_1(X11),X11),esk12_0))|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0)&((~(in(ordered_pair(X10,esk13_0),esk12_0))&in(esk13_0,esk11_0))|~(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0)))&relation_of2_as_subset(esk12_0,esk10_0,esk11_0)),inference(shift_quantors,[status(thm)],[144])).
% fof(146, negated_conjecture,![X10]:![X11]:((((~(in(X11,esk11_0))|in(ordered_pair(esk14_1(X11),X11),esk12_0))|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0)&((~(in(ordered_pair(X10,esk13_0),esk12_0))|~(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0))&(in(esk13_0,esk11_0)|~(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0))))&relation_of2_as_subset(esk12_0,esk10_0,esk11_0)),inference(distribute,[status(thm)],[145])).
% cnf(147,negated_conjecture,(relation_of2_as_subset(esk12_0,esk10_0,esk11_0)),inference(split_conjunct,[status(thm)],[146])).
% cnf(148,negated_conjecture,(in(esk13_0,esk11_0)|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)!=esk11_0),inference(split_conjunct,[status(thm)],[146])).
% cnf(149,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)!=esk11_0|~in(ordered_pair(X1,esk13_0),esk12_0)),inference(split_conjunct,[status(thm)],[146])).
% cnf(150,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|in(ordered_pair(esk14_1(X1),X1),esk12_0)|~in(X1,esk11_0)),inference(split_conjunct,[status(thm)],[146])).
% cnf(151,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|in(unordered_pair(unordered_pair(esk14_1(X1),X1),singleton(esk14_1(X1))),esk12_0)|~in(X1,esk11_0)),inference(rw,[status(thm)],[150,96,theory(equality)]),['unfolding']).
% cnf(153,plain,(in(X3,relation_rng(X1))|~relation(X1)|~in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),X1)),inference(rw,[status(thm)],[102,96,theory(equality)]),['unfolding']).
% cnf(156,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)],[61,96,theory(equality)]),['unfolding']).
% cnf(159,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)!=esk11_0|~in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk12_0)),inference(rw,[status(thm)],[149,96,theory(equality)]),['unfolding']).
% cnf(168,plain,(empty(X1)|in(esk7_1(X1),X1)),inference(spm,[status(thm)],[106,79,theory(equality)])).
% cnf(173,plain,(~empty(X1)|~in(X2,esk7_1(powerset(X1)))),inference(spm,[status(thm)],[123,79,theory(equality)])).
% cnf(175,negated_conjecture,(in(esk13_0,esk11_0)|relation_rng(esk12_0)!=esk11_0|~relation_of2(esk12_0,esk10_0,esk11_0)),inference(spm,[status(thm)],[148,94,theory(equality)])).
% cnf(176,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)!=esk11_0|~in(unordered_pair(unordered_pair(esk13_0,X1),singleton(X1)),esk12_0)),inference(spm,[status(thm)],[159,98,theory(equality)])).
% cnf(191,plain,(relation(X1)|~relation_of2_as_subset(X1,X2,X3)),inference(spm,[status(thm)],[131,118,theory(equality)])).
% cnf(195,plain,(~empty(X2)|~in(X4,relation_rng_as_subset(X1,X2,X3))|~relation_of2(X3,X1,X2)),inference(spm,[status(thm)],[123,115,theory(equality)])).
% cnf(197,plain,(element(relation_rng(X3),powerset(X2))|~relation_of2(X3,X1,X2)),inference(spm,[status(thm)],[115,94,theory(equality)])).
% cnf(198,plain,(in(X1,relation_rng(X2))|~relation(X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X3)),X2)),inference(spm,[status(thm)],[153,98,theory(equality)])).
% cnf(206,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|in(unordered_pair(unordered_pair(X1,esk14_1(X1)),singleton(esk14_1(X1))),esk12_0)|~in(X1,esk11_0)),inference(rw,[status(thm)],[151,98,theory(equality)])).
% cnf(221,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)],[156,98,theory(equality)])).
% cnf(243,negated_conjecture,(relation(esk12_0)),inference(spm,[status(thm)],[191,147,theory(equality)])).
% cnf(255,plain,(empty(esk7_1(powerset(X1)))|~empty(X1)),inference(spm,[status(thm)],[173,168,theory(equality)])).
% cnf(265,plain,(empty_set=esk7_1(powerset(X1))|~empty(X1)),inference(spm,[status(thm)],[112,255,theory(equality)])).
% cnf(278,plain,(~empty(X1)|~in(X2,empty_set)),inference(spm,[status(thm)],[173,265,theory(equality)])).
% fof(281, plain,(~(epred1_0)<=>![X1]:~(empty(X1))),introduced(definition),['split']).
% cnf(282,plain,(epred1_0|~empty(X1)),inference(split_equiv,[status(thm)],[281])).
% fof(283, plain,(~(epred2_0)<=>![X2]:~(in(X2,empty_set))),introduced(definition),['split']).
% cnf(284,plain,(epred2_0|~in(X2,empty_set)),inference(split_equiv,[status(thm)],[283])).
% cnf(285,plain,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[278,281,theory(equality)]),283,theory(equality)]),['split']).
% cnf(287,plain,(epred1_0),inference(spm,[status(thm)],[282,124,theory(equality)])).
% cnf(289,plain,(~epred2_0|$false),inference(rw,[status(thm)],[285,287,theory(equality)])).
% cnf(290,plain,(~epred2_0),inference(cn,[status(thm)],[289,theory(equality)])).
% cnf(292,negated_conjecture,(in(esk13_0,esk11_0)|relation_rng(esk12_0)!=esk11_0|~relation_of2_as_subset(esk12_0,esk10_0,esk11_0)),inference(spm,[status(thm)],[175,73,theory(equality)])).
% cnf(293,negated_conjecture,(in(esk13_0,esk11_0)|relation_rng(esk12_0)!=esk11_0|$false),inference(rw,[status(thm)],[292,147,theory(equality)])).
% cnf(294,negated_conjecture,(in(esk13_0,esk11_0)|relation_rng(esk12_0)!=esk11_0),inference(cn,[status(thm)],[293,theory(equality)])).
% cnf(295,plain,(~in(X2,empty_set)),inference(sr,[status(thm)],[284,290,theory(equality)])).
% cnf(298,plain,(empty_set=X1|in(esk2_2(empty_set,X1),X1)),inference(spm,[status(thm)],[295,54,theory(equality)])).
% cnf(318,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)!=esk11_0|relation_rng(esk12_0)!=X1|~relation(esk12_0)|~in(esk13_0,X1)),inference(spm,[status(thm)],[176,221,theory(equality)])).
% cnf(320,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)!=esk11_0|relation_rng(esk12_0)!=X1|$false|~in(esk13_0,X1)),inference(rw,[status(thm)],[318,243,theory(equality)])).
% cnf(321,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)!=esk11_0|relation_rng(esk12_0)!=X1|~in(esk13_0,X1)),inference(cn,[status(thm)],[320,theory(equality)])).
% cnf(380,plain,(element(relation_rng(X1),powerset(X2))|~relation_of2_as_subset(X1,X3,X2)),inference(spm,[status(thm)],[197,73,theory(equality)])).
% cnf(422,negated_conjecture,(relation_rng(esk12_0)!=esk11_0|relation_rng(esk12_0)!=X1|~in(esk13_0,X1)|~relation_of2(esk12_0,esk10_0,esk11_0)),inference(spm,[status(thm)],[321,94,theory(equality)])).
% cnf(526,plain,(empty_set=relation_rng_as_subset(X2,X3,X1)|~relation_of2(X1,X2,X3)|~empty(X3)),inference(spm,[status(thm)],[195,298,theory(equality)])).
% cnf(538,plain,(empty_set=relation_rng(X3)|~relation_of2(X3,X1,X2)|~empty(X2)),inference(spm,[status(thm)],[94,526,theory(equality)])).
% cnf(545,plain,(relation_rng(X1)=empty_set|~empty(X3)|~relation_of2_as_subset(X1,X2,X3)),inference(spm,[status(thm)],[538,73,theory(equality)])).
% cnf(546,negated_conjecture,(relation_rng(esk12_0)=empty_set|~empty(esk11_0)),inference(spm,[status(thm)],[545,147,theory(equality)])).
% cnf(550,negated_conjecture,(in(esk13_0,esk11_0)|empty_set!=esk11_0|~empty(esk11_0)),inference(spm,[status(thm)],[294,546,theory(equality)])).
% cnf(553,negated_conjecture,(in(esk13_0,esk11_0)|~empty(esk11_0)),inference(csr,[status(thm)],[550,112])).
% cnf(554,negated_conjecture,(~empty(esk11_0)),inference(csr,[status(thm)],[553,91])).
% cnf(652,negated_conjecture,(in(X1,relation_rng(esk12_0))|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|~relation(esk12_0)|~in(X1,esk11_0)),inference(spm,[status(thm)],[198,206,theory(equality)])).
% cnf(654,negated_conjecture,(in(X1,relation_rng(esk12_0))|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|$false|~in(X1,esk11_0)),inference(rw,[status(thm)],[652,243,theory(equality)])).
% cnf(655,negated_conjecture,(in(X1,relation_rng(esk12_0))|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|~in(X1,esk11_0)),inference(cn,[status(thm)],[654,theory(equality)])).
% cnf(669,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|in(esk2_2(esk11_0,X1),relation_rng(esk12_0))|esk11_0=X1|in(esk2_2(esk11_0,X1),X1)),inference(spm,[status(thm)],[655,54,theory(equality)])).
% cnf(781,negated_conjecture,(element(relation_rng(esk12_0),powerset(esk11_0))),inference(spm,[status(thm)],[380,147,theory(equality)])).
% cnf(800,negated_conjecture,(element(X1,esk11_0)|~in(X1,relation_rng(esk12_0))),inference(spm,[status(thm)],[109,781,theory(equality)])).
% cnf(3011,negated_conjecture,(relation_rng(esk12_0)!=esk11_0|relation_rng(esk12_0)!=X1|~in(esk13_0,X1)|~relation_of2_as_subset(esk12_0,esk10_0,esk11_0)),inference(spm,[status(thm)],[422,73,theory(equality)])).
% cnf(3012,negated_conjecture,(relation_rng(esk12_0)!=esk11_0|relation_rng(esk12_0)!=X1|~in(esk13_0,X1)|$false),inference(rw,[status(thm)],[3011,147,theory(equality)])).
% cnf(3013,negated_conjecture,(relation_rng(esk12_0)!=esk11_0|relation_rng(esk12_0)!=X1|~in(esk13_0,X1)),inference(cn,[status(thm)],[3012,theory(equality)])).
% cnf(7674,negated_conjecture,(element(esk2_2(esk11_0,X1),esk11_0)|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|esk11_0=X1|in(esk2_2(esk11_0,X1),X1)),inference(spm,[status(thm)],[800,669,theory(equality)])).
% cnf(10226,negated_conjecture,(element(esk2_2(esk11_0,relation_rng(esk12_0)),esk11_0)|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|esk11_0=relation_rng(esk12_0)),inference(spm,[status(thm)],[800,7674,theory(equality)])).
% cnf(10248,negated_conjecture,(empty(esk11_0)|in(esk2_2(esk11_0,relation_rng(esk12_0)),esk11_0)|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|relation_rng(esk12_0)=esk11_0),inference(spm,[status(thm)],[106,10226,theory(equality)])).
% cnf(10254,negated_conjecture,(in(esk2_2(esk11_0,relation_rng(esk12_0)),esk11_0)|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|relation_rng(esk12_0)=esk11_0),inference(sr,[status(thm)],[10248,554,theory(equality)])).
% cnf(10269,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|in(esk2_2(esk11_0,relation_rng(esk12_0)),relation_rng(esk12_0))|relation_rng(esk12_0)=esk11_0),inference(spm,[status(thm)],[655,10254,theory(equality)])).
% cnf(10297,negated_conjecture,(esk11_0=relation_rng(esk12_0)|relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|~in(esk2_2(esk11_0,relation_rng(esk12_0)),esk11_0)),inference(spm,[status(thm)],[55,10269,theory(equality)])).
% cnf(10357,negated_conjecture,(relation_rng_as_subset(esk10_0,esk11_0,esk12_0)=esk11_0|relation_rng(esk12_0)=esk11_0),inference(csr,[status(thm)],[10297,10254])).
% cnf(10358,negated_conjecture,(esk11_0=relation_rng(esk12_0)|~relation_of2(esk12_0,esk10_0,esk11_0)),inference(spm,[status(thm)],[94,10357,theory(equality)])).
% cnf(10379,negated_conjecture,(in(esk13_0,esk11_0)|relation_rng(esk12_0)=esk11_0),inference(spm,[status(thm)],[148,10357,theory(equality)])).
% cnf(10383,negated_conjecture,(in(esk13_0,esk11_0)),inference(csr,[status(thm)],[10379,294])).
% cnf(10423,negated_conjecture,(relation_rng(esk12_0)=esk11_0|~relation_of2_as_subset(esk12_0,esk10_0,esk11_0)),inference(spm,[status(thm)],[10358,73,theory(equality)])).
% cnf(10424,negated_conjecture,(relation_rng(esk12_0)=esk11_0|$false),inference(rw,[status(thm)],[10423,147,theory(equality)])).
% cnf(10425,negated_conjecture,(relation_rng(esk12_0)=esk11_0),inference(cn,[status(thm)],[10424,theory(equality)])).
% cnf(10559,negated_conjecture,($false|relation_rng(esk12_0)!=X1|~in(esk13_0,X1)),inference(rw,[status(thm)],[3013,10425,theory(equality)])).
% cnf(10560,negated_conjecture,($false|esk11_0!=X1|~in(esk13_0,X1)),inference(rw,[status(thm)],[10559,10425,theory(equality)])).
% cnf(10561,negated_conjecture,(esk11_0!=X1|~in(esk13_0,X1)),inference(cn,[status(thm)],[10560,theory(equality)])).
% cnf(10621,negated_conjecture,($false),inference(spm,[status(thm)],[10561,10383,theory(equality)])).
% cnf(10622,negated_conjecture,($false),10621,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1587
% # ...of these trivial : 5
% # ...subsumed : 999
% # ...remaining for further processing: 583
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 40
% # Backward-rewritten : 93
% # Generated clauses : 7376
% # ...of the previous two non-trivial : 7147
% # Contextual simplify-reflections : 673
% # Paramodulations : 7329
% # Factorizations : 8
% # Equation resolutions : 30
% # Current number of processed clauses: 447
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 11
% # Non-unit-clauses : 412
% # Current number of unprocessed clauses: 4241
% # ...number of literals in the above : 20055
% # Clause-clause subsumption calls (NU) : 13357
% # Rec. Clause-clause subsumption calls : 8633
% # Unit Clause-clause subsumption calls : 799
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 329 leaves, 1.61+/-1.395 terms/leaf
% # Paramod-from index: 132 leaves, 1.21+/-0.603 terms/leaf
% # Paramod-into index: 307 leaves, 1.52+/-1.249 terms/leaf
% # -------------------------------------------------
% # User time : 0.401 s
% # System time : 0.013 s
% # Total time : 0.414 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.64 CPU 0.74 WC
% FINAL PrfWatch: 0.64 CPU 0.74 WC
% SZS output end Solution for /tmp/SystemOnTPTP31315/SEU266+1.tptp
%
%------------------------------------------------------------------------------