TSTP Solution File: SEU298+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU298+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 : Tue Jul 19 13:30:45 EDT 2022
% Result : Timeout 300.07s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU298+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.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 Jun 20 00:42:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 7857 was started by sandbox on n020.cluster.edu,
% 0.42/1.00 Mon Jun 20 00:42:34 2022
% 0.42/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7703_n020.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_7703_n020.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 (42 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 exists B (element(B,powerset(A)) & empty(B) & relation(B) & function(B) & one_to_one(B) & epsilon_transitive(B) & epsilon_connected(B) & ordinal(B) & natural(B) & finite(B))) # label(rc2_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 2 (exists A (relation(A) & function(A) & one_to_one(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 3 (exists A (relation(A) & function(A) & one_to_one(A) & empty(A) & epsilon_transitive(A) & epsilon_connected(A) & ordinal(A))) # label(rc2_ordinal1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 4 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 5 (exists A (relation(A) & empty(A) & function(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 6 (all A (relation(A) & empty(A) & function(A) -> relation(A) & function(A) & one_to_one(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 7 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 8 (all A all B (relation(A) & relation(B) -> relation(set_difference(A,B)))) # label(fc3_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 9 (exists A (-empty(A) & relation(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 10 (exists A (-empty(A) & epsilon_transitive(A) & epsilon_connected(A) & ordinal(A) & natural(A))) # label(rc1_arytm_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 11 (all A (ordinal(A) & natural(A) -> -empty(succ(A)) & epsilon_transitive(succ(A)) & epsilon_connected(succ(A)) & ordinal(succ(A)) & natural(succ(A)))) # label(fc2_arytm_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 12 (exists A (-empty(A) & finite(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 13 (all A (empty(A) -> finite(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 14 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc3_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 15 (all A (finite(A) -> (all B (element(B,powerset(A)) -> finite(B))))) # label(cc2_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 16 (all A all B (finite(A) -> finite(set_difference(A,B)))) # label(fc12_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 17 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 18 (all A (empty(A) -> relation(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 19 (all A (empty(A) & ordinal(A) -> epsilon_transitive(A) & epsilon_connected(A) & ordinal(A) & natural(A))) # label(cc2_arytm_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 20 (all A (epsilon_transitive(A) & epsilon_connected(A) -> ordinal(A))) # label(cc2_ordinal1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 21 (exists A (epsilon_transitive(A) & epsilon_connected(A) & ordinal(A))) # label(rc1_ordinal1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 22 (all A (empty(A) -> epsilon_transitive(A) & epsilon_connected(A) & ordinal(A))) # label(cc3_ordinal1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 23 (exists A (-empty(A) & epsilon_transitive(A) & epsilon_connected(A) & ordinal(A))) # label(rc3_ordinal1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 24 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 25 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 26 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 27 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 28 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 29 $T # label(dt_k1_ordinal1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 30 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 31 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 32 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 33 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 34 (all A (-empty(singleton(A)) & finite(singleton(A)))) # label(fc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 35 (all A (ordinal(A) -> (all B (element(B,A) -> epsilon_transitive(B) & epsilon_connected(B) & ordinal(B))))) # label(cc1_arytm_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 36 (all A -empty(succ(A))) # label(fc1_ordinal1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 37 (all A (ordinal(A) -> epsilon_transitive(A) & epsilon_connected(A))) # label(cc1_ordinal1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 38 (all A (ordinal(A) -> -empty(succ(A)) & epsilon_transitive(succ(A)) & epsilon_connected(succ(A)) & ordinal(succ(A)))) # label(fc3_ordinal1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 39 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 40 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 41 (all A all B (ordinal(A) & element(B,powerset(powerset(succ(A)))) -> ((all C all D all E (C = D & (exists F (in(F,B) & D = set_difference(F,singleton(A)))) & C = E & (exists G (in(G,B) & E = set_difference(G,singleton(A)))) -> D = E)) -> (exists C all D (in(D,C) <-> (exists E (in(E,powerset(A)) & E = D & (exists H (in(H,B) & D = set_difference(H,singleton(A))))))))))) # label(s1_tarski__e4_27_3_1__finset_1__1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 42 -(all A all B (ordinal(A) & element(B,powerset(powerset(succ(A)))) -> (exists C all D (in(D,C) <-> in(D,powerset(A)) & (exists E (in(E,B) & D = set_difference(E,singleton(A)))))))) # label(s1_xboole_0__e4_27_3_1__finCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------