0.11/0.13	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.35	% Computer : n020.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 : 1440
0.13/0.35	% WCLimit  : 180
0.13/0.35	% DateTime : Mon Jul  3 04:39:31 EDT 2023
0.13/0.35	% CPUTime  : 
0.45/1.07	============================== Prover9 ===============================
0.45/1.07	Prover9 (32) version 2009-11A, November 2009.
0.45/1.07	Process 11046 was started by sandbox on n020.cluster.edu,
0.45/1.07	Mon Jul  3 04:39:32 2023
0.45/1.07	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_10860_n020.cluster.edu".
0.45/1.07	============================== end of head ===========================
0.45/1.07	
0.45/1.07	============================== INPUT =================================
0.45/1.07	
0.45/1.07	% Reading from file /tmp/Prover9_10860_n020.cluster.edu
0.45/1.07	
0.45/1.07	set(prolog_style_variables).
0.45/1.07	set(auto2).
0.45/1.07	    % set(auto2) -> set(auto).
0.45/1.07	    % set(auto) -> set(auto_inference).
0.45/1.07	    % set(auto) -> set(auto_setup).
0.45/1.07	    % set(auto_setup) -> set(predicate_elim).
0.45/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.45/1.07	    % set(auto) -> set(auto_limits).
0.45/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.45/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.45/1.07	    % set(auto) -> set(auto_denials).
0.45/1.07	    % set(auto) -> set(auto_process).
0.45/1.07	    % set(auto2) -> assign(new_constants, 1).
0.45/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.45/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.45/1.07	    % set(auto2) -> assign(max_hours, 1).
0.45/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.45/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.45/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.45/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.45/1.07	    % set(auto2) -> set(sort_initial_sos).
0.45/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.45/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.45/1.07	    % set(auto2) -> assign(max_megs, 400).
0.45/1.07	    % set(auto2) -> assign(stats, some).
0.45/1.07	    % set(auto2) -> clear(echo_input).
0.45/1.07	    % set(auto2) -> set(quiet).
0.45/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.45/1.07	    % set(auto2) -> clear(print_given).
0.45/1.07	assign(lrs_ticks,-1).
0.45/1.07	assign(sos_limit,10000).
0.45/1.07	assign(order,kbo).
0.45/1.07	set(lex_order_vars).
0.45/1.07	clear(print_given).
0.45/1.07	
0.45/1.07	% formulas(sos).  % not echoed (58 formulas)
0.45/1.07	
0.45/1.07	============================== end of input ==========================
0.45/1.07	
0.45/1.07	% From the command line: assign(max_seconds, 1440).
0.45/1.07	
0.45/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.45/1.07	
0.45/1.07	% Formulas that are not ordinary clauses:
0.45/1.07	1 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	2 (all A (empty(A) -> epsilon_connected(A) & ordinal(A) & epsilon_transitive(A))) # label(cc3_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	3 (all A A = set_union2(A,empty_set)) # label(t1_boole) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	4 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	5 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	6 (exists A (empty(A) & function(A) & relation(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	7 (all A (relation(A) -> (all B ((all C (in(C,B) -> in(ordered_pair(C,C),A))) <-> is_reflexive_in(A,B))))) # label(d1_relat_2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	8 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	9 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	10 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	11 (all A relation(inclusion_relation(A))) # label(dt_k1_wellord2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	12 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	13 (all A all B unordered_pair(unordered_pair(A,B),singleton(A)) = ordered_pair(A,B)) # label(d5_tarski) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	14 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	15 (all A all B all C -(in(A,B) & empty(C) & element(B,powerset(C)))) # label(t5_subset) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	16 (exists A (one_to_one(A) & function(A) & relation(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	17 (all A (ordinal(A) -> epsilon_connected(A) & epsilon_transitive(A))) # label(cc1_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	18 (all A all B (element(A,B) -> in(A,B) | empty(B))) # label(t2_subset) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	19 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	20 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	21 $T # label(dt_k3_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	22 (exists A (ordinal(A) & epsilon_connected(A) & epsilon_transitive(A))) # label(rc1_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	23 (all A (relation(A) -> set_union2(relation_dom(A),relation_rng(A)) = relation_field(A))) # label(d6_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	24 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	25 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	26 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	27 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	28 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	29 (all A all B set_union2(B,A) = set_union2(A,B)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	30 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	31 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	32 (exists A (function(A) & ordinal(A) & epsilon_connected(A) & epsilon_transitive(A) & empty(A) & one_to_one(A) & relation(A))) # label(rc2_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	33 (exists A (relation(A) & function(A) & relation_empty_yielding(A))) # label(rc4_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	34 (exists A (epsilon_transitive(A) & ordinal(A) & epsilon_connected(A) & -empty(A))) # label(rc3_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	35 (all A (epsilon_transitive(A) & epsilon_connected(A) -> ordinal(A))) # label(cc2_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	36 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	37 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	38 (all A (relation(A) -> (reflexive(A) <-> is_reflexive_in(A,relation_field(A))))) # label(d9_relat_2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	39 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	40 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	41 (exists A (function(A) & relation(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	42 (all A (function(A) & empty(A) & relation(A) -> one_to_one(A) & function(A) & relation(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	43 (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.45/1.08	44 (all A (empty(A) -> empty_set = A)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	45 (all A all B (relation(B) -> (B = inclusion_relation(A) <-> A = relation_field(B) & (all C all D (in(C,A) & in(D,A) -> (subset(C,D) <-> in(ordered_pair(C,D),B))))))) # label(d1_wellord2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	46 (all A all B -(empty(A) & empty(B) & B != A)) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	47 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	48 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause).  [assumption].
0.45/1.08	49 -(all A reflexive(inclusion_relation(A))) # label(t2_wellord2) # label(negated_conjecture) # label(non_clause).  [assumption].
0.45/1.08	
0.45/1.08	============================== end of process non-clausal formulas ===
0.45/1.08	
0.45/1.08	============================== PROCESS INITIAL CLAUSES ===============
0.45/1.08	
0.45/1.08	============================== PREDICATE ELIMINATION =================
0.45/1.08	50 -function(A) | -empty(A) | -relation(A) | one_to_one(A) # label(cc2_funct_1) # label(axiom).  [clausify(42)].
0.45/1.08	51 function(c2) # label(rc2_funct_1) # label(axiom).  [clausify(6)].
0.45/1.08	52 function(c3) # label(rc3_funct_1) # label(axiom).  [clausify(16)].
0.45/1.08	53 function(empty_set) # label(fc2_ordinal1_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndLHS) # label(axiom).  [assumption].
0.45/1.08	54 function(c6) # label(rc2_ordinal1) # label(axiom).  [clausify(32)].
0.45/1.08	55 function(c7) # label(rc4_funct_1) # label(axiom).  [clausify(33)].
0.45/1.08	56 function(c9) # label(rc1_funct_1) # label(axiom).  [clausify(41)].
0.45/1.08	57 -empty(A) | function(A) # label(cc1_funct_1) # label(axiom).  [clausify(20)].
0.45/1.08	Derived: -empty(c2) | -relation(c2) | one_to_one(c2).  [resolve(50,a,51,a)].
0.45/1.08	Derived: -empty(c3) | -relation(c3) | one_to_one(c3).  [resolve(50,a,52,a)].
0.45/1.08	Derived: -empty(empty_set) | -relation(empty_set) | one_to_one(empty_set).  [resolve(50,a,53,a)].
0.45/1.08	Derived: -empty(c6) | -relation(c6) | one_to_one(c6).  [resolve(50,a,54,a)].
0.45/1.08	Derived: -empty(c7) | -relation(c7) | one_to_one(c7).  [resolve(50,a,55,a)].
0.45/1.08	Derived: -empty(c9) | -relation(c9) | one_to_one(c9).  [resolve(50,a,56,a)].
0.45/1.08	Derived: -empty(A) | -relation(A) | one_to_one(A) | -empty(A).  [resolve(50,a,57,b)].
0.45/1.08	58 -relation(A) | -reflexive(A) | is_reflexive_in(A,relation_field(A)) # label(d9_relat_2) # label(axiom).  [clausify(38)].
0.45/1.08	59 relation(c2) # label(rc2_funct_1) # label(axiom).  [clausify(6)].
0.45/1.08	60 relation(c3) # label(rc3_funct_1) # label(axiom).  [clausify(16)].
0.45/1.08	61 relation(empty_set) # label(fc2_ordinal1_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS) # label(axiom).  [assumption].
0.45/1.08	62 relation(c6) # label(rc2_ordinal1) # label(axiom).  [clausify(32)].
0.45/1.08	63 relation(c7) # label(rc4_funct_1) # label(axiom).  [clausify(33)].
0.45/1.08	64 relation(c9) # label(rc1_funct_1) # label(axiom).  [clausify(41)].
0.45/1.08	65 relation(inclusion_relation(A)) # label(dt_k1_wellord2) # label(axiom).  [clausify(11)].
0.45/1.08	Derived: -reflexive(c2) | is_reflexive_in(c2,relation_field(c2)).  [resolve(58,a,59,a)].
0.45/1.08	Derived: -reflexive(c3) | is_reflexive_in(c3,relation_field(c3)).  [resolve(58,a,60,a)].
0.45/1.08	Derived: -reflexive(empty_set) | is_reflexive_in(empty_set,relation_field(empty_set)).  [resolve(58,a,61,a)].
0.45/1.08	Derived: -reflexive(c6) | is_reflexive_in(c6,relation_field(c6)).  [resolve(58,a,62,a)].
0.45/1.08	Derived: -reflexive(c7) | is_reflexive_in(c7,relation_field(c7)).  [resolve(58,a,63,a)].
0.45/1.08	Derived: -reflexive(c9) | is_reflexive_in(c9,relation_field(c9)).  [resolve(58,a,64,a)].
0.45/1.08	Derived: -reflexive(inclusion_relation(A)) | is_reflexive_in(inclusion_relation(A),relation_field(inclusion_relation(A))).  [resolve(58,a,65,a)].
0.45/1.08	66 -relation(A) | reflexive(A) | -is_reflexive_in(A,relation_field(A)) # label(d9_relat_2) # label(axiom).  [clausify(38)].
0.45/1.08	Derived: reflexive(c2) | -is_reflexive_in(c2,relation_field(c2)).  [resolve(66,a,59,a)].
0.45/1.08	Derived: reflexive(c3) | -is_reflexive_in(c3,relation_field(c3)).  [resolve(66,a,60,a)].
0.45/1.08	Derived: reflexive(empty_set) | -is_reflexive_in(empty_set,relation_field(empty_set)).  [resolve(66,a,61,a)].
0.45/1.08	Derived: reflexive(c6) | -is_reflexive_in(c6,relation_field(c6)).  [resolve(66,a,62,a)].
0.45/1.08	Derived: reflexive(c7) | -is_reflexive_in(c7,relation_field(c7)).  [resolve(66,a,63,a)].
0.45/1.08	Derived: reflexive(c9) | -is_reflexive_in(c9,relation_field(c9)).  [resolve(66,a,64,a)].
0.45/1.08	Derived: reflexive(inclusion_relation(A)) | -is_reflexive_in(inclusion_relation(A),relation_field(inclusion_relation(A))).  [resolve(66,a,65,a)].
0.45/1.08	67 -relation(A) | in(f1(A,B),B) | is_reflexive_in(A,B) # label(d1_relat_2) # label(axiom).  [clausify(7)].
0.45/1.08	Derived: in(f1(c2,A),A) | is_reflexive_in(c2,A).  [resolve(67,a,59,a)].
0.45/1.08	Derived: in(f1(c3,A),A) | is_reflexive_in(c3,A).  [resolve(67,a,60,a)].
0.45/1.08	Derived: in(f1(empty_set,A),A) | is_reflexive_in(empty_set,A).  [resolve(67,a,61,a)].
0.45/1.08	Derived: in(f1(c6,A),A) | is_reflexive_in(c6,A).  [resolve(67,a,62,a)].
0.80/1.08	Derived: in(f1(c7,A),A) | is_reflexive_in(c7,A).  [resolve(67,a,63,a)].
0.80/1.08	Derived: in(f1(c9,A),A) | is_reflexive_in(c9,A).  [resolve(67,a,64,a)].
0.80/1.08	Derived: in(f1(inclusion_relation(A),B),B) | is_reflexive_in(inclusion_relation(A),B).  [resolve(67,a,65,a)].
0.80/1.08	68 -relation(A) | relation_field(A) = set_union2(relation_dom(A),relation_rng(A)) # label(d6_relat_1) # label(axiom).  [clausify(23)].
0.80/1.08	Derived: relation_field(c2) = set_union2(relation_dom(c2),relation_rng(c2)).  [resolve(68,a,59,a)].
0.80/1.08	Derived: relation_field(c3) = set_union2(relation_dom(c3),relation_rng(c3)).  [resolve(68,a,60,a)].
0.80/1.08	Derived: relation_field(empty_set) = set_union2(relation_dom(empty_set),relation_rng(empty_set)).  [resolve(68,a,61,a)].
0.80/1.08	Derived: relation_field(c6) = set_union2(relation_dom(c6),relation_rng(c6)).  [resolve(68,a,62,a)].
0.80/1.08	Derived: relation_field(c7) = set_union2(relation_dom(c7),relation_rng(c7)).  [resolve(68,a,63,a)].
0.80/1.08	Derived: relation_field(c9) = set_union2(relation_dom(c9),relation_rng(c9)).  [resolve(68,a,64,a)].
0.80/1.08	Derived: relation_field(inclusion_relation(A)) = set_union2(relation_dom(inclusion_relation(A)),relation_rng(inclusion_relation(A))).  [resolve(68,a,65,a)].
0.80/1.08	69 -relation(A) | inclusion_relation(B) != A | relation_field(A) = B # label(d1_wellord2) # label(axiom).  [clausify(45)].
0.80/1.08	Derived: inclusion_relation(A) != c2 | relation_field(c2) = A.  [resolve(69,a,59,a)].
0.80/1.08	Derived: inclusion_relation(A) != c3 | relation_field(c3) = A.  [resolve(69,a,60,a)].
0.80/1.08	Derived: inclusion_relation(A) != empty_set | relation_field(empty_set) = A.  [resolve(69,a,61,a)].
0.80/1.08	Derived: inclusion_relation(A) != c6 | relation_field(c6) = A.  [resolve(69,a,62,a)].
0.80/1.08	Derived: inclusion_relation(A) != c7 | relation_field(c7) = A.  [resolve(69,a,63,a)].
0.80/1.08	Derived: inclusion_relation(A) != c9 | relation_field(c9) = A.  [resolve(69,a,64,a)].
0.80/1.08	Derived: inclusion_relation(A) != inclusion_relation(B) | relation_field(inclusion_relation(B)) = A.  [resolve(69,a,65,a)].
0.80/1.08	70 -relation(A) | -in(B,C) | in(ordered_pair(B,B),A) | -is_reflexive_in(A,C) # label(d1_relat_2) # label(axiom).  [clausify(7)].
0.80/1.08	Derived: -in(A,B) | in(ordered_pair(A,A),c2) | -is_reflexive_in(c2,B).  [resolve(70,a,59,a)].
0.80/1.08	Derived: -in(A,B) | in(ordered_pair(A,A),c3) | -is_reflexive_in(c3,B).  [resolve(70,a,60,a)].
0.80/1.08	Derived: -in(A,B) | in(ordered_pair(A,A),empty_set) | -is_reflexive_in(empty_set,B).  [resolve(70,a,61,a)].
0.80/1.08	Derived: -in(A,B) | in(ordered_pair(A,A),c6) | -is_reflexive_in(c6,B).  [resolve(70,a,62,a)].
0.80/1.08	Derived: -in(A,B) | in(ordered_pair(A,A),c7) | -is_reflexive_in(c7,B).  [resolve(70,a,63,a)].
0.80/1.08	Derived: -in(A,B) | in(ordered_pair(A,A),c9) | -is_reflexive_in(c9,B).  [resolve(70,a,64,a)].
0.80/1.08	Derived: -in(A,B) | in(ordered_pair(A,A),inclusion_relation(C)) | -is_reflexive_in(inclusion_relation(C),B).  [resolve(70,a,65,a)].
0.80/1.08	71 -relation(A) | -in(ordered_pair(f1(A,B),f1(A,B)),A) | is_reflexive_in(A,B) # label(d1_relat_2) # label(axiom).  [clausify(7)].
0.80/1.08	Derived: -in(ordered_pair(f1(c2,A),f1(c2,A)),c2) | is_reflexive_in(c2,A).  [resolve(71,a,59,a)].
0.80/1.08	Derived: -in(ordered_pair(f1(c3,A),f1(c3,A)),c3) | is_reflexive_in(c3,A).  [resolve(71,a,60,a)].
0.80/1.08	Derived: -in(ordered_pair(f1(empty_set,A),f1(empty_set,A)),empty_set) | is_reflexive_in(empty_set,A).  [resolve(71,a,61,a)].
0.80/1.08	Derived: -in(ordered_pair(f1(c6,A),f1(c6,A)),c6) | is_reflexive_in(c6,A).  [resolve(71,a,62,a)].
0.80/1.08	Derived: -in(ordered_pair(f1(c7,A),f1(c7,A)),c7) | is_reflexive_in(c7,A).  [resolve(71,a,63,a)].
0.80/1.08	Derived: -in(ordered_pair(f1(c9,A),f1(c9,A)),c9) | is_reflexive_in(c9,A).  [resolve(71,a,64,a)].
0.80/1.08	Derived: -in(ordered_pair(f1(inclusion_relation(A),B),f1(inclusion_relation(A),B)),inclusion_relation(A)) | is_reflexive_in(inclusion_relation(A),B).  [resolve(71,a,65,a)].
0.80/1.08	72 -relation(A) | inclusion_relation(B) = A | relation_field(A) != B | in(f3(B,A),B) # label(d1_wellord2) # label(axiom).  [clausify(45)].
0.80/1.08	Derived: inclusion_relation(A) = c2 | relation_field(c2) != A | in(f3(A,c2),A).  [resolve(72,a,59,a)].
0.80/1.08	Derived: inclusion_relation(A) = c3 | relation_field(c3) != A | in(f3(A,c3),A).  [resolve(72,a,60,a)].
0.80/1.08	Derived: inclusion_relation(A) = empty_set | relation_field(empty_set) != A | in(f3(A,empty_set),A).  [resolve(72,a,61,a)].
0.80/1.08	Derived: inclusion_relation(A) = c6 | relation_field(c6) != A | in(f3(A,c6),A).  [resolve(72,a,62,a)].
0.80/1.08	Derived: inclusion_relation(A) = c7 | relation_field(c7) != A | in(f3(A,c7),A).  [resolve(72,a,63,a)].
0.80/1.08	Derived: inclusion_relation(A) = c9 | relation_field(c9) != A | in(f3(A,c9),A).  [resolve(72,a,64,a)].
0.80/1.08	Derived: inclusion_relation(A) = inclusion_relation(B) | relation_field(inclusion_relation(B)) != A | in(f3(A,inclusion_relation(B)),A).  [resolve(72,a,65,a)].
0.80/1.08	73 -relation(A) | inclusion_relation(B) = A | relation_field(A) != B | in(f4(B,A),B) # label(d1_wellord2) # label(axiom).  [clausify(45)].
0.80/1.08	Derived: inclusion_relation(A) = c2 | relation_field(c2) != A | in(f4(A,c2),A).  [resolve(73,a,59,a)].
0.80/1.08	Derived: inclusion_relation(A) = c3 | relation_field(c3) != A | in(f4(A,c3),A).  [resolve(73,a,60,a)].
0.80/1.08	Derived: inclusion_relation(A) = empty_set | relation_field(empty_set) != A | in(f4(A,empty_set),A).  [resolve(73,a,61,a)].
0.80/1.08	Derived: inclusion_relation(A) = c6 | relation_field(c6) != A | in(f4(A,c6),A).  [resolve(73,a,62,a)].
0.80/1.08	Derived: inclusion_relation(A) = c7 | relation_field(c7) != A | in(f4(A,c7),A).  [resolve(73,a,63,a)].
0.80/1.08	Derived: inclusion_relation(A) = c9 | relation_field(c9) != A | in(f4(A,c9),A).  [resolve(73,a,64,a)].
0.80/1.08	Derived: inclusion_relation(A) = inclusion_relation(B) | relation_field(inclusion_relation(B)) != A | in(f4(A,inclusion_relation(B)),A).  [resolve(73,a,65,a)].
0.80/1.08	74 -relation(A) | inclusion_relation(B) != A | -in(C,B) | -in(D,B) | -subset(C,D) | in(ordered_pair(C,D),A) # label(d1_wellord2) # label(axiom).  [clausify(45)].
0.80/1.08	Derived: inclusion_relation(A) != c2 | -in(B,A) | -in(C,A) | -subset(B,C) | in(ordered_pair(B,C),c2).  [resolve(74,a,59,a)].
0.80/1.08	Derived: inclusion_relation(A) != c3 | -in(B,A) | -in(C,A) | -subset(B,C) | in(ordered_pair(B,C),c3).  [resolve(74,a,60,a)].
0.80/1.08	Derived: inclusion_relation(A) != empty_set | -in(B,A) | -in(C,A) | -subset(B,C) | in(ordered_pair(B,C),empty_set).  [resolve(74,a,61,a)].
0.80/1.08	Derived: inclusion_relation(A) != c6 | -in(B,A) | -in(C,A) | -subset(B,C) | in(ordered_pair(B,C),c6).  [resolve(74,a,62,a)].
0.80/1.08	Derived: inclusion_relation(A) != c7 | -in(B,A) | -in(C,A) | -subset(B,C) | in(ordered_pair(B,C),c7).  [resolve(74,a,63,a)].
0.80/1.08	Derived: inclusion_relation(A) != c9 | -in(B,A) | -in(C,A) | -subset(B,C) | in(ordered_pair(B,C),c9).  [resolve(74,a,64,a)].
0.80/1.08	Derived: inclusion_relation(A) != inclusion_relation(B) | -in(C,A) | -in(D,A) | -subset(C,D) | in(ordered_pair(C,D),inclusion_relation(B)).  [resolve(74,a,65,a)].
0.80/1.08	75 -relation(A) | inclusion_relation(B) != A | -in(C,B) | -in(D,B) | subset(C,D) | -in(ordered_pair(C,D),A) # label(d1_wellord2) # label(axiom).  [clausify(45)].
0.80/1.08	Derived: inclusion_relation(A) != c2 | -in(B,A) | -in(C,A) | subset(B,C) | -in(ordered_pair(B,C),c2).  [resolve(75,a,59,a)].
0.80/1.08	Derived: inclusion_relation(A) != c3 | -in(B,A) | -in(C,A) | subset(B,C) | -in(ordered_pair(B,C),c3).  [resolve(75,a,60,a)].
0.80/1.08	Derived: inclusion_relation(A) != empty_set | -in(B,A) | -in(C,A) | subset(B,C) | -in(ordered_pair(B,C),empty_set).  [resolve(75,a,61,a)].
0.80/1.08	Derived: inclusion_relation(A) != c6 | -in(B,A) | -in(C,A) | subset(B,C) | -in(ordered_pair(B,C),c6).  [resolve(75,a,62,a)].
0.80/1.08	Derived: inclusion_relation(A) != c7 | -in(B,A) | -in(C,A) | subset(B,C) | -in(ordered_pair(B,C),c7).  [resolve(75,a,63,a)].
0.80/1.08	Derived: inclusion_relation(A) != c9 | -in(B,A) | -in(C,A) | subset(B,C) | -in(ordered_pair(B,C),c9).  [resolve(75,a,64,a)].
0.80/1.08	Derived: inclusion_relation(A) != inclusion_relation(B) | -in(C,A) | -in(D,A) | subset(C,D) | -in(ordered_pair(C,D),inclusion_relation(B)).  [resolve(75,a,65,a)].
0.80/1.08	76 -relation(A) | inclusion_relation(B) = A | relation_field(A) != B | subset(f3(B,A),f4(B,A)) | in(ordered_pair(f3(B,A),f4(B,A)),A) # label(d1_wellord2) # label(axiom).  [clausify(45)].
0.80/1.08	Derived: inclusion_relation(A) = c2 | relation_field(c2) != A | subset(f3(A,c2),f4(A,c2)) | in(ordered_pair(f3(A,c2),f4(A,c2)),c2).  [resolve(76,a,59,a)].
0.80/1.08	Derived: inclusion_relation(A) = c3 | relation_field(c3) != A | subset(f3(A,c3),f4(A,c3)) | in(ordered_pair(f3(A,c3),f4(A,c3)),c3).  [resolve(76,a,60,a)].
0.80/1.09	Derived: inclusion_relation(A) = empty_set | relation_field(empty_set) != A | subset(f3(A,empty_set),f4(A,empty_set)) | in(ordered_pair(f3(A,empty_set),f4(A,empty_set)),empty_set).  [resolve(76,a,61,a)].
0.80/1.09	Derived: inclusion_relation(A) = c6 | relation_field(c6) != A | subset(f3(A,c6),f4(A,c6)) | in(ordered_pair(f3(A,c6),f4(A,c6)),c6).  [resolve(76,a,62,a)].
0.80/1.09	Derived: inclusion_relation(A) = c7 | relation_field(c7) != A | subset(f3(A,c7),f4(A,c7)) | in(ordered_pair(f3(A,c7),f4(A,c7)),c7).  [resolve(76,a,63,a)].
0.80/1.09	Derived: inclusion_relation(A) = c9 | relation_field(c9) != A | subset(f3(A,c9),f4(A,c9)) | in(ordered_pair(f3(A,c9),f4(A,c9)),c9).  [resolve(76,a,64,a)].
0.80/1.09	Derived: inclusion_relation(A) = inclusion_relation(B) | relation_field(inclusion_relation(B)) != A | subset(f3(A,inclusion_relation(B)),f4(A,inclusion_relation(B))) | in(ordered_pair(f3(A,inclusion_relation(B)),f4(A,inclusion_relation(B))),inclusion_relation(B)).  [resolve(76,a,65,a)].
0.80/1.09	77 -relation(A) | inclusion_relation(B) = A | relation_field(A) != B | -subset(f3(B,A),f4(B,A)) | -in(ordered_pair(f3(B,A),f4(B,A)),A) # label(d1_wellord2) # label(axiom).  [clausify(45)].
0.80/1.09	Derived: inclusion_relation(A) = c2 | relation_field(c2) != A | -subset(f3(A,c2),f4(A,c2)) | -in(ordered_pair(f3(A,c2),f4(A,c2)),c2).  [resolve(77,a,59,a)].
0.80/1.09	Derived: inclusion_relation(A) = c3 | relation_field(c3) != A | -subset(f3(A,c3),f4(A,c3)) | -in(ordered_pair(f3(A,c3),f4(A,c3)),c3).  [resolve(77,a,60,a)].
0.80/1.09	Derived: inclusion_relation(A) = empty_set | relation_field(empty_set) != A | -subset(f3(A,empty_set),f4(A,empty_set)) | -in(ordered_pair(f3(A,empty_set),f4(A,empty_set)),empty_set).  [resolve(77,a,61,a)].
0.80/1.09	Derived: inclusion_relation(A) = c6 | relation_field(c6) != A | -subset(f3(A,c6),f4(A,c6)) | -in(ordered_pair(f3(A,c6),f4(A,c6)),c6).  [resolve(77,a,62,a)].
0.80/1.09	Derived: inclusion_relation(A) = c7 | relation_field(c7) != A | -subset(f3(A,c7),f4(A,c7)) | -in(ordered_pair(f3(A,c7),f4(A,c7)),c7).  [resolve(77,a,63,a)].
0.80/1.09	Derived: inclusion_relation(A) = c9 | relation_field(c9) != A | -subset(f3(A,c9),f4(A,c9)) | -in(ordered_pair(f3(A,c9),f4(A,c9)),c9).  [resolve(77,a,64,a)].
0.80/1.09	Derived: inclusion_relation(A) = inclusion_relation(B) | relation_field(inclusion_relation(B)) != A | -subset(f3(A,inclusion_relation(B)),f4(A,inclusion_relation(B))) | -in(ordered_pair(f3(A,inclusion_relation(B)),f4(A,inclusion_relation(B))),inclusion_relation(B)).  [resolve(77,a,65,a)].
0.80/1.09	78 -ordinal(A) | epsilon_connected(A) # label(cc1_ordinal1) # label(axiom).  [clausify(17)].
0.80/1.09	79 ordinal(c5) # label(rc1_ordinal1) # label(axiom).  [clausify(22)].
0.80/1.09	80 ordinal(empty_set) # label(fc2_ordinal1_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndLHS) # label(axiom).  [assumption].
0.80/1.09	81 ordinal(c6) # label(rc2_ordinal1) # label(axiom).  [clausify(32)].
0.80/1.09	82 ordinal(c8) # label(rc3_ordinal1) # label(axiom).  [clausify(34)].
0.80/1.09	83 -empty(A) | ordinal(A) # label(cc3_ordinal1) # label(axiom).  [clausify(2)].
0.80/1.09	Derived: epsilon_connected(c5).  [resolve(78,a,79,a)].
0.80/1.09	Derived: epsilon_connected(empty_set).  [resolve(78,a,80,a)].
0.80/1.09	Derived: epsilon_connected(c6).  [resolve(78,a,81,a)].
0.80/1.09	Derived: epsilon_connected(c8).  [resolve(78,a,82,a)].
0.80/1.09	Derived: epsilon_connected(A) | -empty(A).  [resolve(78,a,83,b)].
0.80/1.09	84 -ordinal(A) | epsilon_transitive(A) # label(cc1_ordinal1) # label(axiom).  [clausify(17)].
0.80/1.09	Derived: epsilon_transitive(c5).  [resolve(84,a,79,a)].
0.80/1.09	Derived: epsilon_transitive(empty_set).  [resolve(84,a,80,a)].
0.80/1.09	Derived: epsilon_transitive(c6).  [resolve(84,a,81,a)].
0.80/1.09	Derived: epsilon_transitive(c8).  [resolve(84,a,82,a)].
0.80/1.09	Derived: epsilon_transitive(A) | -empty(A).  [resolve(84,a,83,b)].
0.80/1.09	85 -epsilon_transitive(A) | -epsilon_connected(A) | ordinal(A) # label(cc2_ordinal1) # label(axiom).  [clausify(35)].
0.80/1.09	
0.80/1.09	============================== end predicate elimination =============
0.80/1.09	
0.80/1.09	Auto_denials:  (non-Horn, no changes).
0.80/1.09	
0.80/1.09	Term ordering decisions:
0.80/1.09	Function symbol KB weights:  empty_set=1. c1=1. c2=1. c3=1. c4=1. c6=1. c7=1. c8=1. c9=1. c10=1. ordered_pair=1. set_union2=1. unordered_pair=1. f1=1. f3=1. f4=1. inclusion_relation=1. relation_field=1. relation_dom=1. relation_rng=1. powerset=1. singleton=1. f2=1.
22.24/22.53	
22.24/22.53	============================== end of process initial clauses ========
22.24/22.53	
22.24/22.53	============================== CLAUSES FOR SEARCH ====================
22.24/22.53	
22.24/22.53	============================== end of clauses for search =============
22.24/22.53	
22.24/22.53	============================== SEARCH ================================
22.24/22.53	
22.24/22.53	% Starting search at 0.02 seconds.
22.24/22.53	
22.24/22.53	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 26 (0.00 of 0.35 sec).
22.24/22.53	
22.24/22.53	Low Water (keep): wt=46.000, iters=3352
22.24/22.53	
22.24/22.53	Low Water (keep): wt=41.000, iters=3366
22.24/22.53	
22.24/22.53	Low Water (keep): wt=40.000, iters=3373
22.24/22.53	
22.24/22.53	Low Water (keep): wt=39.000, iters=3371
22.24/22.53	
22.24/22.53	Low Water (keep): wt=38.000, iters=3353
22.24/22.53	
22.24/22.53	Low Water (keep): wt=37.000, iters=3493
22.24/22.53	
22.24/22.53	Low Water (keep): wt=34.000, iters=3415
22.24/22.53	
22.24/22.53	Low Water (keep): wt=33.000, iters=3365
22.24/22.53	
22.24/22.53	Low Water (keep): wt=32.000, iters=3335
22.24/22.53	
22.24/22.53	Low Water (keep): wt=31.000, iters=3336
22.24/22.53	
22.24/22.53	Low Water (keep): wt=30.000, iters=3422
22.24/22.53	
22.24/22.53	Low Water (keep): wt=29.000, iters=3333
22.24/22.53	
22.24/22.53	Low Water (keep): wt=28.000, iters=3356
22.24/22.53	
22.24/22.53	Low Water (keep): wt=27.000, iters=3403
22.24/22.53	
22.24/22.53	Low Water (keep): wt=26.000, iters=3334
22.24/22.53	
22.24/22.53	Low Water (displace): id=5238, wt=89.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=5241, wt=87.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=2365, wt=84.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=5169, wt=79.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=12066, wt=25.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=12081, wt=23.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=12088, wt=21.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=12089, wt=20.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=12090, wt=19.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=12710, wt=18.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=12753, wt=17.000
22.24/22.53	
22.24/22.53	Low Water (keep): wt=25.000, iters=3335
22.24/22.53	
22.24/22.53	Low Water (displace): id=14474, wt=16.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=15808, wt=15.000
22.24/22.53	
22.24/22.53	Low Water (keep): wt=24.000, iters=3333
22.24/22.53	
22.24/22.53	Low Water (displace): id=16159, wt=14.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=17556, wt=13.000
22.24/22.53	
22.24/22.53	Low Water (displace): id=17571, wt=12.000
22.24/22.53	
22.24/22.53	Low Water (keep): wt=23.000, iters=3339
22.24/22.53	
22.24/22.53	Low Water (keep): wt=22.000, iters=3343
22.24/22.53	
22.24/22.53	Low Water (keep): wt=21.000, iters=3335
22.24/22.53	
22.24/22.53	Low Water (keep): wt=20.000, iters=3368
22.24/22.53	
22.24/22.53	Low Water (keep): wt=19.000, iters=3334
22.24/22.53	
22.24/22.53	============================== PROOF =================================
22.24/22.53	% SZS status Theorem
22.24/22.53	% SZS output start Refutation
22.24/22.53	
22.24/22.53	% Proof 1 at 21.07 (+ 0.38) seconds.
22.24/22.53	% Length of proof is 36.
22.24/22.53	% Level of proof is 9.
22.24/22.53	% Maximum clause weight is 26.000.
22.24/22.53	% Given clauses 7529.
22.24/22.53	
22.24/22.53	7 (all A (relation(A) -> (all B ((all C (in(C,B) -> in(ordered_pair(C,C),A))) <-> is_reflexive_in(A,B))))) # label(d1_relat_2) # label(axiom) # label(non_clause).  [assumption].
22.24/22.53	11 (all A relation(inclusion_relation(A))) # label(dt_k1_wellord2) # label(axiom) # label(non_clause).  [assumption].
22.24/22.53	13 (all A all B unordered_pair(unordered_pair(A,B),singleton(A)) = ordered_pair(A,B)) # label(d5_tarski) # label(axiom) # label(non_clause).  [assumption].
22.24/22.53	38 (all A (relation(A) -> (reflexive(A) <-> is_reflexive_in(A,relation_field(A))))) # label(d9_relat_2) # label(axiom) # label(non_clause).  [assumption].
22.24/22.53	40 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
22.24/22.53	45 (all A all B (relation(B) -> (B = inclusion_relation(A) <-> A = relation_field(B) & (all C all D (in(C,A) & in(D,A) -> (subset(C,D) <-> in(ordered_pair(C,D),B))))))) # label(d1_wellord2) # label(axiom) # label(non_clause).  [assumption].
22.24/22.53	47 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
22.24/22.53	49 -(all A reflexive(inclusion_relation(A))) # label(t2_wellord2) # label(negated_conjecture) # label(non_clause).  [assumption].
22.24/22.53	65 relation(inclusion_relation(A)) # label(dt_k1_wellord2) # label(axiom).  [clausify(11)].
22.24/22.53	66 -relation(A) | reflexive(A) | -is_reflexive_in(A,relation_field(A)) # label(d9_relat_2) # label(axiom).  [clausify(38)].
22.24/22.53	67 -relation(A) | in(f1(A,B),B) | is_reflexive_in(A,B) # label(d1_relat_2) # label(axiom).  [clausify(7)].
22.24/22.53	69 -relation(A) | inclusion_relation(B) != A | relation_field(A) = B # label(d1_wellord2) # label(axiom).  [clausify(45)].
22.24/22.53	71 -relation(A) | -in(ordered_pair(f1(A,B),f1(A,B)),A) | is_reflexive_in(A,B) # label(d1_relat_2) # label(axiom).  [clausify(7)].
22.25/22.53	74 -relation(A) | inclusion_relation(B) != A | -in(C,B) | -in(D,B) | -subset(C,D) | in(ordered_pair(C,D),A) # label(d1_wellord2) # label(axiom).  [clausify(45)].
22.25/22.53	90 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom).  [clausify(40)].
22.25/22.53	95 unordered_pair(A,B) = unordered_pair(B,A) # label(commutativity_k2_tarski) # label(axiom).  [clausify(47)].
22.25/22.53	96 unordered_pair(unordered_pair(A,B),singleton(A)) = ordered_pair(A,B) # label(d5_tarski) # label(axiom).  [clausify(13)].
22.25/22.53	97 ordered_pair(A,B) = unordered_pair(singleton(A),unordered_pair(A,B)).  [copy(96),rewrite([95(3)]),flip(a)].
22.25/22.53	100 -reflexive(inclusion_relation(c10)) # label(t2_wellord2) # label(negated_conjecture).  [clausify(49)].
22.25/22.53	128 reflexive(inclusion_relation(A)) | -is_reflexive_in(inclusion_relation(A),relation_field(inclusion_relation(A))).  [resolve(66,a,65,a)].
22.25/22.53	135 in(f1(inclusion_relation(A),B),B) | is_reflexive_in(inclusion_relation(A),B).  [resolve(67,a,65,a)].
22.25/22.53	156 inclusion_relation(A) != inclusion_relation(B) | relation_field(inclusion_relation(B)) = A.  [resolve(69,a,65,a)].
22.25/22.53	183 -in(ordered_pair(f1(inclusion_relation(A),B),f1(inclusion_relation(A),B)),inclusion_relation(A)) | is_reflexive_in(inclusion_relation(A),B).  [resolve(71,a,65,a)].
22.25/22.53	184 -in(unordered_pair(singleton(f1(inclusion_relation(A),B)),unordered_pair(f1(inclusion_relation(A),B),f1(inclusion_relation(A),B))),inclusion_relation(A)) | is_reflexive_in(inclusion_relation(A),B).  [copy(183),rewrite([97(5)])].
22.25/22.53	211 inclusion_relation(A) != inclusion_relation(B) | -in(C,A) | -in(D,A) | -subset(C,D) | in(ordered_pair(C,D),inclusion_relation(B)).  [resolve(74,a,65,a)].
22.25/22.53	212 inclusion_relation(A) != inclusion_relation(B) | -in(C,A) | -in(D,A) | -subset(C,D) | in(unordered_pair(singleton(C),unordered_pair(C,D)),inclusion_relation(B)).  [copy(211),rewrite([97(7)])].
22.25/22.53	262 inclusion_relation(A) != inclusion_relation(B) | -in(C,A) | in(unordered_pair(singleton(C),unordered_pair(C,C)),inclusion_relation(B)).  [factor(212,b,c),unit_del(c,90)].
22.25/22.53	275 in(f1(inclusion_relation(A),relation_field(inclusion_relation(A))),relation_field(inclusion_relation(A))) | reflexive(inclusion_relation(A)).  [resolve(135,b,128,b)].
22.25/22.53	281 relation_field(inclusion_relation(A)) = A.  [xx_res(156,a)].
22.25/22.53	283 in(f1(inclusion_relation(A),A),A) | reflexive(inclusion_relation(A)).  [back_rewrite(275),rewrite([281(3),281(4)])].
22.25/22.53	290 reflexive(inclusion_relation(A)) | -is_reflexive_in(inclusion_relation(A),A).  [back_rewrite(128),rewrite([281(5)])].
22.25/22.53	450 reflexive(inclusion_relation(A)) | inclusion_relation(A) != inclusion_relation(B) | in(unordered_pair(singleton(f1(inclusion_relation(A),A)),unordered_pair(f1(inclusion_relation(A),A),f1(inclusion_relation(A),A))),inclusion_relation(B)).  [resolve(283,a,262,b)].
22.25/22.53	4493 reflexive(inclusion_relation(A)) | in(unordered_pair(singleton(f1(inclusion_relation(A),A)),unordered_pair(f1(inclusion_relation(A),A),f1(inclusion_relation(A),A))),inclusion_relation(A)).  [xx_res(450,b)].
22.25/22.53	28893 reflexive(inclusion_relation(A)) | is_reflexive_in(inclusion_relation(A),A).  [resolve(4493,b,184,a)].
22.25/22.53	28914 reflexive(inclusion_relation(A)).  [resolve(28893,b,290,b),merge(b)].
22.25/22.53	28915 $F.  [resolve(28914,a,100,a)].
22.25/22.53	
22.25/22.53	% SZS output end Refutation
22.25/22.53	============================== end of proof ==========================
22.25/22.53	
22.25/22.53	============================== STATISTICS ============================
22.25/22.53	
22.25/22.53	Given=7529. Generated=675363. Kept=28777. proofs=1.
22.25/22.53	Usable=7513. Sos=9966. Demods=17. Limbo=0, Disabled=11484. Hints=0.
22.25/22.53	Megabytes=31.70.
22.25/22.53	User_CPU=21.07, System_CPU=0.38, Wall_clock=21.
22.25/22.53	
22.25/22.53	============================== end of statistics =====================
22.25/22.53	
22.25/22.53	============================== end of search =========================
22.25/22.53	
22.25/22.53	THEOREM PROVED
22.25/22.53	% SZS status Theorem
22.25/22.53	
22.25/22.53	Exiting with 1 proof.
22.25/22.53	
22.25/22.53	Process 11046 exit (max_proofs) Mon Jul  3 04:39:53 2023
22.25/22.53	Prover9 interrupted
22.25/22.53	EOF