%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU363+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 04:03:11 EST 2010

% Result   : Theorem 209.60s
% Output   : Solution 210.19s
% 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/SystemOnTPTP25405/SEU363+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~t61_yellow_0:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
%  CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... dt_m1_yellow_0:
%  CSA axiom dt_m1_yellow_0 found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_m1_subset_1:
%  CSA axiom existence_m1_subset_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_m1_yellow_0:
%  CSA axiom existence_m1_yellow_0 found
% Looking for CSA axiom ... t1_subset: CSA axiom t1_subset found
% Looking for CSA axiom ... d14_yellow_0:
%  CSA axiom d14_yellow_0 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% d9_orders_2:
%  CSA axiom d9_orders_2 found
% Looking for CSA axiom ... t2_subset:
%  CSA axiom t2_subset found
% Looking for CSA axiom ... t4_subset:
%  CSA axiom t4_subset found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% t8_boole: CSA axiom t8_boole found
% Looking for CSA axiom ... t7_boole:
%  CSA axiom t7_boole found
% Looking for CSA axiom ... existence_l1_struct_0:
%  CSA axiom existence_l1_struct_0 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% existence_m2_relset_1:
%  CSA axiom existence_m2_relset_1 found
% Looking for CSA axiom ... rc1_xboole_0:
%  CSA axiom rc1_xboole_0 found
% Looking for CSA axiom ... rc2_xboole_0:
% t5_subset:
%  CSA axiom t5_subset found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% rc2_xboole_0:
% dt_u1_orders_2:
%  CSA axiom dt_u1_orders_2 found
% Looking for CSA axiom ... dt_l1_orders_2:
%  CSA axiom dt_l1_orders_2 found
% Looking for CSA axiom ... rc3_finset_1:
%  CSA axiom rc3_finset_1 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% rc2_xboole_0:
% rc4_finset_1:
% dt_k2_wellord1:
%  CSA axiom dt_k2_wellord1 found
% Looking for CSA axiom ... existence_m1_relset_1:
%  CSA axiom existence_m1_relset_1 found
% Looking for CSA axiom ... reflexivity_r1_tarski:
%  CSA axiom reflexivity_r1_tarski found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... existence_l1_orders_2:
% rc2_xboole_0:
% rc4_finset_1:
% t106_zfmisc_1:
%  CSA axiom t106_zfmisc_1 found
% Looking for CSA axiom ... cc2_finset_1:
%  CSA axiom cc2_finset_1 found
% Looking for CSA axiom ... t6_boole:
%  CSA axiom t6_boole found
% ---- Iteration 9 (24 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% rc2_xboole_0:
% rc4_finset_1:
% t3_subset:
%  CSA axiom t3_subset found
% Looking for CSA axiom ... redefinition_k1_toler_1:
%  CSA axiom redefinition_k1_toler_1 found
% Looking for CSA axiom ... redefinition_m2_relset_1:
%  CSA axiom redefinition_m2_relset_1 found
% ---- Iteration 10 (27 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% rc2_xboole_0:
% rc4_finset_1:
% cc1_finset_1:
%  CSA axiom cc1_finset_1 found
% Looking for CSA axiom ... cc1_relset_1:
%  CSA axiom cc1_relset_1 found
% Looking for CSA axiom ... dt_m2_relset_1:
%  CSA axiom dt_m2_relset_1 found
% ---- Iteration 11 (30 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_orders_2:
% rc2_xboole_0:
% rc4_finset_1:
% rc1_finset_1:
% dt_k1_toler_1:
%  CSA axiom dt_k1_toler_1 found
% Looking for CSA axiom ... fc1_xboole_0:
% fc14_finset_1:
% t16_wellord1:
%  CSA axiom t16_wellord1 found
% Looking for CSA axiom ... dt_k1_xboole_0:
% dt_k1_zfmisc_1:
% dt_k2_zfmisc_1:
% dt_k4_tarski:
% dt_l1_struct_0:
% dt_m1_relset_1:
% dt_m1_subset_1:
% dt_u1_struct_0:
%  CSA axiom not found
% ---- Iteration 12 (32 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :t16_wellord1:dt_k1_toler_1:dt_m2_relset_1:cc1_relset_1:cc1_finset_1:redefinition_m2_relset_1:redefinition_k1_toler_1:t3_subset:t6_boole:cc2_finset_1:t106_zfmisc_1:reflexivity_r1_tarski:existence_m1_relset_1:dt_k2_wellord1:rc3_finset_1:dt_l1_orders_2:dt_u1_orders_2:t5_subset:rc1_xboole_0:existence_m2_relset_1:existence_l1_struct_0:t7_boole:t8_boole:t4_subset:t2_subset:d9_orders_2:d14_yellow_0:t1_subset:existence_m1_yellow_0:existence_m1_subset_1:dt_m1_yellow_0:antisymmetry_r2_hidden (32)
% Unselected axioms are ... :existence_l1_orders_2:rc2_xboole_0:rc4_finset_1:rc1_finset_1:fc1_xboole_0:fc14_finset_1:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_zfmisc_1:dt_k4_tarski:dt_l1_struct_0:dt_m1_relset_1:dt_m1_subset_1:dt_u1_struct_0 (14)
% SZS status THM for /tmp/SystemOnTPTP25405/SEU363+1.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP25405/SEU363+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 3516
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(X1,relation_restriction(X3,X2))<=>(in(X1,X3)&in(X1,cartesian_product2(X2,X2))))),file('/tmp/SRASS.s.p', t16_wellord1)).
% fof(3, 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(4, axiom,![X1]:![X2]:![X3]:(element(X3,powerset(cartesian_product2(X1,X2)))=>relation(X3)),file('/tmp/SRASS.s.p', cc1_relset_1)).
% fof(7, axiom,![X1]:![X2]:(relation(X1)=>relation_restriction_as_relation_of(X1,X2)=relation_restriction(X1,X2)),file('/tmp/SRASS.s.p', redefinition_k1_toler_1)).
% fof(11, axiom,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', t106_zfmisc_1)).
% fof(17, axiom,![X1]:(rel_str(X1)=>relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))),file('/tmp/SRASS.s.p', dt_u1_orders_2)).
% fof(26, axiom,![X1]:(rel_str(X1)=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>(related(X1,X2,X3)<=>in(ordered_pair(X2,X3),the_InternalRel(X1)))))),file('/tmp/SRASS.s.p', d9_orders_2)).
% fof(27, axiom,![X1]:(rel_str(X1)=>![X2]:(subrelstr(X2,X1)=>(full_subrelstr(X2,X1)<=>the_InternalRel(X2)=relation_restriction_as_relation_of(the_InternalRel(X1),the_carrier(X2))))),file('/tmp/SRASS.s.p', d14_yellow_0)).
% fof(31, axiom,![X1]:(rel_str(X1)=>![X2]:(subrelstr(X2,X1)=>rel_str(X2))),file('/tmp/SRASS.s.p', dt_m1_yellow_0)).
% fof(33, conjecture,![X1]:(rel_str(X1)=>![X2]:((full_subrelstr(X2,X1)&subrelstr(X2,X1))=>![X3]:(element(X3,the_carrier(X1))=>![X4]:(element(X4,the_carrier(X1))=>![X5]:(element(X5,the_carrier(X2))=>![X6]:(element(X6,the_carrier(X2))=>(((((X5=X3&X6=X4)&related(X1,X3,X4))&in(X5,the_carrier(X2)))&in(X6,the_carrier(X2)))=>related(X2,X5,X6)))))))),file('/tmp/SRASS.s.p', t61_yellow_0)).
% fof(34, negated_conjecture,~(![X1]:(rel_str(X1)=>![X2]:((full_subrelstr(X2,X1)&subrelstr(X2,X1))=>![X3]:(element(X3,the_carrier(X1))=>![X4]:(element(X4,the_carrier(X1))=>![X5]:(element(X5,the_carrier(X2))=>![X6]:(element(X6,the_carrier(X2))=>(((((X5=X3&X6=X4)&related(X1,X3,X4))&in(X5,the_carrier(X2)))&in(X6,the_carrier(X2)))=>related(X2,X5,X6))))))))),inference(assume_negation,[status(cth)],[33])).
% fof(37, plain,![X1]:![X2]:![X3]:(~(relation(X3))|((~(in(X1,relation_restriction(X3,X2)))|(in(X1,X3)&in(X1,cartesian_product2(X2,X2))))&((~(in(X1,X3))|~(in(X1,cartesian_product2(X2,X2))))|in(X1,relation_restriction(X3,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(38, plain,![X4]:![X5]:![X6]:(~(relation(X6))|((~(in(X4,relation_restriction(X6,X5)))|(in(X4,X6)&in(X4,cartesian_product2(X5,X5))))&((~(in(X4,X6))|~(in(X4,cartesian_product2(X5,X5))))|in(X4,relation_restriction(X6,X5))))),inference(variable_rename,[status(thm)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:((((in(X4,X6)|~(in(X4,relation_restriction(X6,X5))))|~(relation(X6)))&((in(X4,cartesian_product2(X5,X5))|~(in(X4,relation_restriction(X6,X5))))|~(relation(X6))))&(((~(in(X4,X6))|~(in(X4,cartesian_product2(X5,X5))))|in(X4,relation_restriction(X6,X5)))|~(relation(X6)))),inference(distribute,[status(thm)],[38])).
% cnf(40,plain,(in(X2,relation_restriction(X1,X3))|~relation(X1)|~in(X2,cartesian_product2(X3,X3))|~in(X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(46, plain,![X1]:![X2]:![X3]:(~(relation_of2_as_subset(X3,X1,X2))|element(X3,powerset(cartesian_product2(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(47, plain,![X4]:![X5]:![X6]:(~(relation_of2_as_subset(X6,X4,X5))|element(X6,powerset(cartesian_product2(X4,X5)))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X1]:![X2]:![X3]:(~(element(X3,powerset(cartesian_product2(X1,X2))))|relation(X3)),inference(fof_nnf,[status(thm)],[4])).
% fof(50, plain,![X4]:![X5]:![X6]:(~(element(X6,powerset(cartesian_product2(X4,X5))))|relation(X6)),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3)))),inference(split_conjunct,[status(thm)],[50])).
% fof(59, plain,![X1]:![X2]:(~(relation(X1))|relation_restriction_as_relation_of(X1,X2)=relation_restriction(X1,X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(60, plain,![X3]:![X4]:(~(relation(X3))|relation_restriction_as_relation_of(X3,X4)=relation_restriction(X3,X4)),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(relation_restriction_as_relation_of(X1,X2)=relation_restriction(X1,X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(73, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(in(X1,X3)&in(X2,X4)))&((~(in(X1,X3))|~(in(X2,X4)))|in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))),inference(fof_nnf,[status(thm)],[11])).
% fof(74, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(in(X5,X7)&in(X6,X8)))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(variable_rename,[status(thm)],[73])).
% fof(75, plain,![X5]:![X6]:![X7]:![X8]:(((in(X5,X7)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))))&(in(X6,X8)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(distribute,[status(thm)],[74])).
% cnf(76,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[75])).
% fof(97, plain,![X1]:(~(rel_str(X1))|relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))),inference(fof_nnf,[status(thm)],[17])).
% fof(98, plain,![X2]:(~(rel_str(X2))|relation_of2_as_subset(the_InternalRel(X2),the_carrier(X2),the_carrier(X2))),inference(variable_rename,[status(thm)],[97])).
% cnf(99,plain,(relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))|~rel_str(X1)),inference(split_conjunct,[status(thm)],[98])).
% fof(124, plain,![X1]:(~(rel_str(X1))|![X2]:(~(element(X2,the_carrier(X1)))|![X3]:(~(element(X3,the_carrier(X1)))|((~(related(X1,X2,X3))|in(ordered_pair(X2,X3),the_InternalRel(X1)))&(~(in(ordered_pair(X2,X3),the_InternalRel(X1)))|related(X1,X2,X3)))))),inference(fof_nnf,[status(thm)],[26])).
% fof(125, plain,![X4]:(~(rel_str(X4))|![X5]:(~(element(X5,the_carrier(X4)))|![X6]:(~(element(X6,the_carrier(X4)))|((~(related(X4,X5,X6))|in(ordered_pair(X5,X6),the_InternalRel(X4)))&(~(in(ordered_pair(X5,X6),the_InternalRel(X4)))|related(X4,X5,X6)))))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X4]:![X5]:![X6]:(((~(element(X6,the_carrier(X4)))|((~(related(X4,X5,X6))|in(ordered_pair(X5,X6),the_InternalRel(X4)))&(~(in(ordered_pair(X5,X6),the_InternalRel(X4)))|related(X4,X5,X6))))|~(element(X5,the_carrier(X4))))|~(rel_str(X4))),inference(shift_quantors,[status(thm)],[125])).
% fof(127, plain,![X4]:![X5]:![X6]:(((((~(related(X4,X5,X6))|in(ordered_pair(X5,X6),the_InternalRel(X4)))|~(element(X6,the_carrier(X4))))|~(element(X5,the_carrier(X4))))|~(rel_str(X4)))&((((~(in(ordered_pair(X5,X6),the_InternalRel(X4)))|related(X4,X5,X6))|~(element(X6,the_carrier(X4))))|~(element(X5,the_carrier(X4))))|~(rel_str(X4)))),inference(distribute,[status(thm)],[126])).
% cnf(128,plain,(related(X1,X2,X3)|~rel_str(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))|~in(ordered_pair(X2,X3),the_InternalRel(X1))),inference(split_conjunct,[status(thm)],[127])).
% cnf(129,plain,(in(ordered_pair(X2,X3),the_InternalRel(X1))|~rel_str(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))|~related(X1,X2,X3)),inference(split_conjunct,[status(thm)],[127])).
% fof(130, plain,![X1]:(~(rel_str(X1))|![X2]:(~(subrelstr(X2,X1))|((~(full_subrelstr(X2,X1))|the_InternalRel(X2)=relation_restriction_as_relation_of(the_InternalRel(X1),the_carrier(X2)))&(~(the_InternalRel(X2)=relation_restriction_as_relation_of(the_InternalRel(X1),the_carrier(X2)))|full_subrelstr(X2,X1))))),inference(fof_nnf,[status(thm)],[27])).
% fof(131, plain,![X3]:(~(rel_str(X3))|![X4]:(~(subrelstr(X4,X3))|((~(full_subrelstr(X4,X3))|the_InternalRel(X4)=relation_restriction_as_relation_of(the_InternalRel(X3),the_carrier(X4)))&(~(the_InternalRel(X4)=relation_restriction_as_relation_of(the_InternalRel(X3),the_carrier(X4)))|full_subrelstr(X4,X3))))),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,![X3]:![X4]:((~(subrelstr(X4,X3))|((~(full_subrelstr(X4,X3))|the_InternalRel(X4)=relation_restriction_as_relation_of(the_InternalRel(X3),the_carrier(X4)))&(~(the_InternalRel(X4)=relation_restriction_as_relation_of(the_InternalRel(X3),the_carrier(X4)))|full_subrelstr(X4,X3))))|~(rel_str(X3))),inference(shift_quantors,[status(thm)],[131])).
% fof(133, plain,![X3]:![X4]:((((~(full_subrelstr(X4,X3))|the_InternalRel(X4)=relation_restriction_as_relation_of(the_InternalRel(X3),the_carrier(X4)))|~(subrelstr(X4,X3)))|~(rel_str(X3)))&(((~(the_InternalRel(X4)=relation_restriction_as_relation_of(the_InternalRel(X3),the_carrier(X4)))|full_subrelstr(X4,X3))|~(subrelstr(X4,X3)))|~(rel_str(X3)))),inference(distribute,[status(thm)],[132])).
% cnf(135,plain,(the_InternalRel(X2)=relation_restriction_as_relation_of(the_InternalRel(X1),the_carrier(X2))|~rel_str(X1)|~subrelstr(X2,X1)|~full_subrelstr(X2,X1)),inference(split_conjunct,[status(thm)],[133])).
% fof(146, plain,![X1]:(~(rel_str(X1))|![X2]:(~(subrelstr(X2,X1))|rel_str(X2))),inference(fof_nnf,[status(thm)],[31])).
% fof(147, plain,![X3]:(~(rel_str(X3))|![X4]:(~(subrelstr(X4,X3))|rel_str(X4))),inference(variable_rename,[status(thm)],[146])).
% fof(148, plain,![X3]:![X4]:((~(subrelstr(X4,X3))|rel_str(X4))|~(rel_str(X3))),inference(shift_quantors,[status(thm)],[147])).
% cnf(149,plain,(rel_str(X2)|~rel_str(X1)|~subrelstr(X2,X1)),inference(split_conjunct,[status(thm)],[148])).
% fof(153, negated_conjecture,?[X1]:(rel_str(X1)&?[X2]:((full_subrelstr(X2,X1)&subrelstr(X2,X1))&?[X3]:(element(X3,the_carrier(X1))&?[X4]:(element(X4,the_carrier(X1))&?[X5]:(element(X5,the_carrier(X2))&?[X6]:(element(X6,the_carrier(X2))&(((((X5=X3&X6=X4)&related(X1,X3,X4))&in(X5,the_carrier(X2)))&in(X6,the_carrier(X2)))&~(related(X2,X5,X6))))))))),inference(fof_nnf,[status(thm)],[34])).
% fof(154, negated_conjecture,?[X7]:(rel_str(X7)&?[X8]:((full_subrelstr(X8,X7)&subrelstr(X8,X7))&?[X9]:(element(X9,the_carrier(X7))&?[X10]:(element(X10,the_carrier(X7))&?[X11]:(element(X11,the_carrier(X8))&?[X12]:(element(X12,the_carrier(X8))&(((((X11=X9&X12=X10)&related(X7,X9,X10))&in(X11,the_carrier(X8)))&in(X12,the_carrier(X8)))&~(related(X8,X11,X12))))))))),inference(variable_rename,[status(thm)],[153])).
% fof(155, negated_conjecture,(rel_str(esk8_0)&((full_subrelstr(esk9_0,esk8_0)&subrelstr(esk9_0,esk8_0))&(element(esk10_0,the_carrier(esk8_0))&(element(esk11_0,the_carrier(esk8_0))&(element(esk12_0,the_carrier(esk9_0))&(element(esk13_0,the_carrier(esk9_0))&(((((esk12_0=esk10_0&esk13_0=esk11_0)&related(esk8_0,esk10_0,esk11_0))&in(esk12_0,the_carrier(esk9_0)))&in(esk13_0,the_carrier(esk9_0)))&~(related(esk9_0,esk12_0,esk13_0))))))))),inference(skolemize,[status(esa)],[154])).
% cnf(156,negated_conjecture,(~related(esk9_0,esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[155])).
% cnf(157,negated_conjecture,(in(esk13_0,the_carrier(esk9_0))),inference(split_conjunct,[status(thm)],[155])).
% cnf(158,negated_conjecture,(in(esk12_0,the_carrier(esk9_0))),inference(split_conjunct,[status(thm)],[155])).
% cnf(159,negated_conjecture,(related(esk8_0,esk10_0,esk11_0)),inference(split_conjunct,[status(thm)],[155])).
% cnf(160,negated_conjecture,(esk13_0=esk11_0),inference(split_conjunct,[status(thm)],[155])).
% cnf(161,negated_conjecture,(esk12_0=esk10_0),inference(split_conjunct,[status(thm)],[155])).
% cnf(162,negated_conjecture,(element(esk13_0,the_carrier(esk9_0))),inference(split_conjunct,[status(thm)],[155])).
% cnf(163,negated_conjecture,(element(esk12_0,the_carrier(esk9_0))),inference(split_conjunct,[status(thm)],[155])).
% cnf(164,negated_conjecture,(element(esk11_0,the_carrier(esk8_0))),inference(split_conjunct,[status(thm)],[155])).
% cnf(165,negated_conjecture,(element(esk10_0,the_carrier(esk8_0))),inference(split_conjunct,[status(thm)],[155])).
% cnf(166,negated_conjecture,(subrelstr(esk9_0,esk8_0)),inference(split_conjunct,[status(thm)],[155])).
% cnf(167,negated_conjecture,(full_subrelstr(esk9_0,esk8_0)),inference(split_conjunct,[status(thm)],[155])).
% cnf(168,negated_conjecture,(rel_str(esk8_0)),inference(split_conjunct,[status(thm)],[155])).
% cnf(174,negated_conjecture,(element(esk12_0,the_carrier(esk8_0))),inference(rw,[status(thm)],[165,161,theory(equality)])).
% cnf(175,negated_conjecture,(element(esk13_0,the_carrier(esk8_0))),inference(rw,[status(thm)],[164,160,theory(equality)])).
% cnf(178,negated_conjecture,(rel_str(esk9_0)|~rel_str(esk8_0)),inference(pm,[status(thm)],[149,166,theory(equality)])).
% cnf(179,negated_conjecture,(rel_str(esk9_0)|$false),inference(rw,[status(thm)],[178,168,theory(equality)])).
% cnf(180,negated_conjecture,(rel_str(esk9_0)),inference(cn,[status(thm)],[179,theory(equality)])).
% cnf(181,negated_conjecture,(related(esk8_0,esk12_0,esk13_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[159,161,theory(equality)]),160,theory(equality)])).
% cnf(210,negated_conjecture,(relation_of2_as_subset(the_InternalRel(esk8_0),the_carrier(esk8_0),the_carrier(esk8_0))),inference(pm,[status(thm)],[99,168,theory(equality)])).
% cnf(211,negated_conjecture,(relation_restriction_as_relation_of(the_InternalRel(esk8_0),the_carrier(esk9_0))=the_InternalRel(esk9_0)|~subrelstr(esk9_0,esk8_0)|~rel_str(esk8_0)),inference(pm,[status(thm)],[135,167,theory(equality)])).
% cnf(212,negated_conjecture,(relation_restriction_as_relation_of(the_InternalRel(esk8_0),the_carrier(esk9_0))=the_InternalRel(esk9_0)|$false|~rel_str(esk8_0)),inference(rw,[status(thm)],[211,166,theory(equality)])).
% cnf(213,negated_conjecture,(relation_restriction_as_relation_of(the_InternalRel(esk8_0),the_carrier(esk9_0))=the_InternalRel(esk9_0)|$false|$false),inference(rw,[status(thm)],[212,168,theory(equality)])).
% cnf(214,negated_conjecture,(relation_restriction_as_relation_of(the_InternalRel(esk8_0),the_carrier(esk9_0))=the_InternalRel(esk9_0)),inference(cn,[status(thm)],[213,theory(equality)])).
% cnf(215,negated_conjecture,(in(ordered_pair(X1,esk13_0),cartesian_product2(X2,the_carrier(esk9_0)))|~in(X1,X2)),inference(pm,[status(thm)],[76,157,theory(equality)])).
% cnf(218,negated_conjecture,(in(ordered_pair(X1,esk13_0),the_InternalRel(esk8_0))|~related(esk8_0,X1,esk13_0)|~rel_str(esk8_0)|~element(X1,the_carrier(esk8_0))),inference(pm,[status(thm)],[129,175,theory(equality)])).
% cnf(222,negated_conjecture,(in(ordered_pair(X1,esk13_0),the_InternalRel(esk8_0))|~related(esk8_0,X1,esk13_0)|$false|~element(X1,the_carrier(esk8_0))),inference(rw,[status(thm)],[218,168,theory(equality)])).
% cnf(223,negated_conjecture,(in(ordered_pair(X1,esk13_0),the_InternalRel(esk8_0))|~related(esk8_0,X1,esk13_0)|~element(X1,the_carrier(esk8_0))),inference(cn,[status(thm)],[222,theory(equality)])).
% cnf(352,negated_conjecture,(element(the_InternalRel(esk8_0),powerset(cartesian_product2(the_carrier(esk8_0),the_carrier(esk8_0))))),inference(pm,[status(thm)],[48,210,theory(equality)])).
% cnf(416,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),cartesian_product2(the_carrier(esk9_0),the_carrier(esk9_0)))),inference(pm,[status(thm)],[215,158,theory(equality)])).
% cnf(499,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),the_InternalRel(esk8_0))|~element(esk12_0,the_carrier(esk8_0))),inference(pm,[status(thm)],[223,181,theory(equality)])).
% cnf(500,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),the_InternalRel(esk8_0))|$false),inference(rw,[status(thm)],[499,174,theory(equality)])).
% cnf(501,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),the_InternalRel(esk8_0))),inference(cn,[status(thm)],[500,theory(equality)])).
% cnf(729,negated_conjecture,(relation(the_InternalRel(esk8_0))),inference(pm,[status(thm)],[51,352,theory(equality)])).
% cnf(730,negated_conjecture,(relation_restriction_as_relation_of(the_InternalRel(esk8_0),X1)=relation_restriction(the_InternalRel(esk8_0),X1)),inference(pm,[status(thm)],[61,729,theory(equality)])).
% cnf(742,negated_conjecture,(relation_restriction(the_InternalRel(esk8_0),the_carrier(esk9_0))=the_InternalRel(esk9_0)),inference(rw,[status(thm)],[214,730,theory(equality)])).
% cnf(1016,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),relation_restriction(X1,the_carrier(esk9_0)))|~in(ordered_pair(esk12_0,esk13_0),X1)|~relation(X1)),inference(pm,[status(thm)],[40,416,theory(equality)])).
% cnf(3476,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),relation_restriction(the_InternalRel(esk8_0),the_carrier(esk9_0)))|~relation(the_InternalRel(esk8_0))),inference(pm,[status(thm)],[1016,501,theory(equality)])).
% cnf(3482,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),the_InternalRel(esk9_0))|~relation(the_InternalRel(esk8_0))),inference(rw,[status(thm)],[3476,742,theory(equality)])).
% cnf(3483,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),the_InternalRel(esk9_0))|$false),inference(rw,[status(thm)],[3482,729,theory(equality)])).
% cnf(3484,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),the_InternalRel(esk9_0))),inference(cn,[status(thm)],[3483,theory(equality)])).
% cnf(3515,negated_conjecture,(related(esk9_0,esk12_0,esk13_0)|~rel_str(esk9_0)|~element(esk13_0,the_carrier(esk9_0))|~element(esk12_0,the_carrier(esk9_0))),inference(pm,[status(thm)],[128,3484,theory(equality)])).
% cnf(3521,negated_conjecture,(related(esk9_0,esk12_0,esk13_0)|$false|~element(esk13_0,the_carrier(esk9_0))|~element(esk12_0,the_carrier(esk9_0))),inference(rw,[status(thm)],[3515,180,theory(equality)])).
% cnf(3522,negated_conjecture,(related(esk9_0,esk12_0,esk13_0)|$false|$false|~element(esk12_0,the_carrier(esk9_0))),inference(rw,[status(thm)],[3521,162,theory(equality)])).
% cnf(3523,negated_conjecture,(related(esk9_0,esk12_0,esk13_0)|$false|$false|$false),inference(rw,[status(thm)],[3522,163,theory(equality)])).
% cnf(3524,negated_conjecture,(related(esk9_0,esk12_0,esk13_0)),inference(cn,[status(thm)],[3523,theory(equality)])).
% cnf(3525,negated_conjecture,($false),inference(sr,[status(thm)],[3524,156,theory(equality)])).
% cnf(3526,negated_conjecture,($false),3525,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 716
% # ...of these trivial                : 2
% # ...subsumed                        : 202
% # ...remaining for further processing: 512
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 14
% # Backward-rewritten                 : 19
% # Generated clauses                  : 3028
% # ...of the previous two non-trivial : 2832
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 3024
% # Factorizations                     : 4
% # Equation resolutions               : 0
% # Current number of processed clauses: 479
% #    Positive orientable unit clauses: 160
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 18
% #    Non-unit-clauses                : 301
% # Current number of unprocessed clauses: 2117
% # ...number of literals in the above : 7022
% # Clause-clause subsumption calls (NU) : 1651
% # Rec. Clause-clause subsumption calls : 1299
% # Unit Clause-clause subsumption calls : 106
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 169
% # Indexed BW rewrite successes       : 10
% # Backwards rewriting index:   429 leaves,   1.47+/-1.222 terms/leaf
% # Paramod-from index:          171 leaves,   1.36+/-1.305 terms/leaf
% # Paramod-into index:          361 leaves,   1.44+/-1.197 terms/leaf
% # -------------------------------------------------
% # User time              : 0.122 s
% # System time            : 0.005 s
% # Total time             : 0.127 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.34 WC
% FINAL PrfWatch: 0.25 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP25405/SEU363+1.tptp
% 
%------------------------------------------------------------------------------