%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU321+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 : art01.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:31:24 EST 2010
% Result : Theorem 183.18s
% Output : Solution 183.72s
% 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/SystemOnTPTP8296/SEU321+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~l40_tops_1:
% ---- 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_k3_subset_1:
% CSA axiom dt_k3_subset_1 found
% Looking for CSA axiom ... existence_l1_struct_0:
% 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_struct_0:
% l3_subset_1:
% CSA axiom l3_subset_1 found
% Looking for CSA axiom ... l71_subset_1:
% CSA axiom l71_subset_1 found
% Looking for CSA axiom ... rc3_struct_0:
% t1_subset:
% CSA axiom t1_subset found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... existence_l1_struct_0:
% rc3_struct_0:
% t3_ordinal1:
% CSA axiom t3_ordinal1 found
% Looking for CSA axiom ... t4_subset:
% t54_subset_1:
% CSA axiom t54_subset_1 found
% Looking for CSA axiom ... t7_tarski:
% CSA axiom t7_tarski found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... existence_l1_struct_0:
% rc3_struct_0:
% t4_subset:
% rc5_struct_0:
% CSA axiom rc5_struct_0 found
% Looking for CSA axiom ... involutiveness_k3_subset_1:
% CSA axiom involutiveness_k3_subset_1 found
% Looking for CSA axiom ... dt_k1_pre_topc:
% CSA axiom dt_k1_pre_topc found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... existence_l1_struct_0:
% rc3_struct_0:
% t4_subset:
% dt_k2_pre_topc:
% CSA axiom dt_k2_pre_topc found
% Looking for CSA axiom ... fc1_struct_0:
% CSA axiom fc1_struct_0 found
% Looking for CSA axiom ... 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_struct_0:
% rc3_struct_0:
% t4_subset:
% t50_subset_1:
% CSA axiom t50_subset_1 found
% Looking for CSA axiom ... d8_setfam_1:
% CSA axiom d8_setfam_1 found
% Looking for CSA axiom ... t3_subset:
% CSA axiom t3_subset found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... existence_l1_struct_0:
% rc3_struct_0:
% t4_subset:
% rc1_subset_1:
% rc2_subset_1:
% CSA axiom rc2_subset_1 found
% Looking for CSA axiom ... t17_pre_topc:
% CSA axiom t17_pre_topc found
% Looking for CSA axiom ... cc16_membered:
% CSA axiom cc16_membered found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :cc16_membered:t17_pre_topc:rc2_subset_1:t3_subset:d8_setfam_1:t50_subset_1:t5_subset:fc1_struct_0:dt_k2_pre_topc:dt_k1_pre_topc:involutiveness_k3_subset_1:rc5_struct_0:t7_tarski:t54_subset_1:t3_ordinal1:t1_subset:l71_subset_1:l3_subset_1:existence_m1_subset_1:dt_k3_subset_1:antisymmetry_r2_hidden (21)
% Unselected axioms are ... :existence_l1_struct_0:rc3_struct_0:t4_subset:rc1_subset_1:cc2_finset_1:d2_subset_1:d5_subset_1:t2_subset:dt_k2_subset_1:dt_k5_setfam_1:dt_k5_subset_1:dt_k6_setfam_1:dt_k6_subset_1:dt_k7_setfam_1:t43_subset_1:dt_k1_lattices:dt_k2_lattices:t15_pre_topc:t22_pre_topc:dt_k6_pre_topc:dt_u1_pre_topc:t29_tops_1:t30_tops_1:d3_pre_topc:t12_pre_topc:d5_pre_topc:t2_tarski:d1_zfmisc_1:cc1_relset_1:commutativity_k5_subset_1:d1_xboole_0:dt_l1_lattices:dt_l1_pre_topc:dt_l2_lattices:existence_l1_lattices:existence_l1_pre_topc:existence_l2_lattices:existence_l3_lattices:existence_m1_relset_1:existence_m2_relset_1:fc1_subset_1:idempotence_k5_subset_1:involutiveness_k7_setfam_1:rc1_xboole_0:rc2_xboole_0:reflexivity_r1_tarski:symmetry_r1_xboole_0:t1_xboole_1:t63_xboole_1:t7_boole:t48_pre_topc:dt_k3_lattices:dt_k4_lattices:rc6_pre_topc:cc17_membered:d3_tarski:dt_m2_relset_1:s1_xboole_0__e2_37_1_1__pre_topc__1:s3_subset_1__e2_37_1_1__pre_topc:t136_zfmisc_1:t44_pre_topc:t45_pre_topc:dt_k4_relset_1:dt_k5_relset_1:commutativity_k3_lattices:commutativity_k4_lattices:d3_lattices:s1_tarski__e1_40__pre_topc__1:s1_xboole_0__e1_40__pre_topc__1:s1_xboole_0__e6_22__wellord2:s3_subset_1__e1_40__pre_topc:t23_ordinal1:t26_lattices:d13_pre_topc:s1_tarski__e2_37_1_1__pre_topc__1:t10_ordinal1:t3_xboole_0:s1_xboole_0__e6_27__finset_1:redefinition_k6_subset_1:l82_funct_1:t46_setfam_1:d8_lattices:s1_tarski__e6_27__finset_1__1:d12_funct_1:d1_pre_topc:fc13_finset_1:rc3_finset_1:t17_finset_1:t1_zfmisc_1:d1_setfam_1:d4_xboole_0:s1_tarski__e4_27_3_1__finset_1__1:s1_xboole_0__e4_27_3_1__finset_1:t23_lattices:t86_relat_1:t18_finset_1:t46_pre_topc:antisymmetry_r2_xboole_0:cc1_finset_1:cc1_finsub_1:cc2_finsub_1:commutativity_k2_tarski:commutativity_k2_xboole_0:commutativity_k3_xboole_0:fc29_membered:fc30_membered:fc38_membered:idempotence_k2_xboole_0:idempotence_k3_xboole_0:irreflexivity_r2_xboole_0:rc1_finset_1:reflexivity_r2_wellord2:symmetry_r2_wellord2:t10_zfmisc_1:t33_zfmisc_1:cc10_membered:d1_lattices:d2_lattices:redefinition_k3_lattices:redefinition_k4_lattices:t3_boole:t3_xboole_1:t4_boole:t52_pre_topc:t6_boole:d2_ordinal1:d4_subset_1:fc1_funct_1:fc4_funct_1:fc5_funct_1:l1_zfmisc_1:l2_zfmisc_1:rc2_partfun1:rc3_funct_1:redefinition_k5_setfam_1:redefinition_k5_subset_1:redefinition_k6_setfam_1:t145_relat_1:t146_relat_1:t1_boole:t21_funct_1:t2_boole:t31_ordinal1:t37_zfmisc_1:t38_zfmisc_1:t39_xboole_1:t40_xboole_1:t48_xboole_1:t83_xboole_1:d6_pre_topc:d8_xboole_0:dt_k2_funct_1:fc2_funct_1:l50_zfmisc_1:rc4_funct_1:s1_tarski__e6_22__wellord2__1:t12_xboole_1:t24_ordinal1:t28_xboole_1:t6_zfmisc_1:t92_zfmisc_1:t99_zfmisc_1:t9_tarski:cc18_membered:d10_xboole_0:d1_enumset1:d1_tarski:d2_tarski:d2_xboole_0:d3_ordinal1:d3_xboole_0:d4_tarski:fc3_relat_1:s1_tarski__e16_22__wellord2__1:s2_ordinal1__e18_27__finset_1__1:t145_funct_1:t146_funct_1:t56_relat_1:t8_boole:cc1_relat_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:s2_funct_1__e16_22__wellord2__1:s3_funct_1__e16_22__wellord2:t22_funct_1:t23_funct_1:t26_finset_1:t34_funct_1:t70_funct_1:t8_funct_1:cc20_membered:t118_zfmisc_1:t119_zfmisc_1:t13_finset_1:t33_xboole_1:t36_xboole_1:fc4_subset_1:s1_tarski__e10_24__wellord2__1:s1_tarski__e18_27__finset_1__1:s1_xboole_0__e18_27__finset_1__1:t2_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_wellord1: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:fc5_pre_topc:fc9_finset_1:l3_wellord1:l4_zfmisc_1:redefinition_m2_relset_1:redefinition_r2_wellord2:t15_finset_1:t16_wellord1:t39_zfmisc_1:cc19_membered:connectedness_r1_ordinal1:d1_finset_1:d1_funct_1:d7_xboole_0:fc1_ordinal1:fc2_subset_1:fc2_xboole_0:fc3_subset_1:fc3_xboole_0:fc4_relat_1:l32_xboole_1:l3_zfmisc_1:reflexivity_r1_ordinal1:s2_funct_1__e10_24__wellord2:t144_relat_1:t17_xboole_1:t19_xboole_1:t25_relat_1:t26_xboole_1:t28_wellord2:t37_xboole_1:t42_ordinal1:t65_zfmisc_1:t68_funct_1:cc11_membered:cc2_funct_1:d1_relat_1:d1_relat_2:d2_relat_1:d2_zfmisc_1:d8_relat_2:l23_zfmisc_1:l29_wellord1:l2_wellord1:rc1_partfun1:s1_ordinal2__e18_27__finset_1: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:t41_ordinal1:t44_relat_1:t45_xboole_1:t46_zfmisc_1:t60_relat_1:t60_xboole_1:t72_funct_1:t7_xboole_1:t8_xboole_1:cc1_ordinal1:cc2_ordinal1:d1_relset_1:d4_ordinal1:d6_relat_1:fc1_finset_1:fc3_funct_1:rc1_funct_1:rc1_funct_2:rc1_ordinal1:t46_relat_1:t47_relat_1:t49_wellord1:t54_wellord1:t62_funct_1:t71_relat_1:d4_wellord1:d4_wellord2:d6_ordinal1:d9_funct_1:fc10_relat_1:fc5_relat_1:fc6_relat_1:fc7_relat_1:fc8_relat_1:fc9_relat_1:l25_zfmisc_1:l28_zfmisc_1:l55_zfmisc_1:rc2_funct_1:redefinition_r1_ordinal1:s1_funct_1__e10_24__wellord2__1:s1_ordinal1__e8_6__wellord2:t106_zfmisc_1:t115_relat_1:t147_funct_1:t19_wellord1:t22_wellord1:t23_wellord1:t24_wellord1:t25_wellord1:t31_wellord1:t32_ordinal1:t32_wellord1:t4_xboole_0:t54_funct_1:t55_funct_1:cc12_membered:d1_mcart_1:d2_mcart_1:d6_wellord1:d7_wellord1: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:fc11_relat_1:fc2_relat_1:fc33_membered:fc34_membered:fc3_ordinal1:fc40_membered:l4_wellord1:rc3_relat_1:s1_funct_1__e16_22__wellord2__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:t117_relat_1:t140_relat_1:t160_relat_1:t178_relat_1:t26_wellord2:t35_funct_1:t47_setfam_1:t48_setfam_1:t69_enumset1:t88_relat_1:t8_zfmisc_1:t9_zfmisc_1:d4_funct_1:fc1_relat_1:fc6_membered:involutiveness_k4_relat_1:s1_relat_1__e6_21__wellord2:t21_funct_2:t21_relat_1:t37_relat_1:t57_funct_1:t90_relat_1:d14_relat_2:d1_ordinal1:d5_tarski:d9_relat_2:fc1_finsub_1:l1_wellord1:rc2_ordinal1:s1_tarski__e16_22__wellord2__2:s1_xboole_0__e16_22__wellord2__1:t143_relat_1:t14_relset_1:t166_relat_1:t20_relat_1:t22_relset_1:t23_relset_1:t64_relat_1:t65_relat_1:t74_relat_1:t7_mcart_1:cc15_membered:cc1_membered:cc2_membered:cc3_ordinal1:d1_funct_2:d1_wellord2:dt_l3_lattices:fc12_relat_1:fc1_pre_topc:fc2_arytm_3:fc35_membered:fc36_membered:fc41_membered:rc1_membered:rc1_ordinal2:rc3_ordinal1:t12_relset_1:t25_wellord2:t2_wellord2:t3_wellord2:t5_wellord2:cc13_membered:cc1_arytm_3:cc3_arytm_3:fc13_relat_1:fc4_ordinal1:rc2_finset_1:t174_relat_1:t20_wellord1:t21_wellord1:t4_wellord2:t6_wellord2:t7_wellord2:d12_relat_2:d16_relat_2:d3_wellord1:dt_k2_binop_1:t116_relat_1:t118_relat_1:t39_wellord1:t45_relat_1:t46_funct_2: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:t94_relat_1:cc2_arytm_3:d2_wellord1:fc1_ordinal2:rc1_arytm_3:t17_wellord1:t18_wellord1: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 (501)
% SZS status THM for /tmp/SystemOnTPTP8296/SEU321+2.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP8296/SEU321+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 14960
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:?[X2]:(element(X2,powerset(X1))&empty(X2)),file('/tmp/SRASS.s.p', rc2_subset_1)).
% fof(6, axiom,![X1]:(~(X1=empty_set)=>![X2]:(element(X2,powerset(X1))=>![X3]:(element(X3,X1)=>(~(in(X3,X2))=>in(X3,subset_complement(X1,X2)))))),file('/tmp/SRASS.s.p', t50_subset_1)).
% fof(7, axiom,![X1]:![X2]:![X3]:~(((in(X1,X2)&element(X2,powerset(X3)))&empty(X3))),file('/tmp/SRASS.s.p', t5_subset)).
% fof(8, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),file('/tmp/SRASS.s.p', fc1_struct_0)).
% fof(14, axiom,![X1]:![X2]:![X3]:(element(X3,powerset(X1))=>~((in(X2,subset_complement(X1,X3))&in(X2,X3)))),file('/tmp/SRASS.s.p', t54_subset_1)).
% fof(17, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)=>in(X3,X2))=>element(X1,powerset(X2))),file('/tmp/SRASS.s.p', l71_subset_1)).
% fof(18, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>![X3]:(in(X3,X2)=>in(X3,X1))),file('/tmp/SRASS.s.p', l3_subset_1)).
% fof(19, axiom,![X1]:?[X2]:element(X2,X1),file('/tmp/SRASS.s.p', existence_m1_subset_1)).
% fof(20, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>element(subset_complement(X1,X2),powerset(X1))),file('/tmp/SRASS.s.p', dt_k3_subset_1)).
% fof(22, conjecture,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>(in(X3,subset_complement(the_carrier(X1),X2))<=>~(in(X3,X2)))))),file('/tmp/SRASS.s.p', l40_tops_1)).
% fof(23, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>(in(X3,subset_complement(the_carrier(X1),X2))<=>~(in(X3,X2))))))),inference(assume_negation,[status(cth)],[22])).
% fof(24, plain,![X1]:(~(X1=empty_set)=>![X2]:(element(X2,powerset(X1))=>![X3]:(element(X3,X1)=>(~(in(X3,X2))=>in(X3,subset_complement(X1,X2)))))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(25, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(28, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>(in(X3,subset_complement(the_carrier(X1),X2))<=>~(in(X3,X2))))))),inference(fof_simplification,[status(thm)],[23,theory(equality)])).
% fof(37, plain,![X3]:?[X4]:(element(X4,powerset(X3))&empty(X4)),inference(variable_rename,[status(thm)],[3])).
% fof(38, plain,![X3]:(element(esk1_1(X3),powerset(X3))&empty(esk1_1(X3))),inference(skolemize,[status(esa)],[37])).
% cnf(39,plain,(empty(esk1_1(X1))),inference(split_conjunct,[status(thm)],[38])).
% fof(55, plain,![X1]:(X1=empty_set|![X2]:(~(element(X2,powerset(X1)))|![X3]:(~(element(X3,X1))|(in(X3,X2)|in(X3,subset_complement(X1,X2)))))),inference(fof_nnf,[status(thm)],[24])).
% fof(56, plain,![X4]:(X4=empty_set|![X5]:(~(element(X5,powerset(X4)))|![X6]:(~(element(X6,X4))|(in(X6,X5)|in(X6,subset_complement(X4,X5)))))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X4]:![X5]:![X6]:(((~(element(X6,X4))|(in(X6,X5)|in(X6,subset_complement(X4,X5))))|~(element(X5,powerset(X4))))|X4=empty_set),inference(shift_quantors,[status(thm)],[56])).
% cnf(58,plain,(X1=empty_set|in(X3,subset_complement(X1,X2))|in(X3,X2)|~element(X2,powerset(X1))|~element(X3,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|~(empty(X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(60, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|~(empty(X6))),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2)),inference(split_conjunct,[status(thm)],[60])).
% fof(62, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|~(empty(the_carrier(X1)))),inference(fof_nnf,[status(thm)],[25])).
% fof(63, plain,![X2]:((empty_carrier(X2)|~(one_sorted_str(X2)))|~(empty(the_carrier(X2)))),inference(variable_rename,[status(thm)],[62])).
% cnf(64,plain,(empty_carrier(X1)|~empty(the_carrier(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(87, plain,![X1]:![X2]:![X3]:(~(element(X3,powerset(X1)))|(~(in(X2,subset_complement(X1,X3)))|~(in(X2,X3)))),inference(fof_nnf,[status(thm)],[14])).
% fof(88, plain,![X4]:![X5]:![X6]:(~(element(X6,powerset(X4)))|(~(in(X5,subset_complement(X4,X6)))|~(in(X5,X6)))),inference(variable_rename,[status(thm)],[87])).
% cnf(89,plain,(~in(X1,X2)|~in(X1,subset_complement(X3,X2))|~element(X2,powerset(X3))),inference(split_conjunct,[status(thm)],[88])).
% fof(96, plain,![X1]:![X2]:(?[X3]:(in(X3,X1)&~(in(X3,X2)))|element(X1,powerset(X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(97, plain,![X4]:![X5]:(?[X6]:(in(X6,X4)&~(in(X6,X5)))|element(X4,powerset(X5))),inference(variable_rename,[status(thm)],[96])).
% fof(98, plain,![X4]:![X5]:((in(esk5_2(X4,X5),X4)&~(in(esk5_2(X4,X5),X5)))|element(X4,powerset(X5))),inference(skolemize,[status(esa)],[97])).
% fof(99, plain,![X4]:![X5]:((in(esk5_2(X4,X5),X4)|element(X4,powerset(X5)))&(~(in(esk5_2(X4,X5),X5))|element(X4,powerset(X5)))),inference(distribute,[status(thm)],[98])).
% cnf(100,plain,(element(X1,powerset(X2))|~in(esk5_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[99])).
% cnf(101,plain,(element(X1,powerset(X2))|in(esk5_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[99])).
% fof(102, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|![X3]:(~(in(X3,X2))|in(X3,X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(103, plain,![X4]:![X5]:(~(element(X5,powerset(X4)))|![X6]:(~(in(X6,X5))|in(X6,X4))),inference(variable_rename,[status(thm)],[102])).
% fof(104, plain,![X4]:![X5]:![X6]:((~(in(X6,X5))|in(X6,X4))|~(element(X5,powerset(X4)))),inference(shift_quantors,[status(thm)],[103])).
% cnf(105,plain,(in(X3,X2)|~element(X1,powerset(X2))|~in(X3,X1)),inference(split_conjunct,[status(thm)],[104])).
% fof(106, plain,![X3]:?[X4]:element(X4,X3),inference(variable_rename,[status(thm)],[19])).
% fof(107, plain,![X3]:element(esk6_1(X3),X3),inference(skolemize,[status(esa)],[106])).
% cnf(108,plain,(element(esk6_1(X1),X1)),inference(split_conjunct,[status(thm)],[107])).
% fof(109, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|element(subset_complement(X1,X2),powerset(X1))),inference(fof_nnf,[status(thm)],[20])).
% fof(110, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|element(subset_complement(X3,X4),powerset(X3))),inference(variable_rename,[status(thm)],[109])).
% cnf(111,plain,(element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[110])).
% fof(115, negated_conjecture,?[X1]:((~(empty_carrier(X1))&one_sorted_str(X1))&?[X2]:(element(X2,powerset(the_carrier(X1)))&?[X3]:(element(X3,the_carrier(X1))&((~(in(X3,subset_complement(the_carrier(X1),X2)))|in(X3,X2))&(in(X3,subset_complement(the_carrier(X1),X2))|~(in(X3,X2))))))),inference(fof_nnf,[status(thm)],[28])).
% fof(116, negated_conjecture,?[X4]:((~(empty_carrier(X4))&one_sorted_str(X4))&?[X5]:(element(X5,powerset(the_carrier(X4)))&?[X6]:(element(X6,the_carrier(X4))&((~(in(X6,subset_complement(the_carrier(X4),X5)))|in(X6,X5))&(in(X6,subset_complement(the_carrier(X4),X5))|~(in(X6,X5))))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, negated_conjecture,((~(empty_carrier(esk7_0))&one_sorted_str(esk7_0))&(element(esk8_0,powerset(the_carrier(esk7_0)))&(element(esk9_0,the_carrier(esk7_0))&((~(in(esk9_0,subset_complement(the_carrier(esk7_0),esk8_0)))|in(esk9_0,esk8_0))&(in(esk9_0,subset_complement(the_carrier(esk7_0),esk8_0))|~(in(esk9_0,esk8_0))))))),inference(skolemize,[status(esa)],[116])).
% cnf(118,negated_conjecture,(in(esk9_0,subset_complement(the_carrier(esk7_0),esk8_0))|~in(esk9_0,esk8_0)),inference(split_conjunct,[status(thm)],[117])).
% cnf(119,negated_conjecture,(in(esk9_0,esk8_0)|~in(esk9_0,subset_complement(the_carrier(esk7_0),esk8_0))),inference(split_conjunct,[status(thm)],[117])).
% cnf(120,negated_conjecture,(element(esk9_0,the_carrier(esk7_0))),inference(split_conjunct,[status(thm)],[117])).
% cnf(121,negated_conjecture,(element(esk8_0,powerset(the_carrier(esk7_0)))),inference(split_conjunct,[status(thm)],[117])).
% cnf(122,negated_conjecture,(one_sorted_str(esk7_0)),inference(split_conjunct,[status(thm)],[117])).
% cnf(123,negated_conjecture,(~empty_carrier(esk7_0)),inference(split_conjunct,[status(thm)],[117])).
% cnf(141,plain,(in(X1,X2)|~in(X1,esk6_1(powerset(X2)))),inference(spm,[status(thm)],[105,108,theory(equality)])).
% cnf(146,plain,(in(X1,X2)|~in(X1,subset_complement(X2,X3))|~element(X3,powerset(X2))),inference(spm,[status(thm)],[105,111,theory(equality)])).
% cnf(147,plain,(element(X1,powerset(X1))),inference(spm,[status(thm)],[100,101,theory(equality)])).
% cnf(159,negated_conjecture,(~in(esk9_0,esk8_0)|~element(esk8_0,powerset(the_carrier(esk7_0)))),inference(spm,[status(thm)],[89,118,theory(equality)])).
% cnf(162,negated_conjecture,(~in(esk9_0,esk8_0)|$false),inference(rw,[status(thm)],[159,121,theory(equality)])).
% cnf(163,negated_conjecture,(~in(esk9_0,esk8_0)),inference(cn,[status(thm)],[162,theory(equality)])).
% cnf(166,negated_conjecture,(in(esk9_0,esk8_0)|empty_set=the_carrier(esk7_0)|~element(esk8_0,powerset(the_carrier(esk7_0)))|~element(esk9_0,the_carrier(esk7_0))),inference(spm,[status(thm)],[119,58,theory(equality)])).
% cnf(173,negated_conjecture,(in(esk9_0,esk8_0)|empty_set=the_carrier(esk7_0)|$false|~element(esk9_0,the_carrier(esk7_0))),inference(rw,[status(thm)],[166,121,theory(equality)])).
% cnf(174,negated_conjecture,(in(esk9_0,esk8_0)|empty_set=the_carrier(esk7_0)|$false|$false),inference(rw,[status(thm)],[173,120,theory(equality)])).
% cnf(175,negated_conjecture,(in(esk9_0,esk8_0)|empty_set=the_carrier(esk7_0)),inference(cn,[status(thm)],[174,theory(equality)])).
% cnf(198,plain,(~in(X1,X2)|~empty(X2)),inference(spm,[status(thm)],[61,147,theory(equality)])).
% cnf(200,negated_conjecture,(the_carrier(esk7_0)=empty_set),inference(sr,[status(thm)],[175,163,theory(equality)])).
% cnf(201,negated_conjecture,(empty_carrier(esk7_0)|~empty(empty_set)|~one_sorted_str(esk7_0)),inference(spm,[status(thm)],[64,200,theory(equality)])).
% cnf(212,negated_conjecture,(empty_carrier(esk7_0)|~empty(empty_set)|$false),inference(rw,[status(thm)],[201,122,theory(equality)])).
% cnf(213,negated_conjecture,(empty_carrier(esk7_0)|~empty(empty_set)),inference(cn,[status(thm)],[212,theory(equality)])).
% cnf(214,negated_conjecture,(~empty(empty_set)),inference(sr,[status(thm)],[213,123,theory(equality)])).
% cnf(236,plain,(element(X1,powerset(X2))|~empty(X1)),inference(spm,[status(thm)],[198,101,theory(equality)])).
% cnf(252,plain,(element(esk1_1(X1),powerset(X2))),inference(spm,[status(thm)],[236,39,theory(equality)])).
% cnf(257,plain,(~in(X1,esk1_1(X2))|~empty(X3)),inference(spm,[status(thm)],[61,252,theory(equality)])).
% cnf(272,plain,(in(esk5_2(esk6_1(powerset(X1)),X2),X1)|element(esk6_1(powerset(X1)),powerset(X2))),inference(spm,[status(thm)],[141,101,theory(equality)])).
% cnf(300,plain,(in(X1,X2)|empty_set=X2|in(X1,X3)|~element(X3,powerset(X2))|~element(X1,X2)),inference(spm,[status(thm)],[146,58,theory(equality)])).
% fof(309, plain,(~(epred1_0)<=>![X2]:![X1]:~(in(X1,esk1_1(X2)))),introduced(definition),['split']).
% cnf(310,plain,(epred1_0|~in(X1,esk1_1(X2))),inference(split_equiv,[status(thm)],[309])).
% fof(311, plain,(~(epred2_0)<=>![X3]:~(empty(X3))),introduced(definition),['split']).
% cnf(312,plain,(epred2_0|~empty(X3)),inference(split_equiv,[status(thm)],[311])).
% cnf(313,plain,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[257,309,theory(equality)]),311,theory(equality)]),['split']).
% cnf(314,plain,(epred2_0),inference(spm,[status(thm)],[312,39,theory(equality)])).
% cnf(315,plain,($false|~epred1_0),inference(rw,[status(thm)],[313,314,theory(equality)])).
% cnf(316,plain,(~epred1_0),inference(cn,[status(thm)],[315,theory(equality)])).
% cnf(386,plain,(epred1_0|element(esk6_1(powerset(esk1_1(X1))),powerset(X2))),inference(spm,[status(thm)],[310,272,theory(equality)])).
% cnf(403,plain,(element(esk6_1(powerset(esk1_1(X1))),powerset(X2))),inference(sr,[status(thm)],[386,316,theory(equality)])).
% cnf(552,plain,(empty_set=X2|in(X1,X2)|~element(X3,powerset(X2))|~element(X1,X2)),inference(csr,[status(thm)],[300,105])).
% cnf(555,plain,(empty_set=X1|in(X2,X1)|~element(X2,X1)),inference(spm,[status(thm)],[552,403,theory(equality)])).
% cnf(615,plain,(epred1_0|empty_set=esk1_1(X2)|~element(X1,esk1_1(X2))),inference(spm,[status(thm)],[310,555,theory(equality)])).
% cnf(633,plain,(esk1_1(X2)=empty_set|~element(X1,esk1_1(X2))),inference(sr,[status(thm)],[615,316,theory(equality)])).
% cnf(670,plain,(esk1_1(X1)=empty_set),inference(spm,[status(thm)],[633,108,theory(equality)])).
% cnf(694,plain,(empty(empty_set)),inference(rw,[status(thm)],[39,670,theory(equality)])).
% cnf(695,plain,($false),inference(sr,[status(thm)],[694,214,theory(equality)])).
% cnf(696,plain,($false),695,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 254
% # ...of these trivial : 2
% # ...subsumed : 59
% # ...remaining for further processing: 193
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 24
% # Generated clauses : 482
% # ...of the previous two non-trivial : 479
% # Contextual simplify-reflections : 10
% # Paramodulations : 476
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 129
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 110
% # Current number of unprocessed clauses: 221
% # ...number of literals in the above : 858
% # Clause-clause subsumption calls (NU) : 990
% # Rec. Clause-clause subsumption calls : 805
% # Unit Clause-clause subsumption calls : 359
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 31
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 167 leaves, 1.31+/-0.875 terms/leaf
% # Paramod-from index: 62 leaves, 1.03+/-0.177 terms/leaf
% # Paramod-into index: 145 leaves, 1.18+/-0.494 terms/leaf
% # -------------------------------------------------
% # User time : 0.039 s
% # System time : 0.007 s
% # Total time : 0.046 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.22 WC
% FINAL PrfWatch: 0.17 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP8296/SEU321+2.tptp
%
%------------------------------------------------------------------------------