TSTP Solution File: GRP637+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP637+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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 : Sat Jul 16 11:20:05 EDT 2022
% Result : Timeout 300.05s 300.29s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP637+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 05:34:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.45/1.01 ============================== Prover9 ===============================
% 0.45/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01 Process 17391 was started by sandbox2 on n010.cluster.edu,
% 0.45/1.01 Mon Jun 13 05:34:25 2022
% 0.45/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17238_n010.cluster.edu".
% 0.45/1.01 ============================== end of head ===========================
% 0.45/1.01
% 0.45/1.01 ============================== INPUT =================================
% 0.45/1.01
% 0.45/1.01 % Reading from file /tmp/Prover9_17238_n010.cluster.edu
% 0.45/1.01
% 0.45/1.01 set(prolog_style_variables).
% 0.45/1.01 set(auto2).
% 0.45/1.01 % set(auto2) -> set(auto).
% 0.45/1.01 % set(auto) -> set(auto_inference).
% 0.45/1.01 % set(auto) -> set(auto_setup).
% 0.45/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01 % set(auto) -> set(auto_limits).
% 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01 % set(auto) -> set(auto_denials).
% 0.45/1.01 % set(auto) -> set(auto_process).
% 0.45/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01 % set(auto2) -> assign(stats, some).
% 0.45/1.01 % set(auto2) -> clear(echo_input).
% 0.45/1.01 % set(auto2) -> set(quiet).
% 0.45/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01 % set(auto2) -> clear(print_given).
% 0.45/1.01 assign(lrs_ticks,-1).
% 0.45/1.01 assign(sos_limit,10000).
% 0.45/1.01 assign(order,kbo).
% 0.45/1.01 set(lex_order_vars).
% 0.45/1.01 clear(print_given).
% 0.45/1.01
% 0.45/1.01 % formulas(sos). % not echoed (55 formulas)
% 0.45/1.01
% 0.45/1.01 ============================== end of input ==========================
% 0.45/1.01
% 0.45/1.01 % From the command line: assign(max_seconds, 300).
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01
% 0.45/1.01 % Formulas that are not ordinary clauses:
% 0.45/1.01 1 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 2 (all A all B all C (m1_relset_1(C,A,B) -> (v1_funct_1(C) & v1_partfun1(C,A,B) -> v1_funct_1(C) & v1_funct_2(C,A,B)))) # label(cc1_funct_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 3 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B))) -> v1_relat_1(C))) # label(cc1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 4 (all A all B (-v1_xboole_0(B) -> (all C (m1_relset_1(C,A,B) -> (v1_funct_1(C) & v1_funct_2(C,A,B) -> v1_funct_1(C) & v1_partfun1(C,A,B) & v1_funct_2(C,A,B)))))) # label(cc5_funct_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 5 (all A all B (-v1_xboole_0(A) & -v1_xboole_0(B) -> (all C (m1_relset_1(C,A,B) -> (v1_funct_1(C) & v1_funct_2(C,A,B) -> v1_funct_1(C) & -v1_xboole_0(C) & v1_partfun1(C,A,B) & v1_funct_2(C,A,B)))))) # label(cc6_funct_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 6 (all A (-v3_struct_0(A) & v3_group_1(A) & l1_group_1(A) -> (all B (-v3_struct_0(B) & v3_group_1(B) & l1_group_1(B) -> (m1_group_2(B,A) <-> r1_tarski(u1_struct_0(B),u1_struct_0(A)) & u1_group_1(B) = k1_realset1(u1_group_1(A),u1_struct_0(B))))))) # label(d5_group_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 7 $T # label(dt_k1_realset1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 8 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 9 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 10 (all A all B all C all D (v1_funct_1(C) & v1_funct_2(C,A,B) & m1_relset_1(C,A,B) -> m1_subset_1(k2_funct_2(A,B,C,D),k1_zfmisc_1(B)))) # label(dt_k2_funct_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 11 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 12 $T # label(dt_k9_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 13 (all A (l1_group_1(A) -> l1_struct_0(A))) # label(dt_l1_group_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 14 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 15 (all A (-v3_struct_0(A) & v3_group_1(A) & l1_group_1(A) -> (all B (m1_group_2(B,A) -> -v3_struct_0(B) & v3_group_1(B) & l1_group_1(B))))) # label(dt_m1_group_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 16 (all A all B (-v3_struct_0(A) & v3_group_1(A) & v4_group_1(A) & l1_group_1(A) & m1_group_2(B,A) -> (all C (m1_group_6(C,A,B) -> m1_group_2(C,A))))) # label(dt_m1_group_6) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 17 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 18 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 19 (all A all B all C (m2_relset_1(C,A,B) -> m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B))))) # label(dt_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 20 (all A (l1_group_1(A) -> v1_funct_1(u1_group_1(A)) & v1_funct_2(u1_group_1(A),k2_zfmisc_1(u1_struct_0(A),u1_struct_0(A)),u1_struct_0(A)) & m2_relset_1(u1_group_1(A),k2_zfmisc_1(u1_struct_0(A),u1_struct_0(A)),u1_struct_0(A)))) # label(dt_u1_group_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 21 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 22 (exists A l1_group_1(A)) # label(existence_l1_group_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 23 (exists A l1_struct_0(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 24 (all A (-v3_struct_0(A) & v3_group_1(A) & l1_group_1(A) -> (exists B m1_group_2(B,A)))) # label(existence_m1_group_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 25 (all A all B (-v3_struct_0(A) & v3_group_1(A) & v4_group_1(A) & l1_group_1(A) & m1_group_2(B,A) -> (exists C m1_group_6(C,A,B)))) # label(existence_m1_group_6) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 26 (all A all B exists C m1_relset_1(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 27 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 28 (all A all B exists C m2_relset_1(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 29 (all A (-v3_struct_0(A) & l1_struct_0(A) -> -v1_xboole_0(u1_struct_0(A)))) # label(fc1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 30 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 31 (all A all B (-v1_xboole_0(A) & -v1_xboole_0(B) -> -v1_xboole_0(k2_zfmisc_1(A,B)))) # label(fc4_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 32 (all A all B exists C (m1_relset_1(C,A,B) & v1_relat_1(C) & v1_funct_1(C) & v1_funct_2(C,A,B))) # label(rc1_funct_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 33 (all A (-v1_xboole_0(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(A)) & -v1_xboole_0(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 34 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 35 (all A all B exists C (m1_relset_1(C,A,B) & v1_relat_1(C) & v1_funct_1(C))) # label(rc2_partfun1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 36 (all A exists B (m1_subset_1(B,k1_zfmisc_1(A)) & v1_xboole_0(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 37 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 38 (exists A (l1_struct_0(A) & -v3_struct_0(A))) # label(rc3_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 39 (all A (-v3_struct_0(A) & l1_struct_0(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))) & -v1_xboole_0(B))))) # label(rc5_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 40 (all A all B all C all D (v1_funct_1(C) & v1_funct_2(C,A,B) & m1_relset_1(C,A,B) -> k2_funct_2(A,B,C,D) = k9_relat_1(C,D))) # label(redefinition_k2_funct_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 41 (all A all B (-v3_struct_0(A) & v3_group_1(A) & v4_group_1(A) & l1_group_1(A) & m1_group_2(B,A) -> (all C (m1_group_6(C,A,B) <-> m1_group_2(C,B))))) # label(redefinition_m1_group_6) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 42 (all A all B all C (m2_relset_1(C,A,B) <-> m1_relset_1(C,A,B))) # label(redefinition_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 43 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 44 (all A all B all C (v1_relat_1(C) -> (r1_tarski(A,B) -> r1_tarski(k9_relat_1(C,A),k9_relat_1(C,B))))) # label(t156_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 45 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 46 (all A all B (m1_subset_1(A,B) -> v1_xboole_0(B) | r2_hidden(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 47 (all A all B (m1_subset_1(A,k1_zfmisc_1(B)) <-> r1_tarski(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 48 (all A all B all C (r2_hidden(A,B) & m1_subset_1(B,k1_zfmisc_1(C)) -> m1_subset_1(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 49 (all A all B all C -(r2_hidden(A,B) & m1_subset_1(B,k1_zfmisc_1(C)) & v1_xboole_0(C))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 50 (all A (-v3_struct_0(A) & v3_group_1(A) & v4_group_1(A) & l1_group_1(A) -> (all B (m1_group_2(B,A) -> (all C (m1_group_2(C,A) -> (r1_tarski(u1_struct_0(B),u1_struct_0(C)) -> m1_group_2(B,C)))))))) # label(t66_group_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 51 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 52 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 53 (all A all B -(v1_xboole_0(A) & A != B & v1_xboole_0(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 54 -(all A (-v3_struct_0(A) & v3_group_1(A) & v4_group_1(A) & l1_group_1(A) -> (all B (-v3_struct_0(B) & v3_group_1(B) & v4_group_1(B) & l1_group_1(B) -> (all C (v1_funct_1(C) & v1_funct_2(C,u1_struct_0(A),u1_struct_0(B)) & v1_group_6(C,A,B) & m2_relset_1(C,u1_struct_0(A),u1_struct_0(B)) -> (all D (m1_group_2(D,A) -> (all E (m1_group_2(E,A) -> (all F (m1_group_2(F,B) -> (all G (m1_group_2(G,B) -> (u1_struct_0(F) = k2_funct_2(u1_struct_0(A),u1_struct_0(B),C,u1_struct_0(D)) & u1_struct_0(G) = k2_funct_2(u1_struct_0(A),u1_struct_0(B),C,u1_struct_0(E)) & m1_group_6(D,A,E) -> m1_group_6(F,B,G)))))))))))))))) # label(t10_latsubgr) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.01
% 0.45/1.01 ============================== end of process non-clausal formulas ===
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.01
% 0.45/1.01 ============================== PREDICATE ELIMINATION =================
% 0.45/1.01 55 v3_struct_0(A) | -l1_struct_0(A) | -v1_xboole_0(u1_struct_0(A)) # label(fc1_struct_0) # label(axiom). [clausify(29)].
% 0.45/1.01 56 l1_struct_0(c2) # label(existence_l1_struct_0) # label(axiom). [clausify(23)].
% 0.45/1.01 57 l1_struct_0(c5) # label(rc3_struct_0) # label(axiom). [clausify(38)].
% 0.45/1.01 58 -l1_group_1(A) | l1_struct_0(A) # label(dt_l1_group_1) # label(axiom). [clausify(13)].
% 0.45/1.01 Derived: v3_struct_0(c2) | -v1_xboole_0(u1_struct_0(c2)). [resolve(55,b,56,a)].
% 0.45/1.01 Derived: v3_struct_0(c5) | -v1_xboole_0(u1_struct_0(c5)). [resolve(55,b,57,a)].
% 0.45/1.01 Derived: v3_struct_0(A) | -v1_xboole_0(u1_struct_0(A)) | -l1_group_1(A). [resolve(55,b,58,b)].
% 0.45/1.01 59 v3_struct_0(A) | -l1_struct_0(A) | -v1_xboole_0(f10(A)) # label(rc5_struct_0) # label(axiom). [clausify(39)].
% 0.45/1.01 Derived: v3_struct_0(c2) | -v1_xboole_0(f10(c2)). [resolve(59,b,56,a)].
% 0.45/1.01 Derived: v3_struct_0(c5) | -v1_xboole_0(f10(c5)). [resolve(59,b,57,a)].
% 0.45/1.01 Derived: v3_struct_0(A) | -v1_xboole_0(f10(A)) | -l1_group_1(A). [resolve(59,b,58,b)].
% 0.45/1.01 60 v3_struct_0(A) | -l1_struct_0(A) | m1_subset_1(f10(A),k1_zfmisc_1(u1_struct_0(A))) # label(rc5_struct_0) # label(axiom). [clausify(39)].
% 0.45/1.01 Derived: v3_struct_0(c2) | m1_subset_1(f10(c2),k1_zfmisc_1(u1_struct_0(c2))). [resolve(60,b,56,a)].
% 0.45/1.01 Derived: v3_struct_0(c5) | m1_subset_1(f10(c5),k1_zfmisc_1(u1_struct_0(c5))). [resolve(60,b,57,a)].
% 0.45/1.01 Derived: v3_struct_0(A) | m1_subset_1(f10(A),k1_zfmisc_1(u1_struct_0(A))) | -l1_group_1(A). [resolve(60,b,58,b)].
% 0.45/1.01 61 v3_struct_0(A) | -v3_group_1(A) | -v4_group_1(A) | -l1_group_1(A) | -m1_group_2(B,A) | m1_group_6(f2(A,B),A,B) # label(existence_m1_group_6) # label(axiom). [clausify(25)].
% 0.45/1.01 62 v4_group_1(c6) # label(t10_latsubgr) # label(negated_conjecture). [clausify(54)].
% 0.45/1.01 63 v4_group_1(c7) # label(t10_latsubgr) # label(negated_conjecture). [clausify(54)].
% 0.45/1.01 Derived: v3_struct_0(c6) | -v3_group_1(c6) | -l1_group_1(c6) | -m1_group_2(A,c6) | m1_group_6(f2(c6,A),c6,A). [resolve(61,c,62,a)].
% 0.45/1.01 Derived: v3_struct_0(c7) | -v3_group_1(c7) | -l1_group_1(c7) | -m1_group_2(A,c7) | m1_group_6(f2(c7,A),c7,A). [resolve(61,c,63,a)].
% 0.45/1.01 64 v3_struct_0(A) | -v3_group_1(A) | -v4_group_1(A) | -l1_group_1(A) | -m1_group_2(B,A) | -m1_group_6(C,A,B) | m1_group_2(C,A) # label(dt_m1_group_6) # label(axiom). [clausify(16)].
% 0.45/1.01 Derived: v3_struct_0(c6) | -v3_group_1(c6) | -l1_group_1(c6) | -m1_group_2(A,c6) | -m1_group_6(B,c6,A) | m1_group_2(B,c6). [resolve(64,c,62,a)].
% 0.45/1.01 Derived: v3_struct_0(c7) | -v3_group_1(c7) | -l1_group_1(c7) | -m1_group_2(A,c7) | -m1_group_6(B,c7,A) | m1_group_2(B,c7). [resolve(64,c,63,a)].
% 0.45/1.01 65 v3_struct_0(A) | -v3_group_1(A) | -v4_group_1(A) | -l1_group_1(A) | -m1_group_2(B,A) | -m1_group_6(C,A,B) | m1_group_2(C,B) # label(redefinition_m1_group_6) # label(axiom). [clausify(41)].
% 0.45/1.01 Derived: v3_struct_0(c6) | -v3_group_1(c6) | -l1_group_1(c6) | -m1_group_2(A,c6) | -m1_group_6(B,c6,A) | m1_group_2(B,A). [resolve(65,c,62,a)].
% 0.45/1.01 Derived: v3_struct_0(c7) | -v3_group_1(c7) | -l1_group_1(c7) | -m1_group_2(A,c7) | -m1_group_6(B,c7,A) | m1_group_2(B,A). [resolve(65,c,63,a)].
% 0.45/1.01 66 v3_struct_0(A) | -v3_group_1(A) | -v4_group_1(A) | -l1_group_1(A) | -m1_group_2(B,A) | m1_group_6(C,A,B) | -m1_group_2(C,B) # label(redefinition_m1_group_6) # label(axiom). [clausify(41)].
% 0.45/1.01 Derived: v3_struct_0(c6) | -v3_group_1(c6) | -l1_group_1(c6) | -m1_group_2(A,c6) | m1_group_6(B,c6,A) | -m1_group_2(B,A). [resolve(66,c,62,a)].
% 0.45/1.01 Derived: v3_struct_0(c7) | -v3_group_1(c7) | -l1_group_1(c7) | -m1_group_2(A,c7) | m1_group_6(B,c7,A) | -m1_group_2(B,A). [resolve(66,c,63,a)].
% 0.45/1.01 67 v3_struct_0(A) | -v3_group_1(A) | -v4_group_1(A) | -l1_group_1(A) | -m1_group_2(B,A) | -m1_group_2(C,A) | -r1_tarski(u1_struct_0(B),u1_struct_0(C)) | m1_group_2(B,C) # label(t66_group_2) # label(axiom). [clausify(50)].
% 0.45/1.01 Derived: v3_struct_0(c6) | -v3_group_1(c6) | -l1_group_1(c6) | -m1_group_2(A,c6) | -m1_group_2(B,c6) | -r1_tarski(u1_struct_0(A),u1_struct_0(B)) | m1_group_2(A,B). [resolve(67,c,62,a)].
% 0.45/1.01 Derived: v3_struct_0(c7) | -v3_group_1(c7) | -l1_group_1(c7) | -m1_group_2(A,c7) | -m1_group_2(B,c7) | -r1_tarski(u1_struct_0(A),u1_struct_0(B)) | m1_group_2(A,B). [resolve(67,c,63,a)].
% 0.45/1.01 68 -m1_relset_1(A,B,C) | -v1_funct_1(A) | -v1_partfun1(A,B,C) | v1_funct_2(A,B,C) # label(cc1_funct_2) # label(axiom). [clausify(2)].
% 0.45/1.01 69 v1_funct_1(c8) # label(t10_latsubgr) # label(negated_conjecture). [clausify(54)].
% 0.45/1.01 70 v1_funct_1(f6(A,B)) # label(rc1_funct_2) # label(axiom). [clausify(32)].
% 0.45/1.01 71 v1_funct_1(f8(A,B)) # label(rc2_partfun1) # label(axiom). [clausify(35)].
% 0.45/1.01 72 -l1_group_1(A) | v1_funct_1(u1_group_1(A)) # label(dt_u1_group_1) # label(axiom). [clausify(20)].
% 0.45/1.01 Derived: -m1_relset_1(c8,A,B) | -v1_partfun1(c8,A,B) | v1_funct_2(c8,A,B). [resolve(68,b,69,a)].
% 0.45/1.01 Derived: -m1_relset_1(f6(A,B),C,D) | -v1_partfun1(f6(A,B),C,D) | v1_funct_2(f6(A,B),C,D). [resolve(68,b,70,a)].
% 0.45/1.01 Derived: -m1_relset_1(f8(A,B),C,D) | -v1_partfun1(f8(A,B),C,D) | v1_funct_2(f8(A,B),C,D). [resolve(68,b,71,a)].
% 0.45/1.01 Derived: -m1_relset_1(u1_group_1(A),B,C) | -v1_partfun1(u1_group_1(A),B,C) | v1_funct_2(u1_group_1(A),B,C) | -l1_group_1(A). [resolve(68,b,72,b)].
% 0.45/1.01 73 v1_xboole_0(A) | -m1_relset_1(B,C,A) | -v1_funct_1(B) | -v1_funct_2(B,C,A) | v1_partfun1(B,C,A) # label(cc5_funct_2) # label(axiom). [clausify(4)].
% 0.45/1.01 Derived: v1_xboole_0(A) | -m1_relset_1(c8,B,A) | -v1_funct_2(c8,B,A) | v1_partfun1(c8,B,A). [resolve(73,c,69,a)].
% 0.76/1.01 Derived: v1_xboole_0(A) | -m1_relset_1(f6(B,C),D,A) | -v1_funct_2(f6(B,C),D,A) | v1_partfun1(f6(B,C),D,A). [resolve(73,c,70,a)].
% 0.76/1.01 Derived: v1_xboole_0(A) | -m1_relset_1(f8(B,C),D,A) | -v1_funct_2(f8(B,C),D,A) | v1_partfun1(f8(B,C),D,A). [resolve(73,c,71,a)].
% 0.76/1.01 Derived: v1_xboole_0(A) | -m1_relset_1(u1_group_1(B),C,A) | -v1_funct_2(u1_group_1(B),C,A) | v1_partfun1(u1_group_1(B),C,A) | -l1_group_1(B). [resolve(73,c,72,b)].
% 0.76/1.01 74 v1_xboole_0(A) | v1_xboole_0(B) | -m1_relset_1(C,A,B) | -v1_funct_1(C) | -v1_funct_2(C,A,B) | -v1_xboole_0(C) # label(cc6_funct_2) # label(axiom). [clausify(5)].
% 0.76/1.01 Derived: v1_xboole_0(A) | v1_xboole_0(B) | -m1_relset_1(c8,A,B) | -v1_funct_2(c8,A,B) | -v1_xboole_0(c8). [resolve(74,d,69,a)].
% 0.76/1.01 Derived: v1_xboole_0(A) | v1_xboole_0(B) | -m1_relset_1(f6(C,D),A,B) | -v1_funct_2(f6(C,D),A,B) | -v1_xboole_0(f6(C,D)). [resolve(74,d,70,a)].
% 0.76/1.01 Derived: v1_xboole_0(A) | v1_xboole_0(B) | -m1_relset_1(f8(C,D),A,B) | -v1_funct_2(f8(C,D),A,B) | -v1_xboole_0(f8(C,D)). [resolve(74,d,71,a)].
% 0.76/1.01 Derived: v1_xboole_0(A) | v1_xboole_0(B) | -m1_relset_1(u1_group_1(C),A,B) | -v1_funct_2(u1_group_1(C),A,B) | -v1_xboole_0(u1_group_1(C)) | -l1_group_1(C). [resolve(74,d,72,b)].
% 0.76/1.01 75 v1_xboole_0(A) | v1_xboole_0(B) | -m1_relset_1(C,A,B) | -v1_funct_1(C) | -v1_funct_2(C,A,B) | v1_partfun1(C,A,B) # label(cc6_funct_2) # label(axiom). [clausify(5)].
% 0.76/1.01 76 -v1_funct_1(A) | -v1_funct_2(A,B,C) | -m1_relset_1(A,B,C) | m1_subset_1(k2_funct_2(B,C,A,D),k1_zfmisc_1(C)) # label(dt_k2_funct_2) # label(axiom). [clausify(10)].
% 0.76/1.01 Derived: -v1_funct_2(c8,A,B) | -m1_relset_1(c8,A,B) | m1_subset_1(k2_funct_2(A,B,c8,C),k1_zfmisc_1(B)). [resolve(76,a,69,a)].
% 0.76/1.01 Derived: -v1_funct_2(f6(A,B),C,D) | -m1_relset_1(f6(A,B),C,D) | m1_subset_1(k2_funct_2(C,D,f6(A,B),E),k1_zfmisc_1(D)). [resolve(76,a,70,a)].
% 0.76/1.01 Derived: -v1_funct_2(f8(A,B),C,D) | -m1_relset_1(f8(A,B),C,D) | m1_subset_1(k2_funct_2(C,D,f8(A,B),E),k1_zfmisc_1(D)). [resolve(76,a,71,a)].
% 0.76/1.01 Derived: -v1_funct_2(u1_group_1(A),B,C) | -m1_relset_1(u1_group_1(A),B,C) | m1_subset_1(k2_funct_2(B,C,u1_group_1(A),D),k1_zfmisc_1(C)) | -l1_group_1(A). [resolve(76,a,72,b)].
% 0.76/1.02 77 -v1_funct_1(A) | -v1_funct_2(A,B,C) | -m1_relset_1(A,B,C) | k9_relat_1(A,D) = k2_funct_2(B,C,A,D) # label(redefinition_k2_funct_2) # label(axiom). [clausify(40)].
% 0.76/1.02 Derived: -v1_funct_2(c8,A,B) | -m1_relset_1(c8,A,B) | k9_relat_1(c8,C) = k2_funct_2(A,B,c8,C). [resolve(77,a,69,a)].
% 0.76/1.02 Derived: -v1_funct_2(f6(A,B),C,D) | -m1_relset_1(f6(A,B),C,D) | k9_relat_1(f6(A,B),E) = k2_funct_2(C,D,f6(A,B),E). [resolve(77,a,70,a)].
% 0.76/1.02 Derived: -v1_funct_2(f8(A,B),C,D) | -m1_relset_1(f8(A,B),C,D) | k9_relat_1(f8(A,B),E) = k2_funct_2(C,D,f8(A,B),E). [resolve(77,a,71,a)].
% 0.76/1.02 Derived: -v1_funct_2(u1_group_1(A),B,C) | -m1_relset_1(u1_group_1(A),B,C) | k9_relat_1(u1_group_1(A),D) = k2_funct_2(B,C,u1_group_1(A),D) | -l1_group_1(A). [resolve(77,a,72,b)].
% 0.76/1.02 78 -v1_relat_1(A) | -r1_tarski(B,C) | r1_tarski(k9_relat_1(A,B),k9_relat_1(A,C)) # label(t156_relat_1) # label(axiom). [clausify(44)].
% 0.76/1.02 79 v1_relat_1(f6(A,B)) # label(rc1_funct_2) # label(axiom). [clausify(32)].
% 0.76/1.02 80 v1_relat_1(f8(A,B)) # label(rc2_partfun1) # label(axiom). [clausify(35)].
% 0.76/1.02 81 -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | v1_relat_1(A) # label(cc1_relset_1) # label(axiom). [clausify(3)].
% 0.76/1.02 Derived: -r1_tarski(A,B) | r1_tarski(k9_relat_1(f6(C,D),A),k9_relat_1(f6(C,D),B)). [resolve(78,a,79,a)].
% 0.76/1.02 Derived: -r1_tarski(A,B) | r1_tarski(k9_relat_1(f8(C,D),A),k9_relat_1(f8(C,D),B)). [resolve(78,a,80,a)].
% 0.76/1.02 Derived: -r1_tarski(A,B) | r1_tarski(k9_relat_1(C,A),k9_relat_1(C,B)) | -m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(D,E))). [resolve(78,a,81,b)].
% 0.76/1.02 82 -m2_relset_1(A,B,C) | m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(42)].
% 0.76/1.02 83 m2_relset_1(f5(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(28)].
% 0.76/1.02 84 m2_relset_1(c8,u1_struct_0(c6),u1_struct_0(c7)) # label(t10_latsubgr) # label(negated_conjecture). [clausify(54)].
% 0.76/1.02 Derived: m1_relset_1(f5(A,B),A,B). [resolve(82,a,83,a)].
% 0.76/1.02 Derived: m1_relset_1(c8,u1_struct_0(c6),u1_stCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------