TSTP Solution File: SET581+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET581+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 04:30:24 EDT 2022
% Result : Theorem 0.72s 1.02s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET581+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 9 17:13:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.01 ============================== Prover9 ===============================
% 0.72/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.01 Process 23962 was started by sandbox on n020.cluster.edu,
% 0.72/1.01 Sat Jul 9 17:13:14 2022
% 0.72/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23589_n020.cluster.edu".
% 0.72/1.01 ============================== end of head ===========================
% 0.72/1.01
% 0.72/1.01 ============================== INPUT =================================
% 0.72/1.01
% 0.72/1.01 % Reading from file /tmp/Prover9_23589_n020.cluster.edu
% 0.72/1.01
% 0.72/1.01 set(prolog_style_variables).
% 0.72/1.01 set(auto2).
% 0.72/1.01 % set(auto2) -> set(auto).
% 0.72/1.01 % set(auto) -> set(auto_inference).
% 0.72/1.01 % set(auto) -> set(auto_setup).
% 0.72/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.01 % set(auto) -> set(auto_limits).
% 0.72/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.01 % set(auto) -> set(auto_denials).
% 0.72/1.01 % set(auto) -> set(auto_process).
% 0.72/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.01 % set(auto2) -> assign(stats, some).
% 0.72/1.01 % set(auto2) -> clear(echo_input).
% 0.72/1.01 % set(auto2) -> set(quiet).
% 0.72/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.01 % set(auto2) -> clear(print_given).
% 0.72/1.01 assign(lrs_ticks,-1).
% 0.72/1.01 assign(sos_limit,10000).
% 0.72/1.01 assign(order,kbo).
% 0.72/1.01 set(lex_order_vars).
% 0.72/1.01 clear(print_given).
% 0.72/1.01
% 0.72/1.01 % formulas(sos). % not echoed (7 formulas)
% 0.72/1.01
% 0.72/1.01 ============================== end of input ==========================
% 0.72/1.01
% 0.72/1.01 % From the command line: assign(max_seconds, 300).
% 0.72/1.01
% 0.72/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.01
% 0.72/1.01 % Formulas that are not ordinary clauses:
% 0.72/1.01 1 (all B all C all D (member(D,intersection(B,C)) <-> member(D,B) & member(D,C))) # label(intersection_defn) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 2 (all B -member(B,empty_set)) # label(empty_set_defn) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 3 (all B all C (B = C <-> (all D (member(D,B) <-> member(D,C))))) # label(equal_member_defn) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 4 (all B all C (not_equal(B,C) <-> B != C)) # label(not_equal_defn) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 5 (all B all C intersection(B,C) = intersection(C,B)) # label(commutativity_of_intersection) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 6 (all B (empty(B) <-> (all C -member(C,B)))) # label(empty_defn) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.01 7 -(all B all C all D (member(B,C) & member(B,D) -> not_equal(intersection(C,D),empty_set))) # label(prove_th24) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.72/1.01
% 0.72/1.01 ============================== end of process non-clausal formulas ===
% 0.72/1.01
% 0.72/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.01
% 0.72/1.01 ============================== PREDICATE ELIMINATION =================
% 0.72/1.01 8 -empty(A) | -member(B,A) # label(empty_defn) # label(axiom). [clausify(6)].
% 0.72/1.01 9 empty(A) | member(f2(A),A) # label(empty_defn) # label(axiom). [clausify(6)].
% 0.72/1.01 Derived: -member(A,B) | member(f2(B),B). [resolve(8,a,9,a)].
% 0.72/1.01
% 0.72/1.01 ============================== end predicate elimination =============
% 0.72/1.01
% 0.72/1.01 Auto_denials: (non-Horn, no changes).
% 0.72/1.01
% 0.72/1.01 Term ordering decisions:
% 0.72/1.01
% 0.72/1.01 % Assigning unary symbol f2 kb_weight 0 and highest precedence (10).
% 0.72/1.01 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. intersection=1. f1=1. f2=0.
% 0.72/1.01
% 0.72/1.01 ============================== end of process initial clauses ========
% 0.72/1.01
% 0.72/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.01
% 0.72/1.01 ============================== end of clauses for search =============
% 0.72/1.01
% 0.72/1.01 ============================== SEARCH ================================
% 0.72/1.02
% 0.72/1.02 % Starting search at 0.01 seconds.
% 0.72/1.02
% 0.72/1.02 ============================== PROOF =================================
% 0.72/1.02 % SZS status Theorem
% 0.72/1.02 % SZS output start Refutation
% 0.72/1.02
% 0.72/1.02 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.72/1.02 % Length of proof is 15.
% 0.72/1.02 % Level of proof is 3.
% 0.72/1.02 % Maximum clause weight is 11.000.
% 0.72/1.02 % Given clauses 40.
% 0.72/1.02
% 0.72/1.02 1 (all B all C all D (member(D,intersection(B,C)) <-> member(D,B) & member(D,C))) # label(intersection_defn) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.02 2 (all B -member(B,empty_set)) # label(empty_set_defn) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.02 4 (all B all C (not_equal(B,C) <-> B != C)) # label(not_equal_defn) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.02 5 (all B all C intersection(B,C) = intersection(C,B)) # label(commutativity_of_intersection) # label(axiom) # label(non_clause). [assumption].
% 0.72/1.02 7 -(all B all C all D (member(B,C) & member(B,D) -> not_equal(intersection(C,D),empty_set))) # label(prove_th24) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.72/1.02 10 member(c1,c2) # label(prove_th24) # label(negated_conjecture). [clausify(7)].
% 0.72/1.02 11 member(c1,c3) # label(prove_th24) # label(negated_conjecture). [clausify(7)].
% 0.72/1.02 12 not_equal(A,B) | B = A # label(not_equal_defn) # label(axiom). [clausify(4)].
% 0.72/1.02 13 intersection(A,B) = intersection(B,A) # label(commutativity_of_intersection) # label(axiom). [clausify(5)].
% 0.72/1.02 15 -member(A,empty_set) # label(empty_set_defn) # label(axiom). [clausify(2)].
% 0.72/1.02 16 -not_equal(intersection(c2,c3),empty_set) # label(prove_th24) # label(negated_conjecture). [clausify(7)].
% 0.72/1.02 22 member(A,intersection(B,C)) | -member(A,B) | -member(A,C) # label(intersection_defn) # label(axiom). [clausify(1)].
% 0.72/1.02 28 intersection(c2,c3) = empty_set. [resolve(16,a,12,a),flip(a)].
% 0.72/1.02 52 member(c1,intersection(A,c3)) | -member(c1,A). [resolve(22,b,11,a),rewrite([13(3)])].
% 0.72/1.02 161 $F. [resolve(52,b,10,a),rewrite([28(4)]),unit_del(a,15)].
% 0.72/1.02
% 0.72/1.02 % SZS output end Refutation
% 0.72/1.02 ============================== end of proof ==========================
% 0.72/1.02
% 0.72/1.02 ============================== STATISTICS ============================
% 0.72/1.02
% 0.72/1.02 Given=40. Generated=308. Kept=151. proofs=1.
% 0.72/1.02 Usable=38. Sos=107. Demods=3. Limbo=2, Disabled=21. Hints=0.
% 0.72/1.02 Megabytes=0.14.
% 0.72/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.72/1.02
% 0.72/1.02 ============================== end of statistics =====================
% 0.72/1.02
% 0.72/1.02 ============================== end of search =========================
% 0.72/1.02
% 0.72/1.02 THEOREM PROVED
% 0.72/1.02 % SZS status Theorem
% 0.72/1.02
% 0.72/1.02 Exiting with 1 proof.
% 0.72/1.02
% 0.72/1.02 Process 23962 exit (max_proofs) Sat Jul 9 17:13:14 2022
% 0.72/1.02 Prover9 interrupted
%------------------------------------------------------------------------------