TSTP Solution File: SET603+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET603+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:39 EDT 2022
% Result : Theorem 1.11s 1.42s
% Output : Refutation 1.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET603+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Sun Jul 10 14:02:33 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.45/1.02 ============================== Prover9 ===============================
% 0.45/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.02 Process 24332 was started by sandbox2 on n017.cluster.edu,
% 0.45/1.02 Sun Jul 10 14:02:33 2022
% 0.45/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24179_n017.cluster.edu".
% 0.45/1.02 ============================== end of head ===========================
% 0.45/1.02
% 0.45/1.02 ============================== INPUT =================================
% 0.45/1.02
% 0.45/1.02 % Reading from file /tmp/Prover9_24179_n017.cluster.edu
% 0.45/1.02
% 0.45/1.02 set(prolog_style_variables).
% 0.45/1.02 set(auto2).
% 0.45/1.02 % set(auto2) -> set(auto).
% 0.45/1.02 % set(auto) -> set(auto_inference).
% 0.45/1.02 % set(auto) -> set(auto_setup).
% 0.45/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.02 % set(auto) -> set(auto_limits).
% 0.45/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.02 % set(auto) -> set(auto_denials).
% 0.45/1.02 % set(auto) -> set(auto_process).
% 0.45/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.02 % set(auto2) -> assign(stats, some).
% 0.45/1.02 % set(auto2) -> clear(echo_input).
% 0.45/1.02 % set(auto2) -> set(quiet).
% 0.45/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.02 % set(auto2) -> clear(print_given).
% 0.45/1.02 assign(lrs_ticks,-1).
% 0.45/1.02 assign(sos_limit,10000).
% 0.45/1.02 assign(order,kbo).
% 0.45/1.02 set(lex_order_vars).
% 0.45/1.02 clear(print_given).
% 0.45/1.02
% 0.45/1.02 % formulas(sos). % not echoed (9 formulas)
% 0.45/1.02
% 0.45/1.02 ============================== end of input ==========================
% 0.45/1.02
% 0.45/1.02 % From the command line: assign(max_seconds, 300).
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.02
% 0.45/1.02 % Formulas that are not ordinary clauses:
% 0.45/1.02 1 (all B all C ((all D (member(D,B) <-> member(D,C))) -> B = C)) # label(member_equal) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 2 (all B all C all D (member(D,difference(B,C)) <-> member(D,B) & -member(D,C))) # label(difference_defn) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 3 (all B -member(B,empty_set)) # label(empty_set_defn) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 4 (all B all C (B = C <-> subset(B,C) & subset(C,B))) # label(equal_defn) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 5 (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.45/1.02 6 (all B all C (subset(B,C) <-> (all D (member(D,B) -> member(D,C))))) # label(subset_defn) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 7 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 8 (all B (empty(B) <-> (all C -member(C,B)))) # label(empty_defn) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 9 -(all B difference(B,empty_set) = B) # label(prove_th74) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.02
% 0.45/1.02 ============================== end of process non-clausal formulas ===
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.02
% 0.45/1.02 ============================== PREDICATE ELIMINATION =================
% 0.45/1.02 10 -empty(A) | -member(B,A) # label(empty_defn) # label(axiom). [clausify(8)].
% 0.45/1.02 11 empty(A) | member(f4(A),A) # label(empty_defn) # label(axiom). [clausify(8)].
% 0.45/1.02 Derived: -member(A,B) | member(f4(B),B). [resolve(10,a,11,a)].
% 0.45/1.02
% 0.45/1.02 ============================== end predicate elimination =============
% 0.45/1.02
% 0.45/1.02 Auto_denials: (non-Horn, no changes).
% 0.45/1.02
% 0.45/1.02 Term ordering decisions:
% 0.45/1.02
% 0.45/1.02 % Assigning unary symbol f4 kb_weight 0 and highest precedence (10).
% 0.45/1.02 Function symbol KB weights: empty_set=1. c1=1. difference=1. f1=1. f2=1. f3=1. f4=0.
% 0.45/1.02
% 0.45/1.02 ============================== end of process initial clauses ========
% 1.11/1.42
% 1.11/1.42 ============================== CLAUSES FOR SEARCH ====================
% 1.11/1.42
% 1.11/1.42 ============================== end of clauses for search =============
% 1.11/1.42
% 1.11/1.42 ============================== SEARCH ================================
% 1.11/1.42
% 1.11/1.42 % Starting search at 0.01 seconds.
% 1.11/1.42
% 1.11/1.42 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 30 (0.00 of 0.31 sec).
% 1.11/1.42
% 1.11/1.42 ============================== PROOF =================================
% 1.11/1.42 % SZS status Theorem
% 1.11/1.42 % SZS output start Refutation
% 1.11/1.42
% 1.11/1.42 % Proof 1 at 0.40 (+ 0.01) seconds.
% 1.11/1.42 % Length of proof is 16.
% 1.11/1.42 % Level of proof is 6.
% 1.11/1.42 % Maximum clause weight is 20.000.
% 1.11/1.42 % Given clauses 593.
% 1.11/1.42
% 1.11/1.42 2 (all B all C all D (member(D,difference(B,C)) <-> member(D,B) & -member(D,C))) # label(difference_defn) # label(axiom) # label(non_clause). [assumption].
% 1.11/1.42 3 (all B -member(B,empty_set)) # label(empty_set_defn) # label(axiom) # label(non_clause). [assumption].
% 1.11/1.42 5 (all B all C (B = C <-> (all D (member(D,B) <-> member(D,C))))) # label(equal_member_defn) # label(axiom) # label(non_clause). [assumption].
% 1.11/1.42 9 -(all B difference(B,empty_set) = B) # label(prove_th74) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.11/1.42 15 A = B | member(f2(B,A),B) | member(f2(B,A),A) # label(equal_member_defn) # label(axiom). [clausify(5)].
% 1.11/1.42 16 -member(A,empty_set) # label(empty_set_defn) # label(axiom). [clausify(3)].
% 1.11/1.42 17 difference(c1,empty_set) != c1 # label(prove_th74) # label(negated_conjecture). [clausify(9)].
% 1.11/1.42 21 -member(A,difference(B,C)) | member(A,B) # label(difference_defn) # label(axiom). [clausify(2)].
% 1.11/1.42 27 member(A,difference(B,C)) | -member(A,B) | member(A,C) # label(difference_defn) # label(axiom). [clausify(2)].
% 1.11/1.42 29 A = B | -member(f2(B,A),B) | -member(f2(B,A),A) # label(equal_member_defn) # label(axiom). [clausify(5)].
% 1.11/1.42 39 member(f2(A,difference(B,C)),B) | difference(B,C) = A | member(f2(A,difference(B,C)),A). [resolve(21,a,15,c)].
% 1.11/1.42 44 member(f2(A,difference(A,B)),A) | difference(A,B) = A. [factor(39,a,c)].
% 1.11/1.42 64 member(f2(A,B),difference(A,C)) | member(f2(A,B),C) | B = A | member(f2(A,B),B). [resolve(27,b,15,b)].
% 1.11/1.42 164 difference(A,B) = A | -member(f2(A,difference(A,B)),difference(A,B)). [resolve(44,a,29,b),merge(b)].
% 1.11/1.42 2456 -member(f2(c1,difference(c1,empty_set)),difference(c1,empty_set)). [ur(164,a,17,a)].
% 1.11/1.42 2468 $F. [resolve(2456,a,64,a),unit_del(a,16),unit_del(b,17),unit_del(c,2456)].
% 1.11/1.42
% 1.11/1.42 % SZS output end Refutation
% 1.11/1.42 ============================== end of proof ==========================
% 1.11/1.42
% 1.11/1.42 ============================== STATISTICS ============================
% 1.11/1.42
% 1.11/1.42 Given=593. Generated=14442. Kept=2456. proofs=1.
% 1.11/1.42 Usable=576. Sos=1808. Demods=4. Limbo=4, Disabled=89. Hints=0.
% 1.11/1.42 Megabytes=1.85.
% 1.11/1.42 User_CPU=0.40, System_CPU=0.01, Wall_clock=1.
% 1.11/1.42
% 1.11/1.42 ============================== end of statistics =====================
% 1.11/1.42
% 1.11/1.42 ============================== end of search =========================
% 1.11/1.42
% 1.11/1.42 THEOREM PROVED
% 1.11/1.42 % SZS status Theorem
% 1.11/1.42
% 1.11/1.42 Exiting with 1 proof.
% 1.11/1.42
% 1.11/1.42 Process 24332 exit (max_proofs) Sun Jul 10 14:02:34 2022
% 1.11/1.42 Prover9 interrupted
%------------------------------------------------------------------------------