TSTP Solution File: SEU323-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU323-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:58 EDT 2022
% Result : Unsatisfiable 0.46s 1.04s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU323-10 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n022.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 18:51:46 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.04 ============================== Prover9 ===============================
% 0.46/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.04 Process 30210 was started by sandbox2 on n022.cluster.edu,
% 0.46/1.04 Sun Jun 19 18:51:47 2022
% 0.46/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30057_n022.cluster.edu".
% 0.46/1.04 ============================== end of head ===========================
% 0.46/1.04
% 0.46/1.04 ============================== INPUT =================================
% 0.46/1.04
% 0.46/1.04 % Reading from file /tmp/Prover9_30057_n022.cluster.edu
% 0.46/1.04
% 0.46/1.04 set(prolog_style_variables).
% 0.46/1.04 set(auto2).
% 0.46/1.04 % set(auto2) -> set(auto).
% 0.46/1.04 % set(auto) -> set(auto_inference).
% 0.46/1.04 % set(auto) -> set(auto_setup).
% 0.46/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.04 % set(auto) -> set(auto_limits).
% 0.46/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.04 % set(auto) -> set(auto_denials).
% 0.46/1.04 % set(auto) -> set(auto_process).
% 0.46/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.04 % set(auto2) -> assign(stats, some).
% 0.46/1.04 % set(auto2) -> clear(echo_input).
% 0.46/1.04 % set(auto2) -> set(quiet).
% 0.46/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.04 % set(auto2) -> clear(print_given).
% 0.46/1.04 assign(lrs_ticks,-1).
% 0.46/1.04 assign(sos_limit,10000).
% 0.46/1.04 assign(order,kbo).
% 0.46/1.04 set(lex_order_vars).
% 0.46/1.04 clear(print_given).
% 0.46/1.04
% 0.46/1.04 % formulas(sos). % not echoed (25 formulas)
% 0.46/1.04
% 0.46/1.04 ============================== end of input ==========================
% 0.46/1.04
% 0.46/1.04 % From the command line: assign(max_seconds, 300).
% 0.46/1.04
% 0.46/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.04
% 0.46/1.04 % Formulas that are not ordinary clauses:
% 0.46/1.04
% 0.46/1.04 ============================== end of process non-clausal formulas ===
% 0.46/1.04
% 0.46/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.04
% 0.46/1.04 ============================== PREDICATE ELIMINATION =================
% 0.46/1.04
% 0.46/1.04 ============================== end predicate elimination =============
% 0.46/1.04
% 0.46/1.04 Auto_denials:
% 0.46/1.04 % copying label t51_tops_1_3 to answer in negative clause
% 0.46/1.04
% 0.46/1.04 Term ordering decisions:
% 0.46/1.04 Function symbol KB weights: true=1. sK2_t51_tops_1_A=1. sK1_t51_tops_1_B=1. sK5_existence_l1_pre_topc_A=1. sK6_existence_l1_struct_0_A=1. element=1. subset_complement=1. closed_subset=1. interior=1. open_subset=1. subset=1. topstr_closure=1. powerset=1. the_carrier=1. top_str=1. topological_space=1. one_sorted_str=1. sK3_rc1_tops_1_B=1. sK7_rc6_pre_topc_B=1. sK4_existence_m1_subset_1_B=1. ifeq=1. ifeq2=1.
% 0.46/1.04
% 0.46/1.04 ============================== end of process initial clauses ========
% 0.46/1.04
% 0.46/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.04
% 0.46/1.04 ============================== end of clauses for search =============
% 0.46/1.04
% 0.46/1.04 ============================== SEARCH ================================
% 0.46/1.04
% 0.46/1.04 % Starting search at 0.01 seconds.
% 0.46/1.04
% 0.46/1.04 ============================== PROOF =================================
% 0.46/1.04 % SZS status Unsatisfiable
% 0.46/1.04 % SZS output start Refutation
% 0.46/1.04
% 0.46/1.04 % Proof 1 at 0.03 (+ 0.00) seconds: t51_tops_1_3.
% 0.46/1.04 % Length of proof is 30.
% 0.46/1.04 % Level of proof is 8.
% 0.46/1.04 % Maximum clause weight is 41.000.
% 0.46/1.04 % Given clauses 73.
% 0.46/1.04
% 0.46/1.04 1 one_sorted_str(sK6_existence_l1_struct_0_A) = true # label(existence_l1_struct_0) # label(axiom). [assumption].
% 0.46/1.04 2 true = one_sorted_str(sK6_existence_l1_struct_0_A). [copy(1),flip(a)].
% 0.46/1.04 3 top_str(sK5_existence_l1_pre_topc_A) = true # label(existence_l1_pre_topc) # label(axiom). [assumption].
% 0.46/1.04 4 one_sorted_str(sK6_existence_l1_struct_0_A) = top_str(sK5_existence_l1_pre_topc_A). [copy(3),rewrite([2(3)]),flip(a)].
% 0.46/1.04 5 top_str(sK2_t51_tops_1_A) = true # label(t51_tops_1) # label(negated_conjecture). [assumption].
% 0.46/1.04 6 top_str(sK5_existence_l1_pre_topc_A) = top_str(sK2_t51_tops_1_A). [copy(5),rewrite([2(3),4(4)]),flip(a)].
% 0.46/1.04 7 topological_space(sK2_t51_tops_1_A) = true # label(t51_tops_1_1) # label(negated_conjecture). [assumption].
% 0.46/1.04 8 topological_space(sK2_t51_tops_1_A) = top_str(sK2_t51_tops_1_A). [copy(7),rewrite([2(3),4(4),6(4)])].
% 0.46/1.04 13 ifeq2(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 0.46/1.04 14 ifeq(A,A,B,C) = B # label(ifeq_axiom_001) # label(axiom). [assumption].
% 0.46/1.04 15 element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))) = true # label(t51_tops_1_2) # label(negated_conjecture). [assumption].
% 0.46/1.04 16 element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))) = top_str(sK2_t51_tops_1_A). [copy(15),rewrite([2(6),4(7),6(7)])].
% 0.46/1.04 25 ifeq(element(A,powerset(B)),true,element(subset_complement(B,A),powerset(B)),true) = true # label(dt_k3_subset_1) # label(axiom). [assumption].
% 0.46/1.04 26 ifeq(element(A,powerset(B)),top_str(sK2_t51_tops_1_A),element(subset_complement(B,A),powerset(B)),top_str(sK2_t51_tops_1_A)) = top_str(sK2_t51_tops_1_A). [copy(25),rewrite([2(3),4(4),6(4),2(8),4(9),6(9),2(11),4(12),6(12)])].
% 0.46/1.04 35 ifeq(element(A,powerset(the_carrier(B))),true,ifeq(top_str(B),true,element(topstr_closure(B,A),powerset(the_carrier(B))),true),true) = true # label(dt_k6_pre_topc) # label(axiom). [assumption].
% 0.46/1.04 36 ifeq(element(A,powerset(the_carrier(B))),top_str(sK2_t51_tops_1_A),ifeq(top_str(B),top_str(sK2_t51_tops_1_A),element(topstr_closure(B,A),powerset(the_carrier(B))),top_str(sK2_t51_tops_1_A)),top_str(sK2_t51_tops_1_A)) = top_str(sK2_t51_tops_1_A). [copy(35),rewrite([2(4),4(5),6(5),2(7),4(8),6(8),2(13),4(14),6(14),2(16),4(17),6(17),2(19),4(20),6(20)])].
% 0.46/1.04 39 ifeq(element(A,powerset(the_carrier(B))),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,closed_subset(topstr_closure(B,A),B),true),true),true) = true # label(fc2_tops_1) # label(axiom). [assumption].
% 0.46/1.04 40 ifeq(element(A,powerset(the_carrier(B))),top_str(sK2_t51_tops_1_A),ifeq(topological_space(B),top_str(sK2_t51_tops_1_A),ifeq(top_str(B),top_str(sK2_t51_tops_1_A),closed_subset(topstr_closure(B,A),B),top_str(sK2_t51_tops_1_A)),top_str(sK2_t51_tops_1_A)),top_str(sK2_t51_tops_1_A)) = top_str(sK2_t51_tops_1_A). [copy(39),rewrite([2(4),4(5),6(5),2(7),4(8),6(8),2(10),4(11),6(11),2(14),4(15),6(15),2(17),4(18),6(18),2(20),4(21),6(21),2(23),4(24),6(24)])].
% 0.46/1.04 41 ifeq2(element(A,powerset(the_carrier(B))),true,ifeq2(top_str(B),true,subset_complement(the_carrier(B),topstr_closure(B,subset_complement(the_carrier(B),A))),interior(B,A)),interior(B,A)) = interior(B,A) # label(d1_tops_1) # label(axiom). [assumption].
% 0.46/1.04 42 ifeq2(element(A,powerset(the_carrier(B))),top_str(sK2_t51_tops_1_A),ifeq2(top_str(B),top_str(sK2_t51_tops_1_A),subset_complement(the_carrier(B),topstr_closure(B,subset_complement(the_carrier(B),A))),interior(B,A)),interior(B,A)) = interior(B,A). [copy(41),rewrite([2(4),4(5),6(5),2(7),4(8),6(8)])].
% 0.46/1.04 43 ifeq(element(A,powerset(the_carrier(B))),true,ifeq(closed_subset(A,B),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,open_subset(subset_complement(the_carrier(B),A),B),true),true),true),true) = true # label(fc3_tops_1) # label(axiom). [assumption].
% 0.46/1.04 44 ifeq(element(A,powerset(the_carrier(B))),top_str(sK2_t51_tops_1_A),ifeq(closed_subset(A,B),top_str(sK2_t51_tops_1_A),ifeq(topological_space(B),top_str(sK2_t51_tops_1_A),ifeq(top_str(B),top_str(sK2_t51_tops_1_A),open_subset(subset_complement(the_carrier(B),A),B),top_str(sK2_t51_tops_1_A)),top_str(sK2_t51_tops_1_A)),top_str(sK2_t51_tops_1_A)),top_str(sK2_t51_tops_1_A)) = top_str(sK2_t51_tops_1_A). [copy(43),rewrite([2(4),4(5),6(5),2(7),4(8),6(8),2(10),4(11),6(11),2(13),4(14),6(14),2(18),4(19),6(19),2(21),4(22),6(22),2(24),4(25),6(25),2(27),4(28),6(28),2(30),4(31),6(31)])].
% 0.46/1.04 47 open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) != true # label(t51_tops_1_3) # label(negated_conjecture) # answer(t51_tops_1_3). [assumption].
% 0.46/1.04 48 open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) != top_str(sK2_t51_tops_1_A) # answer(t51_tops_1_3). [copy(47),rewrite([2(6),4(7),6(7)])].
% 0.46/1.04 61 element(subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B),powerset(the_carrier(sK2_t51_tops_1_A))) = top_str(sK2_t51_tops_1_A). [para(16(a,1),26(a,1,1)),rewrite([14(15)])].
% 0.46/1.04 85 subset_complement(the_carrier(sK2_t51_tops_1_A),topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B))) = interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B). [para(16(a,1),42(a,1,1)),rewrite([13(21),13(17)])].
% 0.46/1.04 147 element(topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B)),powerset(the_carrier(sK2_t51_tops_1_A))) = top_str(sK2_t51_tops_1_A). [para(61(a,1),36(a,1,1)),rewrite([14(21),14(17)])].
% 0.46/1.04 149 closed_subset(topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B)),sK2_t51_tops_1_A) = top_str(sK2_t51_tops_1_A). [para(61(a,1),40(a,1,1)),rewrite([8(6),14(23),14(19),14(15)])].
% 0.46/1.04 216 open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) = top_str(sK2_t51_tops_1_A). [para(149(a,1),44(a,1,3,1)),rewrite([147(10),8(10),85(25),14(24),14(20),14(16),14(12)])].
% 0.46/1.04 217 $F # answer(t51_tops_1_3). [resolve(216,a,48,a)].
% 0.46/1.04
% 0.46/1.04 % SZS output end Refutation
% 0.46/1.04 ============================== end of proof ==========================
% 0.46/1.04
% 0.46/1.04 ============================== STATISTICS ============================
% 0.46/1.04
% 0.46/1.04 Given=73. Generated=378. Kept=193. proofs=1.
% 0.46/1.04 Usable=73. Sos=104. Demods=176. Limbo=0, Disabled=40. Hints=0.
% 0.46/1.04 Megabytes=0.33.
% 0.46/1.04 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.46/1.04
% 0.46/1.04 ============================== end of statistics =====================
% 0.46/1.04
% 0.46/1.04 ============================== end of search =========================
% 0.46/1.04
% 0.46/1.04 THEOREM PROVED
% 0.46/1.04 % SZS status Unsatisfiable
% 0.46/1.04
% 0.46/1.04 Exiting with 1 proof.
% 0.46/1.04
% 0.46/1.04 Process 30210 exit (max_proofs) Sun Jun 19 18:51:47 2022
% 0.46/1.04 Prover9 interrupted
%------------------------------------------------------------------------------