TSTP Solution File: SET594+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET594+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:32 EDT 2022
% Result : Theorem 0.82s 1.10s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET594+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n008.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 : Sat Jul 9 21:15:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/0.98 ============================== Prover9 ===============================
% 0.70/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.70/0.98 Process 18067 was started by sandbox on n008.cluster.edu,
% 0.70/0.98 Sat Jul 9 21:15:09 2022
% 0.70/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17914_n008.cluster.edu".
% 0.70/0.98 ============================== end of head ===========================
% 0.70/0.98
% 0.70/0.98 ============================== INPUT =================================
% 0.70/0.98
% 0.70/0.98 % Reading from file /tmp/Prover9_17914_n008.cluster.edu
% 0.70/0.98
% 0.70/0.98 set(prolog_style_variables).
% 0.70/0.98 set(auto2).
% 0.70/0.98 % set(auto2) -> set(auto).
% 0.70/0.98 % set(auto) -> set(auto_inference).
% 0.70/0.98 % set(auto) -> set(auto_setup).
% 0.70/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.70/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/0.98 % set(auto) -> set(auto_limits).
% 0.70/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/0.98 % set(auto) -> set(auto_denials).
% 0.70/0.98 % set(auto) -> set(auto_process).
% 0.70/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.70/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.70/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.70/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.70/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.70/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.70/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.70/0.98 % set(auto2) -> assign(stats, some).
% 0.70/0.98 % set(auto2) -> clear(echo_input).
% 0.70/0.98 % set(auto2) -> set(quiet).
% 0.70/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.70/0.98 % set(auto2) -> clear(print_given).
% 0.70/0.98 assign(lrs_ticks,-1).
% 0.70/0.98 assign(sos_limit,10000).
% 0.70/0.98 assign(order,kbo).
% 0.70/0.98 set(lex_order_vars).
% 0.70/0.98 clear(print_given).
% 0.70/0.98
% 0.70/0.98 % formulas(sos). % not echoed (9 formulas)
% 0.70/0.98
% 0.70/0.98 ============================== end of input ==========================
% 0.70/0.98
% 0.70/0.98 % From the command line: assign(max_seconds, 300).
% 0.70/0.98
% 0.70/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/0.98
% 0.70/0.98 % Formulas that are not ordinary clauses:
% 0.70/0.98 1 (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.70/0.98 2 (all B all C all D (member(D,union(B,C)) <-> member(D,B) | member(D,C))) # label(union_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.98 3 (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.70/0.98 4 (all B all C (B = C <-> subset(B,C) & subset(C,B))) # label(equal_defn) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.98 5 (all B all C union(B,C) = union(C,B)) # label(commutativity_of_union) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.98 6 (all B all C intersection(B,C) = intersection(C,B)) # label(commutativity_of_intersection) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.98 7 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause). [assumption].
% 0.70/0.98 8 (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.70/0.98 9 -(all B all C all D (union(intersection(B,C),intersection(B,D)) = B -> subset(B,union(C,D)))) # label(prove_th53) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.70/0.98
% 0.70/0.98 ============================== end of process non-clausal formulas ===
% 0.70/0.98
% 0.70/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/0.98
% 0.70/0.98 ============================== PREDICATE ELIMINATION =================
% 0.70/0.98
% 0.70/0.98 ============================== end predicate elimination =============
% 0.70/0.98
% 0.70/0.98 Auto_denials: (non-Horn, no changes).
% 0.70/0.98
% 0.70/0.98 Term ordering decisions:
% 0.70/0.98 Function symbol KB weights: c1=1. c2=1. c3=1. intersection=1. union=1. f1=1. f2=1.
% 0.70/0.98
% 0.70/0.98 ============================== end of process initial clauses ========
% 0.70/0.98
% 0.70/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.70/0.98
% 0.70/0.98 ============================== end of clauses for search =============
% 0.70/0.98
% 0.70/0.98 ============================== SEARCH ================================
% 0.82/1.10
% 0.82/1.10 % Starting search at 0.01 seconds.
% 0.82/1.10
% 0.82/1.10 ============================== PROOF =================================
% 0.82/1.10 % SZS status Theorem
% 0.82/1.10 % SZS output start Refutation
% 0.82/1.10
% 0.82/1.10 % Proof 1 at 0.13 (+ 0.00) seconds.
% 0.82/1.10 % Length of proof is 20.
% 0.82/1.10 % Level of proof is 5.
% 0.82/1.10 % Maximum clause weight is 13.000.
% 0.82/1.10 % Given clauses 204.
% 0.82/1.10
% 0.82/1.10 1 (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.82/1.10 2 (all B all C all D (member(D,union(B,C)) <-> member(D,B) | member(D,C))) # label(union_defn) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 3 (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.82/1.10 9 -(all B all C all D (union(intersection(B,C),intersection(B,D)) = B -> subset(B,union(C,D)))) # label(prove_th53) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.82/1.10 13 subset(A,B) | member(f1(A,B),A) # label(subset_defn) # label(axiom). [clausify(1)].
% 0.82/1.10 14 union(intersection(c1,c2),intersection(c1,c3)) = c1 # label(prove_th53) # label(negated_conjecture). [clausify(9)].
% 0.82/1.10 16 -subset(c1,union(c2,c3)) # label(prove_th53) # label(negated_conjecture). [clausify(9)].
% 0.82/1.10 19 subset(A,B) | -member(f1(A,B),B) # label(subset_defn) # label(axiom). [clausify(1)].
% 0.82/1.10 20 member(A,union(B,C)) | -member(A,B) # label(union_defn) # label(axiom). [clausify(2)].
% 0.82/1.10 21 member(A,union(B,C)) | -member(A,C) # label(union_defn) # label(axiom). [clausify(2)].
% 0.82/1.10 23 -member(A,intersection(B,C)) | member(A,C) # label(intersection_defn) # label(axiom). [clausify(3)].
% 0.82/1.10 28 -member(A,union(B,C)) | member(A,B) | member(A,C) # label(union_defn) # label(axiom). [clausify(2)].
% 0.82/1.10 33 member(f1(c1,union(c2,c3)),c1). [resolve(16,a,13,a)].
% 0.82/1.10 35 -member(f1(c1,union(c2,c3)),union(c2,c3)). [ur(19,a,16,a)].
% 0.82/1.10 58 -member(A,c1) | member(A,intersection(c1,c2)) | member(A,intersection(c1,c3)). [para(14(a,1),28(a,2))].
% 0.82/1.10 80 -member(f1(c1,union(c2,c3)),c3). [ur(21,a,35,a)].
% 0.82/1.10 81 -member(f1(c1,union(c2,c3)),c2). [ur(20,a,35,a)].
% 0.82/1.10 86 -member(f1(c1,union(c2,c3)),intersection(A,c3)). [ur(23,b,80,a)].
% 0.82/1.10 190 -member(f1(c1,union(c2,c3)),intersection(A,c2)). [ur(23,b,81,a)].
% 0.82/1.10 1188 $F. [resolve(58,a,33,a),unit_del(a,190),unit_del(b,86)].
% 0.82/1.10
% 0.82/1.10 % SZS output end Refutation
% 0.82/1.10 ============================== end of proof ==========================
% 0.82/1.10
% 0.82/1.10 ============================== STATISTICS ============================
% 0.82/1.10
% 0.82/1.10 Given=204. Generated=2889. Kept=1178. proofs=1.
% 0.82/1.10 Usable=204. Sos=931. Demods=3. Limbo=32, Disabled=32. Hints=0.
% 0.82/1.10 Megabytes=0.90.
% 0.82/1.10 User_CPU=0.13, System_CPU=0.00, Wall_clock=0.
% 0.82/1.10
% 0.82/1.10 ============================== end of statistics =====================
% 0.82/1.10
% 0.82/1.10 ============================== end of search =========================
% 0.82/1.10
% 0.82/1.10 THEOREM PROVED
% 0.82/1.10 % SZS status Theorem
% 0.82/1.10
% 0.82/1.10 Exiting with 1 proof.
% 0.82/1.10
% 0.82/1.10 Process 18067 exit (max_proofs) Sat Jul 9 21:15:09 2022
% 0.82/1.10 Prover9 interrupted
%------------------------------------------------------------------------------