TSTP Solution File: CAT031+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CAT031+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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 : Fri Jul 15 00:06:23 EDT 2022
% Result : Timeout 300.03s 300.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CAT031+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 00:33:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.06 ============================== Prover9 ===============================
% 0.41/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.06 Process 5417 was started by sandbox on n028.cluster.edu,
% 0.41/1.06 Mon May 30 00:33:49 2022
% 0.41/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5264_n028.cluster.edu".
% 0.41/1.06 ============================== end of head ===========================
% 0.41/1.06
% 0.41/1.06 ============================== INPUT =================================
% 0.41/1.06
% 0.41/1.06 % Reading from file /tmp/Prover9_5264_n028.cluster.edu
% 0.41/1.06
% 0.41/1.06 set(prolog_style_variables).
% 0.41/1.06 set(auto2).
% 0.41/1.06 % set(auto2) -> set(auto).
% 0.41/1.06 % set(auto) -> set(auto_inference).
% 0.41/1.06 % set(auto) -> set(auto_setup).
% 0.41/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.06 % set(auto) -> set(auto_limits).
% 0.41/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.06 % set(auto) -> set(auto_denials).
% 0.41/1.06 % set(auto) -> set(auto_process).
% 0.41/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.06 % set(auto2) -> assign(stats, some).
% 0.41/1.06 % set(auto2) -> clear(echo_input).
% 0.41/1.06 % set(auto2) -> set(quiet).
% 0.41/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.06 % set(auto2) -> clear(print_given).
% 0.41/1.06 assign(lrs_ticks,-1).
% 0.41/1.06 assign(sos_limit,10000).
% 0.41/1.06 assign(order,kbo).
% 0.41/1.06 set(lex_order_vars).
% 0.41/1.06 clear(print_given).
% 0.41/1.06
% 0.41/1.06 % formulas(sos). % not echoed (65 formulas)
% 0.41/1.06
% 0.41/1.06 ============================== end of input ==========================
% 0.41/1.06
% 0.41/1.06 % From the command line: assign(max_seconds, 300).
% 0.41/1.06
% 0.41/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.06
% 0.41/1.06 % Formulas that are not ordinary clauses:
% 0.41/1.06 1 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 2 (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.41/1.06 3 (all A all B k2_tarski(A,B) = k2_tarski(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 4 (all A (v2_cat_1(A) & l1_cat_1(A) -> (all B (v2_cat_1(B) & l1_cat_1(B) -> (all C (v2_cat_1(C) & l1_cat_1(C) -> (all D (m2_cat_1(D,A,B) -> (all E (m2_cat_1(E,A,B) -> (all F (m2_cat_1(F,A,C) -> (all G (m2_cat_1(G,A,C) -> (r1_nattra_1(A,B,D,E) & r1_nattra_1(A,C,F,G) -> (all H (m1_nattra_1(H,A,B,D,E) -> (all I (m1_nattra_1(I,A,C,F,G) -> k15_isocat_2(A,B,C,D,E,F,G,H,I) = k14_funct_3(u1_cat_1(A),u2_cat_1(B),u2_cat_1(C),H,I)))))))))))))))))))) # label(d11_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 5 (all A (v2_cat_1(A) & l1_cat_1(A) -> (all B (v2_cat_1(B) & l1_cat_1(B) -> (all C (m2_cat_1(C,A,B) -> (all D (m2_cat_1(D,A,B) -> (r1_nattra_1(A,B,C,D) -> (all E (m1_nattra_1(E,A,B,C,D) -> (all F (m1_subset_1(F,u1_cat_1(A)) -> k5_nattra_1(A,B,C,D,E,F) = k8_funct_2(u1_cat_1(A),u2_cat_1(B),E,F)))))))))))))) # label(d5_nattra_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 6 (all A all B k4_tarski(A,B) = k2_tarski(k2_tarski(A,B),k1_tarski(A))) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 7 (all A all B all C all D all E (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) & v2_cat_1(C) & l1_cat_1(C) & m2_cat_1(D,A,B) & m2_cat_1(E,A,C) -> m2_cat_1(k10_isocat_2(A,B,C,D,E),A,k11_cat_2(B,C)))) # label(dt_k10_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 8 (all A all B (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) -> v2_cat_1(k11_cat_2(A,B)) & l1_cat_1(k11_cat_2(A,B)))) # label(dt_k11_cat_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 9 (all A all B all C all D (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) & m2_cat_1(C,A,B) & m1_subset_1(D,u1_cat_1(A)) -> m1_subset_1(k13_cat_1(A,B,C,D),u1_cat_1(B)))) # label(dt_k13_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 10 (all A all B all C all D (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) & m1_subset_1(C,u2_cat_1(A)) & m1_subset_1(D,u2_cat_1(B)) -> m1_subset_1(k13_cat_2(A,B,C,D),u2_cat_1(k11_cat_2(A,B))))) # label(dt_k13_cat_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 11 (all A all B (v1_relat_1(A) & v1_funct_1(A) & v1_relat_1(B) & v1_funct_1(B) -> v1_relat_1(k13_funct_3(A,B)) & v1_funct_1(k13_funct_3(A,B)))) # label(dt_k13_funct_3) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 12 (all A all B all C all D all E (-v1_xboole_0(B) & -v1_xboole_0(C) & v1_funct_1(D) & v1_funct_2(D,A,B) & m1_relset_1(D,A,B) & v1_funct_1(E) & v1_funct_2(E,A,C) & m1_relset_1(E,A,C) -> v1_funct_1(k14_funct_3(A,B,C,D,E)) & v1_funct_2(k14_funct_3(A,B,C,D,E),A,k2_zfmisc_1(B,C)) & m2_relset_1(k14_funct_3(A,B,C,D,E),A,k2_zfmisc_1(B,C)))) # label(dt_k14_funct_3) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 13 (all A all B all C all D all E all F all G all H all I (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) & v2_cat_1(C) & l1_cat_1(C) & m2_cat_1(D,A,B) & m2_cat_1(E,A,B) & m2_cat_1(F,A,C) & m2_cat_1(G,A,C) & m1_nattra_1(H,A,B,D,E) & m1_nattra_1(I,A,C,F,G) -> m1_nattra_1(k15_isocat_2(A,B,C,D,E,F,G,H,I),A,k11_cat_2(B,C),k10_isocat_2(A,B,C,D,F),k10_isocat_2(A,B,C,E,G)))) # label(dt_k15_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 14 $T # label(dt_k1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 15 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 16 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 17 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 18 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 19 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 20 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 21 (all A all B all C all D all E all F (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) & m2_cat_1(C,A,B) & m2_cat_1(D,A,B) & m1_nattra_1(E,A,B,C,D) & m1_subset_1(F,u1_cat_1(A)) -> m1_cat_1(k5_nattra_1(A,B,C,D,E,F),B,k13_cat_1(A,B,C,F),k13_cat_1(A,B,D,F)))) # label(dt_k5_nattra_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 22 (all A all B all C all D (-v1_xboole_0(A) & v1_funct_1(C) & v1_funct_2(C,A,B) & m1_relset_1(C,A,B) & m1_subset_1(D,A) -> m1_subset_1(k8_funct_2(A,B,C,D),B))) # label(dt_k8_funct_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 23 $T # label(dt_l1_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 24 (all A all B all C (l1_cat_1(A) & m1_subset_1(B,u1_cat_1(A)) & m1_subset_1(C,u1_cat_1(A)) -> (all D (m1_cat_1(D,A,B,C) -> m1_subset_1(D,u2_cat_1(A)))))) # label(dt_m1_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 25 (all A all B all C all D (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) & m2_cat_1(C,A,B) & m2_cat_1(D,A,B) -> (all E (m1_nattra_1(E,A,B,C,D) -> v1_funct_1(E) & v1_funct_2(E,u1_cat_1(A),u2_cat_1(B)) & m2_relset_1(E,u1_cat_1(A),u2_cat_1(B)))))) # label(dt_m1_nattra_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 26 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 27 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 28 (all A all B (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) -> (all C (m2_cat_1(C,A,B) -> v1_funct_1(C) & v1_funct_2(C,u2_cat_1(A),u2_cat_1(B)) & m2_relset_1(C,u2_cat_1(A),u2_cat_1(B)))))) # label(dt_m2_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 29 (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.41/1.06 30 (all A (l1_cat_1(A) -> -v1_xboole_0(u1_cat_1(A)))) # label(dt_u1_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 31 (all A (l1_cat_1(A) -> -v1_xboole_0(u2_cat_1(A)))) # label(dt_u2_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 32 (exists A l1_cat_1(A)) # label(existence_l1_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 33 (all A all B all C (l1_cat_1(A) & m1_subset_1(B,u1_cat_1(A)) & m1_subset_1(C,u1_cat_1(A)) -> (exists D m1_cat_1(D,A,B,C)))) # label(existence_m1_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 34 (all A all B all C all D (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) & m2_cat_1(C,A,B) & m2_cat_1(D,A,B) -> (exists E m1_nattra_1(E,A,B,C,D)))) # label(existence_m1_nattra_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 35 (all A all B exists C m1_relset_1(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 36 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 37 (all A all B (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) -> (exists C m2_cat_1(C,A,B)))) # label(existence_m2_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 38 (all A all B exists C m2_relset_1(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 39 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 40 (all A -v1_xboole_0(k1_tarski(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 41 (all A all B -v1_xboole_0(k2_tarski(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 42 (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.41/1.06 43 (all A (v2_cat_1(A) & l1_cat_1(A) -> (all B (v2_cat_1(B) & l1_cat_1(B) -> (all C (v2_cat_1(C) & l1_cat_1(C) -> (all D (m2_cat_1(D,A,B) -> (all E (m2_cat_1(E,A,B) -> (all F (m2_cat_1(F,A,C) -> (all G (m2_cat_1(G,A,C) -> (r1_nattra_1(A,B,D,E) & r1_nattra_1(A,C,F,G) -> (all H (m1_nattra_1(H,A,B,D,E) -> (all I (m1_nattra_1(I,A,C,F,G) -> (all J (m1_subset_1(J,u1_cat_1(A)) -> k8_funct_2(u1_cat_1(A),k2_zfmisc_1(u2_cat_1(B),u2_cat_1(C)),k14_funct_3(u1_cat_1(A),u2_cat_1(B),u2_cat_1(C),H,I),J) = k13_cat_2(B,C,k5_nattra_1(A,B,D,E,H,J),k5_nattra_1(A,C,F,G,I,J))))))))))))))))))))))) # label(l54_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 44 (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.41/1.06 45 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 46 (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.41/1.06 47 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 48 (all A all B all C all D all E (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) & v2_cat_1(C) & l1_cat_1(C) & m2_cat_1(D,A,B) & m2_cat_1(E,A,C) -> k10_isocat_2(A,B,C,D,E) = k13_funct_3(D,E))) # label(redefinition_k10_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 49 (all A all B all C all D (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) & m1_subset_1(C,u2_cat_1(A)) & m1_subset_1(D,u2_cat_1(B)) -> k13_cat_2(A,B,C,D) = k4_tarski(C,D))) # label(redefinition_k13_cat_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 50 (all A all B all C all D all E (-v1_xboole_0(B) & -v1_xboole_0(C) & v1_funct_1(D) & v1_funct_2(D,A,B) & m1_relset_1(D,A,B) & v1_funct_1(E) & v1_funct_2(E,A,C) & m1_relset_1(E,A,C) -> k14_funct_3(A,B,C,D,E) = k13_funct_3(D,E))) # label(redefinition_k14_funct_3) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 51 (all A all B all C all D (-v1_xboole_0(A) & v1_funct_1(C) & v1_funct_2(C,A,B) & m1_relset_1(C,A,B) & m1_subset_1(D,A) -> k8_funct_2(A,B,C,D) = k1_funct_1(C,D))) # label(redefinition_k8_funct_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 52 (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.41/1.06 53 (all A all B all C all D (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) & m2_cat_1(C,A,B) & m2_cat_1(D,A,B) -> r1_nattra_1(A,B,C,C))) # label(reflexivity_r1_nattra_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 54 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 55 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 56 (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.41/1.06 57 (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.41/1.06 58 (all A (v2_cat_1(A) & l1_cat_1(A) -> (all B (v2_cat_1(B) & l1_cat_1(B) -> (all C (v2_cat_1(C) & l1_cat_1(C) -> (all D (m2_cat_1(D,A,B) -> (all E (m2_cat_1(E,A,B) -> (all F (m2_cat_1(F,A,C) -> (all G (m2_cat_1(G,A,C) -> (r1_nattra_1(A,B,D,E) & r1_nattra_1(A,C,F,G) -> r1_nattra_1(A,k11_cat_2(B,C),k10_isocat_2(A,B,C,D,F),k10_isocat_2(A,B,C,E,G))))))))))))))))) # label(t44_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 59 (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.41/1.06 60 (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.41/1.06 61 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 62 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 63 (all A all B -(v1_xboole_0(A) & A != B & v1_xboole_0(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.06 64 -(all A (v2_cat_1(A) & l1_cat_1(A) -> (all B (v2_cat_1(B) & l1_cat_1(B) -> (all C (v2_cat_1(C) & l1_cat_1(C) -> (all D (m2_cat_1(D,A,B) -> (all E (m2_cat_1(E,A,B) -> (all F (m2_cat_1(F,A,C) -> (all G (m2_cat_1(G,A,C) -> (r1_nattra_1(A,B,D,E) & r1_nattra_1(A,C,F,G) -> (all H (m1_nattra_1(H,A,B,D,E) -> (all I (m1_nattra_1(I,A,C,F,G) -> (all J (m1_subset_1(J,u1_cat_1(A)) -> k5_nattra_1(A,k11_cat_2(B,C),k10_isocat_2(A,B,C,D,F),k10_isocat_2(A,B,C,E,G),k15_isocat_2(A,B,C,D,E,F,G,H,I),J) = k13_cat_2(B,C,k5_nattra_1(A,B,D,E,H,J),k5_nattra_1(A,C,F,G,I,J))))))))))))))))))))))) # label(t45_isocat_2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/1.06
% 0.41/1.06 ============================== end of process non-clausal formulas ===
% 0.41/1.06
% 0.41/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.06
% 0.41/1.06 ============================== PREDICATE ELIMINATION =================
% 0.41/1.06 65 m1_subset_1(A,k1_zfmisc_1(B)) | -r1_tarski(A,B) # label(t3_subset) # label(axiom). [clausify(57)].
% 0.41/1.06 66 r1_tarski(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(54)].
% 0.41/1.06 67 -m1_subset_1(A,k1_zfmisc_1(B)) | r1_tarski(A,B) # label(t3_subset) # label(axiom). [clausify(57)].
% 0.41/1.06 Derived: m1_subset_1(A,k1_zfmisc_1(A)). [resolve(65,b,66,a)].
% 0.41/1.06 68 -m2_relset_1(A,B,C) | m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(52)].
% 0.41/1.06 69 m2_relset_1(f6(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(38)].
% 0.41/1.06 Derived: m1_relset_1(f6(A,B),A,B). [resolve(68,a,69,a)].
% 0.41/1.06 70 m2_relset_1(A,B,C) | -m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(52)].
% 0.41/1.06 71 -m2_relset_1(A,B,C) | m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) # label(dt_m2_relset_1) # label(axiom). [clausify(29)].
% 0.41/1.06 Derived: m1_subset_1(f6(A,B),k1_zfmisc_1(k2_zfmisc_1(A,B))). [resolve(71,a,69,a)].
% 0.41/1.06 Derived: m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_relset_1(A,B,C). [resolve(71,a,70,a)].
% 0.41/1.06 72 -v2_cat_1(A) | -l1_cat_1(A) | -v2_cat_1(B) | -l1_cat_1(B) | -m2_cat_1(C,A,B) | m2_relset_1(C,u2_cat_1(A),u2_cat_1(B)) # label(dt_m2_cat_1) # label(axiom). [clausify(28)].
% 0.41/1.06 Derived: -v2_cat_1(A) | -l1_cat_1(A) | -v2_cat_1(B) | -l1_cat_1(B) | -Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------