TSTP Solution File: SET618+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET618+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:50 EDT 2022
% Result : Theorem 0.43s 0.98s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET618+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n003.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.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 06:43:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 12845 was started by sandbox on n003.cluster.edu,
% 0.43/0.98 Sun Jul 10 06:43:14 2022
% 0.43/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12687_n003.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_12687_n003.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (12 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98 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.43/0.98 2 (all B union(B,B) = B) # label(idempotency_of_union) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 3 (all B difference(B,B) = empty_set) # label(self_difference_is_empty_set) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 4 (all B -member(B,empty_set)) # label(empty_set_defn) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 5 (all B all C (B = C <-> subset(B,C) & subset(C,B))) # label(equal_defn) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 6 (all B all C union(B,C) = union(C,B)) # label(commutativity_of_union) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 7 (all B all C symmetric_difference(B,C) = symmetric_difference(C,B)) # label(commutativity_of_symmetric_difference) # label(axiom) # label(non_clause). [assumption].
% 0.43/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.43/0.98 9 (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.43/0.98 10 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 11 (all B (empty(B) <-> (all C -member(C,B)))) # label(empty_defn) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 12 -(all B symmetric_difference(B,B) = empty_set) # label(prove_th93) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.98
% 0.43/0.98 ============================== end of process non-clausal formulas ===
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.98
% 0.43/0.98 ============================== PREDICATE ELIMINATION =================
% 0.43/0.98 13 -empty(A) | -member(B,A) # label(empty_defn) # label(axiom). [clausify(11)].
% 0.43/0.98 14 empty(A) | member(f3(A),A) # label(empty_defn) # label(axiom). [clausify(11)].
% 0.43/0.98 Derived: -member(A,B) | member(f3(B),B). [resolve(13,a,14,a)].
% 0.43/0.98
% 0.43/0.98 ============================== end predicate elimination =============
% 0.43/0.98
% 0.43/0.98 Auto_denials: (non-Horn, no changes).
% 0.43/0.98
% 0.43/0.98 Term ordering decisions:
% 0.43/0.98
% 0.43/0.98 % Assigning unary symbol f3 kb_weight 0 and highest precedence (11).
% 0.43/0.98 Function symbol KB weights: empty_set=1. c1=1. union=1. difference=1. symmetric_difference=1. f1=1. f2=1. f3=0.
% 0.43/0.98
% 0.43/0.98 ============================== PROOF =================================
% 0.43/0.98 % SZS status Theorem
% 0.43/0.98 % SZS output start Refutation
% 0.43/0.98
% 0.43/0.98 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.98 % Length of proof is 10.
% 0.43/0.98 % Level of proof is 3.
% 0.43/0.98 % Maximum clause weight is 11.000.
% 0.43/0.98 % Given clauses 0.
% 0.43/0.98
% 0.43/0.98 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.43/0.98 2 (all B union(B,B) = B) # label(idempotency_of_union) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 3 (all B difference(B,B) = empty_set) # label(self_difference_is_empty_set) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 12 -(all B symmetric_difference(B,B) = empty_set) # label(prove_th93) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.98 16 union(A,A) = A # label(idempotency_of_union) # label(axiom). [clausify(2)].
% 0.43/0.98 17 difference(A,A) = empty_set # label(self_difference_is_empty_set) # label(axiom). [clausify(3)].
% 0.43/0.98 21 union(difference(A,B),difference(B,A)) = symmetric_difference(A,B) # label(symmetric_difference_defn) # label(axiom). [clausify(1)].
% 0.43/0.98 22 symmetric_difference(A,B) = union(difference(A,B),difference(B,A)). [copy(21),flip(a)].
% 0.43/0.98 25 symmetric_difference(c1,c1) != empty_set # label(prove_th93) # label(negated_conjecture). [clausify(12)].
% 0.43/0.98 26 $F. [copy(25),rewrite([22(3),17(3),17(4),16(3)]),xx(a)].
% 0.43/0.98
% 0.43/0.98 % SZS output end Refutation
% 0.43/0.98 ============================== end of proof ==========================
% 0.43/0.98
% 0.43/0.98 ============================== STATISTICS ============================
% 0.43/0.98
% 0.43/0.98 Given=0. Generated=10. Kept=9. proofs=1.
% 0.43/0.98 Usable=0. Sos=0. Demods=5. Limbo=9, Disabled=12. Hints=0.
% 0.43/0.98 Megabytes=0.04.
% 0.43/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.98
% 0.43/0.98 ============================== end of statistics =====================
% 0.43/0.98
% 0.43/0.98 ============================== end of search =========================
% 0.43/0.98
% 0.43/0.98 THEOREM PROVED
% 0.43/0.98 % SZS status Theorem
% 0.43/0.98
% 0.43/0.98 Exiting with 1 proof.
% 0.43/0.98
% 0.43/0.98 Process 12845 exit (max_proofs) Sun Jul 10 06:43:14 2022
% 0.43/0.98 Prover9 interrupted
%------------------------------------------------------------------------------