TSTP Solution File: TOP005-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : TOP005-2 : TPTP v8.1.0. Released v1.0.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:50 EDT 2022
% Result : Unsatisfiable 0.67s 1.00s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : TOP005-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/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 12:38:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/1.00 ============================== Prover9 ===============================
% 0.67/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.67/1.00 Process 6841 was started by sandbox on n027.cluster.edu,
% 0.67/1.00 Sun May 29 12:38:30 2022
% 0.67/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6688_n027.cluster.edu".
% 0.67/1.00 ============================== end of head ===========================
% 0.67/1.00
% 0.67/1.00 ============================== INPUT =================================
% 0.67/1.00
% 0.67/1.00 % Reading from file /tmp/Prover9_6688_n027.cluster.edu
% 0.67/1.00
% 0.67/1.00 set(prolog_style_variables).
% 0.67/1.00 set(auto2).
% 0.67/1.00 % set(auto2) -> set(auto).
% 0.67/1.00 % set(auto) -> set(auto_inference).
% 0.67/1.00 % set(auto) -> set(auto_setup).
% 0.67/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.67/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/1.00 % set(auto) -> set(auto_limits).
% 0.67/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/1.00 % set(auto) -> set(auto_denials).
% 0.67/1.00 % set(auto) -> set(auto_process).
% 0.67/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.67/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.67/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.67/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.67/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.67/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.67/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.67/1.00 % set(auto2) -> assign(stats, some).
% 0.67/1.00 % set(auto2) -> clear(echo_input).
% 0.67/1.00 % set(auto2) -> set(quiet).
% 0.67/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.67/1.00 % set(auto2) -> clear(print_given).
% 0.67/1.00 assign(lrs_ticks,-1).
% 0.67/1.00 assign(sos_limit,10000).
% 0.67/1.00 assign(order,kbo).
% 0.67/1.00 set(lex_order_vars).
% 0.67/1.00 clear(print_given).
% 0.67/1.00
% 0.67/1.00 % formulas(sos). % not echoed (12 formulas)
% 0.67/1.00
% 0.67/1.00 ============================== end of input ==========================
% 0.67/1.00
% 0.67/1.00 % From the command line: assign(max_seconds, 300).
% 0.67/1.00
% 0.67/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/1.00
% 0.67/1.00 % Formulas that are not ordinary clauses:
% 0.67/1.00
% 0.67/1.00 ============================== end of process non-clausal formulas ===
% 0.67/1.00
% 0.67/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/1.00
% 0.67/1.00 ============================== PREDICATE ELIMINATION =================
% 0.67/1.00 1 -subset_collections(A,B) | -element_of_collection(C,A) | element_of_collection(C,B) # label(set_theory_21) # label(axiom). [assumption].
% 0.67/1.00 2 subset_collections(g,top_of_basis(f)) # label(lemma_1e_2) # label(negated_conjecture). [assumption].
% 0.67/1.00 Derived: -element_of_collection(A,g) | element_of_collection(A,top_of_basis(f)). [resolve(1,a,2,a)].
% 0.67/1.00
% 0.67/1.00 ============================== end predicate elimination =============
% 0.67/1.00
% 0.67/1.00 Auto_denials: (non-Horn, no changes).
% 0.67/1.00
% 0.67/1.00 Term ordering decisions:
% 0.67/1.00 Function symbol KB weights: f=1. g=1. f1=1. f11=1. top_of_basis=1. union_of_members=1. f10=1.
% 0.67/1.00
% 0.67/1.00 ============================== end of process initial clauses ========
% 0.67/1.00
% 0.67/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.67/1.00
% 0.67/1.00 ============================== end of clauses for search =============
% 0.67/1.00
% 0.67/1.00 ============================== SEARCH ================================
% 0.67/1.00
% 0.67/1.00 % Starting search at 0.01 seconds.
% 0.67/1.00
% 0.67/1.00 ============================== PROOF =================================
% 0.67/1.00 % SZS status Unsatisfiable
% 0.67/1.00 % SZS output start Refutation
% 0.67/1.00
% 0.67/1.00 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.67/1.00 % Length of proof is 27.
% 0.67/1.00 % Level of proof is 9.
% 0.67/1.00 % Maximum clause weight is 41.000.
% 0.67/1.00 % Given clauses 96.
% 0.67/1.00
% 0.67/1.00 1 -subset_collections(A,B) | -element_of_collection(C,A) | element_of_collection(C,B) # label(set_theory_21) # label(axiom). [assumption].
% 0.67/1.00 2 subset_collections(g,top_of_basis(f)) # label(lemma_1e_2) # label(negated_conjecture). [assumption].
% 0.67/1.00 3 element_of_collection(A,top_of_basis(B)) | element_of_set(f11(B,A),A) # label(topology_generated_40) # label(axiom). [assumption].
% 0.67/1.00 4 -element_of_collection(union_of_members(g),top_of_basis(f)) # label(lemma_1e_3) # label(negated_conjecture). [assumption].
% 0.67/1.00 5 -element_of_set(A,union_of_members(B)) | element_of_set(A,f1(B,A)) # label(union_of_members_1) # label(axiom). [assumption].
% 0.67/1.00 6 -element_of_set(A,union_of_members(B)) | element_of_collection(f1(B,A),B) # label(union_of_members_2) # label(axiom). [assumption].
% 0.67/1.00 8 -subset_sets(A,B) | -element_of_collection(B,C) | subset_sets(A,union_of_members(C)) # label(set_theory_20) # label(axiom). [assumption].
% 0.67/1.00 9 -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.67/1.00 10 -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.67/1.00 11 -element_of_collection(A,top_of_basis(B)) | -element_of_set(C,A) | subset_sets(f10(B,A,C),A) # label(topology_generated_39) # label(axiom). [assumption].
% 0.67/1.00 12 element_of_collection(A,top_of_basis(B)) | -element_of_set(f11(B,A),C) | -element_of_collection(C,B) | -subset_sets(C,A) # label(topology_generated_41) # label(axiom). [assumption].
% 0.67/1.00 13 -element_of_collection(A,g) | element_of_collection(A,top_of_basis(f)). [resolve(1,a,2,a)].
% 0.67/1.00 14 element_of_set(f11(A,union_of_members(B)),f1(B,f11(A,union_of_members(B)))) | element_of_collection(union_of_members(B),top_of_basis(A)). [resolve(5,a,3,b)].
% 0.67/1.00 15 element_of_collection(f1(A,f11(B,union_of_members(A))),A) | element_of_collection(union_of_members(A),top_of_basis(B)). [resolve(6,a,3,b)].
% 0.67/1.00 21 element_of_collection(union_of_members(A),top_of_basis(B)) | -element_of_collection(f1(A,f11(B,union_of_members(A))),top_of_basis(C)) | subset_sets(f10(C,f1(A,f11(B,union_of_members(A))),f11(B,union_of_members(A))),f1(A,f11(B,union_of_members(A)))). [resolve(14,a,11,b)].
% 0.67/1.00 22 element_of_collection(union_of_members(A),top_of_basis(B)) | -element_of_collection(f1(A,f11(B,union_of_members(A))),top_of_basis(C)) | element_of_collection(f10(C,f1(A,f11(B,union_of_members(A))),f11(B,union_of_members(A))),C). [resolve(14,a,10,b)].
% 0.67/1.00 23 element_of_collection(union_of_members(A),top_of_basis(B)) | -element_of_collection(f1(A,f11(B,union_of_members(A))),top_of_basis(C)) | element_of_set(f11(B,union_of_members(A)),f10(C,f1(A,f11(B,union_of_members(A))),f11(B,union_of_members(A)))). [resolve(14,a,9,b)].
% 0.67/1.00 27 element_of_collection(union_of_members(g),top_of_basis(A)) | element_of_collection(f1(g,f11(A,union_of_members(g))),top_of_basis(f)). [resolve(15,a,13,a)].
% 0.67/1.00 39 element_of_collection(union_of_members(g),top_of_basis(A)) | subset_sets(f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g))),f1(g,f11(A,union_of_members(g)))). [resolve(21,b,27,b),merge(c)].
% 0.67/1.00 51 element_of_collection(union_of_members(g),top_of_basis(A)) | -element_of_collection(f1(g,f11(A,union_of_members(g))),B) | subset_sets(f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g))),union_of_members(B)). [resolve(39,b,8,a)].
% 0.67/1.00 52 element_of_collection(union_of_members(g),top_of_basis(A)) | element_of_collection(f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g))),f). [resolve(22,b,27,b),merge(c)].
% 0.67/1.00 73 element_of_collection(union_of_members(g),top_of_basis(A)) | element_of_set(f11(A,union_of_members(g)),f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g)))). [resolve(23,b,27,b),merge(c)].
% 0.67/1.00 95 element_of_collection(union_of_members(g),top_of_basis(A)) | subset_sets(f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g))),union_of_members(g)). [resolve(51,b,15,a),merge(c)].
% 0.67/1.00 96 element_of_collection(union_of_members(g),top_of_basis(A)) | element_of_collection(union_of_members(g),top_of_basis(B)) | -element_of_set(f11(B,union_of_members(g)),f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g)))) | -element_of_collection(f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g))),B). [resolve(95,b,12,d)].
% 0.67/1.00 98 element_of_collection(union_of_members(g),top_of_basis(A)) | -element_of_set(f11(A,union_of_members(g)),f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g)))) | -element_of_collection(f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g))),A). [factor(96,a,b)].
% 0.67/1.00 274 element_of_collection(union_of_members(g),top_of_basis(A)) | -element_of_collection(f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g))),A). [resolve(98,b,73,b),merge(c)].
% 0.67/1.00 275 $F. [resolve(274,b,52,b),merge(b),unit_del(a,4)].
% 0.67/1.00
% 0.67/1.00 % SZS output end Refutation
% 0.67/1.00 ============================== end of proof ==========================
% 0.67/1.00
% 0.67/1.00 ============================== STATISTICS ============================
% 0.67/1.00
% 0.67/1.00 Given=96. Generated=355. Kept=272. proofs=1.
% 0.67/1.00 Usable=94. Sos=166. Demods=0. Limbo=0, Disabled=25. Hints=0.
% 0.67/1.00 Megabytes=0.59.
% 0.67/1.00 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.67/1.00
% 0.67/1.00 ============================== end of statistics =====================
% 0.67/1.00
% 0.67/1.00 ============================== end of search =========================
% 0.67/1.00
% 0.67/1.00 THEOREM PROVED
% 0.67/1.00 % SZS status Unsatisfiable
% 0.67/1.00
% 0.67/1.00 Exiting with 1 proof.
% 0.67/1.00
% 0.67/1.00 Process 6841 exit (max_proofs) Sun May 29 12:38:30 2022
% 0.67/1.00 Prover9 interrupted
%------------------------------------------------------------------------------