TSTP Solution File: TOP001-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : TOP001-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:49 EDT 2022
% Result : Unsatisfiable 0.68s 0.97s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : TOP001-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.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 14:14:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/0.97 ============================== Prover9 ===============================
% 0.68/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.97 Process 27620 was started by sandbox on n024.cluster.edu,
% 0.68/0.97 Sun May 29 14:14:07 2022
% 0.68/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27330_n024.cluster.edu".
% 0.68/0.97 ============================== end of head ===========================
% 0.68/0.97
% 0.68/0.97 ============================== INPUT =================================
% 0.68/0.97
% 0.68/0.97 % Reading from file /tmp/Prover9_27330_n024.cluster.edu
% 0.68/0.97
% 0.68/0.97 set(prolog_style_variables).
% 0.68/0.97 set(auto2).
% 0.68/0.97 % set(auto2) -> set(auto).
% 0.68/0.97 % set(auto) -> set(auto_inference).
% 0.68/0.97 % set(auto) -> set(auto_setup).
% 0.68/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.97 % set(auto) -> set(auto_limits).
% 0.68/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.97 % set(auto) -> set(auto_denials).
% 0.68/0.97 % set(auto) -> set(auto_process).
% 0.68/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.97 % set(auto2) -> assign(stats, some).
% 0.68/0.97 % set(auto2) -> clear(echo_input).
% 0.68/0.97 % set(auto2) -> set(quiet).
% 0.68/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.97 % set(auto2) -> clear(print_given).
% 0.68/0.97 assign(lrs_ticks,-1).
% 0.68/0.97 assign(sos_limit,10000).
% 0.68/0.97 assign(order,kbo).
% 0.68/0.97 set(lex_order_vars).
% 0.68/0.97 clear(print_given).
% 0.68/0.97
% 0.68/0.97 % formulas(sos). % not echoed (13 formulas)
% 0.68/0.97
% 0.68/0.97 ============================== end of input ==========================
% 0.68/0.97
% 0.68/0.97 % From the command line: assign(max_seconds, 300).
% 0.68/0.97
% 0.68/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.97
% 0.68/0.97 % Formulas that are not ordinary clauses:
% 0.68/0.97
% 0.68/0.97 ============================== end of process non-clausal formulas ===
% 0.68/0.97
% 0.68/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.97
% 0.68/0.97 ============================== PREDICATE ELIMINATION =================
% 0.68/0.97 1 -subset_sets(union_of_members(top_of_basis(f)),cx) # label(lemma_1a_2) # label(negated_conjecture). [assumption].
% 0.68/0.97 2 subset_sets(A,A) # label(set_theory_1) # label(axiom). [assumption].
% 0.68/0.97 3 subset_sets(A,B) | element_of_set(in_1st_set(A,B),A) # label(set_theory_4) # label(axiom). [assumption].
% 0.68/0.97 Derived: element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(top_of_basis(f))). [resolve(1,a,3,a)].
% 0.68/0.97 4 -equal_sets(A,B) | subset_sets(A,B) # label(set_theory_3) # label(axiom). [assumption].
% 0.68/0.97 Derived: -equal_sets(union_of_members(top_of_basis(f)),cx). [resolve(4,b,1,a)].
% 0.68/0.97 5 subset_sets(A,B) | -element_of_set(in_1st_set(A,B),B) # label(set_theory_5) # label(axiom). [assumption].
% 0.68/0.97 Derived: -element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),cx). [resolve(5,a,1,a)].
% 0.68/0.97 6 -subset_sets(A,B) | -element_of_set(C,A) | element_of_set(C,B) # label(set_theory_2) # label(axiom). [assumption].
% 0.68/0.97 Derived: -element_of_set(A,B) | element_of_set(A,C) | element_of_set(in_1st_set(B,C),B). [resolve(6,a,3,a)].
% 0.68/0.97 Derived: -element_of_set(A,B) | element_of_set(A,C) | -equal_sets(B,C). [resolve(6,a,4,b)].
% 0.68/0.97 Derived: -element_of_set(A,B) | element_of_set(A,C) | -element_of_set(in_1st_set(B,C),C). [resolve(6,a,5,a)].
% 0.68/0.97 7 -basis(A,B) | equal_sets(union_of_members(B),A) # label(basis_for_topology_28) # label(axiom). [assumption].
% 0.68/0.97 8 basis(cx,f) # label(lemma_1a_1) # label(negated_conjecture). [assumption].
% 0.68/0.97 Derived: equal_sets(union_of_members(f),cx). [resolve(7,a,8,a)].
% 0.68/0.97 9 equal_sets(union_of_members(f),cx). [resolve(7,a,8,a)].
% 0.68/0.97 10 -equal_sets(union_of_members(top_of_basis(f)),cx). [resolve(4,b,1,a)].
% 0.68/0.97 11 -element_of_set(A,B) | element_of_set(A,C) | -equal_sets(B,C). [resolve(6,a,4,b)].
% 0.68/0.97 Derived: -element_of_set(A,union_of_members(f)) | element_of_set(A,cx). [resolve(9,a,11,c)].
% 0.68/0.97
% 0.68/0.97 ============================== end predicate elimination =============
% 0.68/0.97
% 0.68/0.97 Auto_denials: (non-Horn, no changes).
% 0.68/0.97
% 0.68/0.97 Term ordering decisions:
% 0.68/0.97 Function symbol KB weights: f=1. cx=1. in_1st_set=1. f1=1. union_of_members=1. top_of_basis=1. f10=1.
% 0.68/0.97
% 0.68/0.97 ============================== end of process initial clauses ========
% 0.68/0.97
% 0.68/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.97
% 0.68/0.97 ============================== end of clauses for search =============
% 0.68/0.97
% 0.68/0.97 ============================== SEARCH ================================
% 0.68/0.97
% 0.68/0.97 % Starting search at 0.01 seconds.
% 0.68/0.97
% 0.68/0.97 ============================== PROOF =================================
% 0.68/0.97 % SZS status Unsatisfiable
% 0.68/0.97 % SZS output start Refutation
% 0.68/0.97
% 0.68/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.68/0.97 % Length of proof is 25.
% 0.68/0.97 % Level of proof is 6.
% 0.68/0.97 % Maximum clause weight is 23.000.
% 0.68/0.97 % Given clauses 28.
% 0.68/0.97
% 0.68/0.97 1 -subset_sets(union_of_members(top_of_basis(f)),cx) # label(lemma_1a_2) # label(negated_conjecture). [assumption].
% 0.68/0.97 3 subset_sets(A,B) | element_of_set(in_1st_set(A,B),A) # label(set_theory_4) # label(axiom). [assumption].
% 0.68/0.97 4 -equal_sets(A,B) | subset_sets(A,B) # label(set_theory_3) # label(axiom). [assumption].
% 0.68/0.97 5 subset_sets(A,B) | -element_of_set(in_1st_set(A,B),B) # label(set_theory_5) # label(axiom). [assumption].
% 0.68/0.97 6 -subset_sets(A,B) | -element_of_set(C,A) | element_of_set(C,B) # label(set_theory_2) # label(axiom). [assumption].
% 0.68/0.97 7 -basis(A,B) | equal_sets(union_of_members(B),A) # label(basis_for_topology_28) # label(axiom). [assumption].
% 0.68/0.97 8 basis(cx,f) # label(lemma_1a_1) # label(negated_conjecture). [assumption].
% 0.68/0.97 9 equal_sets(union_of_members(f),cx). [resolve(7,a,8,a)].
% 0.68/0.97 11 -element_of_set(A,B) | element_of_set(A,C) | -equal_sets(B,C). [resolve(6,a,4,b)].
% 0.68/0.97 12 -element_of_set(A,union_of_members(B)) | element_of_set(A,f1(B,A)) # label(union_of_members_1) # label(axiom). [assumption].
% 0.68/0.97 13 -element_of_set(A,union_of_members(B)) | element_of_collection(f1(B,A),B) # label(union_of_members_2) # label(axiom). [assumption].
% 0.68/0.97 14 element_of_set(A,union_of_members(B)) | -element_of_set(A,C) | -element_of_collection(C,B) # label(union_of_members_3) # label(axiom). [assumption].
% 0.68/0.97 15 -element_of_collection(A,top_of_basis(B)) | -element_of_set(C,A) | element_of_set(C,f10(B,A,C)) # label(topology_generated_37) # label(axiom). [assumption].
% 0.68/0.97 16 -element_of_collection(A,top_of_basis(B)) | -element_of_set(C,A) | element_of_collection(f10(B,A,C),B) # label(topology_generated_38) # label(axiom). [assumption].
% 0.68/0.97 17 element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(top_of_basis(f))). [resolve(1,a,3,a)].
% 0.68/0.97 18 -element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),cx). [resolve(5,a,1,a)].
% 0.68/0.97 21 -element_of_set(A,union_of_members(f)) | element_of_set(A,cx). [resolve(9,a,11,c)].
% 0.68/0.97 22 element_of_collection(f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx)),top_of_basis(f)). [resolve(17,a,13,a)].
% 0.68/0.97 23 element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx))). [resolve(17,a,12,a)].
% 0.68/0.97 26 -element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(f)). [ur(21,b,18,a)].
% 0.68/0.97 27 -element_of_set(A,f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx))) | element_of_collection(f10(f,f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx)),A),f). [resolve(22,a,16,a)].
% 0.68/0.97 28 -element_of_set(A,f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx))) | element_of_set(A,f10(f,f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx)),A)). [resolve(22,a,15,a)].
% 0.68/0.97 41 element_of_collection(f10(f,f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx)),in_1st_set(union_of_members(top_of_basis(f)),cx)),f). [resolve(27,a,23,a)].
% 0.68/0.97 47 -element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),f10(f,f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx)),in_1st_set(union_of_members(top_of_basis(f)),cx))). [ur(14,a,26,a,c,41,a)].
% 0.68/0.97 51 $F. [resolve(28,a,23,a),unit_del(a,47)].
% 0.68/0.97
% 0.68/0.97 % SZS output end Refutation
% 0.68/0.97 ============================== end of proof ==========================
% 0.68/0.97
% 0.68/0.97 ============================== STATISTICS ============================
% 0.68/0.97
% 0.68/0.97 Given=28. Generated=59. Kept=39. proofs=1.
% 0.68/0.97 Usable=28. Sos=11. Demods=0. Limbo=0, Disabled=21. Hints=0.
% 0.68/0.97 Megabytes=0.08.
% 0.68/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.68/0.97
% 0.68/0.97 ============================== end of statistics =====================
% 0.68/0.97
% 0.68/0.97 ============================== end of search =========================
% 0.68/0.97
% 0.68/0.97 THEOREM PROVED
% 0.68/0.97 % SZS status Unsatisfiable
% 0.68/0.97
% 0.68/0.97 Exiting with 1 proof.
% 0.68/0.97
% 0.68/0.97 Process 27620 exit (max_proofs) Sun May 29 14:14:07 2022
% 0.68/0.97 Prover9 interrupted
%------------------------------------------------------------------------------