TSTP Solution File: TOP020+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : TOP020+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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 21 21:33:51 EDT 2022
% Result : Timeout 300.09s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : TOP020+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 May 29 05:56:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 29945 was started by sandbox2 on n027.cluster.edu,
% 0.42/0.99 Sun May 29 05:56:15 2022
% 0.42/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29791_n027.cluster.edu".
% 0.42/0.99 ============================== end of head ===========================
% 0.42/0.99
% 0.42/0.99 ============================== INPUT =================================
% 0.42/0.99
% 0.42/0.99 % Reading from file /tmp/Prover9_29791_n027.cluster.edu
% 0.42/0.99
% 0.42/0.99 set(prolog_style_variables).
% 0.42/0.99 set(auto2).
% 0.42/0.99 % set(auto2) -> set(auto).
% 0.42/0.99 % set(auto) -> set(auto_inference).
% 0.42/0.99 % set(auto) -> set(auto_setup).
% 0.42/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99 % set(auto) -> set(auto_limits).
% 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99 % set(auto) -> set(auto_denials).
% 0.42/0.99 % set(auto) -> set(auto_process).
% 0.42/0.99 % 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 (9 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 X all A ((all Y (a_member_of(Y,coerce_to_class(X)) & -a_member_of(Y,A) -> (exists G (a_member_of(Y,G) & open_in(G,X) & disjoint(G,A))))) -> closed_in(A,X))) # label(closed_subset_thm) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 2 (all X (a_hausdorff_top_space(X) -> (all A all B (a_member_of(A,coerce_to_class(X)) & a_member_of(B,coerce_to_class(X)) & A != B -> (exists G1 exists G2 (open_in(G1,X) & open_in(G2,X) & a_member_of(A,G1) & a_member_of(B,G2) & disjoint(G1,G2))))))) # label(hausdorff) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 3 (all A all X all B all Y (open_in(A,X) & open_in(B,Y) -> open_in(the_product_of(A,B),the_product_top_space_of(X,Y)))) # label(product_of_open_sets) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 4 (all S all T all X (a_member_of(X,coerce_to_class(the_product_top_space_of(S,T))) -> (exists A exists B (a_member_of(A,coerce_to_class(S)) & a_member_of(B,coerce_to_class(T)) & X = the_ordered_pair(A,B))))) # label(product_top) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 5 (all X all S all T (a_member_of(X,the_product_of(S,T)) <-> (exists A exists B (a_member_of(A,S) & a_member_of(B,T) & X = the_ordered_pair(A,B))))) # label(product) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 6 (all A all B (disjoint(A,B) <-> -(exists Y (a_member_of(Y,A) & a_member_of(Y,B))))) # label(disjoint_defn) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 7 (all A all B all C all D (the_ordered_pair(A,B) = the_ordered_pair(C,D) -> A = C & B = D)) # label(ordered_pair) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 8 (all X all S (a_member_of(X,coerce_to_class(the_diagonal_top(S))) <-> (exists A (a_member_of(A,coerce_to_class(S)) & X = the_ordered_pair(A,A))))) # label(diagonal_top) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 9 -(all S (a_hausdorff_top_space(S) -> closed_in(coerce_to_class(the_diagonal_top(S)),the_product_top_space_of(S,S)))) # label(challenge_AMR_1_4_4) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.05/1.33
% 1.05/1.33 ============================== end of process non-clausal formulas ===
% 1.05/1.33
% 1.05/1.33 ============================== PROCESS INITIAL CLAUSES ===============
% 1.05/1.33
% 1.05/1.33 ============================== PREDICATE ELIMINATION =================
% 1.05/1.33 10 -a_hausdorff_top_space(A) | -a_member_of(B,coerce_to_class(A)) | -a_member_of(C,coerce_to_class(A)) | C = B | open_in(f2(A,B,C),A) # label(hausdorff) # label(axiom). [clausify(2)].
% 1.05/1.33 11 a_hausdorff_top_space(c1) # label(challenge_AMR_1_4_4) # label(negated_conjecture). [clausify(9)].
% 1.05/1.33 Derived: -a_member_of(A,coerce_to_class(c1)) | -a_member_of(B,coerce_to_class(c1)) | B = A | open_in(f2(c1,A,B),c1). [resolve(10,a,11,a)].
% 1.05/1.33 12 -a_hausdorff_top_space(A) | -a_member_of(B,coerce_to_class(A)) | -a_member_of(C,coerce_to_class(A)) | C = B | open_in(f3(A,B,C),A) # label(hausdorff) # label(axiom). [clausify(2)].
% 1.05/1.33 Derived: -a_member_of(A,coerce_to_class(c1)) | -a_member_of(B,coerce_to_class(c1)) | B = A | open_in(f3(c1,A,B),c1). [resolve(12,a,11,a)].
% 1.05/1.33 13 -a_hausdorff_top_space(A) | -a_member_of(B,coerce_to_class(A)) | -a_member_of(C,coerce_to_class(A)) | C = B | a_member_of(B,f2(A,B,C)) # label(hausdorff) # label(axiom). [clausify(2)].
% 1.05/1.33 Derived: -a_member_of(A,coerce_to_class(c1)) | -a_member_of(B,coerce_to_class(c1)) | B = A | a_member_of(A,f2(c1,A,B)). [resolve(13,a,11,a)].
% 1.05/1.33 14 -a_hausdorff_top_space(A) | -a_member_of(B,coerce_to_class(A)) | -a_member_of(C,coerce_to_class(A)) | C = B | a_member_of(C,f3(A,B,C)) # label(hausdorff) # label(axiom). [clausify(2)].
% 1.05/1.33 Derived: -a_member_of(A,coerce_to_class(c1)) | -a_member_of(B,coerce_to_class(c1)) | B = A | a_member_of(B,f3(c1,A,B)). [resolve(14,a,11,a)].
% 1.05/1.33 15 -a_hausdorff_top_space(A) | -a_member_of(B,coerce_to_class(A)) | -a_member_of(C,coerce_to_class(A)) | C = B | disjoint(f2(A,B,C),f3(A,B,C)) # label(hausdorff) # label(axiom). [clausify(2)].
% 1.05/1.33 Derived: -a_member_of(A,coerce_to_class(c1)) | -a_member_of(B,coerce_to_class(c1)) | B = A | disjoint(f2(c1,A,B),f3(c1,A,B)). [resolve(15,a,11,a)].
% 1.05/1.33 16 -disjoint(A,B) | -a_member_of(C,A) | -a_member_of(C,B) # label(disjoint_defn) # label(axiom). [clausify(6)].
% 1.05/1.33 17 disjoint(A,B) | a_member_of(f8(A,B),A) # label(disjoint_defn) # label(axiom). [clausify(6)].
% 1.05/1.33 18 disjoint(A,B) | a_member_of(f8(A,B),B) # label(disjoint_defn) # label(axiom). [clausify(6)].
% 1.05/1.33 Derived: -a_member_of(A,B) | -a_member_of(A,C) | a_member_of(f8(B,C),B). [resolve(16,a,17,a)].
% 1.05/1.33 Derived: -a_member_of(A,B) | -a_member_of(A,C) | a_member_of(f8(B,C),C). [resolve(16,a,18,a)].
% 1.05/1.33 19 -a_member_of(f1(A,B),C) | -open_in(C,A) | -disjoint(C,B) | closed_in(B,A) # label(closed_subset_thm) # label(axiom). [clausify(1)].
% 1.05/1.33 Derived: -a_member_of(f1(A,B),C) | -open_in(C,A) | closed_in(B,A) | a_member_of(f8(C,B),C). [resolve(19,c,17,a)].
% 1.05/1.33 Derived: -a_member_of(f1(A,B),C) | -open_in(C,A) | closed_in(B,A) | a_member_of(f8(C,B),B). [resolve(19,c,18,a)].
% 1.05/1.33 20 -a_member_of(A,coerce_to_class(c1)) | -a_member_of(B,coerce_to_class(c1)) | B = A | disjoint(f2(c1,A,B),f3(c1,A,B)). [resolve(15,a,11,a)].
% 1.05/1.33 Derived: -a_member_of(A,coerce_to_class(c1)) | -a_member_of(B,coerce_to_class(c1)) | B = A | -a_member_of(C,f2(c1,A,B)) | -a_member_of(C,f3(c1,A,B)). [resolve(20,d,16,a)].
% 1.05/1.33 Derived: -a_member_of(A,coerce_to_class(c1)) | -a_member_of(B,coerce_to_class(c1)) | B = A | -a_member_of(f1(C,f3(c1,A,B)),f2(c1,A,B)) | -open_in(f2(c1,A,B),C) | closed_in(f3(c1,A,B),C). [resolve(20,d,19,c)].
% 1.05/1.33
% 1.05/1.33 ============================== end predicate elimination =============
% 1.05/1.33
% 1.05/1.33 Auto_denials: (non-Horn, no changes).
% 1.05/1.33
% 1.05/1.33 Term ordering decisions:
% 1.05/1.33 Function symbol KB weights: c1=1. the_ordered_pair=1. the_product_of=1. the_product_top_space_of=1. f1=1. f8=1. f9=1. coerce_to_class=1. the_diagonal_top=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1.
% 1.05/1.33
% 1.05/1.33 ============================== end of process initial clauses ========
% 1.05/1.33
% 1.05/1.33 ============================== CLAUSES FOR SEARCH ====================
% 1.05/1.33
% 1.05/1.33 ============================== end of clauses for search =============
% 1.05/1.33
% 1.05/1.33 ============================== SEARCH ================================
% 1.05/1.33
% 1.05/1.33 % Starting search at 0.01 seconds.
% 1.05/1.33
% 1.05/1.33 NOTE: Back_sCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------