TSTP Solution File: TOP004-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : TOP004-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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.66s 0.94s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : TOP004-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 : n023.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 10:16:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.66/0.94 ============================== Prover9 ===============================
% 0.66/0.94 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.94 Process 28897 was started by sandbox2 on n023.cluster.edu,
% 0.66/0.94 Sun May 29 10:16:43 2022
% 0.66/0.94 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28744_n023.cluster.edu".
% 0.66/0.94 ============================== end of head ===========================
% 0.66/0.94
% 0.66/0.94 ============================== INPUT =================================
% 0.66/0.94
% 0.66/0.94 % Reading from file /tmp/Prover9_28744_n023.cluster.edu
% 0.66/0.94
% 0.66/0.94 set(prolog_style_variables).
% 0.66/0.94 set(auto2).
% 0.66/0.94 % set(auto2) -> set(auto).
% 0.66/0.94 % set(auto) -> set(auto_inference).
% 0.66/0.94 % set(auto) -> set(auto_setup).
% 0.66/0.94 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.94 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.94 % set(auto) -> set(auto_limits).
% 0.66/0.94 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.94 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.94 % set(auto) -> set(auto_denials).
% 0.66/0.94 % set(auto) -> set(auto_process).
% 0.66/0.94 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.94 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.94 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.94 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.94 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.94 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.94 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.94 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.94 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.94 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.94 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.94 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.94 % set(auto2) -> assign(stats, some).
% 0.66/0.94 % set(auto2) -> clear(echo_input).
% 0.66/0.94 % set(auto2) -> set(quiet).
% 0.66/0.94 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.94 % set(auto2) -> clear(print_given).
% 0.66/0.94 assign(lrs_ticks,-1).
% 0.66/0.94 assign(sos_limit,10000).
% 0.66/0.94 assign(order,kbo).
% 0.66/0.94 set(lex_order_vars).
% 0.66/0.94 clear(print_given).
% 0.66/0.94
% 0.66/0.94 % formulas(sos). % not echoed (21 formulas)
% 0.66/0.94
% 0.66/0.94 ============================== end of input ==========================
% 0.66/0.94
% 0.66/0.94 % From the command line: assign(max_seconds, 300).
% 0.66/0.94
% 0.66/0.94 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.94
% 0.66/0.94 % Formulas that are not ordinary clauses:
% 0.66/0.94
% 0.66/0.94 ============================== end of process non-clausal formulas ===
% 0.66/0.94
% 0.66/0.94 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.94
% 0.66/0.94 ============================== PREDICATE ELIMINATION =================
% 0.66/0.94 1 -basis(A,B) | equal_sets(union_of_members(B),A) # label(basis_for_topology_28) # label(axiom). [assumption].
% 0.66/0.94 2 basis(cx,f) # label(lemma_1d_1) # label(negated_conjecture). [assumption].
% 0.66/0.94 Derived: equal_sets(union_of_members(f),cx). [resolve(1,a,2,a)].
% 0.66/0.94 3 -basis(A,B) | -element_of_set(C,A) | -element_of_collection(D,B) | -element_of_collection(E,B) | -element_of_set(C,intersection_of_sets(D,E)) | element_of_set(C,f6(A,B,C,D,E)) # label(basis_for_topology_29) # label(axiom). [assumption].
% 0.66/0.94 Derived: -element_of_set(A,cx) | -element_of_collection(B,f) | -element_of_collection(C,f) | -element_of_set(A,intersection_of_sets(B,C)) | element_of_set(A,f6(cx,f,A,B,C)). [resolve(3,a,2,a)].
% 0.66/0.94 4 -basis(A,B) | -element_of_set(C,A) | -element_of_collection(D,B) | -element_of_collection(E,B) | -element_of_set(C,intersection_of_sets(D,E)) | element_of_collection(f6(A,B,C,D,E),B) # label(basis_for_topology_30) # label(axiom). [assumption].
% 0.66/0.94 Derived: -element_of_set(A,cx) | -element_of_collection(B,f) | -element_of_collection(C,f) | -element_of_set(A,intersection_of_sets(B,C)) | element_of_collection(f6(cx,f,A,B,C),f). [resolve(4,a,2,a)].
% 0.66/0.94 5 -basis(A,B) | -element_of_set(C,A) | -element_of_collection(D,B) | -element_of_collection(E,B) | -element_of_set(C,intersection_of_sets(D,E)) | subset_sets(f6(A,B,C,D,E),intersection_of_sets(D,E)) # label(basis_for_topology_31) # label(axiom). [assumption].
% 0.66/0.94 Derived: -element_of_set(A,cx) | -element_of_collection(B,f) | -element_of_collection(C,f) | -element_of_set(A,intersection_of_sets(B,C)) | subset_sets(f6(cx,f,A,B,C),intersection_of_sets(B,C)). [resolve(5,a,2,a)].
% 0.66/0.94 6 -equal_sets(A,B) | -element_of_set(C,A) | element_of_set(C,B) # label(set_theory_17) # label(axiom). [assumption].
% 0.66/0.94 7 equal_sets(intersection_of_sets(A,B),intersection_of_sets(B,A)) # label(set_theory_18) # label(axiom). [assumption].
% 0.66/0.94 Derived: -element_of_set(A,intersection_of_sets(B,C)) | element_of_set(A,intersection_of_sets(C,B)). [resolve(6,a,7,a)].
% 0.66/0.94 8 equal_sets(union_of_members(f),cx). [resolve(1,a,2,a)].
% 0.66/0.94 Derived: -element_of_set(A,union_of_members(f)) | element_of_set(A,cx). [resolve(8,a,6,a)].
% 0.66/0.94
% 0.66/0.94 ============================== end predicate elimination =============
% 0.66/0.94
% 0.66/0.94 Auto_denials: (non-Horn, no changes).
% 0.66/0.94
% 0.66/0.94 Term ordering decisions:
% 0.66/0.94 Function symbol KB weights: f=1. cx=1. intersection_of_sets=1. f11=1. top_of_basis=1. union_of_members=1. f10=1. f6=1.
% 0.66/0.94
% 0.66/0.94 ============================== PROOF =================================
% 0.66/0.94 % SZS status Unsatisfiable
% 0.66/0.94 % SZS output start Refutation
% 0.66/0.94
% 0.66/0.94 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.66/0.94 % Length of proof is 3.
% 0.66/0.94 % Level of proof is 1.
% 0.66/0.94 % Maximum clause weight is 4.000.
% 0.66/0.94 % Given clauses 0.
% 0.66/0.94
% 0.66/0.94 9 element_of_collection(A,top_of_basis(f)) # label(lemma_1d_2) # label(negated_conjecture). [assumption].
% 0.66/0.94 11 -element_of_collection(intersection_of_sets(A,B),top_of_basis(f)) # label(lemma_1d_4) # label(negated_conjecture). [assumption].
% 0.66/0.94 12 $F. [copy(11),unit_del(a,9)].
% 0.66/0.94
% 0.66/0.94 % SZS output end Refutation
% 0.66/0.94 ============================== end of proof ==========================
% 0.66/0.94
% 0.66/0.94 ============================== STATISTICS ============================
% 0.66/0.94
% 0.66/0.94 Given=0. Generated=4. Kept=2. proofs=1.
% 0.66/0.94 Usable=0. Sos=0. Demods=0. Limbo=2, Disabled=12. Hints=0.
% 0.66/0.94 Megabytes=0.03.
% 0.66/0.94 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.66/0.94
% 0.66/0.94 ============================== end of statistics =====================
% 0.66/0.94
% 0.66/0.94 ============================== end of search =========================
% 0.66/0.94
% 0.66/0.94 THEOREM PROVED
% 0.66/0.94 % SZS status Unsatisfiable
% 0.66/0.94
% 0.66/0.94 Exiting with 1 proof.
% 0.66/0.94
% 0.66/0.94 Process 28897 exit (max_proofs) Sun May 29 10:16:43 2022
% 0.66/0.94 Prover9 interrupted
%------------------------------------------------------------------------------