TSTP Solution File: ALG224+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ALG224+1 : TPTP v8.1.0. Released v3.4.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 : Thu Jul 14 17:54:08 EDT 2022
% Result : Timeout 300.05s 300.60s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : ALG224+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.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 : Wed Jun 8 04:27:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.01 ============================== Prover9 ===============================
% 0.42/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.01 Process 28250 was started by sandbox on n024.cluster.edu,
% 0.42/1.01 Wed Jun 8 04:27:50 2022
% 0.42/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28097_n024.cluster.edu".
% 0.42/1.01 ============================== end of head ===========================
% 0.42/1.01
% 0.42/1.01 ============================== INPUT =================================
% 0.42/1.01
% 0.42/1.01 % Reading from file /tmp/Prover9_28097_n024.cluster.edu
% 0.42/1.01
% 0.42/1.01 set(prolog_style_variables).
% 0.42/1.01 set(auto2).
% 0.42/1.01 % set(auto2) -> set(auto).
% 0.42/1.01 % set(auto) -> set(auto_inference).
% 0.42/1.01 % set(auto) -> set(auto_setup).
% 0.42/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.01 % set(auto) -> set(auto_limits).
% 0.42/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.01 % set(auto) -> set(auto_denials).
% 0.42/1.01 % set(auto) -> set(auto_process).
% 0.42/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.01 % set(auto2) -> assign(stats, some).
% 0.42/1.01 % set(auto2) -> clear(echo_input).
% 0.42/1.01 % set(auto2) -> set(quiet).
% 0.42/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.01 % set(auto2) -> clear(print_given).
% 0.42/1.01 assign(lrs_ticks,-1).
% 0.42/1.01 assign(sos_limit,10000).
% 0.42/1.01 assign(order,kbo).
% 0.42/1.01 set(lex_order_vars).
% 0.42/1.01 clear(print_given).
% 0.42/1.01
% 0.42/1.01 % formulas(sos). % not echoed (42 formulas)
% 0.42/1.01
% 0.42/1.01 ============================== end of input ==========================
% 0.42/1.01
% 0.42/1.01 % From the command line: assign(max_seconds, 300).
% 0.42/1.01
% 0.42/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.01
% 0.42/1.01 % Formulas that are not ordinary clauses:
% 0.42/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.42/1.01 2 (all A (v1_xboole_0(A) -> v1_fraenkel(A))) # label(cc1_closure2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 3 (all A (v1_xboole_0(A) -> v1_finset_1(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 4 (all A (v1_xboole_0(A) -> v1_funct_1(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 5 (all A (v1_finset_1(A) -> (all B (m1_subset_1(B,k1_zfmisc_1(A)) -> v1_finset_1(B))))) # label(cc2_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 6 (all A (v1_relat_1(A) & v1_xboole_0(A) & v1_funct_1(A) -> v1_relat_1(A) & v1_funct_1(A) & v2_funct_1(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 7 (all A all B (m1_pboole(B,A) -> (all C (m1_subset_1(C,k1_zfmisc_1(k1_closure2(A,B))) -> (all D (m1_subset_1(D,k1_zfmisc_1(k1_closure2(A,B))) -> (r2_closure3(A,B,C,D) <-> (all E -(r2_hidden(E,C) & (all F -(r2_hidden(F,D) & r1_tarski(F,E)))))))))))) # label(d2_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 8 $T # label(dt_k1_closure2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 9 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 10 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 11 (all A all B (m1_pboole(B,A) -> v1_relat_1(B) & v1_funct_1(B))) # label(dt_m1_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 12 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 13 (all A exists B m1_pboole(B,A)) # label(existence_m1_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 14 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 15 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 16 (all A all B (m1_pboole(B,A) -> -v1_xboole_0(k1_closure2(A,B)) & v1_fraenkel(k1_closure2(A,B)) & v1_pralg_2(k1_closure2(A,B)))) # label(fc2_closure2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 17 (exists A (v1_xboole_0(A) & v1_relat_1(A) & v1_funct_1(A) & v2_funct_1(A) & v1_finset_1(A) & v1_fraenkel(A))) # label(rc1_closure2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 18 (exists A (-v1_xboole_0(A) & v1_finset_1(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 19 (exists A (v1_relat_1(A) & v1_funct_1(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 20 (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 21 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 22 (all A all B (m1_pboole(B,A) -> (exists C (m1_subset_1(C,k1_zfmisc_1(k1_closure2(A,B))) & -v1_xboole_0(C) & v1_fraenkel(C) & v1_pralg_2(C))))) # label(rc2_closure2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 23 (exists A (v1_relat_1(A) & v1_xboole_0(A) & v1_funct_1(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 24 (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 25 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 26 (all A all B (m1_pboole(B,A) -> (exists C (m1_subset_1(C,k1_zfmisc_1(k1_closure2(A,B))) & v1_xboole_0(C) & v1_relat_1(C) & v1_funct_1(C) & v2_funct_1(C) & v1_finset_1(C) & v1_fraenkel(C))))) # label(rc3_closure2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 27 (all A (-v1_xboole_0(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(A)) & -v1_xboole_0(B) & v1_finset_1(B))))) # label(rc3_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 28 (exists A (v1_relat_1(A) & v1_funct_1(A) & v2_funct_1(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 29 (all A (-v1_xboole_0(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(A)) & -v1_xboole_0(B) & v1_finset_1(B))))) # label(rc4_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 30 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 31 (all A all B all C all D (m1_pboole(B,A) & m1_subset_1(C,k1_zfmisc_1(k1_closure2(A,B))) & m1_subset_1(D,k1_zfmisc_1(k1_closure2(A,B))) -> r2_closure3(A,B,C,C))) # label(reflexivity_r2_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 32 (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.01 33 (all A all B all C (r1_tarski(A,B) & r1_tarski(B,C) -> r1_tarski(A,C))) # label(t1_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 34 (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 35 (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 36 (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.01 37 (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.01 38 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 39 (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 40 (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 41 -(all A all B (m1_pboole(B,A) -> (all C (m1_subset_1(C,k1_zfmisc_1(k1_closure2(A,B))) -> (all D (m1_subset_1(D,k1_zfmisc_1(k1_closure2(A,B))) -> (all E (m1_subset_1(E,k1_zfmisc_1(k1_closure2(A,B))) -> (r2_closure3(A,B,C,D) & r2_closure3(A,B,D,E) -> r2_closure3(A,B,C,E)))))))))) # label(t5_closure3) # 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 42 -v1_relat_1(A) | -v1_xboole_0(A) | -v1_funct_1(A) | v2_funct_1(A) # label(cc2_funct_1) # label(axiom). [clausify(6)].
% 0.42/1.01 43 v1_relat_1(c1) # label(rc1_closure2) # label(axiom). [clausify(17)].
% 0.42/1.01 44 v1_relat_1(c3) # label(rc1_funct_1) # label(axiom). [clausify(19)].
% 0.42/1.01 45 v1_relat_1(c5) # label(rc2_funct_1) # label(axiom). [clausify(23)].
% 0.42/1.01 46 v1_relat_1(c7) # label(rc3_funct_1) # label(axiom). [clausify(28)].
% 0.42/1.01 47 -m1_pboole(A,B) | v1_relat_1(A) # label(dt_m1_pboole) # label(axiom). [clausify(11)].
% 0.42/1.01 48 -m1_pboole(A,B) | v1_relat_1(f8(B,A)) # label(rc3_closure2) # label(axiom). [clausify(26)].
% 0.42/1.01 Derived: -v1_xboole_0(c1) | -v1_funct_1(c1) | v2_funct_1(c1). [resolve(42,a,43,a)].
% 0.42/1.01 Derived: -v1_xboole_0(c3) | -v1_funct_1(c3) | v2_funct_1(c3). [resolve(42,a,44,a)].
% 0.42/1.01 Derived: -v1_xboole_0(c5) | -v1_funct_1(c5) | v2_funct_1(c5). [resolve(42,a,45,a)].
% 0.42/1.01 Derived: -v1_xboole_0(c7) | -v1_funct_1(c7) | v2_funct_1(c7). [resolve(42,a,46,a)].
% 0.42/1.01 Derived: -v1_xboole_0(A) | -v1_funct_1(A) | v2_funct_1(A) | -m1_pboole(A,B). [resolve(42,a,47,b)].
% 0.42/1.01 Derived: -v1_xboole_0(f8(A,B)) | -v1_funct_1(f8(A,B)) | v2_funct_1(f8(A,B)) | -m1_pboole(B,A). [resolve(42,a,48,b)].
% 0.42/1.01 49 -m1_pboole(A,B) | -v1_xboole_0(k1_closure2(B,A)) # label(fc2_closure2) # label(axiom). [clausify(16)].
% 0.42/1.01 50 m1_pboole(c9,c8) # label(t5_closure3) # label(negated_conjecture). [clausify(41)].
% 0.42/1.01 51 m1_pboole(f3(A),A) # label(existence_m1_pboole) # label(axiom). [clausify(13)].
% 0.42/1.01 Derived: -v1_xboole_0(k1_closure2(c8,c9)). [resolve(49,a,50,a)].
% 0.42/1.01 Derived: -v1_xboole_0(k1_closure2(A,f3(A))). [resolve(49,a,51,a)].
% 0.42/1.01 52 -m1_pboole(A,B) | -v1_xboole_0(f6(B,A)) # label(rc2_closure2) # label(axiom). [clausify(22)].
% 0.42/1.01 Derived: -v1_xboole_0(f6(c8,c9)). [resolve(52,a,50,a)].
% 0.42/1.01 Derived: -v1_xboole_0(f6(A,f3(A))). [resolve(52,a,51,a)].
% 0.42/1.01 53 -m1_pboole(A,B) | v1_pralg_2(k1_closure2(B,A)) # label(fc2_closure2) # label(axiom). [clausify(16)].
% 0.42/1.01 Derived: v1_pralg_2(k1_closure2(c8,c9)). [resolve(53,a,50,a)].
% 0.42/1.01 Derived: v1_pralg_2(k1_closure2(A,f3(A))). [resolve(53,a,51,a)].
% 0.42/1.01 54 -m1_pboole(A,B) | v1_pralg_2(f6(B,A)) # label(rc2_closure2) # label(axiom). [clausify(22)].
% 0.42/1.01 Derived: v1_pralg_2(f6(c8,c9)). [resolve(54,a,50,a)].
% 0.42/1.01 Derived: v1_pralg_2(f6(A,f3(A))). [resolve(54,a,51,a)].
% 0.42/1.01 55 -m1_pboole(A,B) | v1_xboole_0(f8(B,A)) # label(rc3_closure2) # label(axiom). [clausify(26)].
% 0.42/1.01 Derived: v1_xboole_0(f8(c8,c9)). [resolve(55,a,50,a)].
% 0.42/1.01 Derived: v1_xboole_0(f8(A,f3(A))). [resolve(55,a,51,a)].
% 0.42/1.01 56 -m1_pboole(A,B) | v1_finset_1(f8(B,A)) # label(rc3_closure2) # label(axiom). [clausify(26)].
% 0.42/1.01 Derived: v1_finset_1(f8(c8,c9)). [resolve(56,a,50,a)].
% 0.42/1.01 Derived: v1_finset_1(f8(A,f3(A))). [resolve(56,a,51,a)].
% 0.42/1.01 57 -m1_pboole(A,B) | m1_subset_1(f6(B,A),k1_zfmisc_1(k1_closure2(B,A))) # label(rc2_closure2) # label(axiom). [clausify(22)].
% 0.42/1.01 Derived: m1_subset_1(f6(c8,c9),k1_zfmisc_1(k1_closure2(c8,c9))). [resolve(57,a,50,a)].
% 0.42/1.01 Derived: m1_subset_1(f6(A,f3(A)),k1_zfmisc_1(k1_closure2(A,f3(A)))). [resolve(57,a,51,a)].
% 0.42/1.01 58 -m1_pboole(A,B) | m1_subset_1(f8(B,A),k1_zfmisc_1(k1_closure2(B,A))) # label(rc3_closure2) # label(axiom). [clausify(26)].
% 0.42/1.01 Derived: m1_subset_1(f8(c8,c9),k1_zfmisc_1(k1_closure2(c8,c9))). [resolve(58,a,50,a)].
% 0.42/1.01 Derived: m1_subset_1(f8(A,f3(A)),k1_zfmisc_1(k1_closure2(A,f3(A)))). [resolve(58,a,51,a)].
% 0.42/1.01 59 -m1_pboole(A,B) | -m1_subset_1(C,k1_zfmisc_1(k1_closure2(B,A))) | -m1_subset_1(D,k1_zfmisc_1(k1_closure2(B,A))) | r2_closure3(B,A,C,C) # label(reflexivity_r2_closure3) # label(axiom). [clausify(31)].
% 0.42/1.01 Derived: -m1_subset_1(A,k1_zfmisc_1(k1_closure2(c8,c9))) | -m1_subset_1(B,k1_zfmisc_1(k1_closure2(c8,c9))) | r2_closure3(c8,c9,A,A). [resolve(59,a,50,a)].
% 0.42/1.01 Derived: -m1_subset_1(A,k1_zfmisc_1(k1_closure2(B,f3(B)))) | -m1_subset_1(C,k1_zfmisc_1(k1_closure2(B,f3(B)))) | r2_closure3(B,Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------