TSTP Solution File: CAT026+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CAT026+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:22 EDT 2022
% Result : Timeout 300.06s 300.34s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CAT026+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 : n017.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 : Sun May 29 18:27:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 31125 was started by sandbox on n017.cluster.edu,
% 0.42/1.00 Sun May 29 18:27:40 2022
% 0.42/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30972_n017.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_30972_n017.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (50 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00 1 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 2 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 3 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 4 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 5 (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.42/1.00 6 (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.42/1.00 7 (all A all B exists C m1_relset_1(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 8 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 9 (all A all B (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) -> m2_cat_1(k16_cat_2(A,B),k11_cat_2(A,B),A))) # label(dt_k16_cat_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 10 (all A all B (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) -> m2_cat_1(k17_cat_2(A,B),k11_cat_2(A,B),B))) # label(dt_k17_cat_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 11 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 12 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 13 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 14 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 15 (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.42/1.00 16 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 17 (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.42/1.01 18 (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.42/1.01 19 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 20 (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.42/1.01 21 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 22 (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.42/1.01 23 (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.42/1.01 24 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 25 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 26 (all A all B -(v1_xboole_0(A) & A != B & v1_xboole_0(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 27 (all A all B exists C m2_relset_1(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 28 (all A all B (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) -> k8_isocat_2(A,B) = k16_cat_2(A,B))) # label(redefinition_k8_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 29 (all A all B (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) -> k9_isocat_2(A,B) = k17_cat_2(A,B))) # label(redefinition_k9_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 30 (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.42/1.01 31 (all A all B (v1_relat_1(A) & v1_relat_1(B) -> v1_relat_1(k5_relat_1(A,B)))) # label(dt_k5_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 32 (all A all B (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) -> m2_cat_1(k8_isocat_2(A,B),k11_cat_2(A,B),A))) # label(dt_k8_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 33 (all A all B (v2_cat_1(A) & l1_cat_1(A) & v2_cat_1(B) & l1_cat_1(B) -> m2_cat_1(k9_isocat_2(A,B),k11_cat_2(A,B),B))) # label(dt_k9_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 34 (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.42/1.01 35 (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.42/1.01 36 (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) -> r2_nattra_1(A,B,C,C))) # label(reflexivity_r2_nattra_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 37 (exists A l1_cat_1(A)) # label(existence_l1_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 38 (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.42/1.01 39 (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,B,C) -> k2_isocat_1(A,B,C,D,E) = k5_relat_1(D,E))) # label(redefinition_k2_isocat_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 40 (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.42/1.01 41 (all A all B all C all D (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,k11_cat_2(B,C)) -> m2_cat_1(k11_isocat_2(A,B,C,D),A,B))) # label(dt_k11_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 42 (all A all B all C all D (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,k11_cat_2(B,C)) -> m2_cat_1(k12_isocat_2(A,B,C,D),A,C))) # label(dt_k12_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 43 (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,B,C) -> m2_cat_1(k2_isocat_1(A,B,C,D,E),A,C))) # label(dt_k2_isocat_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 44 $T # label(dt_l1_cat_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 45 (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.42/1.01 46 (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,k11_cat_2(B,C)) -> k11_isocat_2(A,B,C,D) = k2_isocat_1(A,k11_cat_2(B,C),B,D,k8_isocat_2(B,C)))))))))) # label(d7_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 47 (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,k11_cat_2(B,C)) -> k12_isocat_2(A,B,C,D) = k2_isocat_1(A,k11_cat_2(B,C),C,D,k9_isocat_2(B,C)))))))))) # label(d8_isocat_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 48 (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,B,C) -> (all G (m2_cat_1(G,B,C) -> (r2_nattra_1(A,B,D,E) & r2_nattra_1(B,C,F,G) -> r2_nattra_1(A,C,k2_isocat_1(A,B,C,D,F),k2_isocat_1(A,B,C,E,G))))))))))))))))) # label(t27_isocat_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 49 -(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,k11_cat_2(B,C)) -> (all E (m2_cat_1(E,A,k11_cat_2(B,C)) -> (r2_nattra_1(A,k11_cat_2(B,C),D,E) -> r2_nattra_1(A,B,k11_isocat_2(A,B,C,D),k11_isocat_2(A,B,C,E)) & r2_nattra_1(A,C,k12_isocat_2(A,B,C,D),k12_isocat_2(A,B,C,E))))))))))))) # label(t38_isocat_2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/1.01
% 0.42/1.01 ============================== end of process non-clausal formulas ===
% 0.42/1.01
% 0.42/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.01
% 0.42/1.01 ============================== PREDICATE ELIMINATION =================
% 0.42/1.01 50 m1_subset_1(A,k1_zfmisc_1(B)) | -r1_tarski(A,B) # label(t3_subset) # label(axiom). [clausify(23)].
% 0.42/1.01 51 r1_tarski(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(1)].
% 0.42/1.01 52 -m1_subset_1(A,k1_zfmisc_1(B)) | r1_tarski(A,B) # label(t3_subset) # label(axiom). [clausify(23)].
% 0.42/1.01 Derived: m1_subset_1(A,k1_zfmisc_1(A)). [resolve(50,b,51,a)].
% 0.42/1.01 53 m2_relset_1(A,B,C) | -m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(30)].
% 0.42/1.01 54 m1_relset_1(f1(A,B),A,B) # label(existence_m1_relset_1) # label(axiom). [clausify(7)].
% 0.42/1.01 55 -m2_relset_1(A,B,C) | m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(30)].
% 0.42/1.01 Derived: m2_relset_1(f1(A,B),A,B). [resolve(53,b,54,a)].
% 0.42/1.01 56 -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(34)].
% 0.42/1.01 57 m2_relset_1(f5(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(27)].
% 0.42/1.01 Derived: m1_subset_1(f5(A,B),k1_zfmisc_1(k2_zfmisc_1(A,B))). [resolve(56,a,57,a)].
% 0.42/1.01 58 -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(45)].
% 0.42/1.01 Derived: -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(C,k1_zfmisc_1(k2_zfmisc_1(u2_cat_1(A),u2_cat_1(B)))). [resolve(58,f,56,a)].
% 0.42/1.01 59 m2_relset_1(f1(A,B),A,B). [resolve(53,b,54,a)].
% 0.42/1.01 Derived: m1_subset_1(f1(A,B),k1_zfmisc_1(k2_zfmisc_1(A,B))).Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------