TSTP Solution File: SEU315+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU315+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:53 EDT 2022
% Result : Timeout 300.05s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU315+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n029.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 : Sun Jun 19 05:38:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.00 ============================== Prover9 ===============================
% 0.41/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.00 Process 8076 was started by sandbox2 on n029.cluster.edu,
% 0.41/1.00 Sun Jun 19 05:38:45 2022
% 0.41/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7923_n029.cluster.edu".
% 0.41/1.00 ============================== end of head ===========================
% 0.41/1.00
% 0.41/1.00 ============================== INPUT =================================
% 0.41/1.00
% 0.41/1.00 % Reading from file /tmp/Prover9_7923_n029.cluster.edu
% 0.41/1.00
% 0.41/1.00 set(prolog_style_variables).
% 0.41/1.00 set(auto2).
% 0.41/1.00 % set(auto2) -> set(auto).
% 0.41/1.00 % set(auto) -> set(auto_inference).
% 0.41/1.00 % set(auto) -> set(auto_setup).
% 0.41/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.00 % set(auto) -> set(auto_limits).
% 0.41/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.00 % set(auto) -> set(auto_denials).
% 0.41/1.00 % set(auto) -> set(auto_process).
% 0.41/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.00 % set(auto2) -> assign(stats, some).
% 0.41/1.00 % set(auto2) -> clear(echo_input).
% 0.41/1.00 % set(auto2) -> set(quiet).
% 0.41/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.00 % set(auto2) -> clear(print_given).
% 0.41/1.00 assign(lrs_ticks,-1).
% 0.41/1.00 assign(sos_limit,10000).
% 0.41/1.00 assign(order,kbo).
% 0.41/1.00 set(lex_order_vars).
% 0.41/1.00 clear(print_given).
% 0.41/1.00
% 0.41/1.00 % formulas(sos). % not echoed (39 formulas)
% 0.41/1.00
% 0.41/1.00 ============================== end of input ==========================
% 0.41/1.00
% 0.41/1.00 % From the command line: assign(max_seconds, 300).
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.00
% 0.41/1.00 % Formulas that are not ordinary clauses:
% 0.41/1.00 1 (all A (v5_membered(A) -> v4_membered(A))) # label(cc1_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 2 (all A (v4_membered(A) -> v3_membered(A))) # label(cc2_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 3 (all A (v3_membered(A) -> v2_membered(A))) # label(cc3_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 4 (all A (v2_membered(A) -> v1_membered(A))) # label(cc4_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 5 (exists A (-empty(A) & v1_membered(A) & v2_membered(A) & v3_membered(A) & v4_membered(A) & v5_membered(A))) # label(rc1_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 6 (all A (v1_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B))))) # label(cc10_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 7 (all A (v2_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B) & v1_xreal_0(B))))) # label(cc11_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 8 (all A (v3_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B) & v1_xreal_0(B) & v1_rat_1(B))))) # label(cc12_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 9 (all A (v4_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B) & v1_xreal_0(B) & v1_int_1(B) & v1_rat_1(B))))) # label(cc13_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 10 (all A (v5_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B) & natural(B) & v1_xreal_0(B) & v1_int_1(B) & v1_rat_1(B))))) # label(cc14_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 11 (all A (v1_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B))))) # label(cc16_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 12 (all A (v2_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v2_membered(B))))) # label(cc17_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 13 (all A (v3_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v2_membered(B) & v3_membered(B))))) # label(cc18_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 14 (all A (v4_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v2_membered(B) & v3_membered(B) & v4_membered(B))))) # label(cc19_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 15 (all A (v5_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v2_membered(B) & v3_membered(B) & v4_membered(B) & v5_membered(B))))) # label(cc20_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 16 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 17 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 18 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 19 (all A (empty(A) -> v1_membered(A) & v2_membered(A) & v3_membered(A) & v4_membered(A) & v5_membered(A))) # label(cc15_membered) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 20 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 21 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 22 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 23 (all A (top_str(A) -> one_sorted_str(A))) # label(dt_l1_pre_topc) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 24 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 25 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 26 (all A (topological_space(A) & top_str(A) -> (exists B (element(B,powerset(the_carrier(A))) & closed_subset(B,A))))) # label(rc6_pre_topc) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 27 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 28 (all A all B (topological_space(A) & top_str(A) & element(B,powerset(the_carrier(A))) -> (exists C all D (in(D,C) <-> in(D,powerset(the_carrier(A))) & (exists E (element(E,powerset(the_carrier(A))) & E = D & closed_subset(E,A) & subset(B,D))))))) # label(s1_xboole_0__e1_40__pre_topc__1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 29 (all A all B ((-empty(A) -> (element(B,A) <-> in(B,A))) & (empty(A) -> (element(B,A) <-> empty(B))))) # label(d2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 30 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 31 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 32 (all A all B ((all C (in(C,A) -> in(C,B))) -> element(A,powerset(B)))) # label(l71_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 33 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 34 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 35 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 36 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 37 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 38 -(all A all B (topological_space(A) & top_str(A) & element(B,powerset(the_carrier(A))) -> (exists C (element(C,powerset(powerset(the_carrier(A)))) & (all D (element(D,powerset(the_carrier(A))) -> (in(D,C) <-> (exists E (element(E,powerset(the_carrier(A))) & E = D & closed_subset(E,A) & subset(B,D)))))))))) # label(s3_subset_1__e1_40__pre_topc) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/1.00
% 0.41/1.00 ============================== end of process non-clausal formulas ===
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.00
% 0.41/1.00 ============================== PREDICATE ELIMINATION =================
% 0.41/1.00 39 -topological_space(A) | -top_str(A) | closed_subset(f3(A),A) # label(rc6_pre_topc) # label(axiom). [clausify(26)].
% 0.41/1.00 40 topological_space(c4) # label(s3_subset_1__e1_40__pre_topc) # label(negated_conjecture). [clausify(38)].
% 243.05/243.36 Derived: -top_str(c4) | closed_subset(f3(c4),c4). [resolve(39,a,40,a)].
% 243.05/243.36 41 -topological_space(A) | -top_str(A) | element(f3(A),powerset(the_carrier(A))) # label(rc6_pre_topc) # label(axiom). [clausify(26)].
% 243.05/243.36 Derived: -top_str(c4) | element(f3(c4),powerset(the_carrier(c4))). [resolve(41,a,40,a)].
% 243.05/243.36 42 -topological_space(A) | -top_str(A) | -element(B,powerset(the_carrier(A))) | -in(C,f4(A,B)) | subset(B,C) # label(s1_xboole_0__e1_40__pre_topc__1) # label(axiom). [clausify(28)].
% 243.05/243.36 Derived: -top_str(c4) | -element(A,powerset(the_carrier(c4))) | -in(B,f4(c4,A)) | subset(A,B). [resolve(42,a,40,a)].
% 243.05/243.36 43 -topological_space(A) | -top_str(A) | -element(B,powerset(the_carrier(A))) | -in(C,f4(A,B)) | in(C,powerset(the_carrier(A))) # label(s1_xboole_0__e1_40__pre_topc__1) # label(axiom). [clausify(28)].
% 243.05/243.36 Derived: -top_str(c4) | -element(A,powerset(the_carrier(c4))) | -in(B,f4(c4,A)) | in(B,powerset(the_carrier(c4))). [resolve(43,a,40,a)].
% 243.05/243.36 44 -topological_space(A) | -top_str(A) | -element(B,powerset(the_carrier(A))) | -in(C,f4(A,B)) | f5(A,B,C) = C # label(s1_xboole_0__e1_40__pre_topc__1) # label(axiom). [clausify(28)].
% 243.05/243.36 Derived: -top_str(c4) | -element(A,powerset(the_carrier(c4))) | -in(B,f4(c4,A)) | f5(c4,A,B) = B. [resolve(44,a,40,a)].
% 243.05/243.36 45 -topological_space(A) | -top_str(A) | -element(B,powerset(the_carrier(A))) | -in(C,f4(A,B)) | closed_subset(f5(A,B,C),A) # label(s1_xboole_0__e1_40__pre_topc__1) # label(axiom). [clausify(28)].
% 243.05/243.36 Derived: -top_str(c4) | -element(A,powerset(the_carrier(c4))) | -in(B,f4(c4,A)) | closed_subset(f5(c4,A,B),c4). [resolve(45,a,40,a)].
% 243.05/243.36 46 -topological_space(A) | -top_str(A) | -element(B,powerset(the_carrier(A))) | -in(C,f4(A,B)) | element(f5(A,B,C),powerset(the_carrier(A))) # label(s1_xboole_0__e1_40__pre_topc__1) # label(axiom). [clausify(28)].
% 243.05/243.36 Derived: -top_str(c4) | -element(A,powerset(the_carrier(c4))) | -in(B,f4(c4,A)) | element(f5(c4,A,B),powerset(the_carrier(c4))). [resolve(46,a,40,a)].
% 243.05/243.36 47 -topological_space(A) | -top_str(A) | -element(B,powerset(the_carrier(A))) | in(C,f4(A,B)) | -in(C,powerset(the_carrier(A))) | -element(D,powerset(the_carrier(A))) | D != C | -closed_subset(D,A) | -subset(B,C) # label(s1_xboole_0__e1_40__pre_topc__1) # label(axiom). [clausify(28)].
% 243.05/243.36 Derived: -top_str(c4) | -element(A,powerset(the_carrier(c4))) | in(B,f4(c4,A)) | -in(B,powerset(the_carrier(c4))) | -element(C,powerset(the_carrier(c4))) | C != B | -closed_subset(C,c4) | -subset(A,B). [resolve(47,a,40,a)].
% 243.05/243.36
% 243.05/243.36 ============================== end predicate elimination =============
% 243.05/243.36
% 243.05/243.36 Auto_denials: (non-Horn, no changes).
% 243.05/243.36
% 243.05/243.36 Term ordering decisions:
% 243.05/243.36 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. f4=1. f7=1. powerset=1. the_carrier=1. f1=1. f2=1. f3=1. f6=1. f8=1. f9=1. f5=1.
% 243.05/243.36
% 243.05/243.36 ============================== end of process initial clauses ========
% 243.05/243.36
% 243.05/243.36 ============================== CLAUSES FOR SEARCH ====================
% 243.05/243.36
% 243.05/243.36 ============================== end of clauses for search =============
% 243.05/243.36
% 243.05/243.36 ============================== SEARCH ================================
% 243.05/243.36
% 243.05/243.36 % Starting search at 0.02 seconds.
% 243.05/243.36
% 243.05/243.36 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 283 (0.00 of 0.14 sec).
% 243.05/243.36
% 243.05/243.36 Low Water (keep): wt=26.000, iters=3508
% 243.05/243.36
% 243.05/243.36 Low Water (keep): wt=23.000, iters=3391
% 243.05/243.36
% 243.05/243.36 Low Water (keep): wt=22.000, iters=3403
% 243.05/243.36
% 243.05/243.36 Low Water (keep): wt=20.000, iters=3452
% 243.05/243.36
% 243.05/243.36 Low Water (keep): wt=19.000, iters=3340
% 243.05/243.36
% 243.05/243.36 Low Water (keep): wt=18.000, iters=3483
% 243.05/243.36
% 243.05/243.36 Low Water (keep): wt=17.000, iters=3414
% 243.05/243.36
% 243.05/243.36 Low Water (keep): wt=16.000, iters=3354
% 243.05/243.36
% 243.05/243.36 Low Water (keep): wt=15.000, iters=3337
% 243.05/243.36
% 243.05/243.36 Low Water (keep): wt=14.000, iters=3334
% 243.05/243.36
% 243.05/243.36 Low Water (displace): id=3909, wt=60.000
% 243.05/243.36
% 243.05/243.36 Low Water (displace): id=3910, wt=56.000
% 243.05/243.36
% 243.05/243.36 Low Water (displace): id=3898, wt=55.000
% 243.05/243.36
% 243.05/243.36 Low Water (displace): id=3937, wt=51.000
% 243.05/243.36
% 243.05/243.36 Low Water (displace): id=3932, wt=47.000
% 243.05/243.36
% 243.05/243.36 Low Water (displace): id=3935, wt=43.000
% 243.05/243.36
% 243.05/243.36 Low Water (displace): id=3936, wt=41.000
% 243.05/243.36
% 243.05/243.36 Low Water (displace): id=3934, wt=40.000
% 243.05/243.36
% 243.05/243.36 Low Water (displace): id=3864, wt=39.000
% 243.05/243.36
% 243.05/243.36 Low Water (displace): id=3939, wt=38.000
% 243.05/243.36
% 243.05/243.36 LowCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------