TSTP Solution File: SEU123+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU123+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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 13:29:08 EDT 2022
% Result : Theorem 0.47s 1.12s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SEU123+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 16:53:14 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.12 ============================== Prover9 ===============================
% 0.47/1.12 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.12 Process 15317 was started by sandbox2 on n013.cluster.edu,
% 0.47/1.12 Sun Jun 19 16:53:15 2022
% 0.47/1.12 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15164_n013.cluster.edu".
% 0.47/1.12 ============================== end of head ===========================
% 0.47/1.12
% 0.47/1.12 ============================== INPUT =================================
% 0.47/1.12
% 0.47/1.12 % Reading from file /tmp/Prover9_15164_n013.cluster.edu
% 0.47/1.12
% 0.47/1.12 set(prolog_style_variables).
% 0.47/1.12 set(auto2).
% 0.47/1.12 % set(auto2) -> set(auto).
% 0.47/1.12 % set(auto) -> set(auto_inference).
% 0.47/1.12 % set(auto) -> set(auto_setup).
% 0.47/1.12 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.12 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.12 % set(auto) -> set(auto_limits).
% 0.47/1.12 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.12 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.12 % set(auto) -> set(auto_denials).
% 0.47/1.12 % set(auto) -> set(auto_process).
% 0.47/1.12 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.12 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.12 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.12 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.12 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.12 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.12 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.12 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.12 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.12 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.12 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.12 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.12 % set(auto2) -> assign(stats, some).
% 0.47/1.12 % set(auto2) -> clear(echo_input).
% 0.47/1.12 % set(auto2) -> set(quiet).
% 0.47/1.12 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.12 % set(auto2) -> clear(print_given).
% 0.47/1.12 assign(lrs_ticks,-1).
% 0.47/1.12 assign(sos_limit,10000).
% 0.47/1.12 assign(order,kbo).
% 0.47/1.12 set(lex_order_vars).
% 0.47/1.12 clear(print_given).
% 0.47/1.12
% 0.47/1.12 % formulas(sos). % not echoed (23 formulas)
% 0.47/1.12
% 0.47/1.12 ============================== end of input ==========================
% 0.47/1.12
% 0.47/1.12 % From the command line: assign(max_seconds, 300).
% 0.47/1.12
% 0.47/1.12 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.12
% 0.47/1.12 % Formulas that are not ordinary clauses:
% 0.47/1.12 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 2 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 3 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 4 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 5 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 6 (all A all B all C (C = set_intersection2(A,B) <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 7 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 8 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 9 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 10 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 11 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 12 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 13 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 14 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 15 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.47/1.12 16 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.47/1.12 17 (all A all B (-(-disjoint(A,B) & (all C -(in(C,A) & in(C,B)))) & -((exists C (in(C,A) & in(C,B))) & disjoint(A,B)))) # label(t3_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 0.47/1.12 18 (all A all B (-(-disjoint(A,B) & (all C -in(C,set_intersection2(A,B)))) & -((exists C in(C,set_intersection2(A,B))) & disjoint(A,B)))) # label(t4_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 0.47/1.12 19 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 20 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 21 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 22 -(all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.12
% 0.47/1.12 ============================== end of process non-clausal formulas ===
% 0.47/1.12
% 0.47/1.12 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.12
% 0.47/1.12 ============================== PREDICATE ELIMINATION =================
% 0.47/1.12
% 0.47/1.12 ============================== end predicate elimination =============
% 0.47/1.12
% 0.47/1.12 Auto_denials: (non-Horn, no changes).
% 0.47/1.12
% 0.47/1.12 Term ordering decisions:
% 0.47/1.12
% 0.47/1.12 % Assigning unary symbol f1 kb_weight 0 and highest precedence (15).
% 0.47/1.12 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. set_intersection2=1. f2=1. f4=1. f5=1. f3=1. f1=0.
% 0.47/1.12
% 0.47/1.12 ============================== end of process initial clauses ========
% 0.47/1.12
% 0.47/1.12 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.12
% 0.47/1.12 ============================== end of clauses for search =============
% 0.47/1.12
% 0.47/1.12 ============================== SEARCH ================================
% 0.47/1.12
% 0.47/1.12 % Starting search at 0.01 seconds.
% 0.47/1.12
% 0.47/1.12 ============================== PROOF =================================
% 0.47/1.12 % SZS status Theorem
% 0.47/1.12 % SZS output start Refutation
% 0.47/1.12
% 0.47/1.12 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.47/1.12 % Length of proof is 9.
% 0.47/1.12 % Level of proof is 3.
% 0.47/1.12 % Maximum clause weight is 9.000.
% 0.47/1.12 % Given clauses 30.
% 0.47/1.12
% 0.47/1.12 3 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.12 16 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.47/1.12 22 -(all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.12 26 subset(empty_set,A) # label(t2_xboole_1) # label(lemma). [clausify(16)].
% 0.47/1.12 27 subset(c3,empty_set) # label(t3_xboole_1) # label(negated_conjecture). [clausify(22)].
% 0.47/1.12 38 empty_set != c3 # label(t3_xboole_1) # label(negated_conjecture). [clausify(22)].
% 0.47/1.12 39 c3 != empty_set. [copy(38),flip(a)].
% 0.47/1.12 53 A = B | -subset(B,A) | -subset(A,B) # label(d10_xboole_0) # label(axiom). [clausify(3)].
% 0.47/1.12 102 $F. [resolve(53,b,27,a),flip(a),unit_del(a,39),unit_del(b,26)].
% 0.47/1.12
% 0.47/1.12 % SZS output end Refutation
% 0.47/1.12 ============================== end of proof ==========================
% 0.47/1.12
% 0.47/1.12 ============================== STATISTICS ============================
% 0.47/1.12
% 0.47/1.12 Given=30. Generated=119. Kept=78. proofs=1.
% 0.47/1.12 Usable=29. Sos=46. Demods=3. Limbo=1, Disabled=38. Hints=0.
% 0.47/1.12 Megabytes=0.11.
% 0.47/1.12 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.47/1.12
% 0.47/1.12 ============================== end of statistics =====================
% 0.47/1.12
% 0.47/1.12 ============================== end of search =========================
% 0.47/1.12
% 0.47/1.12 THEOREM PROVED
% 0.47/1.12 % SZS status Theorem
% 0.47/1.12
% 0.47/1.12 Exiting with 1 proof.
% 0.47/1.12
% 0.47/1.12 Process 15317 exit (max_proofs) Sun Jun 19 16:53:15 2022
% 0.47/1.12 Prover9 interrupted
%------------------------------------------------------------------------------