TSTP Solution File: SEU383+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU383+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:31:26 EDT 2022
% Result : Timeout 300.06s 300.87s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : SEU383+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.28 % Computer : n026.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Mon Jun 20 07:25:11 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.64/0.95 ============================== Prover9 ===============================
% 0.64/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.64/0.95 Process 2819 was started by sandbox on n026.cluster.edu,
% 0.64/0.95 Mon Jun 20 07:25:11 2022
% 0.64/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2665_n026.cluster.edu".
% 0.64/0.95 ============================== end of head ===========================
% 0.64/0.95
% 0.64/0.95 ============================== INPUT =================================
% 0.64/0.95
% 0.64/0.95 % Reading from file /tmp/Prover9_2665_n026.cluster.edu
% 0.64/0.95
% 0.64/0.95 set(prolog_style_variables).
% 0.64/0.95 set(auto2).
% 0.64/0.95 % set(auto2) -> set(auto).
% 0.64/0.95 % set(auto) -> set(auto_inference).
% 0.64/0.95 % set(auto) -> set(auto_setup).
% 0.64/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.64/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.64/0.95 % set(auto) -> set(auto_limits).
% 0.64/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.64/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.64/0.95 % set(auto) -> set(auto_denials).
% 0.64/0.95 % set(auto) -> set(auto_process).
% 0.64/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.64/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.64/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.64/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.64/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.64/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.64/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.64/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.64/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.64/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.64/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.64/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.64/0.95 % set(auto2) -> assign(stats, some).
% 0.64/0.95 % set(auto2) -> clear(echo_input).
% 0.64/0.95 % set(auto2) -> set(quiet).
% 0.64/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.64/0.95 % set(auto2) -> clear(print_given).
% 0.64/0.95 assign(lrs_ticks,-1).
% 0.64/0.95 assign(sos_limit,10000).
% 0.64/0.95 assign(order,kbo).
% 0.64/0.95 set(lex_order_vars).
% 0.64/0.95 clear(print_given).
% 0.64/0.95
% 0.64/0.95 % formulas(sos). % not echoed (45 formulas)
% 0.64/0.95
% 0.64/0.95 ============================== end of input ==========================
% 0.64/0.95
% 0.64/0.95 % From the command line: assign(max_seconds, 300).
% 0.64/0.95
% 0.64/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.64/0.95
% 0.64/0.95 % Formulas that are not ordinary clauses:
% 0.64/0.95 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 2 (all A (empty(A) -> finite(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 3 (all A (rel_str(A) -> (empty_carrier(A) -> v1_yellow_3(A)))) # label(cc1_yellow_3) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 4 (all A (finite(A) -> (all B (element(B,powerset(A)) -> finite(B))))) # label(cc2_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 5 (all A (rel_str(A) -> (-v1_yellow_3(A) -> -empty_carrier(A)))) # label(cc2_yellow_3) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 6 (all A (rel_str(A) -> (-empty_carrier(A) & reflexive_relstr(A) -> -empty_carrier(A) & -v1_yellow_3(A)))) # label(cc3_yellow_3) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 7 (all A (rel_str(A) -> bottom_of_relstr(A) = join_on_relstr(A,empty_set))) # label(d11_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 8 (all A (rel_str(A) -> (all B (element(B,powerset(the_carrier(A))) -> (upper_relstr_subset(B,A) <-> (all C (element(C,the_carrier(A)) -> (all D (element(D,the_carrier(A)) -> (in(C,B) & related(A,C,D) -> in(D,B))))))))))) # label(d20_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 9 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 10 (all A all B (rel_str(A) -> element(join_on_relstr(A,B),the_carrier(A)))) # label(dt_k1_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 11 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 12 (all A (rel_str(A) -> element(bottom_of_relstr(A),the_carrier(A)))) # label(dt_k3_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 13 (all A (rel_str(A) -> one_sorted_str(A))) # label(dt_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 14 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 15 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 16 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 17 (exists A rel_str(A)) # label(existence_l1_orders_2) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 18 (exists A one_sorted_str(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 19 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 20 (all A (-empty_carrier(A) & one_sorted_str(A) -> -empty(the_carrier(A)))) # label(fc1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 21 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 22 (all A (-empty_carrier(A) & reflexive_relstr(A) & transitive_relstr(A) & rel_str(A) -> (exists B (element(B,powerset(the_carrier(A))) & -empty(B) & filtered_subset(B,A) & upper_relstr_subset(B,A))))) # label(rc10_waybel_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 23 (exists A (-empty(A) & finite(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 24 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 25 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 26 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 27 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 28 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc3_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 29 (exists A (one_sorted_str(A) & -empty_carrier(A))) # label(rc3_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 30 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc4_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 31 (all A (-empty_carrier(A) & one_sorted_str(A) -> (exists B (element(B,powerset(the_carrier(A))) & -empty(B))))) # label(rc5_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 32 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 33 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 34 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 35 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 36 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 37 (all A (-empty_carrier(A) & antisymmetric_relstr(A) & lower_bounded_relstr(A) & rel_str(A) -> (all B (element(B,the_carrier(A)) -> related(A,bottom_of_relstr(A),B))))) # label(t44_yellow_0) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 38 (all A all B all C (in(A,B) & element(B,powerset(C)) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 39 (all A all B all C -(in(A,B) & element(B,powerset(C)) & empty(C))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 40 (all A all B (element(B,powerset(A)) -> (proper_element(B,powerset(A)) <-> B != A))) # label(t5_tex_2) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 41 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 42 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 43 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.64/0.95 44 -(all A (-empty_carrier(A) & reflexive_relstr(A) & transitive_relstr(A) & antisymmetric_relstr(A) & lower_bounded_relstr(A) & rel_str(A) -> (all B (-empty(B) & filtered_subset(B,A) & upper_relstr_subset(B,A) & element(B,powerset(the_carrier(A))) -> (proper_element(B,powerset(the_carrier(A))) <-> -in(bottom_of_relstr(A),B)))))) # label(t8_waybel_7) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.64/0.95
% 0.64/0.95 ============================== end of process non-clausal formulas ===
% 0.64/0.95
% 0.64/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.64/0.95
% 0.64/0.95 ============================== PREDICATE ELIMINATION =================
% 0.64/0.95 45 -rel_str(A) | one_sorted_str(A) # label(dt_l1_orders_2) # label(axiom). [clausify(13)].
% 0.64/0.95 46 rel_str(c1) # label(existence_l1_orders_2) # label(axiom). [clausify(17)].
% 0.64/0.95 47 rel_str(c7) # label(t8_waybel_7) # label(negated_conjecture). [clausify(44)].
% 0.64/0.95 Derived: one_sorted_str(c1). [resolve(45,a,46,a)].
% 0.64/0.95 Derived: one_sorted_str(c7). [resolve(45,a,47,a)].
% 0.64/0.95 48 -rel_str(A) | -empty_carrier(A) | v1_yellow_3(A) # label(cc1_yellow_3) # label(axiom). [clausify(3)].
% 0.64/0.95 Derived: -empty_carrier(c1) | v1_yellow_3(c1). [resolve(48,a,46,a)].
% 0.64/0.95 Derived: -empty_carrier(c7) | v1_yellow_3(c7). [resolve(48,a,47,a)].
% 0.64/0.95 49 -rel_str(A) | v1_yellow_3(A) | -empty_carrier(A) # label(cc2_yellow_3) # label(axiom). [clausify(5)].
% 0.64/0.95 50 -rel_str(A) | element(bottom_of_relstr(A),the_carrier(A)) # label(dt_k3_yellow_0) # label(axiom). [clausify(12)].
% 0.64/0.95 Derived: element(bottom_of_relstr(c1),the_carrier(c1)). [resolve(50,a,46,a)].
% 0.64/0.95 Derived: element(bottom_of_relstr(c7),the_carrier(c7)). [resolve(50,a,47,a)].
% 0.64/0.95 51 -rel_str(A) | empty_carrier(A) | -reflexive_relstr(A) | -v1_yellow_3(A) # label(cc3_yellow_3) # label(axiom). [clausify(6)].
% 0.64/0.95 Derived: empty_carrier(c1) | -reflexive_relstr(c1) | -v1_yellow_3(c1). [resolve(51,a,46,a)].
% 0.64/0.95 Derived: empty_carrier(c7) | -reflexive_relstr(c7) | -v1_yellow_3(c7). [resolve(51,a,47,a)].
% 0.64/0.95 52 -rel_str(A) | join_on_relstr(A,empty_set) = bottom_of_relstr(A) # label(d11_yellow_0) # label(axiom). [clausify(7)].
% 0.64/0.95 Derived: join_on_relstr(c1,empty_set) = bottom_of_relstr(c1). [resolve(52,a,46,a)].
% 0.64/0.95 Derived: join_on_relstr(c7,empty_set) = bottom_of_relstr(c7). [resolve(52,a,47,a)].
% 0.64/0.95 53 -rel_str(A) | element(join_on_relstr(A,B),the_carrier(A)) # label(dt_k1_yellow_0) # label(axiom). [clausify(10)].
% 0.64/0.95 Derived: element(join_on_relstr(c1,A),the_carrier(c1)). [resolve(53,a,46,a)].
% 0.64/0.95 Derived: element(join_on_relstr(c7,A),the_carrier(c7)). [resolve(53,a,47,a)].
% 0.64/0.95 54 empty_carrier(A) | -reflexive_relstr(A) | -transitive_relstr(A) | -rel_str(A) | -empty(f4(A)) # label(rc10_waybel_0) # label(axiom). [clausify(22)].
% 0.64/0.95 Derived: empty_carrier(c1) | -reflexive_relstr(c1) | -transitive_relstr(c1) | -empty(f4(c1)). [resolve(54,d,46,a)].
% 0.64/0.95 Derived: empty_carrier(c7) | -reflexive_relstr(c7) | -transitive_relstr(c7) | -empty(f4(c7)). [resolve(54,d,47,a)].
% 0.64/0.95 55 empty_carrier(A) | -reflexive_relstr(A) | -transitive_relstr(A) | -rel_str(A) | filtered_subset(f4(A),A) # label(rc10_waybel_0) # label(axiom). [clausify(22)].
% 0.64/0.95 Derived: empty_carrier(c1) | -reflexive_relstr(c1) | -transitive_relstr(c1) | filtered_subset(f4(c1),c1). [resolve(55,d,46,a)].
% 0.64/0.95 Derived: empty_carrier(c7) | -reflexive_relstr(c7) | -transitive_relstr(c7) | filtered_subset(f4(c7),c7). [resolve(55,d,47,a)].
% 0.64/0.95 56 empty_carrier(A) | -reflexive_relstr(A) | -transitive_relstr(A) | -rel_str(A) | upper_relstr_subset(f4(A),A) # label(rc10_waybel_0) # label(axiom). [clausify(22)].
% 0.64/0.95 Derived: empty_carrier(c1) | -reflexive_relstr(c1) | -transitive_relstr(c1) | upper_relstr_subset(f4(c1),c1). [resolve(56,d,46,a)].
% 0.64/0.95 Derived: empty_carrier(c7) | -reflexive_relstr(c7) | -transitive_relstr(c7) | upper_relstr_subset(f4(c7),c7). [resolve(56,d,47,a)].
% 0.64/0.95 57 empty_carrier(A) | -reflexive_relstr(A) | -transitive_relstr(A) | -rel_str(A) | element(f4(A),powerset(the_carrier(A))) # label(rc10_waybel_0) # label(axiom). [clausify(22)].
% 0.64/0.95 Derived: empty_carrier(c1) | -reflexive_relstr(c1) | -transitive_relstr(c1) | element(f4(c1),powerset(the_carrier(c1))). [resolve(57,d,46,a)].
% 0.64/0.95 Derived: empty_carrier(c7) | -reflexive_relstr(c7) | -transitive_relstr(c7) | element(f4(c7),powerset(the_carrier(c7))). [resolve(57,d,47,a)].
% 0.64/0.95 58 -rel_str(A) | -element(B,powerset(the_carrier(A))) | upper_relstr_subset(B,A) | in(f1(A,B),B) # label(d20_waybel_0) # label(axiom). [clausify(8)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c1))) | upper_relstr_subset(A,c1) | in(f1(c1,A),A). [resolve(58,a,46,a)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c7))) | upper_relstr_subset(A,c7) | in(f1(c7,A),A). [resolve(58,a,47,a)].
% 0.64/0.95 59 -rel_str(A) | -element(B,powerset(the_carrier(A))) | upper_relstr_subset(B,A) | -in(f2(A,B),B) # label(d20_waybel_0) # label(axiom). [clausify(8)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c1))) | upper_relstr_subset(A,c1) | -in(f2(c1,A),A). [resolve(59,a,46,a)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c7))) | upper_relstr_subset(A,c7) | -in(f2(c7,A),A). [resolve(59,a,47,a)].
% 0.64/0.95 60 -rel_str(A) | -element(B,powerset(the_carrier(A))) | upper_relstr_subset(B,A) | element(f1(A,B),the_carrier(A)) # label(d20_waybel_0) # label(axiom). [clausify(8)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c1))) | upper_relstr_subset(A,c1) | element(f1(c1,A),the_carrier(c1)). [resolve(60,a,46,a)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c7))) | upper_relstr_subset(A,c7) | element(f1(c7,A),the_carrier(c7)). [resolve(60,a,47,a)].
% 0.64/0.95 61 -rel_str(A) | -element(B,powerset(the_carrier(A))) | upper_relstr_subset(B,A) | element(f2(A,B),the_carrier(A)) # label(d20_waybel_0) # label(axiom). [clausify(8)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c1))) | upper_relstr_subset(A,c1) | element(f2(c1,A),the_carrier(c1)). [resolve(61,a,46,a)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c7))) | upper_relstr_subset(A,c7) | element(f2(c7,A),the_carrier(c7)). [resolve(61,a,47,a)].
% 0.64/0.95 62 empty_carrier(A) | -antisymmetric_relstr(A) | -lower_bounded_relstr(A) | -rel_str(A) | -element(B,the_carrier(A)) | related(A,bottom_of_relstr(A),B) # label(t44_yellow_0) # label(axiom). [clausify(37)].
% 0.64/0.95 Derived: empty_carrier(c1) | -antisymmetric_relstr(c1) | -lower_bounded_relstr(c1) | -element(A,the_carrier(c1)) | related(c1,bottom_of_relstr(c1),A). [resolve(62,d,46,a)].
% 0.64/0.95 Derived: empty_carrier(c7) | -antisymmetric_relstr(c7) | -lower_bounded_relstr(c7) | -element(A,the_carrier(c7)) | related(c7,bottom_of_relstr(c7),A). [resolve(62,d,47,a)].
% 0.64/0.95 63 -rel_str(A) | -element(B,powerset(the_carrier(A))) | upper_relstr_subset(B,A) | related(A,f1(A,B),f2(A,B)) # label(d20_waybel_0) # label(axiom). [clausify(8)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c1))) | upper_relstr_subset(A,c1) | related(c1,f1(c1,A),f2(c1,A)). [resolve(63,a,46,a)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c7))) | upper_relstr_subset(A,c7) | related(c7,f1(c7,A),f2(c7,A)). [resolve(63,a,47,a)].
% 0.64/0.95 64 -rel_str(A) | -element(B,powerset(the_carrier(A))) | -upper_relstr_subset(B,A) | -element(C,the_carrier(A)) | -element(D,the_carrier(A)) | -in(C,B) | -related(A,C,D) | in(D,B) # label(d20_waybel_0) # label(axiom). [clausify(8)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c1))) | -upper_relstr_subset(A,c1) | -element(B,the_carrier(c1)) | -element(C,the_carrier(c1)) | -in(B,A) | -related(c1,B,C) | in(C,A). [resolve(64,a,46,a)].
% 0.64/0.95 Derived: -element(A,powerset(the_carrier(c7))) | -upper_relstr_subset(A,c7) | -element(B,the_carrier(c7)) | -element(C,the_carrier(c7)) | -in(B,A) | -related(c7,B,C) | in(C,A). [resolve(64,a,47,a)].
% 0.64/0.95 65 empty_carrier(A) | -one_sorted_str(A) | -empty(the_carrier(A)) # label(fc1_struct_0) # label(axiom). [clausify(20)].
% 0.64/0.95 66 one_sorted_str(c2) # label(existence_l1_struct_0) # label(axiom). [clausify(18)].
% 0.64/0.95 67 one_sorted_str(c6) # label(rc3_struct_0) # label(axiom). [clausify(29)].
% 0.64/0.95 Derived: empty_carrier(c2) | -empty(the_carrier(c2)). [resolve(65,b,66,a)].
% 0.64/0.95 Derived: empty_carrier(c6) | -empty(the_carrier(c6)). [resolve(65,b,67,a)].
% 0.64/0.95 68 empty_carrier(A) | -one_sorted_str(A) | -empty(f9(A)) # label(rc5_struct_0) # label(axiom). [clausify(31)].
% 0.64/0.95 Derived: empty_carrier(c2) | -empty(f9(c2)). [resolve(68,b,66,a)].
% 0.64/0.95 Derived: empty_carrier(c6) | -empty(f9(c6)). [resolve(68,b,67,a)].
% 0.64/0.95 69 empty_carrier(A) | -one_sorted_str(A) | element(f9(A),powerset(the_carrier(A))) # label(rc5_struct_0) # label(axiom). [clausify(31)].
% 0.64/0.95 Derived: empty_carrier(c2) | element(f9(c2),powerset(the_carrier(c2))). [resolve(69,b,66,a)].
% 0.64/0.95 Derived: empty_carrier(c6) | element(f9(c6),powerset(the_carrier(cCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------