%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU317+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 : 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 03:29:56 EST 2010

% Result   : Theorem 106.26s
% Output   : Solution 106.75s
% 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/SystemOnTPTP8203/SEU317+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~t48_pre_topc:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... dt_k6_pre_topc: CSA axiom dt_k6_pre_topc found
% Looking for CSA axiom ... existence_l1_pre_topc:
% existence_m1_subset_1:
%  CSA axiom existence_m1_subset_1 found
% Looking for CSA axiom ... reflexivity_r1_tarski:
%  CSA axiom reflexivity_r1_tarski 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:
% t1_xboole_1:
%  CSA axiom t1_xboole_1 found
% Looking for CSA axiom ... t3_subset:
%  CSA axiom t3_subset found
% Looking for CSA axiom ... dt_u1_pre_topc: CSA axiom dt_u1_pre_topc 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:
% t45_pre_topc:
%  CSA axiom t45_pre_topc 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 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :l71_subset_1:l3_subset_1:t45_pre_topc:dt_u1_pre_topc:t3_subset:t1_xboole_1:reflexivity_r1_tarski:existence_m1_subset_1:dt_k6_pre_topc (9)
% Unselected axioms are ... :existence_l1_pre_topc:t4_subset:rc1_subset_1:rc2_subset_1:cc16_membered:rc6_pre_topc:cc2_finset_1:dt_k2_subset_1:dt_k3_subset_1:dt_k5_setfam_1:dt_k5_subset_1:dt_k6_setfam_1:dt_k6_subset_1:dt_k7_setfam_1:d13_pre_topc:d10_xboole_0:d5_pre_topc:dt_k1_pre_topc:dt_k2_pre_topc:s1_tarski__e1_40__pre_topc__1:s1_xboole_0__e1_40__pre_topc__1:s3_subset_1__e1_40__pre_topc:d1_zfmisc_1:t43_subset_1:t46_pre_topc:d3_tarski:t1_subset:commutativity_k5_subset_1:idempotence_k5_subset_1:involutiveness_k3_subset_1:involutiveness_k7_setfam_1:t5_subset:antisymmetry_r2_hidden:antisymmetry_r2_xboole_0:cc1_relset_1:dt_l1_pre_topc:existence_l1_struct_0:existence_m1_relset_1:existence_m2_relset_1:irreflexivity_r2_xboole_0:rc1_xboole_0:rc2_xboole_0:s1_xboole_0__e2_37_1_1__pre_topc__1:s3_subset_1__e2_37_1_1__pre_topc:symmetry_r1_xboole_0:t136_zfmisc_1:t2_tarski:t3_ordinal1:t3_xboole_0:t54_subset_1:t7_tarski:fc1_subset_1:t44_pre_topc:d1_pre_topc:rc5_struct_0:t2_xboole_1:d6_pre_topc:rc3_finset_1:t118_zfmisc_1:t119_zfmisc_1:t17_xboole_1:t19_xboole_1:t26_xboole_1:t33_xboole_1:t36_xboole_1:cc17_membered:dt_k4_relset_1:dt_k5_relset_1:dt_m2_relset_1:s1_tarski__e2_37_1_1__pre_topc__1:t13_finset_1:t16_relset_1:t60_xboole_1:t63_xboole_1:t7_xboole_1:t8_xboole_1:t18_finset_1:t15_pre_topc:t22_pre_topc:d3_pre_topc:t12_pre_topc:dt_k1_lattices:dt_k2_lattices:fc5_pre_topc:d1_setfam_1:d2_subset_1:t2_subset:t117_relat_1:t178_relat_1:t88_relat_1:cc1_finsub_1:cc2_finsub_1:existence_l1_lattices:existence_l2_lattices:fc1_finset_1:fc29_membered:fc30_membered:fc38_membered:reflexivity_r2_wellord2:s1_xboole_0__e6_22__wellord2:symmetry_r2_wellord2:t14_relset_1:t23_ordinal1:cc10_membered:d1_relset_1:l25_zfmisc_1:l28_zfmisc_1:t17_pre_topc:t46_setfam_1:t4_xboole_0:d2_ordinal1:d4_subset_1:d5_subset_1:fc13_relat_1:l2_zfmisc_1:redefinition_k5_setfam_1:redefinition_k5_subset_1:redefinition_k6_setfam_1:redefinition_k6_subset_1:t31_ordinal1:t32_ordinal1:t37_zfmisc_1:t3_xboole_1:t50_subset_1:t83_xboole_1:commutativity_k2_xboole_0:commutativity_k3_xboole_0:d1_xboole_0:d8_setfam_1:d8_xboole_0:fc2_relat_1:idempotence_k2_xboole_0:idempotence_k3_xboole_0:l50_zfmisc_1:s1_tarski__e6_22__wellord2__1:t12_xboole_1:t24_ordinal1:t28_xboole_1:t38_zfmisc_1:t6_zfmisc_1:t92_zfmisc_1:t99_zfmisc_1:t9_tarski:cc18_membered:d1_tarski:d2_tarski:d2_xboole_0:d3_ordinal1:d3_xboole_0:d4_tarski:d4_xboole_0:fc1_relat_1:fc3_relat_1:s1_tarski__e16_22__wellord2__1:s1_xboole_0__e6_27__finset_1:s2_ordinal1__e18_27__finset_1__1:t56_relat_1:t8_boole:cc1_relat_1:d12_funct_1:d1_enumset1:d2_pre_topc:rc1_relat_1:rc2_relat_1:redefinition_k4_relset_1:redefinition_k5_relset_1:t7_boole:cc20_membered:cc1_finset_1:d5_ordinal2:fc2_ordinal1:fc4_subset_1:l32_xboole_1:l4_zfmisc_1:rc1_finset_1:t145_relat_1:t146_relat_1:t37_xboole_1:t39_zfmisc_1:t45_xboole_1:t65_zfmisc_1:cc1_funct_1:cc1_ordinal1:cc2_ordinal1:cc3_membered:cc4_membered:connectedness_r1_ordinal1:d3_relat_1:d4_ordinal1:d8_lattices:dt_l1_lattices:dt_l2_lattices:existence_l3_lattices:fc10_finset_1:fc11_finset_1:fc12_finset_1:fc1_struct_0:fc1_xboole_0:fc1_zfmisc_1:fc27_membered:fc28_membered:fc31_membered:fc32_membered:fc37_membered:fc39_membered:fc9_finset_1:l29_wellord1:l82_funct_1:rc1_ordinal1:rc3_struct_0:redefinition_m2_relset_1:redefinition_r2_wellord2:reflexivity_r1_ordinal1:s1_tarski__e18_27__finset_1__1:s1_xboole_0__e18_27__finset_1__1:t115_relat_1:t116_relat_1:t118_relat_1:t12_relset_1:t140_relat_1:t144_relat_1:t15_finset_1:t167_relat_1:t16_wellord1:t25_relat_1:t44_relat_1:t45_relat_1:t99_relat_1:cc11_membered:cc19_membered:d1_ordinal1:dt_k3_lattices:dt_k4_lattices:fc13_finset_1:fc1_ordinal1:fc2_subset_1:fc2_xboole_0:fc3_subset_1:fc3_xboole_0:l3_zfmisc_1:s1_tarski__e4_27_3_1__finset_1__1:s1_xboole_0__e4_27_3_1__finset_1:t174_relat_1:t17_finset_1:t19_wellord1:t1_zfmisc_1:t20_wellord1:t21_wellord1:t33_ordinal1:t41_ordinal1:t42_ordinal1:d1_relat_1:d1_relat_2:d2_relat_1:d3_wellord1:d7_xboole_0:d8_relat_2:l23_zfmisc_1:l2_wellord1:s1_tarski__e6_27__finset_1__1:s1_tarski__e8_6__wellord2__1:s1_xboole_0__e8_6__wellord2__1:t30_relat_1:t46_zfmisc_1:t60_relat_1:t86_relat_1:t9_funct_2:d13_funct_1:d5_funct_1:d8_funct_1:rc1_funct_1:s1_ordinal2__e18_27__finset_1:s2_funct_1__e16_22__wellord2__1:s3_funct_1__e16_22__wellord2:t22_funct_1:t23_funct_1:t34_funct_1:t70_funct_1:t8_funct_1:commutativity_k3_lattices:commutativity_k4_lattices:d1_funct_1:d2_zfmisc_1:d3_lattices:d6_ordinal1:fc4_relat_1:fc5_relat_1:fc6_relat_1:fc7_relat_1:fc8_relat_1:l1_zfmisc_1:rc2_funct_1:redefinition_r1_ordinal1:s1_ordinal1__e8_6__wellord2:s1_tarski__e10_24__wellord2__1:t10_ordinal1:t21_funct_1:t21_relat_1:t22_wellord1:t23_wellord1:t24_wellord1:t25_wellord1:t26_lattices:t2_boole:t31_wellord1:t32_wellord1:t39_xboole_1:t3_boole:t40_xboole_1:t46_funct_2:t48_xboole_1:t4_boole:t6_boole:t6_funct_2:cc12_membered:cc2_arytm_3:commutativity_k2_tarski:d11_relat_1:d12_relat_1:d13_relat_1:d14_relat_1:d1_mcart_1:d2_mcart_1:d2_wellord1:d4_relat_1:d5_relat_1:d6_wellord1:d8_relat_1:dt_k1_wellord2:dt_k2_funct_1: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:fc11_relat_1:fc1_funct_1:fc2_funct_1:fc33_membered:fc34_membered:fc40_membered:fc4_funct_1:fc5_funct_1:fc9_relat_1:rc1_arytm_3:rc3_funct_1:rc3_relat_1:rc4_funct_1:t10_zfmisc_1:t119_relat_1:t1_boole:t23_lattices:t26_wellord2:t33_zfmisc_1:t35_funct_1:t47_setfam_1:t48_setfam_1:t69_enumset1:t72_funct_1:t8_zfmisc_1:t9_zfmisc_1:cc3_ordinal1:d10_relat_1:d1_finset_1:d1_lattices:d1_wellord1:d1_wellord2:d2_lattices:d4_funct_1:d4_relat_2:d6_relat_2:d7_relat_1:fc4_ordinal1:fc6_membered:involutiveness_k4_relat_1:l3_wellord1:l55_zfmisc_1:rc2_partfun1:rc3_ordinal1:redefinition_k3_lattices:redefinition_k4_lattices:s2_funct_1__e10_24__wellord2:t106_zfmisc_1:t145_funct_1:t146_funct_1:t17_wellord1:t18_wellord1:t21_funct_2:t26_finset_1:t28_wellord2:t64_relat_1:t65_relat_1:t68_funct_1:t94_relat_1:fc1_finsub_1:l1_wellord1:rc2_finset_1:s1_relat_1__e6_21__wellord2:s1_tarski__e16_22__wellord2__2:s1_xboole_0__e16_22__wellord2__1:t143_relat_1:t147_funct_1:t160_relat_1:t166_relat_1:t20_relat_1:t22_relset_1:t23_relset_1:t37_relat_1:t46_relat_1:t47_relat_1:t71_relat_1:t74_relat_1:t90_relat_1:cc15_membered:cc1_membered:cc2_funct_1:cc2_membered:d1_funct_2:d4_wellord2:dt_l3_lattices:fc12_relat_1:fc1_pre_topc:fc2_arytm_3:fc35_membered:fc36_membered:fc41_membered:rc1_membered:rc1_ordinal2:rc1_partfun1:s1_tarski__e6_21__wellord2__1:s1_xboole_0__e6_21__wellord2__1:t2_wellord2:t3_wellord2:t54_funct_1:t55_funct_1:t5_wellord2:cc13_membered:cc1_arytm_3:cc3_arytm_3:d5_tarski:d6_relat_1:l4_wellord1:s1_funct_1__e10_24__wellord2__1:s1_funct_1__e16_22__wellord2__1:s1_tarski__e10_24__wellord2__2:s1_xboole_0__e10_24__wellord2__1:t21_ordinal1:d12_relat_2:d14_relat_2:d16_relat_2:d9_relat_2:fc3_funct_1:rc1_funct_2:t49_wellord1:t54_wellord1:t57_funct_1:t5_wellord1:t62_funct_1:t8_wellord1:cc14_membered:d9_funct_1:dt_k2_binop_1:dt_u1_lattices:dt_u2_lattices:rc2_ordinal1:t25_wellord2:t39_wellord1:t7_mcart_1:d7_wellord1:fc1_ordinal2:fc3_ordinal1:l30_wellord2:redefinition_k2_binop_1:t4_wellord2:t6_wellord2:t7_wellord2:t53_wellord1:d4_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 (509)
% SZS status THM for /tmp/SystemOnTPTP8203/SEU317+2.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP8203/SEU317+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 10464
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)=>in(X3,X2))=>element(X1,powerset(X2))),file('/tmp/SRASS.s.p', l71_subset_1)).
% fof(2, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>![X3]:(in(X3,X2)=>in(X3,X1))),file('/tmp/SRASS.s.p', l3_subset_1)).
% fof(3, axiom,![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(in(X3,the_carrier(X1))=>(in(X3,topstr_closure(X1,X2))<=>![X4]:(element(X4,powerset(the_carrier(X1)))=>((closed_subset(X4,X1)&subset(X2,X4))=>in(X3,X4))))))),file('/tmp/SRASS.s.p', t45_pre_topc)).
% fof(5, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(10, conjecture,![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset(X2,topstr_closure(X1,X2)))),file('/tmp/SRASS.s.p', t48_pre_topc)).
% fof(11, negated_conjecture,~(![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset(X2,topstr_closure(X1,X2))))),inference(assume_negation,[status(cth)],[10])).
% fof(12, plain,![X1]:![X2]:(?[X3]:(in(X3,X1)&~(in(X3,X2)))|element(X1,powerset(X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(13, plain,![X4]:![X5]:(?[X6]:(in(X6,X4)&~(in(X6,X5)))|element(X4,powerset(X5))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X4]:![X5]:((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|element(X4,powerset(X5))),inference(skolemize,[status(esa)],[13])).
% fof(15, plain,![X4]:![X5]:((in(esk1_2(X4,X5),X4)|element(X4,powerset(X5)))&(~(in(esk1_2(X4,X5),X5))|element(X4,powerset(X5)))),inference(distribute,[status(thm)],[14])).
% cnf(16,plain,(element(X1,powerset(X2))|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[15])).
% cnf(17,plain,(element(X1,powerset(X2))|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(18, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|![X3]:(~(in(X3,X2))|in(X3,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(19, plain,![X4]:![X5]:(~(element(X5,powerset(X4)))|![X6]:(~(in(X6,X5))|in(X6,X4))),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:((~(in(X6,X5))|in(X6,X4))|~(element(X5,powerset(X4)))),inference(shift_quantors,[status(thm)],[19])).
% cnf(21,plain,(in(X3,X2)|~element(X1,powerset(X2))|~in(X3,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X1]:(~(top_str(X1))|![X2]:(~(element(X2,powerset(the_carrier(X1))))|![X3]:(~(in(X3,the_carrier(X1)))|((~(in(X3,topstr_closure(X1,X2)))|![X4]:(~(element(X4,powerset(the_carrier(X1))))|((~(closed_subset(X4,X1))|~(subset(X2,X4)))|in(X3,X4))))&(?[X4]:(element(X4,powerset(the_carrier(X1)))&((closed_subset(X4,X1)&subset(X2,X4))&~(in(X3,X4))))|in(X3,topstr_closure(X1,X2))))))),inference(fof_nnf,[status(thm)],[3])).
% fof(23, plain,![X5]:(~(top_str(X5))|![X6]:(~(element(X6,powerset(the_carrier(X5))))|![X7]:(~(in(X7,the_carrier(X5)))|((~(in(X7,topstr_closure(X5,X6)))|![X8]:(~(element(X8,powerset(the_carrier(X5))))|((~(closed_subset(X8,X5))|~(subset(X6,X8)))|in(X7,X8))))&(?[X9]:(element(X9,powerset(the_carrier(X5)))&((closed_subset(X9,X5)&subset(X6,X9))&~(in(X7,X9))))|in(X7,topstr_closure(X5,X6))))))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X5]:(~(top_str(X5))|![X6]:(~(element(X6,powerset(the_carrier(X5))))|![X7]:(~(in(X7,the_carrier(X5)))|((~(in(X7,topstr_closure(X5,X6)))|![X8]:(~(element(X8,powerset(the_carrier(X5))))|((~(closed_subset(X8,X5))|~(subset(X6,X8)))|in(X7,X8))))&((element(esk2_3(X5,X6,X7),powerset(the_carrier(X5)))&((closed_subset(esk2_3(X5,X6,X7),X5)&subset(X6,esk2_3(X5,X6,X7)))&~(in(X7,esk2_3(X5,X6,X7)))))|in(X7,topstr_closure(X5,X6))))))),inference(skolemize,[status(esa)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:![X8]:((((((~(element(X8,powerset(the_carrier(X5))))|((~(closed_subset(X8,X5))|~(subset(X6,X8)))|in(X7,X8)))|~(in(X7,topstr_closure(X5,X6))))&((element(esk2_3(X5,X6,X7),powerset(the_carrier(X5)))&((closed_subset(esk2_3(X5,X6,X7),X5)&subset(X6,esk2_3(X5,X6,X7)))&~(in(X7,esk2_3(X5,X6,X7)))))|in(X7,topstr_closure(X5,X6))))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5))),inference(shift_quantors,[status(thm)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:![X8]:((((((~(element(X8,powerset(the_carrier(X5))))|((~(closed_subset(X8,X5))|~(subset(X6,X8)))|in(X7,X8)))|~(in(X7,topstr_closure(X5,X6))))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5)))&(((((element(esk2_3(X5,X6,X7),powerset(the_carrier(X5)))|in(X7,topstr_closure(X5,X6)))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5)))&((((((closed_subset(esk2_3(X5,X6,X7),X5)|in(X7,topstr_closure(X5,X6)))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5)))&((((subset(X6,esk2_3(X5,X6,X7))|in(X7,topstr_closure(X5,X6)))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5))))&((((~(in(X7,esk2_3(X5,X6,X7)))|in(X7,topstr_closure(X5,X6)))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5)))))),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(in(X3,topstr_closure(X1,X2))|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))|~in(X3,the_carrier(X1))|~in(X3,esk2_3(X1,X2,X3))),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(in(X3,topstr_closure(X1,X2))|subset(X2,esk2_3(X1,X2,X3))|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))|~in(X3,the_carrier(X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(35, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(36, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(element(X1,powerset(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(subset(X1,X2)|~element(X1,powerset(X2))),inference(split_conjunct,[status(thm)],[36])).
% fof(50, negated_conjecture,?[X1]:(top_str(X1)&?[X2]:(element(X2,powerset(the_carrier(X1)))&~(subset(X2,topstr_closure(X1,X2))))),inference(fof_nnf,[status(thm)],[11])).
% fof(51, negated_conjecture,?[X3]:(top_str(X3)&?[X4]:(element(X4,powerset(the_carrier(X3)))&~(subset(X4,topstr_closure(X3,X4))))),inference(variable_rename,[status(thm)],[50])).
% fof(52, negated_conjecture,(top_str(esk4_0)&(element(esk5_0,powerset(the_carrier(esk4_0)))&~(subset(esk5_0,topstr_closure(esk4_0,esk5_0))))),inference(skolemize,[status(esa)],[51])).
% cnf(53,negated_conjecture,(~subset(esk5_0,topstr_closure(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,negated_conjecture,(element(esk5_0,powerset(the_carrier(esk4_0)))),inference(split_conjunct,[status(thm)],[52])).
% cnf(55,negated_conjecture,(top_str(esk4_0)),inference(split_conjunct,[status(thm)],[52])).
% cnf(57,negated_conjecture,(~element(esk5_0,powerset(topstr_closure(esk4_0,esk5_0)))),inference(spm,[status(thm)],[53,38,theory(equality)])).
% cnf(66,plain,(element(X1,powerset(esk2_3(X2,X1,X3)))|in(X3,topstr_closure(X2,X1))|~top_str(X2)|~element(X1,powerset(the_carrier(X2)))|~in(X3,the_carrier(X2))),inference(spm,[status(thm)],[37,28,theory(equality)])).
% cnf(129,plain,(in(X1,esk2_3(X2,X3,X4))|in(X4,topstr_closure(X2,X3))|~in(X1,X3)|~top_str(X2)|~element(X3,powerset(the_carrier(X2)))|~in(X4,the_carrier(X2))),inference(spm,[status(thm)],[21,66,theory(equality)])).
% cnf(439,plain,(in(X1,topstr_closure(X2,X3))|~top_str(X2)|~element(X3,powerset(the_carrier(X2)))|~in(X1,the_carrier(X2))|~in(X1,X3)),inference(spm,[status(thm)],[27,129,theory(equality)])).
% cnf(969,plain,(in(X1,topstr_closure(X2,X3))|~top_str(X2)|~element(X3,powerset(the_carrier(X2)))|~in(X1,X3)),inference(csr,[status(thm)],[439,21])).
% cnf(970,plain,(element(X1,powerset(topstr_closure(X2,X3)))|~top_str(X2)|~element(X3,powerset(the_carrier(X2)))|~in(esk1_2(X1,topstr_closure(X2,X3)),X3)),inference(spm,[status(thm)],[16,969,theory(equality)])).
% cnf(1010,plain,(element(X1,powerset(topstr_closure(X2,X1)))|~top_str(X2)|~element(X1,powerset(the_carrier(X2)))),inference(spm,[status(thm)],[970,17,theory(equality)])).
% cnf(1011,negated_conjecture,(~top_str(esk4_0)|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(spm,[status(thm)],[57,1010,theory(equality)])).
% cnf(1016,negated_conjecture,($false|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(rw,[status(thm)],[1011,55,theory(equality)])).
% cnf(1017,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1016,54,theory(equality)])).
% cnf(1018,negated_conjecture,($false),inference(cn,[status(thm)],[1017,theory(equality)])).
% cnf(1019,negated_conjecture,($false),1018,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 374
% # ...of these trivial                : 41
% # ...subsumed                        : 129
% # ...remaining for further processing: 204
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 834
% # ...of the previous two non-trivial : 757
% # Contextual simplify-reflections    : 15
% # Paramodulations                    : 834
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 186
% #    Positive orientable unit clauses: 36
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 148
% # Current number of unprocessed clauses: 419
% # ...number of literals in the above : 1402
% # Clause-clause subsumption calls (NU) : 2843
% # Rec. Clause-clause subsumption calls : 2386
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 280
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:   102 leaves,   3.28+/-4.845 terms/leaf
% # Paramod-from index:           36 leaves,   2.72+/-3.863 terms/leaf
% # Paramod-into index:           85 leaves,   3.14+/-5.074 terms/leaf
% # -------------------------------------------------
% # User time              : 0.062 s
% # System time            : 0.003 s
% # Total time             : 0.065 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.24 WC
% FINAL PrfWatch: 0.15 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP8203/SEU317+2.tptp
% 
%------------------------------------------------------------------------------