TSTP Solution File: LAT294+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT294+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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 : Sun Jul 17 06:27:01 EDT 2022
% Result : Timeout 300.10s 300.42s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT294+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 29 07:39:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.41/1.01 ============================== Prover9 ===============================
% 0.41/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.01 Process 1775 was started by sandbox on n009.cluster.edu,
% 0.41/1.01 Wed Jun 29 07:39:38 2022
% 0.41/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1611_n009.cluster.edu".
% 0.41/1.01 ============================== end of head ===========================
% 0.41/1.01
% 0.41/1.01 ============================== INPUT =================================
% 0.41/1.01
% 0.41/1.01 % Reading from file /tmp/Prover9_1611_n009.cluster.edu
% 0.41/1.01
% 0.41/1.01 set(prolog_style_variables).
% 0.41/1.01 set(auto2).
% 0.41/1.01 % set(auto2) -> set(auto).
% 0.41/1.01 % set(auto) -> set(auto_inference).
% 0.41/1.01 % set(auto) -> set(auto_setup).
% 0.41/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.01 % set(auto) -> set(auto_limits).
% 0.41/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.01 % set(auto) -> set(auto_denials).
% 0.41/1.01 % set(auto) -> set(auto_process).
% 0.41/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.01 % set(auto2) -> assign(stats, some).
% 0.41/1.01 % set(auto2) -> clear(echo_input).
% 0.41/1.01 % set(auto2) -> set(quiet).
% 0.41/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.01 % set(auto2) -> clear(print_given).
% 0.41/1.01 assign(lrs_ticks,-1).
% 0.41/1.01 assign(sos_limit,10000).
% 0.41/1.01 assign(order,kbo).
% 0.41/1.01 set(lex_order_vars).
% 0.41/1.01 clear(print_given).
% 0.41/1.01
% 0.41/1.01 % formulas(sos). % not echoed (42 formulas)
% 0.41/1.01
% 0.41/1.01 ============================== end of input ==========================
% 0.41/1.01
% 0.41/1.01 % From the command line: assign(max_seconds, 300).
% 0.41/1.01
% 0.41/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.01
% 0.41/1.01 % Formulas that are not ordinary clauses:
% 0.41/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.41/1.01 2 (all A (v1_xboole_0(A) -> v1_funct_1(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/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.41/1.01 4 (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.41/1.01 5 (all A all B (v1_funct_1(B) & v1_funct_2(B,k2_zfmisc_1(A,A),A) & m2_relset_1(B,k2_zfmisc_1(A,A),A) -> (all C (v1_funct_1(C) & v1_funct_2(C,k2_zfmisc_1(A,A),A) & m2_relset_1(C,k2_zfmisc_1(A,A),A) -> (r6_binop_1(A,B,C) <-> r4_binop_1(A,B,C) & r5_binop_1(A,B,C)))))) # label(d11_binop_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 6 (all A (v1_relat_1(A) -> (all B k1_realset1(A,B) = k7_relat_1(A,k2_zfmisc_1(B,B))))) # label(d3_realset1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 7 $T # label(dt_k1_realset1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 8 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 9 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 10 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 11 (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.41/1.01 12 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 13 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 14 (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.01 15 (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.01 16 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 17 (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.01 18 (all A all B (v1_relat_1(A) -> v1_relat_1(k1_realset1(A,B)))) # label(fc1_realset1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 19 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 20 (all A all B (v1_relat_1(A) & v1_funct_1(A) -> v1_relat_1(k1_realset1(A,B)) & v1_funct_1(k1_realset1(A,B)))) # label(fc2_realset1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 21 (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.41/1.01 22 (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.01 23 (exists A (v1_relat_1(A) & v1_funct_1(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 24 (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.01 25 (exists A v1_xboole_0(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 26 (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.41/1.01 27 (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.01 28 (exists A -v1_xboole_0(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 29 (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.41/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.41/1.01 31 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.41/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.41/1.01 33 (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.01 34 (all A (-v1_xboole_0(A) -> (all B (-v1_xboole_0(B) & m1_subset_1(B,k1_zfmisc_1(A)) -> (all C (v1_funct_1(C) & v1_funct_2(C,k2_zfmisc_1(A,A),A) & m2_relset_1(C,k2_zfmisc_1(A,A),A) -> (all D (v1_funct_1(D) & v1_funct_2(D,k2_zfmisc_1(A,A),A) & m2_relset_1(D,k2_zfmisc_1(A,A),A) -> (all E (v1_funct_1(E) & v1_funct_2(E,k2_zfmisc_1(B,B),B) & m2_relset_1(E,k2_zfmisc_1(B,B),B) -> (all F (v1_funct_1(F) & v1_funct_2(F,k2_zfmisc_1(B,B),B) & m2_relset_1(F,k2_zfmisc_1(B,B),B) -> (E = k1_realset1(C,B) & F = k1_realset1(D,B) -> (r4_binop_1(A,C,D) -> r4_binop_1(B,E,F)) & (r5_binop_1(A,C,D) -> r5_binop_1(B,E,F))))))))))))))) # label(t3_filter_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/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.41/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.41/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.41/1.01 38 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/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.41/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.41/1.01 41 -(all A (-v1_xboole_0(A) -> (all B (-v1_xboole_0(B) & m1_subset_1(B,k1_zfmisc_1(A)) Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------