TSTP Solution File: SEU110+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU110+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:04 EDT 2022
% Result : Theorem 0.98s 1.28s
% Output : Refutation 0.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU110+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 20:55:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.68/1.00 ============================== Prover9 ===============================
% 0.68/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.68/1.00 Process 15946 was started by sandbox on n027.cluster.edu,
% 0.68/1.00 Sun Jun 19 20:55:25 2022
% 0.68/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15793_n027.cluster.edu".
% 0.68/1.00 ============================== end of head ===========================
% 0.68/1.00
% 0.68/1.00 ============================== INPUT =================================
% 0.68/1.00
% 0.68/1.00 % Reading from file /tmp/Prover9_15793_n027.cluster.edu
% 0.68/1.00
% 0.68/1.00 set(prolog_style_variables).
% 0.68/1.00 set(auto2).
% 0.68/1.00 % set(auto2) -> set(auto).
% 0.68/1.00 % set(auto) -> set(auto_inference).
% 0.68/1.00 % set(auto) -> set(auto_setup).
% 0.68/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.68/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/1.00 % set(auto) -> set(auto_limits).
% 0.68/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/1.00 % set(auto) -> set(auto_denials).
% 0.68/1.00 % set(auto) -> set(auto_process).
% 0.68/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.68/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.68/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.68/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.68/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.68/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.68/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.68/1.00 % set(auto2) -> assign(stats, some).
% 0.68/1.00 % set(auto2) -> clear(echo_input).
% 0.68/1.00 % set(auto2) -> set(quiet).
% 0.68/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.68/1.00 % set(auto2) -> clear(print_given).
% 0.68/1.00 assign(lrs_ticks,-1).
% 0.68/1.00 assign(sos_limit,10000).
% 0.68/1.00 assign(order,kbo).
% 0.68/1.00 set(lex_order_vars).
% 0.68/1.00 clear(print_given).
% 0.68/1.00
% 0.68/1.00 % formulas(sos). % not echoed (34 formulas)
% 0.68/1.00
% 0.68/1.00 ============================== end of input ==========================
% 0.68/1.00
% 0.68/1.00 % From the command line: assign(max_seconds, 300).
% 0.68/1.00
% 0.68/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/1.00
% 0.68/1.00 % Formulas that are not ordinary clauses:
% 0.68/1.00 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 2 (all A (empty(A) -> finite(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 3 (all A (preboolean(A) -> cup_closed(A) & diff_closed(A))) # label(cc1_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 4 (all A (finite(A) -> (all B (element(B,powerset(A)) -> finite(B))))) # label(cc2_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 5 (all A (cup_closed(A) & diff_closed(A) -> preboolean(A))) # label(cc2_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 6 (all A all B (element(B,finite_subsets(A)) -> finite(B))) # label(cc3_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 7 (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.68/1.00 8 (all A all B (preboolean(B) -> (B = finite_subsets(A) <-> (all C (in(C,B) <-> subset(C,A) & finite(C)))))) # label(d5_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 9 (all A preboolean(finite_subsets(A))) # label(dt_k5_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 10 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 11 (all A (-empty(powerset(A)) & cup_closed(powerset(A)) & diff_closed(powerset(A)) & preboolean(powerset(A)))) # label(fc1_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 12 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 13 (all A (-empty(finite_subsets(A)) & cup_closed(finite_subsets(A)) & diff_closed(finite_subsets(A)) & preboolean(finite_subsets(A)))) # label(fc2_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 14 (exists A (-empty(A) & finite(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 15 (exists A (-empty(A) & cup_closed(A) & cap_closed(A) & diff_closed(A) & preboolean(A))) # label(rc1_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 16 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 17 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 18 (all A exists B (element(B,powerset(A)) & empty(B) & relation(B) & function(B) & one_to_one(B) & epsilon_transitive(B) & epsilon_connected(B) & ordinal(B) & natural(B) & finite(B))) # label(rc2_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 19 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 20 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 21 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc3_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 22 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc4_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 23 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 24 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 25 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 26 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 27 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 28 (all A all B all C (in(A,B) & element(B,powerset(C)) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 29 (all A all B all C -(in(A,B) & element(B,powerset(C)) & empty(C))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 30 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 31 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 32 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.68/1.00 33 -(all A all B (subset(A,B) -> subset(finite_subsets(A),finite_subsets(B)))) # label(t23_finsub_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.68/1.00
% 0.68/1.00 ============================== end of process non-clausal formulas ===
% 0.68/1.00
% 0.68/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/1.00
% 0.68/1.00 ============================== PREDICATE ELIMINATION =================
% 0.68/1.00 34 -cup_closed(A) | -diff_closed(A) | preboolean(A) # label(cc2_finsub_1) # label(axiom). [clausify(5)].
% 0.68/1.00 35 cup_closed(c2) # label(rc1_finsub_1) # label(axiom). [clausify(15)].
% 0.68/1.00 36 cup_closed(powerset(A)) # label(fc1_finsub_1) # label(axiom). [clausify(11)].
% 0.68/1.00 37 cup_closed(finite_subsets(A)) # label(fc2_finsub_1) # label(axiom). [clausify(13)].
% 0.68/1.00 38 -preboolean(A) | cup_closed(A) # label(cc1_finsub_1) # label(axiom). [clausify(3)].
% 0.68/1.00 Derived: -diff_closed(c2) | preboolean(c2). [resolve(34,a,35,a)].
% 0.68/1.00 Derived: -diff_closed(powerset(A)) | preboolean(powerset(A)). [resolve(34,a,36,a)].
% 0.68/1.00 Derived: -diff_closed(finite_subsets(A)) | preboolean(finite_subsets(A)). [resolve(34,a,37,a)].
% 0.68/1.00 39 -preboolean(A) | diff_closed(A) # label(cc1_finsub_1) # label(axiom). [clausify(3)].
% 0.68/1.00 40 preboolean(c2) # label(rc1_finsub_1) # label(axiom). [clausify(15)].
% 0.68/1.00 41 preboolean(finite_subsets(A)) # label(dt_k5_finsub_1) # label(axiom). [clausify(9)].
% 0.68/1.00 42 preboolean(powerset(A)) # label(fc1_finsub_1) # label(axiom). [clausify(11)].
% 0.68/1.00 43 preboolean(finite_subsets(A)) # label(fc2_finsub_1) # label(axiom). [clausify(13)].
% 0.68/1.00 Derived: diff_closed(c2). [resolve(39,a,40,a)].
% 0.68/1.00 Derived: diff_closed(finite_subsets(A)). [resolve(39,a,41,a)].
% 0.68/1.00 Derived: diff_closed(powerset(A)). [resolve(39,a,42,a)].
% 0.68/1.00 44 -preboolean(A) | finite_subsets(B) != A | -in(C,A) | finite(C) # label(d5_finsub_1) # label(axiom). [clausify(8)].
% 0.98/1.28 Derived: finite_subsets(A) != c2 | -in(B,c2) | finite(B). [resolve(44,a,40,a)].
% 0.98/1.28 Derived: finite_subsets(A) != finite_subsets(B) | -in(C,finite_subsets(B)) | finite(C). [resolve(44,a,41,a)].
% 0.98/1.28 Derived: finite_subsets(A) != powerset(B) | -in(C,powerset(B)) | finite(C). [resolve(44,a,42,a)].
% 0.98/1.28 45 -preboolean(A) | finite_subsets(B) != A | -in(C,A) | subset(C,B) # label(d5_finsub_1) # label(axiom). [clausify(8)].
% 0.98/1.28 Derived: finite_subsets(A) != c2 | -in(B,c2) | subset(B,A). [resolve(45,a,40,a)].
% 0.98/1.28 Derived: finite_subsets(A) != finite_subsets(B) | -in(C,finite_subsets(B)) | subset(C,A). [resolve(45,a,41,a)].
% 0.98/1.28 Derived: finite_subsets(A) != powerset(B) | -in(C,powerset(B)) | subset(C,A). [resolve(45,a,42,a)].
% 0.98/1.28 46 -preboolean(A) | finite_subsets(B) != A | in(C,A) | -subset(C,B) | -finite(C) # label(d5_finsub_1) # label(axiom). [clausify(8)].
% 0.98/1.28 Derived: finite_subsets(A) != c2 | in(B,c2) | -subset(B,A) | -finite(B). [resolve(46,a,40,a)].
% 0.98/1.28 Derived: finite_subsets(A) != finite_subsets(B) | in(C,finite_subsets(B)) | -subset(C,A) | -finite(C). [resolve(46,a,41,a)].
% 0.98/1.28 Derived: finite_subsets(A) != powerset(B) | in(C,powerset(B)) | -subset(C,A) | -finite(C). [resolve(46,a,42,a)].
% 0.98/1.28 47 -preboolean(A) | finite_subsets(B) = A | in(f2(B,A),A) | finite(f2(B,A)) # label(d5_finsub_1) # label(axiom). [clausify(8)].
% 0.98/1.28 Derived: finite_subsets(A) = c2 | in(f2(A,c2),c2) | finite(f2(A,c2)). [resolve(47,a,40,a)].
% 0.98/1.28 Derived: finite_subsets(A) = finite_subsets(B) | in(f2(A,finite_subsets(B)),finite_subsets(B)) | finite(f2(A,finite_subsets(B))). [resolve(47,a,41,a)].
% 0.98/1.28 Derived: finite_subsets(A) = powerset(B) | in(f2(A,powerset(B)),powerset(B)) | finite(f2(A,powerset(B))). [resolve(47,a,42,a)].
% 0.98/1.28 48 -preboolean(A) | finite_subsets(B) = A | in(f2(B,A),A) | subset(f2(B,A),B) # label(d5_finsub_1) # label(axiom). [clausify(8)].
% 0.98/1.28 Derived: finite_subsets(A) = c2 | in(f2(A,c2),c2) | subset(f2(A,c2),A). [resolve(48,a,40,a)].
% 0.98/1.28 Derived: finite_subsets(A) = finite_subsets(B) | in(f2(A,finite_subsets(B)),finite_subsets(B)) | subset(f2(A,finite_subsets(B)),A). [resolve(48,a,41,a)].
% 0.98/1.28 Derived: finite_subsets(A) = powerset(B) | in(f2(A,powerset(B)),powerset(B)) | subset(f2(A,powerset(B)),A). [resolve(48,a,42,a)].
% 0.98/1.28 49 -preboolean(A) | finite_subsets(B) = A | -in(f2(B,A),A) | -subset(f2(B,A),B) | -finite(f2(B,A)) # label(d5_finsub_1) # label(axiom). [clausify(8)].
% 0.98/1.28 Derived: finite_subsets(A) = c2 | -in(f2(A,c2),c2) | -subset(f2(A,c2),A) | -finite(f2(A,c2)). [resolve(49,a,40,a)].
% 0.98/1.28 Derived: finite_subsets(A) = finite_subsets(B) | -in(f2(A,finite_subsets(B)),finite_subsets(B)) | -subset(f2(A,finite_subsets(B)),A) | -finite(f2(A,finite_subsets(B))). [resolve(49,a,41,a)].
% 0.98/1.28 Derived: finite_subsets(A) = powerset(B) | -in(f2(A,powerset(B)),powerset(B)) | -subset(f2(A,powerset(B)),A) | -finite(f2(A,powerset(B))). [resolve(49,a,42,a)].
% 0.98/1.28 50 -diff_closed(c2) | preboolean(c2). [resolve(34,a,35,a)].
% 0.98/1.28 51 -diff_closed(powerset(A)) | preboolean(powerset(A)). [resolve(34,a,36,a)].
% 0.98/1.28 52 -diff_closed(finite_subsets(A)) | preboolean(finite_subsets(A)). [resolve(34,a,37,a)].
% 0.98/1.28
% 0.98/1.28 ============================== end predicate elimination =============
% 0.98/1.28
% 0.98/1.28 Auto_denials: (non-Horn, no changes).
% 0.98/1.28
% 0.98/1.28 Term ordering decisions:
% 0.98/1.28 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. f1=1. f2=1. finite_subsets=1. powerset=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1.
% 0.98/1.28
% 0.98/1.28 ============================== end of process initial clauses ========
% 0.98/1.28
% 0.98/1.28 ============================== CLAUSES FOR SEARCH ====================
% 0.98/1.28
% 0.98/1.28 ============================== end of clauses for search =============
% 0.98/1.28
% 0.98/1.28 ============================== SEARCH ================================
% 0.98/1.28
% 0.98/1.28 % Starting search at 0.02 seconds.
% 0.98/1.28
% 0.98/1.28 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 119 (0.00 of 0.25 sec).
% 0.98/1.28
% 0.98/1.28 Low Water (keep): wt=12.000, iters=3334
% 0.98/1.28
% 0.98/1.28 ============================== PROOF =================================
% 0.98/1.28 % SZS status Theorem
% 0.98/1.28 % SZS output start Refutation
% 0.98/1.28
% 0.98/1.28 % Proof 1 at 0.28 (+ 0.01) seconds.
% 0.98/1.28 % Length of proof is 26.
% 0.98/1.28 % Level of proof is 6.
% 0.98/1.28 % Maximum clause weight is 14.000.
% 0.98/1.28 % Given clauses 598.
% 0.98/1.28
% 0.98/1.28 7 (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.98/1.28 8 (all A all B (preboolean(B) -> (B = finite_subsets(A) <-> (all C (in(C,B) <-> subset(C,A) & finite(C)))))) # label(d5_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.98/1.28 9 (all A preboolean(finite_subsets(A))) # label(dt_k5_finsub_1) # label(axiom) # label(non_clause). [assumption].
% 0.98/1.28 25 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.98/1.28 33 -(all A all B (subset(A,B) -> subset(finite_subsets(A),finite_subsets(B)))) # label(t23_finsub_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.98/1.28 41 preboolean(finite_subsets(A)) # label(dt_k5_finsub_1) # label(axiom). [clausify(9)].
% 0.98/1.28 44 -preboolean(A) | finite_subsets(B) != A | -in(C,A) | finite(C) # label(d5_finsub_1) # label(axiom). [clausify(8)].
% 0.98/1.28 45 -preboolean(A) | finite_subsets(B) != A | -in(C,A) | subset(C,B) # label(d5_finsub_1) # label(axiom). [clausify(8)].
% 0.98/1.28 46 -preboolean(A) | finite_subsets(B) != A | in(C,A) | -subset(C,B) | -finite(C) # label(d5_finsub_1) # label(axiom). [clausify(8)].
% 0.98/1.28 60 subset(c5,c6) # label(t23_finsub_1) # label(negated_conjecture). [clausify(33)].
% 0.98/1.28 69 subset(A,B) | in(f1(A,B),A) # label(d3_tarski) # label(axiom). [clausify(7)].
% 0.98/1.28 76 -subset(finite_subsets(c5),finite_subsets(c6)) # label(t23_finsub_1) # label(negated_conjecture). [clausify(33)].
% 0.98/1.28 90 subset(A,B) | -in(f1(A,B),B) # label(d3_tarski) # label(axiom). [clausify(7)].
% 0.98/1.28 93 -subset(A,B) | -subset(B,C) | subset(A,C) # label(t1_xboole_1) # label(axiom). [clausify(25)].
% 0.98/1.28 96 finite_subsets(A) != finite_subsets(B) | -in(C,finite_subsets(B)) | finite(C). [resolve(44,a,41,a)].
% 0.98/1.28 97 -in(A,finite_subsets(B)) | finite(A). [copy(96),xx(a)].
% 0.98/1.28 100 finite_subsets(A) != finite_subsets(B) | -in(C,finite_subsets(B)) | subset(C,A). [resolve(45,a,41,a)].
% 0.98/1.28 103 finite_subsets(A) != finite_subsets(B) | in(C,finite_subsets(B)) | -subset(C,A) | -finite(C). [resolve(46,a,41,a)].
% 0.98/1.28 119 in(f1(finite_subsets(c5),finite_subsets(c6)),finite_subsets(c5)). [resolve(76,a,69,a)].
% 0.98/1.28 158 -in(f1(finite_subsets(c5),finite_subsets(c6)),finite_subsets(c6)). [ur(90,a,76,a)].
% 0.98/1.28 168 -subset(A,c5) | subset(A,c6). [resolve(93,b,60,a)].
% 0.98/1.28 238 finite_subsets(c5) != finite_subsets(A) | subset(f1(finite_subsets(c5),finite_subsets(c6)),A). [resolve(119,a,100,b),flip(a)].
% 0.98/1.28 239 finite(f1(finite_subsets(c5),finite_subsets(c6))). [resolve(119,a,97,a)].
% 0.98/1.28 479 -subset(f1(finite_subsets(c5),finite_subsets(c6)),c6). [ur(103,a,xx,b,158,a,d,239,a)].
% 0.98/1.28 5423 subset(f1(finite_subsets(c5),finite_subsets(c6)),c5). [xx_res(238,a)].
% 0.98/1.28 5471 $F. [resolve(5423,a,168,a),unit_del(a,479)].
% 0.98/1.28
% 0.98/1.28 % SZS output end Refutation
% 0.98/1.28 ============================== end of proof ==========================
% 0.98/1.28
% 0.98/1.28 ============================== STATISTICS ============================
% 0.98/1.28
% 0.98/1.28 Given=598. Generated=7683. Kept=5417. proofs=1.
% 0.98/1.28 Usable=585. Sos=4758. Demods=4. Limbo=7, Disabled=161. Hints=0.
% 0.98/1.28 Megabytes=4.28.
% 0.98/1.28 User_CPU=0.28, System_CPU=0.01, Wall_clock=0.
% 0.98/1.28
% 0.98/1.28 ============================== end of statistics =====================
% 0.98/1.28
% 0.98/1.28 ============================== end of search =========================
% 0.98/1.28
% 0.98/1.28 THEOREM PROVED
% 0.98/1.28 % SZS status Theorem
% 0.98/1.28
% 0.98/1.28 Exiting with 1 proof.
% 0.98/1.28
% 0.98/1.28 Process 15946 exit (max_proofs) Sun Jun 19 20:55:25 2022
% 0.98/1.28 Prover9 interrupted
%------------------------------------------------------------------------------