TSTP Solution File: SEU311+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU311+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 13:30:52 EDT 2022
% Result : Theorem 80.15s 80.41s
% Output : Refutation 80.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU311+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 12:45:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.76/1.01 ============================== Prover9 ===============================
% 0.76/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.01 Process 32273 was started by sandbox on n024.cluster.edu,
% 0.76/1.01 Mon Jun 20 12:45:03 2022
% 0.76/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32119_n024.cluster.edu".
% 0.76/1.01 ============================== end of head ===========================
% 0.76/1.01
% 0.76/1.01 ============================== INPUT =================================
% 0.76/1.01
% 0.76/1.01 % Reading from file /tmp/Prover9_32119_n024.cluster.edu
% 0.76/1.01
% 0.76/1.01 set(prolog_style_variables).
% 0.76/1.01 set(auto2).
% 0.76/1.01 % set(auto2) -> set(auto).
% 0.76/1.01 % set(auto) -> set(auto_inference).
% 0.76/1.01 % set(auto) -> set(auto_setup).
% 0.76/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.01 % set(auto) -> set(auto_limits).
% 0.76/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.01 % set(auto) -> set(auto_denials).
% 0.76/1.01 % set(auto) -> set(auto_process).
% 0.76/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.01 % set(auto2) -> assign(stats, some).
% 0.76/1.01 % set(auto2) -> clear(echo_input).
% 0.76/1.01 % set(auto2) -> set(quiet).
% 0.76/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.01 % set(auto2) -> clear(print_given).
% 0.76/1.01 assign(lrs_ticks,-1).
% 0.76/1.01 assign(sos_limit,10000).
% 0.76/1.01 assign(order,kbo).
% 0.76/1.01 set(lex_order_vars).
% 0.76/1.01 clear(print_given).
% 0.76/1.01
% 0.76/1.01 % formulas(sos). % not echoed (46 formulas)
% 0.76/1.01
% 0.76/1.01 ============================== end of input ==========================
% 0.76/1.01
% 0.76/1.01 % From the command line: assign(max_seconds, 300).
% 0.76/1.01
% 0.76/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.01
% 0.76/1.01 % Formulas that are not ordinary clauses:
% 0.76/1.01 1 (all A (v5_membered(A) -> v4_membered(A))) # label(cc1_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 2 (all A (v4_membered(A) -> v3_membered(A))) # label(cc2_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 3 (all A (v3_membered(A) -> v2_membered(A))) # label(cc3_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 4 (all A (v2_membered(A) -> v1_membered(A))) # label(cc4_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 5 (exists A (-empty(A) & v1_membered(A) & v2_membered(A) & v3_membered(A) & v4_membered(A) & v5_membered(A))) # label(rc1_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 6 (all A (v1_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B))))) # label(cc10_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 7 (all A (v2_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B) & v1_xreal_0(B))))) # label(cc11_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 8 (all A (v3_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B) & v1_xreal_0(B) & v1_rat_1(B))))) # label(cc12_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 9 (all A (v4_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B) & v1_xreal_0(B) & v1_int_1(B) & v1_rat_1(B))))) # label(cc13_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 10 (all A (v5_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B) & natural(B) & v1_xreal_0(B) & v1_int_1(B) & v1_rat_1(B))))) # label(cc14_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 11 (all A (v1_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B))))) # label(cc16_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 12 (all A (v2_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v2_membered(B))))) # label(cc17_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 13 (all A (v3_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v2_membered(B) & v3_membered(B))))) # label(cc18_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 14 (all A (v4_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v2_membered(B) & v3_membered(B) & v4_membered(B))))) # label(cc19_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 15 (all A (v5_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v2_membered(B) & v3_membered(B) & v4_membered(B) & v5_membered(B))))) # label(cc20_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 16 (all A all B (v1_membered(A) -> v1_membered(set_difference(A,B)))) # label(fc37_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 17 (all A all B (v2_membered(A) -> v1_membered(set_difference(A,B)) & v2_membered(set_difference(A,B)))) # label(fc38_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 18 (all A all B (v3_membered(A) -> v1_membered(set_difference(A,B)) & v2_membered(set_difference(A,B)) & v3_membered(set_difference(A,B)))) # label(fc39_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 19 (all A all B (v4_membered(A) -> v1_membered(set_difference(A,B)) & v2_membered(set_difference(A,B)) & v3_membered(set_difference(A,B)) & v4_membered(set_difference(A,B)))) # label(fc40_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 20 (all A all B (v5_membered(A) -> v1_membered(set_difference(A,B)) & v2_membered(set_difference(A,B)) & v3_membered(set_difference(A,B)) & v4_membered(set_difference(A,B)) & v5_membered(set_difference(A,B)))) # label(fc41_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 21 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 22 (all A (topological_space(A) & top_str(A) -> (exists B (element(B,powerset(the_carrier(A))) & closed_subset(B,A))))) # label(rc6_pre_topc) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 23 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 24 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 25 (all A (empty(A) -> v1_membered(A) & v2_membered(A) & v3_membered(A) & v4_membered(A) & v5_membered(A))) # label(cc15_membered) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 26 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 27 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 28 (all A (one_sorted_str(A) -> element(cast_as_carrier_subset(A),powerset(the_carrier(A))))) # label(dt_k2_pre_topc) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 29 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 30 (all A (top_str(A) -> one_sorted_str(A))) # label(dt_l1_pre_topc) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 31 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 32 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 33 (all A (topological_space(A) & top_str(A) -> closed_subset(cast_as_carrier_subset(A),A))) # label(fc5_pre_topc) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 34 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 35 (all A all B (topological_space(A) & top_str(A) & element(B,powerset(powerset(the_carrier(A)))) -> (exists C all D (in(D,C) <-> in(D,powerset(the_carrier(A))) & in(set_difference(cast_as_carrier_subset(A),D),B))))) # label(s1_xboole_0__e2_37_1_1__pre_topc__1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 36 (all A all B ((-empty(A) -> (element(B,A) <-> in(B,A))) & (empty(A) -> (element(B,A) <-> empty(B))))) # label(d2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 37 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 38 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 39 (all A all B ((all C (in(C,A) -> in(C,B))) -> element(A,powerset(B)))) # label(l71_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 40 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 41 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 42 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 43 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 44 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 45 -(all A all B (topological_space(A) & top_str(A) & element(B,powerset(powerset(the_carrier(A)))) -> (exists C (element(C,powerset(powerset(the_carrier(A)))) & (all D (element(D,powerset(the_carrier(A))) -> (in(D,C) <-> in(set_difference(cast_as_carrier_subset(A),D),B)))))))) # label(s3_subset_1__e2_37_1_1__pre_topc) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.02
% 0.76/1.02 ============================== end of process non-clausal formulas ===
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.02
% 0.76/1.02 ============================== PREDICATE ELIMINATION =================
% 0.76/1.02 46 -topological_space(A) | -top_str(A) | closed_subset(f1(A),A) # label(rc6_pre_topc) # label(axiom). [clausify(22)].
% 0.76/1.02 47 topological_space(c4) # label(s3_subset_1__e2_37_1_1__pre_topc) # label(negated_conjecture). [clausify(45)].
% 0.76/1.02 Derived: -top_str(c4) | closed_subset(f1(c4),c4). [resolve(46,a,47,a)].
% 0.76/1.02 48 -topological_space(A) | -top_str(A) | closed_subset(cast_as_carrier_subset(A),A) # label(fc5_pre_topc) # label(axiom). [clausify(33)].
% 0.76/1.02 Derived: -top_str(c4) | closed_subset(cast_as_carrier_subset(c4),c4). [resolve(48,a,47,a)].
% 0.76/1.02 49 -topological_space(A) | -top_str(A) | element(f1(A),powerset(the_carrier(A))) # label(rc6_pre_topc) # label(axiom). [clausify(22)].
% 0.76/1.02 Derived: -top_str(c4) | element(f1(c4),powerset(the_carrier(c4))). [resolve(49,a,47,a)].
% 0.76/1.02 50 -topological_space(A) | -top_str(A) | -element(B,powerset(powerset(the_carrier(A)))) | -in(C,f4(A,B)) | in(C,powerset(the_carrier(A))) # label(s1_xboole_0__e2_37_1_1__pre_topc__1) # label(axiom). [clausify(35)].
% 0.76/1.02 Derived: -top_str(c4) | -element(A,powerset(powerset(the_carrier(c4)))) | -in(B,f4(c4,A)) | in(B,powerset(the_carrier(c4))). [resolve(50,a,47,a)].
% 0.76/1.02 51 -topological_space(A) | -top_str(A) | -element(B,powerset(powerset(the_carrier(A)))) | -in(C,f4(A,B)) | in(set_difference(cast_as_carrier_subset(A),C),B) # label(s1_xboole_0__e2_37_1_1__pre_topc__1) # label(axiom). [clausify(35)].
% 0.76/1.02 Derived: -top_str(c4) | -element(A,powerset(powerset(the_carrier(c4)))) | -in(B,f4(c4,A)) | in(set_difference(cast_as_carrier_subset(c4),B),A). [resolve(51,a,47,a)].
% 0.76/1.02 52 -topological_space(A) | -top_str(A) | -element(B,powerset(powerset(the_carrier(A)))) | in(C,f4(A,B)) | -in(C,powerset(the_carrier(A))) | -in(set_difference(cast_as_carrier_subset(A),C),B) # label(s1_xboole_0__e2_37_1_1__pre_topc__1) # label(axiom). [clausify(35)].
% 0.76/1.02 Derived: -top_str(c4) | -element(A,powerset(powerset(the_carrier(c4)))) | in(B,f4(c4,A)) | -in(B,powerset(the_carrier(c4))) | -in(set_difference(cast_as_carrier_subset(c4),B),A). [resolve(52,a,47,a)].
% 0.76/1.02 53 -one_sorted_str(A) | element(cast_as_carrier_subset(A),powerset(the_carrier(A))) # label(dt_k2_pre_topc) # label(axiom). [clausify(28)].
% 0.76/1.02 54 -top_str(A) | one_sorted_str(A) # label(dt_l1_pre_topc) # label(axiom). [clausify(30)].
% 0.76/1.02 Derived: element(cast_as_carrier_subset(A),powerset(the_carrier(A))) | -top_str(A). [resolve(53,a,54,b)].
% 0.76/1.02
% 0.76/1.02 ============================== end predicate elimination =============
% 0.76/1.02
% 0.76/1.02 Auto_denials: (non-Horn, no changes).
% 0.76/1.02
% 0.76/1.02 Term ordering decisions:
% 0.76/1.02 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. set_difference=1. f4=1. f6=1. powerset=1. the_carrier=1. cast_as_carrier_subset=1. f1=1. f2=1. f3=1. f5=1. f7=1.
% 0.76/1.02
% 0.76/1.02 ============================== end of process initial clauses ========
% 0.76/1.02
% 0.76/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.02
% 0.76/1.02 ============================== end of clauses for search =============
% 0.76/1.02
% 0.76/1.02 ============================== SEARCH ================================
% 80.15/80.41
% 80.15/80.41 % Starting search at 0.02 seconds.
% 80.15/80.41
% 80.15/80.41 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 235 (0.00 of 0.13 sec).
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=26.000, iters=3850
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=21.000, iters=3505
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=20.000, iters=3403
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=19.000, iters=3346
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=18.000, iters=3341
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=17.000, iters=3416
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=16.000, iters=3406
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=15.000, iters=3440
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=14.000, iters=3343
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=13.000, iters=3358
% 80.15/80.41
% 80.15/80.41 Low Water (displace): id=3587, wt=40.000
% 80.15/80.41
% 80.15/80.41 Low Water (keep): wt=12.000, iters=3339
% 80.15/80.41
% 80.15/80.41 ============================== PROOF =================================
% 80.15/80.41 % SZS status Theorem
% 80.15/80.41 % SZS output start Refutation
% 80.15/80.41
% 80.15/80.41 % Proof 1 at 78.88 (+ 0.52) seconds.
% 80.15/80.41 % Length of proof is 33.
% 80.15/80.41 % Level of proof is 11.
% 80.15/80.41 % Maximum clause weight is 22.000.
% 80.15/80.41 % Given clauses 27586.
% 80.15/80.41
% 80.15/80.41 34 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 80.15/80.41 35 (all A all B (topological_space(A) & top_str(A) & element(B,powerset(powerset(the_carrier(A)))) -> (exists C all D (in(D,C) <-> in(D,powerset(the_carrier(A))) & in(set_difference(cast_as_carrier_subset(A),D),B))))) # label(s1_xboole_0__e2_37_1_1__pre_topc__1) # label(axiom) # label(non_clause). [assumption].
% 80.15/80.41 36 (all A all B ((-empty(A) -> (element(B,A) <-> in(B,A))) & (empty(A) -> (element(B,A) <-> empty(B))))) # label(d2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 80.15/80.41 39 (all A all B ((all C (in(C,A) -> in(C,B))) -> element(A,powerset(B)))) # label(l71_subset_1) # label(axiom) # label(non_clause). [assumption].
% 80.15/80.41 45 -(all A all B (topological_space(A) & top_str(A) & element(B,powerset(powerset(the_carrier(A)))) -> (exists C (element(C,powerset(powerset(the_carrier(A)))) & (all D (element(D,powerset(the_carrier(A))) -> (in(D,C) <-> in(set_difference(cast_as_carrier_subset(A),D),B)))))))) # label(s3_subset_1__e2_37_1_1__pre_topc) # label(negated_conjecture) # label(non_clause). [assumption].
% 80.15/80.41 47 topological_space(c4) # label(s3_subset_1__e2_37_1_1__pre_topc) # label(negated_conjecture). [clausify(45)].
% 80.15/80.41 50 -topological_space(A) | -top_str(A) | -element(B,powerset(powerset(the_carrier(A)))) | -in(C,f4(A,B)) | in(C,powerset(the_carrier(A))) # label(s1_xboole_0__e2_37_1_1__pre_topc__1) # label(axiom). [clausify(35)].
% 80.15/80.41 51 -topological_space(A) | -top_str(A) | -element(B,powerset(powerset(the_carrier(A)))) | -in(C,f4(A,B)) | in(set_difference(cast_as_carrier_subset(A),C),B) # label(s1_xboole_0__e2_37_1_1__pre_topc__1) # label(axiom). [clausify(35)].
% 80.15/80.41 52 -topological_space(A) | -top_str(A) | -element(B,powerset(powerset(the_carrier(A)))) | in(C,f4(A,B)) | -in(C,powerset(the_carrier(A))) | -in(set_difference(cast_as_carrier_subset(A),C),B) # label(s1_xboole_0__e2_37_1_1__pre_topc__1) # label(axiom). [clausify(35)].
% 80.15/80.41 62 top_str(c4) # label(s3_subset_1__e2_37_1_1__pre_topc) # label(negated_conjecture). [clausify(45)].
% 80.15/80.41 66 element(c5,powerset(powerset(the_carrier(c4)))) # label(s3_subset_1__e2_37_1_1__pre_topc) # label(negated_conjecture). [clausify(45)].
% 80.15/80.41 68 in(f6(A,B),A) | element(A,powerset(B)) # label(l71_subset_1) # label(axiom). [clausify(39)].
% 80.15/80.41 71 -empty(powerset(A)) # label(fc1_subset_1) # label(axiom). [clausify(34)].
% 80.15/80.41 74 -element(A,powerset(powerset(the_carrier(c4)))) | -in(f7(A),A) | -in(set_difference(cast_as_carrier_subset(c4),f7(A)),c5) # label(s3_subset_1__e2_37_1_1__pre_topc) # label(negated_conjecture). [clausify(45)].
% 80.15/80.41 119 empty(A) | -element(B,A) | in(B,A) # label(d2_subset_1) # label(axiom). [clausify(36)].
% 80.15/80.41 121 -in(f6(A,B),B) | element(A,powerset(B)) # label(l71_subset_1) # label(axiom). [clausify(39)].
% 80.15/80.41 122 -element(A,powerset(powerset(the_carrier(c4)))) | element(f7(A),powerset(the_carrier(c4))) # label(s3_subset_1__e2_37_1_1__pre_topc) # label(negated_conjecture). [clausify(45)].
% 80.15/80.41 123 -element(A,powerset(powerset(the_carrier(c4)))) | in(f7(A),A) | in(set_difference(cast_as_carrier_subset(c4),f7(A)),c5) # label(s3_subset_1__e2_37_1_1__pre_topc) # label(negated_conjecture). [clausify(45)].
% 80.15/80.42 126 -top_str(c4) | -element(A,powerset(powerset(the_carrier(c4)))) | -in(B,f4(c4,A)) | in(B,powerset(the_carrier(c4))). [resolve(50,a,47,a)].
% 80.15/80.42 127 -element(A,powerset(powerset(the_carrier(c4)))) | -in(B,f4(c4,A)) | in(B,powerset(the_carrier(c4))). [copy(126),unit_del(a,62)].
% 80.15/80.42 128 -top_str(c4) | -element(A,powerset(powerset(the_carrier(c4)))) | -in(B,f4(c4,A)) | in(set_difference(cast_as_carrier_subset(c4),B),A). [resolve(51,a,47,a)].
% 80.15/80.42 129 -element(A,powerset(powerset(the_carrier(c4)))) | -in(B,f4(c4,A)) | in(set_difference(cast_as_carrier_subset(c4),B),A). [copy(128),unit_del(a,62)].
% 80.15/80.42 130 -top_str(c4) | -element(A,powerset(powerset(the_carrier(c4)))) | in(B,f4(c4,A)) | -in(B,powerset(the_carrier(c4))) | -in(set_difference(cast_as_carrier_subset(c4),B),A). [resolve(52,a,47,a)].
% 80.15/80.42 131 -element(A,powerset(powerset(the_carrier(c4)))) | in(B,f4(c4,A)) | -in(B,powerset(the_carrier(c4))) | -in(set_difference(cast_as_carrier_subset(c4),B),A). [copy(130),unit_del(a,62)].
% 80.15/80.42 244 -element(A,powerset(powerset(the_carrier(c4)))) | in(f6(f4(c4,A),B),powerset(the_carrier(c4))) | element(f4(c4,A),powerset(B)). [resolve(127,b,68,a)].
% 80.15/80.42 911 in(f6(f4(c4,c5),A),powerset(the_carrier(c4))) | element(f4(c4,c5),powerset(A)). [resolve(244,a,66,a)].
% 80.15/80.42 8323 element(f4(c4,c5),powerset(powerset(the_carrier(c4)))). [resolve(911,a,121,a),merge(b)].
% 80.15/80.42 8329 in(f7(f4(c4,c5)),f4(c4,c5)) | in(set_difference(cast_as_carrier_subset(c4),f7(f4(c4,c5))),c5). [resolve(8323,a,123,a)].
% 80.15/80.42 8330 element(f7(f4(c4,c5)),powerset(the_carrier(c4))). [resolve(8323,a,122,a)].
% 80.15/80.42 8357 in(f7(f4(c4,c5)),powerset(the_carrier(c4))). [resolve(8330,a,119,b),unit_del(a,71)].
% 80.15/80.42 33040 in(f7(f4(c4,c5)),f4(c4,c5)). [resolve(8329,b,131,d),merge(c),unit_del(b,66),unit_del(c,8357)].
% 80.15/80.42 33041 in(set_difference(cast_as_carrier_subset(c4),f7(f4(c4,c5))),c5). [resolve(33040,a,129,b),unit_del(a,66)].
% 80.15/80.42 33043 $F. [resolve(33040,a,74,b),unit_del(a,8323),unit_del(b,33041)].
% 80.15/80.42
% 80.15/80.42 % SZS output end Refutation
% 80.15/80.42 ============================== end of proof ==========================
% 80.15/80.42
% 80.15/80.42 ============================== STATISTICS ============================
% 80.15/80.42
% 80.15/80.42 Given=27586. Generated=937427. Kept=32984. proofs=1.
% 80.15/80.42 Usable=27579. Sos=4751. Demods=4. Limbo=2, Disabled=752. Hints=0.
% 80.15/80.42 Megabytes=69.40.
% 80.15/80.42 User_CPU=78.88, System_CPU=0.52, Wall_clock=79.
% 80.15/80.42
% 80.15/80.42 ============================== end of statistics =====================
% 80.15/80.42
% 80.15/80.42 ============================== end of search =========================
% 80.15/80.42
% 80.15/80.42 THEOREM PROVED
% 80.15/80.42 % SZS status Theorem
% 80.15/80.42
% 80.15/80.42 Exiting with 1 proof.
% 80.15/80.42
% 80.15/80.42 Process 32273 exit (max_proofs) Mon Jun 20 12:46:22 2022
% 80.15/80.42 Prover9 interrupted
%------------------------------------------------------------------------------