%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU341+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 03:52:28 EST 2010

% Result   : Theorem 180.29s
% Output   : Solution 180.87s
% 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/SystemOnTPTP22636/SEU341+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~t5_connsp_2:
% ---- 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_connsp_2:
%  CSA axiom dt_m1_connsp_2 found
% Looking for CSA axiom ... existence_l1_pre_topc:
% existence_m1_connsp_2:
%  CSA axiom existence_m1_connsp_2 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_pre_topc:
% existence_m1_subset_1:
%  CSA axiom existence_m1_subset_1 found
% Looking for CSA axiom ... l3_subset_1:
%  CSA axiom l3_subset_1 found
% Looking for CSA axiom ... l71_subset_1:
%  CSA axiom l71_subset_1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_pre_topc:
% rc1_tops_1:
%  CSA axiom rc1_tops_1 found
% Looking for CSA axiom ... t1_subset:
%  CSA axiom t1_subset found
% Looking for CSA axiom ... t3_ordinal1:
%  CSA axiom t3_ordinal1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_pre_topc:
% t4_subset:
% t7_tarski:
%  CSA axiom t7_tarski found
% Looking for CSA axiom ... d1_connsp_2:
%  CSA axiom d1_connsp_2 found
% Looking for CSA axiom ... fc6_tops_1:
%  CSA axiom fc6_tops_1 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_pre_topc:
% t4_subset:
% rc2_tops_1:
%  CSA axiom rc2_tops_1 found
% Looking for CSA axiom ... t51_tops_1:
% d1_tops_2:
%  CSA axiom d1_tops_2 found
% Looking for CSA axiom ... d5_pre_topc:
%  CSA axiom d5_pre_topc found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_pre_topc:
% t4_subset:
% t51_tops_1:
% rc6_pre_topc:
% dt_k1_tops_1:
%  CSA axiom dt_k1_tops_1 found
% Looking for CSA axiom ... dt_k6_pre_topc:
%  CSA axiom dt_k6_pre_topc found
% Looking for CSA axiom ... dt_u1_pre_topc:
%  CSA axiom dt_u1_pre_topc found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_l1_pre_topc:
% t4_subset:
% t51_tops_1:
% rc6_pre_topc:
% t55_tops_1:
%  CSA axiom t55_tops_1 found
% Looking for CSA axiom ... rc7_pre_topc:
%  CSA axiom rc7_pre_topc found
% Looking for CSA axiom ... fc3_tops_1:
%  CSA axiom fc3_tops_1 found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :fc3_tops_1:rc7_pre_topc:t55_tops_1:dt_u1_pre_topc:dt_k6_pre_topc:dt_k1_tops_1:d5_pre_topc:d1_tops_2:rc2_tops_1:fc6_tops_1:d1_connsp_2:t7_tarski:t3_ordinal1:t1_subset:rc1_tops_1:l71_subset_1:l3_subset_1:existence_m1_subset_1:existence_m1_connsp_2:dt_m1_connsp_2:antisymmetry_r2_hidden (21)
% Unselected axioms are ... :existence_l1_pre_topc:t4_subset:t51_tops_1:rc6_pre_topc:fc4_tops_1:s1_xboole_0__e2_37_1_1__pre_topc__1:s3_subset_1__e2_37_1_1__pre_topc:t44_pre_topc:t5_subset:t54_subset_1:fc2_tops_1:t29_tops_1:t30_tops_1:l40_tops_1:d2_tops_2:s1_tarski__e1_40__pre_topc__1:s1_xboole_0__e1_40__pre_topc__1:s3_subset_1__e1_40__pre_topc:d13_pre_topc:s1_tarski__e2_37_1_1__pre_topc__1:rc5_struct_0:rc1_subset_1:rc2_subset_1:t3_subset:t44_tops_1:t48_pre_topc:cc16_membered:d2_subset_1:dt_k3_subset_1:t2_subset:t52_pre_topc:cc2_finset_1:dt_k2_subset_1:dt_k5_setfam_1:dt_k5_subset_1:dt_k6_setfam_1:dt_k6_subset_1:dt_k7_setfam_1:d6_pre_topc:t45_pre_topc:d1_pre_topc:dt_k1_lattices:dt_k2_lattices:dt_k1_pre_topc:dt_k2_pre_topc:s1_tarski__e4_7_2__tops_2__1:t16_tops_2:t17_tops_2:t2_tarski:t46_pre_topc:d10_xboole_0:d1_struct_0:d1_zfmisc_1:existence_l1_lattices:existence_l1_orders_2:existence_l1_struct_0:existence_l2_lattices:existence_l3_lattices:existence_m1_relset_1:existence_m2_relset_1:fc1_struct_0:fc1_subset_1:rc1_xboole_0:rc2_xboole_0:rc3_struct_0:reflexivity_r1_tarski:symmetry_r1_xboole_0:t1_xboole_1:t3_xboole_0:t7_boole:commutativity_k5_subset_1:dt_l1_pre_topc:idempotence_k5_subset_1:involutiveness_k3_subset_1:involutiveness_k7_setfam_1:t13_compts_1:t5_tops_2:cc1_relset_1:d1_tops_1:d8_setfam_1:s1_tarski__e4_7_1__tops_2__1:t50_subset_1:dt_k3_lattices:dt_k4_lattices:d3_tarski:t136_zfmisc_1:t13_tops_2:cc17_membered:dt_k4_relset_1:dt_k5_relset_1:dt_m2_relset_1:s1_xboole_0__e6_22__wellord2:t23_ordinal1:commutativity_k3_lattices:d3_lattices:t10_ordinal1:t26_lattices:commutativity_k4_lattices:d3_compts_1:s1_xboole_0__e6_27__finset_1:d5_subset_1:redefinition_k6_subset_1:d9_orders_2:dt_u1_orders_2:fc2_pre_topc:fc5_pre_topc:d3_pre_topc:d4_xboole_0:d8_lattices:fc13_finset_1:rc3_finset_1:rc4_finset_1:t12_pre_topc:t17_finset_1:s1_tarski__e6_27__finset_1__1:t26_orders_2:t65_zfmisc_1:t15_pre_topc:t22_pre_topc:t23_lattices:antisymmetry_r2_xboole_0:cc1_finset_1:cc1_finsub_1:cc2_finsub_1:commutativity_k2_xboole_0:commutativity_k3_xboole_0:d2_zfmisc_1:fc29_membered:fc30_membered:fc38_membered:idempotence_k2_xboole_0:idempotence_k3_xboole_0:irreflexivity_r2_xboole_0:l55_zfmisc_1:rc1_finset_1:rc1_funct_1:reflexivity_r2_wellord2:s1_tarski__e4_7_2__tops_2__2:s1_xboole_0__e4_7_2__tops_2__1:symmetry_r2_wellord2:t106_zfmisc_1:t18_finset_1:t2_xboole_1:t33_zfmisc_1:cc10_membered:d1_lattices:d2_lattices:l25_zfmisc_1:l28_zfmisc_1:redefinition_k3_lattices:redefinition_k4_lattices:t3_boole:t4_boole:t4_xboole_0:t6_boole:d2_ordinal1:d4_subset_1:l1_zfmisc_1:l2_zfmisc_1:l50_zfmisc_1:redefinition_k5_setfam_1:redefinition_k5_subset_1:s1_funct_1__e4_7_2__tops_2__1:t10_tops_2:t17_pre_topc:t1_boole:t25_orders_2:t2_boole:t31_ordinal1:t37_zfmisc_1:t38_zfmisc_1:t39_xboole_1:t3_xboole_1:t40_xboole_1:t46_setfam_1:t48_xboole_1:t83_xboole_1:t92_zfmisc_1:d1_xboole_0:d8_xboole_0:redefinition_k6_setfam_1:s1_tarski__e4_7_1__tops_2__2:s1_xboole_0__e4_7_1__tops_2__1:t12_xboole_1:t28_xboole_1:t6_zfmisc_1:t9_tarski:d1_enumset1:d1_tarski:d2_tarski:d2_xboole_0:d3_ordinal1:d3_xboole_0:d4_tarski:d5_orders_2:d6_orders_2:d8_pre_topc:fc3_relat_1:s1_tarski__e16_22__wellord2__1:s1_tarski__e4_27_3_1__finset_1__1:s1_tarski__e6_22__wellord2__1:s1_xboole_0__e4_27_3_1__finset_1:t11_tops_2:t12_tops_2:t145_funct_1:t146_funct_1:t24_ordinal1:t43_subset_1:t56_relat_1:t8_boole:t99_zfmisc_1:cc18_membered:cc1_relat_1:d12_funct_1:d13_funct_1:d2_pre_topc:d5_funct_1:d5_ordinal2:d8_funct_1:rc1_relat_1:rc2_relat_1:redefinition_k4_relset_1:redefinition_k5_relset_1:s1_funct_1__e4_7_1__tops_2__1:s2_funct_1__e16_22__wellord2__1:s2_funct_1__e4_7_1__tops_2:s2_funct_1__e4_7_2__tops_2:s2_ordinal1__e18_27__finset_1__1:s3_funct_1__e16_22__wellord2:t22_funct_1:t23_funct_1:t34_funct_1:t70_funct_1:cc20_membered:s1_funct_1__e10_24__wellord2__1:s1_funct_1__e16_22__wellord2__1:t118_zfmisc_1:t119_zfmisc_1:t13_finset_1:t21_funct_1:t63_xboole_1:dt_l1_lattices:dt_l2_lattices:fc4_subset_1:l82_funct_1:s1_relat_1__e6_21__wellord2:s1_tarski__e10_24__wellord2__1:s1_tarski__e16_22__wellord2__2:s1_xboole_0__e16_22__wellord2__1:t33_xboole_1:t36_xboole_1:cc1_funct_1:cc3_membered:cc4_membered:d10_relat_1:d11_relat_1:d12_relat_1:d13_relat_1:d14_relat_1:d1_relat_1:d1_wellord1:d2_relat_1:d3_relat_1:d4_relat_1:d4_relat_2:d5_relat_1:d6_relat_2:d7_relat_1:d8_relat_1:fc10_finset_1:fc11_finset_1:fc12_finset_1:fc1_xboole_0:fc1_zfmisc_1:fc27_membered:fc28_membered:fc31_membered:fc32_membered:fc37_membered:fc39_membered:fc9_finset_1:l3_wellord1:l3_zfmisc_1:redefinition_m2_relset_1:redefinition_r2_wellord2:s1_tarski__e18_27__finset_1__1:s1_xboole_0__e18_27__finset_1__1:t15_finset_1:t16_wellord1:t47_setfam_1:t48_setfam_1:connectedness_r1_ordinal1:d1_funct_1:d1_ordinal1:d2_compts_1:dt_l1_orders_2:fc1_ordinal1:fc2_subset_1:fc2_xboole_0:fc3_subset_1:fc3_xboole_0:l32_xboole_1:l4_zfmisc_1:reflexivity_r1_ordinal1:t144_relat_1:t17_xboole_1:t19_xboole_1:t1_zfmisc_1:t25_relat_1:t26_xboole_1:t28_wellord2:t37_xboole_1:t39_zfmisc_1:t42_ordinal1:t68_funct_1:cc11_membered:cc19_membered:cc2_funct_1:d1_relat_2:d1_setfam_1:d7_xboole_0:d8_relat_2:l23_zfmisc_1:l29_wellord1:l2_wellord1:rc1_partfun1:s1_tarski__e8_6__wellord2__1:s1_xboole_0__e8_6__wellord2__1:t167_relat_1:t16_relset_1:t21_ordinal1:t30_relat_1:t33_ordinal1:t35_funct_1:t41_ordinal1:t44_relat_1:t45_xboole_1:t46_zfmisc_1:t60_relat_1:t60_xboole_1:t7_xboole_1:t86_relat_1:t8_xboole_1:cc1_ordinal1:cc2_ordinal1:d1_relset_1:d4_ordinal1:d6_relat_1:fc1_finset_1:fc3_funct_1:rc1_funct_2:rc1_ordinal1:s1_ordinal2__e18_27__finset_1:s1_tarski__e10_24__wellord2__2:s1_tarski__e6_21__wellord2__1:s1_xboole_0__e10_24__wellord2__1:s1_xboole_0__e6_21__wellord2__1:t46_relat_1:t47_relat_1:t49_wellord1:t54_wellord1:t62_funct_1:t71_relat_1:t8_funct_1:d4_wellord1:d4_wellord2:d6_ordinal1:d9_funct_1:dt_k1_wellord2:dt_k2_wellord1:dt_k4_relat_1:dt_k5_relat_1:dt_k6_relat_1:dt_k7_relat_1:dt_k8_relat_1:fc10_relat_1:fc1_funct_1:fc4_funct_1:fc4_relat_1:fc5_funct_1:fc5_relat_1:fc6_relat_1:fc7_relat_1:fc8_relat_1:fc9_relat_1:rc2_funct_1:rc3_funct_1:rc3_relat_1:redefinition_r1_ordinal1:s1_ordinal1__e8_6__wellord2:t115_relat_1:t147_funct_1:t19_wellord1:t22_wellord1:t23_wellord1:t26_wellord2:t31_wellord1:t32_ordinal1:t32_wellord1:t54_funct_1:t55_funct_1:commutativity_k2_tarski:d1_mcart_1:d2_mcart_1:d6_wellord1:dt_k2_funct_1:fc11_relat_1:fc2_funct_1:fc33_membered:fc34_membered:fc40_membered:l4_wellord1:rc2_partfun1:rc4_funct_1:t10_zfmisc_1:t160_relat_1:t69_enumset1:t72_funct_1:t8_zfmisc_1:t9_zfmisc_1:cc12_membered:d1_finset_1:d4_funct_1:fc1_relat_1:fc2_relat_1:fc6_membered:involutiveness_k4_relat_1:s2_funct_1__e10_24__wellord2:t21_relat_1:t26_finset_1:d14_relat_2:d5_tarski:d9_relat_2:fc1_finsub_1:l1_wellord1:rc2_ordinal1:t143_relat_1:t145_relat_1:t146_relat_1:t14_relset_1:t166_relat_1:t20_relat_1:t22_relset_1:t23_relset_1:t37_relat_1:t64_relat_1:t65_relat_1:t74_relat_1:t7_mcart_1:t90_relat_1:cc15_membered:cc1_membered:cc2_membered:cc3_ordinal1:d1_funct_2:d1_wellord2:d7_wellord1:dt_l3_lattices:fc12_relat_1:fc1_pre_topc:fc2_arytm_3:fc35_membered:fc36_membered:fc41_membered:rc1_membered:rc1_ordinal2:rc3_ordinal1:t117_relat_1:t12_relset_1:t140_relat_1:t178_relat_1:t21_funct_2:t25_wellord2:t2_wellord2:t3_wellord2:t57_funct_1:t5_wellord2:t88_relat_1:cc13_membered:cc3_arytm_3:fc13_relat_1:fc4_ordinal1:rc2_finset_1:t174_relat_1:t20_wellord1:t21_wellord1:t24_wellord1:t25_wellord1:t4_wellord2:t6_wellord2:t7_wellord2:cc1_arytm_3:d12_relat_2:d16_relat_2:d3_wellord1:dt_k2_binop_1:t116_relat_1:t118_relat_1:t39_wellord1:t45_relat_1:t5_wellord1:t6_funct_2:t8_wellord1:t99_relat_1:t9_funct_2:cc14_membered:dt_u1_lattices:dt_u2_lattices:fc2_ordinal1:redefinition_k2_binop_1:t119_relat_1:t17_wellord1:t18_wellord1:t46_funct_2:t94_relat_1:cc2_arytm_3:d2_wellord1:fc1_ordinal2:fc3_ordinal1:rc1_arytm_3:l30_wellord2:t53_wellord1:d5_wellord1:dt_k10_relat_1:dt_k1_binop_1:dt_k1_enumset1:dt_k1_funct_1:dt_k1_mcart_1:dt_k1_ordinal1:dt_k1_relat_1:dt_k1_setfam_1:dt_k1_tarski:dt_k1_wellord1:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_mcart_1:dt_k2_relat_1:dt_k2_tarski:dt_k2_xboole_0:dt_k2_zfmisc_1:dt_k3_relat_1:dt_k3_tarski:dt_k3_xboole_0:dt_k4_tarski:dt_k4_xboole_0:dt_k5_ordinal2:dt_k9_relat_1:dt_l1_struct_0:dt_m1_relset_1:dt_m1_subset_1:dt_u1_struct_0 (551)
% SZS status THM for /tmp/SystemOnTPTP22636/SEU341+2.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP22636/SEU341+2.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 30736
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.02 WC
% # Preprocessing time     : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:((topological_space(X1)&top_str(X1))=>![X2]:(top_str(X2)=>![X3]:(element(X3,powerset(the_carrier(X1)))=>![X4]:(element(X4,powerset(the_carrier(X2)))=>((open_subset(X4,X2)=>interior(X2,X4)=X4)&(interior(X1,X3)=X3=>open_subset(X3,X1))))))),file('/tmp/SRASS.s.p', t55_tops_1)).
% fof(11, axiom,![X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,powerset(the_carrier(X1)))=>(point_neighbourhood(X3,X1,X2)<=>in(X2,interior(X1,X3)))))),file('/tmp/SRASS.s.p', d1_connsp_2)).
% fof(22, conjecture,![X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>((open_subset(X2,X1)&in(X3,X2))=>point_neighbourhood(X2,X1,X3))))),file('/tmp/SRASS.s.p', t5_connsp_2)).
% fof(23, negated_conjecture,~(![X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>((open_subset(X2,X1)&in(X3,X2))=>point_neighbourhood(X2,X1,X3)))))),inference(assume_negation,[status(cth)],[22])).
% fof(25, plain,![X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,powerset(the_carrier(X1)))=>(point_neighbourhood(X3,X1,X2)<=>in(X2,interior(X1,X3)))))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(29, negated_conjecture,~(![X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>((open_subset(X2,X1)&in(X3,X2))=>point_neighbourhood(X2,X1,X3)))))),inference(fof_simplification,[status(thm)],[23,theory(equality)])).
% fof(40, plain,![X1]:((~(topological_space(X1))|~(top_str(X1)))|![X2]:(~(top_str(X2))|![X3]:(~(element(X3,powerset(the_carrier(X1))))|![X4]:(~(element(X4,powerset(the_carrier(X2))))|((~(open_subset(X4,X2))|interior(X2,X4)=X4)&(~(interior(X1,X3)=X3)|open_subset(X3,X1))))))),inference(fof_nnf,[status(thm)],[3])).
% fof(41, plain,![X5]:((~(topological_space(X5))|~(top_str(X5)))|![X6]:(~(top_str(X6))|![X7]:(~(element(X7,powerset(the_carrier(X5))))|![X8]:(~(element(X8,powerset(the_carrier(X6))))|((~(open_subset(X8,X6))|interior(X6,X8)=X8)&(~(interior(X5,X7)=X7)|open_subset(X7,X5))))))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X5]:![X6]:![X7]:![X8]:((((~(element(X8,powerset(the_carrier(X6))))|((~(open_subset(X8,X6))|interior(X6,X8)=X8)&(~(interior(X5,X7)=X7)|open_subset(X7,X5))))|~(element(X7,powerset(the_carrier(X5)))))|~(top_str(X6)))|(~(topological_space(X5))|~(top_str(X5)))),inference(shift_quantors,[status(thm)],[41])).
% fof(43, plain,![X5]:![X6]:![X7]:![X8]:((((((~(open_subset(X8,X6))|interior(X6,X8)=X8)|~(element(X8,powerset(the_carrier(X6)))))|~(element(X7,powerset(the_carrier(X5)))))|~(top_str(X6)))|(~(topological_space(X5))|~(top_str(X5))))&(((((~(interior(X5,X7)=X7)|open_subset(X7,X5))|~(element(X8,powerset(the_carrier(X6)))))|~(element(X7,powerset(the_carrier(X5)))))|~(top_str(X6)))|(~(topological_space(X5))|~(top_str(X5))))),inference(distribute,[status(thm)],[42])).
% cnf(45,plain,(interior(X2,X4)=X4|~top_str(X1)|~topological_space(X1)|~top_str(X2)|~element(X3,powerset(the_carrier(X1)))|~element(X4,powerset(the_carrier(X2)))|~open_subset(X4,X2)),inference(split_conjunct,[status(thm)],[43])).
% fof(80, plain,![X1]:(((empty_carrier(X1)|~(topological_space(X1)))|~(top_str(X1)))|![X2]:(~(element(X2,the_carrier(X1)))|![X3]:(~(element(X3,powerset(the_carrier(X1))))|((~(point_neighbourhood(X3,X1,X2))|in(X2,interior(X1,X3)))&(~(in(X2,interior(X1,X3)))|point_neighbourhood(X3,X1,X2)))))),inference(fof_nnf,[status(thm)],[25])).
% fof(81, plain,![X4]:(((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4)))|![X5]:(~(element(X5,the_carrier(X4)))|![X6]:(~(element(X6,powerset(the_carrier(X4))))|((~(point_neighbourhood(X6,X4,X5))|in(X5,interior(X4,X6)))&(~(in(X5,interior(X4,X6)))|point_neighbourhood(X6,X4,X5)))))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X4]:![X5]:![X6]:(((~(element(X6,powerset(the_carrier(X4))))|((~(point_neighbourhood(X6,X4,X5))|in(X5,interior(X4,X6)))&(~(in(X5,interior(X4,X6)))|point_neighbourhood(X6,X4,X5))))|~(element(X5,the_carrier(X4))))|((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4)))),inference(shift_quantors,[status(thm)],[81])).
% fof(83, plain,![X4]:![X5]:![X6]:(((((~(point_neighbourhood(X6,X4,X5))|in(X5,interior(X4,X6)))|~(element(X6,powerset(the_carrier(X4)))))|~(element(X5,the_carrier(X4))))|((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4))))&((((~(in(X5,interior(X4,X6)))|point_neighbourhood(X6,X4,X5))|~(element(X6,powerset(the_carrier(X4)))))|~(element(X5,the_carrier(X4))))|((empty_carrier(X4)|~(topological_space(X4)))|~(top_str(X4))))),inference(distribute,[status(thm)],[82])).
% cnf(84,plain,(empty_carrier(X1)|point_neighbourhood(X3,X1,X2)|~top_str(X1)|~topological_space(X1)|~element(X2,the_carrier(X1))|~element(X3,powerset(the_carrier(X1)))|~in(X2,interior(X1,X3))),inference(split_conjunct,[status(thm)],[83])).
% fof(129, negated_conjecture,?[X1]:(((~(empty_carrier(X1))&topological_space(X1))&top_str(X1))&?[X2]:(element(X2,powerset(the_carrier(X1)))&?[X3]:(element(X3,the_carrier(X1))&((open_subset(X2,X1)&in(X3,X2))&~(point_neighbourhood(X2,X1,X3)))))),inference(fof_nnf,[status(thm)],[29])).
% fof(130, negated_conjecture,?[X4]:(((~(empty_carrier(X4))&topological_space(X4))&top_str(X4))&?[X5]:(element(X5,powerset(the_carrier(X4)))&?[X6]:(element(X6,the_carrier(X4))&((open_subset(X5,X4)&in(X6,X5))&~(point_neighbourhood(X5,X4,X6)))))),inference(variable_rename,[status(thm)],[129])).
% fof(131, negated_conjecture,(((~(empty_carrier(esk9_0))&topological_space(esk9_0))&top_str(esk9_0))&(element(esk10_0,powerset(the_carrier(esk9_0)))&(element(esk11_0,the_carrier(esk9_0))&((open_subset(esk10_0,esk9_0)&in(esk11_0,esk10_0))&~(point_neighbourhood(esk10_0,esk9_0,esk11_0)))))),inference(skolemize,[status(esa)],[130])).
% cnf(132,negated_conjecture,(~point_neighbourhood(esk10_0,esk9_0,esk11_0)),inference(split_conjunct,[status(thm)],[131])).
% cnf(133,negated_conjecture,(in(esk11_0,esk10_0)),inference(split_conjunct,[status(thm)],[131])).
% cnf(134,negated_conjecture,(open_subset(esk10_0,esk9_0)),inference(split_conjunct,[status(thm)],[131])).
% cnf(135,negated_conjecture,(element(esk11_0,the_carrier(esk9_0))),inference(split_conjunct,[status(thm)],[131])).
% cnf(136,negated_conjecture,(element(esk10_0,powerset(the_carrier(esk9_0)))),inference(split_conjunct,[status(thm)],[131])).
% cnf(137,negated_conjecture,(top_str(esk9_0)),inference(split_conjunct,[status(thm)],[131])).
% cnf(138,negated_conjecture,(topological_space(esk9_0)),inference(split_conjunct,[status(thm)],[131])).
% cnf(139,negated_conjecture,(~empty_carrier(esk9_0)),inference(split_conjunct,[status(thm)],[131])).
% cnf(219,negated_conjecture,(interior(esk9_0,esk10_0)=esk10_0|~open_subset(esk10_0,esk9_0)|~element(X1,powerset(the_carrier(X2)))|~top_str(esk9_0)|~top_str(X2)|~topological_space(X2)),inference(spm,[status(thm)],[45,136,theory(equality)])).
% cnf(224,negated_conjecture,(interior(esk9_0,esk10_0)=esk10_0|$false|~element(X1,powerset(the_carrier(X2)))|~top_str(esk9_0)|~top_str(X2)|~topological_space(X2)),inference(rw,[status(thm)],[219,134,theory(equality)])).
% cnf(225,negated_conjecture,(interior(esk9_0,esk10_0)=esk10_0|$false|~element(X1,powerset(the_carrier(X2)))|$false|~top_str(X2)|~topological_space(X2)),inference(rw,[status(thm)],[224,137,theory(equality)])).
% cnf(226,negated_conjecture,(interior(esk9_0,esk10_0)=esk10_0|~element(X1,powerset(the_carrier(X2)))|~top_str(X2)|~topological_space(X2)),inference(cn,[status(thm)],[225,theory(equality)])).
% cnf(227,negated_conjecture,(point_neighbourhood(X1,esk9_0,esk11_0)|empty_carrier(esk9_0)|~in(esk11_0,interior(esk9_0,X1))|~element(X1,powerset(the_carrier(esk9_0)))|~top_str(esk9_0)|~topological_space(esk9_0)),inference(spm,[status(thm)],[84,135,theory(equality)])).
% cnf(229,negated_conjecture,(point_neighbourhood(X1,esk9_0,esk11_0)|empty_carrier(esk9_0)|~in(esk11_0,interior(esk9_0,X1))|~element(X1,powerset(the_carrier(esk9_0)))|$false|~topological_space(esk9_0)),inference(rw,[status(thm)],[227,137,theory(equality)])).
% cnf(230,negated_conjecture,(point_neighbourhood(X1,esk9_0,esk11_0)|empty_carrier(esk9_0)|~in(esk11_0,interior(esk9_0,X1))|~element(X1,powerset(the_carrier(esk9_0)))|$false|$false),inference(rw,[status(thm)],[229,138,theory(equality)])).
% cnf(231,negated_conjecture,(point_neighbourhood(X1,esk9_0,esk11_0)|empty_carrier(esk9_0)|~in(esk11_0,interior(esk9_0,X1))|~element(X1,powerset(the_carrier(esk9_0)))),inference(cn,[status(thm)],[230,theory(equality)])).
% cnf(232,negated_conjecture,(point_neighbourhood(X1,esk9_0,esk11_0)|~in(esk11_0,interior(esk9_0,X1))|~element(X1,powerset(the_carrier(esk9_0)))),inference(sr,[status(thm)],[231,139,theory(equality)])).
% cnf(4140,negated_conjecture,(interior(esk9_0,esk10_0)=esk10_0|~top_str(esk9_0)|~topological_space(esk9_0)),inference(spm,[status(thm)],[226,136,theory(equality)])).
% cnf(4269,negated_conjecture,(interior(esk9_0,esk10_0)=esk10_0|$false|~topological_space(esk9_0)),inference(rw,[status(thm)],[4140,137,theory(equality)])).
% cnf(4270,negated_conjecture,(interior(esk9_0,esk10_0)=esk10_0|$false|$false),inference(rw,[status(thm)],[4269,138,theory(equality)])).
% cnf(4271,negated_conjecture,(interior(esk9_0,esk10_0)=esk10_0),inference(cn,[status(thm)],[4270,theory(equality)])).
% cnf(4609,negated_conjecture,(point_neighbourhood(esk10_0,esk9_0,esk11_0)|~in(esk11_0,esk10_0)|~element(esk10_0,powerset(the_carrier(esk9_0)))),inference(spm,[status(thm)],[232,4271,theory(equality)])).
% cnf(4710,negated_conjecture,(point_neighbourhood(esk10_0,esk9_0,esk11_0)|$false|~element(esk10_0,powerset(the_carrier(esk9_0)))),inference(rw,[status(thm)],[4609,133,theory(equality)])).
% cnf(4711,negated_conjecture,(point_neighbourhood(esk10_0,esk9_0,esk11_0)|$false|$false),inference(rw,[status(thm)],[4710,136,theory(equality)])).
% cnf(4712,negated_conjecture,(point_neighbourhood(esk10_0,esk9_0,esk11_0)),inference(cn,[status(thm)],[4711,theory(equality)])).
% cnf(4713,negated_conjecture,($false),inference(sr,[status(thm)],[4712,132,theory(equality)])).
% cnf(4714,negated_conjecture,($false),4713,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 529
% # ...of these trivial                : 0
% # ...subsumed                        : 6
% # ...remaining for further processing: 523
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 95
% # Generated clauses                  : 1747
% # ...of the previous two non-trivial : 1677
% # Contextual simplify-reflections    : 11
% # Paramodulations                    : 1747
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 428
% #    Positive orientable unit clauses: 226
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 69
% #    Non-unit-clauses                : 133
% # Current number of unprocessed clauses: 836
% # ...number of literals in the above : 2091
% # Clause-clause subsumption calls (NU) : 421
% # Rec. Clause-clause subsumption calls : 398
% # Unit Clause-clause subsumption calls : 55
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 1280
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:   335 leaves,   1.88+/-1.948 terms/leaf
% # Paramod-from index:          105 leaves,   2.51+/-3.024 terms/leaf
% # Paramod-into index:          288 leaves,   1.93+/-2.052 terms/leaf
% # -------------------------------------------------
% # User time              : 0.086 s
% # System time            : 0.012 s
% # Total time             : 0.098 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.30 WC
% FINAL PrfWatch: 0.25 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP22636/SEU341+2.tptp
% 
%------------------------------------------------------------------------------