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