TSTP Solution File: ALG225+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ALG225+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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.02s 300.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG225+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n019.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 06:35:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.01 ============================== Prover9 ===============================
% 0.74/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.01 Process 1490 was started by sandbox2 on n019.cluster.edu,
% 0.74/1.01 Wed Jun 8 06:35:40 2022
% 0.74/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1336_n019.cluster.edu".
% 0.74/1.01 ============================== end of head ===========================
% 0.74/1.01
% 0.74/1.01 ============================== INPUT =================================
% 0.74/1.01
% 0.74/1.01 % Reading from file /tmp/Prover9_1336_n019.cluster.edu
% 0.74/1.01
% 0.74/1.01 set(prolog_style_variables).
% 0.74/1.01 set(auto2).
% 0.74/1.01 % set(auto2) -> set(auto).
% 0.74/1.01 % set(auto) -> set(auto_inference).
% 0.74/1.01 % set(auto) -> set(auto_setup).
% 0.74/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.01 % set(auto) -> set(auto_limits).
% 0.74/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.01 % set(auto) -> set(auto_denials).
% 0.74/1.01 % set(auto) -> set(auto_process).
% 0.74/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.01 % set(auto2) -> assign(stats, some).
% 0.74/1.01 % set(auto2) -> clear(echo_input).
% 0.74/1.01 % set(auto2) -> set(quiet).
% 0.74/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.01 % set(auto2) -> clear(print_given).
% 0.74/1.01 assign(lrs_ticks,-1).
% 0.74/1.01 assign(sos_limit,10000).
% 0.74/1.01 assign(order,kbo).
% 0.74/1.01 set(lex_order_vars).
% 0.74/1.01 clear(print_given).
% 0.74/1.01
% 0.74/1.01 % formulas(sos). % not echoed (66 formulas)
% 0.74/1.01
% 0.74/1.01 ============================== end of input ==========================
% 0.74/1.01
% 0.74/1.01 % From the command line: assign(max_seconds, 300).
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.01
% 0.74/1.01 % Formulas that are not ordinary clauses:
% 0.74/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.74/1.01 2 (all A (v1_xboole_0(A) -> v1_fraenkel(A))) # label(cc1_closure2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 3 (all A (v1_xboole_0(A) -> v1_finset_1(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 4 (all A (v1_xboole_0(A) -> v1_funct_1(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 5 (all A all B (m1_pboole(B,A) -> (v3_relat_1(B) -> v1_pre_circ(B,A)))) # label(cc1_mssubfam) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 6 (all A (-v1_xboole_0(A) -> (all B (m1_pboole(B,A) -> (v2_relat_1(B) -> -v3_relat_1(B)))))) # label(cc1_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 7 (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.74/1.01 8 (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.74/1.01 9 (all A (-v1_xboole_0(A) -> (all B (m1_pboole(B,A) -> (v3_relat_1(B) -> -v2_relat_1(B)))))) # label(cc2_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 10 (all A all B (A = B <-> r1_tarski(A,B) & r1_tarski(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 11 (all A all B (m1_pboole(B,A) -> (v2_relat_1(B) <-> (all C -(r2_hidden(C,A) & v1_xboole_0(k1_funct_1(B,C))))))) # label(d16_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 12 (all A (-v1_xboole_0(A) -> (all B (m1_pboole(B,A) -> (all C (C = k1_closure3(A,B) <-> C = a_2_0_closure3(A,B))))))) # label(d3_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 13 (all A all B (v1_relat_1(B) & v1_funct_1(B) -> (m1_pboole(B,A) <-> k1_relat_1(B) = A))) # label(d3_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 14 (all A all B (r1_tarski(A,B) <-> (all C (r2_hidden(C,A) -> r2_hidden(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 15 (all A k1_pboole(A) = k2_funcop_1(A,k1_xboole_0)) # label(d6_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 16 $T # label(dt_k1_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 17 $T # label(dt_k1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 18 (all A all B (v1_relat_1(A) & v1_funct_1(A) & v1_relat_1(B) & v1_funct_1(B) -> v1_relat_1(k1_funct_4(A,B)) & v1_funct_1(k1_funct_4(A,B)))) # label(dt_k1_funct_4) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 19 (all A m1_pboole(k1_pboole(A),A)) # label(dt_k1_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 20 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 21 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 22 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 23 $T # label(dt_k2_funcop_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 24 (all A all B (v1_relat_1(A) -> v1_relat_1(k7_relat_1(A,B)))) # label(dt_k7_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 25 (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.74/1.01 26 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 27 (all A exists B m1_pboole(B,A)) # label(existence_m1_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 28 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 29 (all A (v1_relat_1(k1_pboole(A)) & v3_relat_1(k1_pboole(A)) & v1_funct_1(k1_pboole(A)) & v1_pre_circ(k1_pboole(A),A))) # label(fc1_mssubfam) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 30 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 31 (all A all B all C (-v1_xboole_0(A) & v2_relat_1(B) & m1_pboole(B,A) & m1_subset_1(C,A) -> -v1_xboole_0(k1_funct_1(B,C)))) # label(fc2_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 32 (all A (v1_relat_1(k1_pboole(A)) & v3_relat_1(k1_pboole(A)) & v1_funct_1(k1_pboole(A)))) # label(fc3_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 33 (all A all B (v1_relat_1(A) & v1_funct_1(A) -> v1_relat_1(k7_relat_1(A,B)) & v1_funct_1(k7_relat_1(A,B)))) # label(fc4_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 34 (all A all B all C (-v1_xboole_0(B) & m1_pboole(C,B) -> (r2_hidden(A,a_2_0_closure3(B,C)) <-> (exists D (m1_subset_1(D,B) & A = D & k1_funct_1(C,D) != k1_xboole_0))))) # label(fraenkel_a_2_0_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 35 (all A all B all C (-v1_xboole_0(B) & v2_relat_1(C) & m1_pboole(C,B) -> (r2_hidden(A,a_2_1_closure3(B,C)) <-> (exists D (m1_subset_1(D,B) & A = D & k1_funct_1(C,D) != k1_xboole_0))))) # label(fraenkel_a_2_1_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 36 (all A all B (v1_relat_1(A) & v1_funct_1(A) & v1_relat_1(B) & v1_funct_1(B) -> k1_funct_4(A,A) = A)) # label(idempotence_k1_funct_4) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 37 (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.74/1.01 38 (exists A (-v1_xboole_0(A) & v1_finset_1(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 39 (exists A (v1_relat_1(A) & v1_funct_1(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 40 (exists A (v1_relat_1(A) & v3_relat_1(A) & v1_funct_1(A))) # label(rc1_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 41 (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.74/1.01 42 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 43 (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.74/1.02 44 (all A exists B (m1_pboole(B,A) & v1_relat_1(B) & v3_relat_1(B) & v1_funct_1(B))) # label(rc2_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 45 (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.74/1.02 46 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 47 (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.74/1.02 48 (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.74/1.02 49 (all A exists B (m1_pboole(B,A) & v1_relat_1(B) & v2_relat_1(B) & v1_funct_1(B))) # label(rc3_pboole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 50 (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.74/1.02 51 (exists A (v1_relat_1(A) & v3_relat_1(A) & v1_funct_1(A))) # label(rc4_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 52 (exists A (v1_relat_1(A) & v2_relat_1(A) & v1_funct_1(A))) # label(rc5_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 53 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 54 (all A (-v1_xboole_0(A) -> (all B (m1_pboole(B,A) -> (all C (m1_pboole(C,A) -> k1_funct_4(B,C) = C)))))) # label(t1_closure3) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 55 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 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.74/1.02 57 (all A all B ((all C (r2_hidden(C,A) <-> r2_hidden(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 58 (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.74/1.02 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.74/1.02 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.74/1.02 61 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 62 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 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.74/1.02 64 (all A all B (v1_relat_1(B) -> (r1_tarski(k1_relat_1(B),A) -> k7_relat_1(B,A) = B))) # label(t97_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 65 -(all A (-v1_xboole_0(A) -> (all B (v2_relat_1(B) & m1_pboole(B,A) -> B = k1_funct_4(k1_pboole(A),k7_relat_1(B,k1_closure3(A,B))))))) # label(t6_closure3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.02
% 0.74/1.02 ============================== end of process non-clausal formulas ===
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.02
% 0.74/1.02 ============================== PREDICATE ELIMINATION =================
% 0.74/1.02 66 v3_relat_1(k1_pboole(A)) # label(fc1_mssubfam) # label(axiom). [clausify(29)].
% 0.74/1.02 67 -m1_pboole(A,B) | -v3_relat_1(A) | v1_pre_circ(A,B) # label(cc1_mssubfam) # label(axiom). [clausify(5)].
% 0.74/1.02 68 v1_xboole_0(A) | -m1_pboole(B,A) | -v2_relat_1(B) | -v3_relat_1(B) # label(cc1_pboole) # label(axiom). [clausify(6)].
% 0.74/1.02 69 v1_xboole_0(A) | -m1_pboole(B,A) | -v3_relat_1(B) | -v2_relat_1(B) # label(cc2_pboole) # label(axiom). [clausify(9)].
% 0.74/1.02 Derived: -m1_pboole(k1_pboole(A),B) | v1_pre_circ(k1_pboole(A),B). [resolve(66,a,67,b)].
% 0.74/1.02 DeriCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------