0.09/0.10	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.10	% Command  : tptp2X_and_run_prover9 %d %s
0.09/0.30	% Computer : n008.cluster.edu
0.09/0.30	% Model    : x86_64 x86_64
0.09/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory   : 8042.1875MB
0.09/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit : 1440
0.09/0.30	% WCLimit  : 180
0.09/0.30	% DateTime : Mon Jul  3 04:41:49 EDT 2023
0.09/0.30	% CPUTime  : 
0.35/1.03	============================== Prover9 ===============================
0.35/1.03	Prover9 (32) version 2009-11A, November 2009.
0.35/1.03	Process 724 was started by sandbox on n008.cluster.edu,
0.35/1.03	Mon Jul  3 04:41:50 2023
0.35/1.03	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_546_n008.cluster.edu".
0.35/1.03	============================== end of head ===========================
0.35/1.03	
0.35/1.03	============================== INPUT =================================
0.35/1.03	
0.35/1.03	% Reading from file /tmp/Prover9_546_n008.cluster.edu
0.35/1.03	
0.35/1.03	set(prolog_style_variables).
0.35/1.03	set(auto2).
0.35/1.03	    % set(auto2) -> set(auto).
0.35/1.03	    % set(auto) -> set(auto_inference).
0.35/1.03	    % set(auto) -> set(auto_setup).
0.35/1.03	    % set(auto_setup) -> set(predicate_elim).
0.35/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.35/1.03	    % set(auto) -> set(auto_limits).
0.35/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.35/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.35/1.03	    % set(auto) -> set(auto_denials).
0.35/1.03	    % set(auto) -> set(auto_process).
0.35/1.03	    % set(auto2) -> assign(new_constants, 1).
0.35/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.35/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.35/1.03	    % set(auto2) -> assign(max_hours, 1).
0.35/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.35/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.35/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.35/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.35/1.03	    % set(auto2) -> set(sort_initial_sos).
0.35/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.35/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.35/1.03	    % set(auto2) -> assign(max_megs, 400).
0.35/1.03	    % set(auto2) -> assign(stats, some).
0.35/1.03	    % set(auto2) -> clear(echo_input).
0.35/1.03	    % set(auto2) -> set(quiet).
0.35/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.35/1.03	    % set(auto2) -> clear(print_given).
0.35/1.03	assign(lrs_ticks,-1).
0.35/1.03	assign(sos_limit,10000).
0.35/1.03	assign(order,kbo).
0.35/1.03	set(lex_order_vars).
0.35/1.03	clear(print_given).
0.35/1.03	
0.35/1.03	% formulas(sos).  % not echoed (33 formulas)
0.35/1.03	
0.35/1.03	============================== end of input ==========================
0.35/1.03	
0.35/1.03	% From the command line: assign(max_seconds, 1440).
0.35/1.03	
0.35/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.35/1.03	
0.35/1.03	% Formulas that are not ordinary clauses:
0.35/1.03	1 (all Ax all C (status(Ax,C,sap) <-> ((exists I1 model(I1,Ax)) -> (exists I2 model(I2,C))))) # label(sap) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	2 (all Ax all C (status(Ax,C,tac) <-> (all I2 model(I2,C)) & (exists I1 model(I1,Ax)))) # label(tac) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	3 (all Ax all C (((exists I1 model(I1,Ax)) <-> (exists I2 model(I2,C))) <-> status(Ax,C,esa))) # label(esa) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	4 (all Ax all C (status(Ax,C,tca) <-> (all I2 model(I2,C)) & -(exists I1 model(I1,Ax)))) # label(tca) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	5 (all Ax all C (status(Ax,C,uns) <-> (all I1 model(I1,Ax)) & (all I2 model(I2,not(C))))) # label(uns) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	6 (all Ax all C ((exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I4 -model(I4,C)) & (exists I3 (model(I3,C) & -model(I3,Ax))) <-> status(Ax,C,wth))) # label(wth) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	7 (all Ax all C ((exists I2 model(I2,C)) & -(exists I1 model(I1,Ax)) <-> status(Ax,C,sca))) # label(sca) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	8 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	9 (all Ax all C (status(Ax,C,eth) <-> (all I3 (model(I3,Ax) <-> model(I3,C))) & (exists I2 -model(I2,Ax)) & (exists I1 model(I1,Ax)))) # label(eth) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	10 (all Ax all C ((exists I3 -model(I3,C)) & (exists I2 model(I2,C)) & -(exists I1 model(I1,Ax)) <-> status(Ax,C,wca))) # label(wca) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	11 (all Ax all C (status(Ax,C,tau) <-> (all I1 (model(I1,Ax) & model(I1,C))))) # label(tau) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	12 (all Ax all C ((all I2 (model(I2,Ax) -> model(I2,C))) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (exists I1 model(I1,Ax)) <-> status(Ax,C,wec))) # label(wec) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	13 (all Ax all C (status(Ax,C,csa) <-> (exists I1 (model(I1,not(C)) & model(I1,Ax))))) # label(csa) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	14 (all Ax all C (status(Ax,C,sat) <-> (exists I1 (model(I1,Ax) & model(I1,C))))) # label(sat) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	15 (all Ax all C (status(Ax,C,thm) <-> (all I1 (model(I1,Ax) -> model(I1,C))))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	16 (all Ax all C (status(Ax,C,wtc) <-> (exists I2 -model(I2,Ax)) & (all I3 model(I3,C)) & (exists I1 model(I1,Ax)))) # label(wtc) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	17 (all Ax all C ((all I2 (model(I2,Ax) <-> model(I2,C))) & (exists I1 model(I1,Ax)) <-> status(Ax,C,eqv))) # label(eqv) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	18 (all Ax all C (status(Ax,C,unp) <-> (-(exists I1 model(I1,Ax)) -> -(exists I2 model(I2,C))))) # label(unp) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	19 (all Ax all C (status(Ax,C,noc) <-> (exists I1 (model(I1,C) & model(I1,Ax))) & (exists I2 (model(I2,Ax) & model(I2,not(C)))))) # label(noc) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	20 (all S1 all S2 ((all Ax all C (status(Ax,C,S1) -> status(Ax,C,S2))) <-> isa(S1,S2))) # label(isa) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	21 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	22 (all S1 all S2 (nevera(S1,S2) <-> (all Ax all C (status(Ax,C,S1) -> -status(Ax,C,S2))))) # label(nevera) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	23 (all I all F -(model(I,not(F)) <-> model(I,F))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	24 (exists Ax exists C ((exists I1 model(I1,Ax)) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (exists I4 -model(I4,C)) & (all I2 (model(I2,Ax) -> model(I2,C))))) # label(mixed_pair) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	25 (all S1 all S2 (nota(S1,S2) <-> (exists Ax exists C (status(Ax,C,S1) & -status(Ax,C,S2))))) # label(nota) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	26 (all I all F (model(I,F) <-> -model(I,not(F)))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	27 (exists I1 exists Ax exists C (-model(I1,C) & (exists I2 model(I2,C)) & model(I1,Ax))) # label(non_thm_spt) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	28 (all S1 all S2 (xora(S1,S2) <-> (all Ax all C -(status(Ax,C,S2) <-> status(Ax,C,S1))))) # label(xora) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	29 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	30 (exists F ((exists I2 -model(I2,F)) & (exists I1 model(I1,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	31 (all S1 all S2 (mighta(S1,S2) <-> (exists Ax exists C (status(Ax,C,S2) & status(Ax,C,S1))))) # label(mighta) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	32 (exists Ax exists C ((exists I1 (model(I1,C) & model(I1,Ax))) & (exists I2 (-model(I2,C) | -model(I2,Ax))))) # label(sat_non_taut_pair) # label(axiom) # label(non_clause).  [assumption].
0.35/1.03	
0.35/1.03	============================== end of process non-clausal formulas ===
0.35/1.03	
0.35/1.03	============================== PROCESS INITIAL CLAUSES ===============
0.35/1.03	
0.35/1.03	============================== PREDICATE ELIMINATION =================
0.35/1.03	33 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom).  [clausify(20)].
0.35/1.03	34 status(f42(A,B),f43(A,B),A) | isa(A,B) # label(isa) # label(axiom).  [clausify(20)].
0.35/1.03	35 -status(f42(A,B),f43(A,B),B) | isa(A,B) # label(isa) # label(axiom).  [clausify(20)].
0.35/1.03	Derived: -status(A,B,C) | status(A,B,D) | status(f42(C,D),f43(C,D),C).  [resolve(33,c,34,b)].
0.35/1.03	Derived: -status(A,B,C) | status(A,B,D) | -status(f42(C,D),f43(C,D),D).  [resolve(33,c,35,b)].
0.35/1.03	36 nevera(A,B) | status(f44(A,B),f45(A,B),A) # label(nevera) # label(axiom).  [clausify(22)].
0.35/1.03	37 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom).  [clausify(22)].
0.35/1.03	Derived: status(f44(A,B),f45(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(36,a,37,a)].
3.30/3.70	38 nevera(A,B) | status(f44(A,B),f45(A,B),B) # label(nevera) # label(axiom).  [clausify(22)].
3.30/3.70	Derived: status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(38,a,37,a)].
3.30/3.70	39 nota(A,B) | -status(C,D,A) | status(C,D,B) # label(nota) # label(axiom).  [clausify(25)].
3.30/3.70	40 -nota(A,B) | status(f46(A,B),f47(A,B),A) # label(nota) # label(axiom).  [clausify(25)].
3.30/3.70	41 -nota(A,B) | -status(f46(A,B),f47(A,B),B) # label(nota) # label(axiom).  [clausify(25)].
3.30/3.70	Derived: -status(A,B,C) | status(A,B,D) | status(f46(C,D),f47(C,D),C).  [resolve(39,a,40,a)].
3.30/3.70	Derived: -status(A,B,C) | status(A,B,D) | -status(f46(C,D),f47(C,D),D).  [resolve(39,a,41,a)].
3.30/3.70	42 -nota(uns,thm) # label(nota_uns_thm) # label(negated_conjecture).  [assumption].
3.30/3.70	Derived: -status(A,B,uns) | status(A,B,thm).  [resolve(42,a,39,a)].
3.30/3.70	43 xora(A,B) | -status(f48(A,B),f49(A,B),B) | status(f48(A,B),f49(A,B),A) # label(xora) # label(axiom).  [clausify(28)].
3.30/3.70	44 -xora(A,B) | status(C,D,B) | status(C,D,A) # label(xora) # label(axiom).  [clausify(28)].
3.30/3.70	45 -xora(A,B) | -status(C,D,B) | -status(C,D,A) # label(xora) # label(axiom).  [clausify(28)].
3.30/3.70	Derived: -status(f48(A,B),f49(A,B),B) | status(f48(A,B),f49(A,B),A) | status(C,D,B) | status(C,D,A).  [resolve(43,a,44,a)].
3.30/3.70	Derived: -status(f48(A,B),f49(A,B),B) | status(f48(A,B),f49(A,B),A) | -status(C,D,B) | -status(C,D,A).  [resolve(43,a,45,a)].
3.30/3.70	46 xora(A,B) | status(f48(A,B),f49(A,B),B) | -status(f48(A,B),f49(A,B),A) # label(xora) # label(axiom).  [clausify(28)].
3.30/3.70	Derived: status(f48(A,B),f49(A,B),B) | -status(f48(A,B),f49(A,B),A) | status(C,D,B) | status(C,D,A).  [resolve(46,a,44,a)].
3.30/3.70	Derived: status(f48(A,B),f49(A,B),B) | -status(f48(A,B),f49(A,B),A) | -status(C,D,B) | -status(C,D,A).  [resolve(46,a,45,a)].
3.30/3.70	47 mighta(A,B) | -status(C,D,B) | -status(C,D,A) # label(mighta) # label(axiom).  [clausify(31)].
3.30/3.70	48 -mighta(A,B) | status(f50(A,B),f51(A,B),B) # label(mighta) # label(axiom).  [clausify(31)].
3.30/3.70	49 -mighta(A,B) | status(f50(A,B),f51(A,B),A) # label(mighta) # label(axiom).  [clausify(31)].
3.30/3.70	Derived: -status(A,B,C) | -status(A,B,D) | status(f50(D,C),f51(D,C),C).  [resolve(47,a,48,a)].
3.30/3.70	Derived: -status(A,B,C) | -status(A,B,D) | status(f50(D,C),f51(D,C),D).  [resolve(47,a,49,a)].
3.30/3.70	
3.30/3.70	============================== end predicate elimination =============
3.30/3.70	
3.30/3.70	Auto_denials:  (non-Horn, no changes).
3.30/3.70	
3.30/3.70	Term ordering decisions:
3.30/3.70	
3.30/3.70	% Assigning unary symbol not kb_weight 0 and highest precedence (91).
3.30/3.70	Function symbol KB weights:  eqv=1. eth=1. noc=1. wec=1. wth=1. esa=1. thm=1. uns=1. csa=1. sap=1. sat=1. tac=1. tau=1. unp=1. wtc=1. sca=1. tca=1. wca=1. cax=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1. f28=1. f29=1. f30=1. f31=1. f32=1. f33=1. f34=1. f35=1. f36=1. f37=1. f38=1. f39=1. f40=1. f41=1. f42=1. f43=1. f44=1. f45=1. f46=1. f47=1. f48=1. f49=1. f50=1. f51=1. not=0.
3.30/3.70	
3.30/3.70	============================== end of process initial clauses ========
3.30/3.70	
3.30/3.70	============================== CLAUSES FOR SEARCH ====================
3.30/3.70	
3.30/3.70	============================== end of clauses for search =============
3.30/3.70	
3.30/3.70	============================== SEARCH ================================
3.30/3.70	
3.30/3.70	% Starting search at 0.03 seconds.
3.30/3.70	
3.30/3.70	Low Water (keep): wt=30.000, iters=3334
3.30/3.70	
3.30/3.70	Low Water (keep): wt=24.000, iters=3338
3.30/3.70	
3.30/3.70	Low Water (keep): wt=23.000, iters=3333
3.30/3.70	
3.30/3.70	Low Water (keep): wt=22.000, iters=3336
3.30/3.70	
3.30/3.70	Low Water (keep): wt=21.000, iters=3335
3.30/3.70	
3.30/3.70	Low Water (keep): wt=20.000, iters=3350
3.30/3.70	
3.30/3.70	Low Water (keep): wt=19.000, iters=3346
3.30/3.70	
3.30/3.70	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 45 (0.00 of 1.84 sec).
3.30/3.70	
3.30/3.70	Low Water (keep): wt=18.000, iters=3341
3.30/3.70	
3.30/3.70	Low Water (keep): wt=17.000, iters=3409
3.30/3.70	
3.30/3.70	Low Water (keep): wt=16.000, iters=3383
3.30/3.70	
3.30/3.70	Low Water (keep): wt=15.000, iters=3340
3.30/3.70	
3.30/3.70	Low Water (keep): wt=14.000, iters=3397
3.30/3.70	
3.30/3.70	Low Water (displace): id=10961, wt=13.000
3.30/3.70	
3.30/3.70	Low Water (displace): id=11092, wt=11.000
45.25/45.87	
45.25/45.87	Low Water (displace): id=11212, wt=10.000
45.25/45.87	
45.25/45.87	Low Water (displace): id=11453, wt=9.000
45.25/45.87	
45.25/45.87	Low Water (keep): wt=13.000, iters=3375
45.25/45.87	
45.25/45.87	Low Water (keep): wt=12.000, iters=3360
45.25/45.87	
45.25/45.87	Low Water (displace): id=14424, wt=7.000
45.25/45.87	
45.25/45.87	Low Water (keep): wt=11.000, iters=5243
45.25/45.87	
45.25/45.87	Low Water (keep): wt=10.000, iters=4161
45.25/45.87	
45.25/45.87	Low Water (keep): wt=9.000, iters=3816
45.25/45.87	
45.25/45.87	============================== PROOF =================================
45.25/45.87	% SZS status Theorem
45.25/45.87	% SZS output start Refutation
45.25/45.87	
45.25/45.87	% Proof 1 at 40.66 (+ 3.82) seconds.
45.25/45.87	% Length of proof is 25.
45.25/45.87	% Level of proof is 8.
45.25/45.87	% Maximum clause weight is 15.000.
45.25/45.87	% Given clauses 28042.
45.25/45.87	
45.25/45.87	2 (all Ax all C (status(Ax,C,tac) <-> (all I2 model(I2,C)) & (exists I1 model(I1,Ax)))) # label(tac) # label(axiom) # label(non_clause).  [assumption].
45.25/45.87	5 (all Ax all C (status(Ax,C,uns) <-> (all I1 model(I1,Ax)) & (all I2 model(I2,not(C))))) # label(uns) # label(axiom) # label(non_clause).  [assumption].
45.25/45.87	15 (all Ax all C (status(Ax,C,thm) <-> (all I1 (model(I1,Ax) -> model(I1,C))))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
45.25/45.87	21 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
45.25/45.87	23 (all I all F -(model(I,not(F)) <-> model(I,F))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
45.25/45.87	25 (all S1 all S2 (nota(S1,S2) <-> (exists Ax exists C (status(Ax,C,S1) & -status(Ax,C,S2))))) # label(nota) # label(axiom) # label(non_clause).  [assumption].
45.25/45.87	29 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
45.25/45.87	39 nota(A,B) | -status(C,D,A) | status(C,D,B) # label(nota) # label(axiom).  [clausify(25)].
45.25/45.87	42 -nota(uns,thm) # label(nota_uns_thm) # label(negated_conjecture).  [assumption].
45.25/45.87	53 -status(A,B,tac) | model(C,B) # label(tac) # label(axiom).  [clausify(2)].
45.25/45.87	55 status(A,B,tac) | -model(f4(A,B),B) | -model(C,A) # label(tac) # label(axiom).  [clausify(2)].
45.25/45.87	65 status(A,B,uns) | -model(f11(A,B),A) | -model(f12(A,B),not(B)) # label(uns) # label(axiom).  [clausify(5)].
45.25/45.87	103 -status(A,B,thm) | -model(C,A) | model(C,B) # label(thm) # label(axiom).  [clausify(15)].
45.25/45.87	123 -model(A,c1) # label(contradiction) # label(axiom).  [clausify(21)].
45.25/45.87	124 model(A,not(B)) | model(A,B) # label(completeness) # label(axiom).  [clausify(23)].
45.25/45.87	134 model(A,c11) # label(tautology) # label(axiom).  [clausify(29)].
45.25/45.87	146 -status(A,B,uns) | status(A,B,thm).  [resolve(42,a,39,a)].
45.25/45.87	153 status(A,A,tac) | -model(f4(A,A),A).  [factor(55,b,c)].
45.25/45.87	371 status(c11,A,uns) | -model(f12(c11,A),not(A)).  [resolve(134,a,65,b)].
45.25/45.87	584 status(not(A),not(A),tac) | model(f4(not(A),not(A)),A).  [resolve(153,b,124,a)].
45.25/45.87	14657 model(f4(not(A),not(A)),A) | model(B,not(A)).  [resolve(584,a,53,a)].
45.25/45.87	43531 model(A,not(c1)).  [resolve(14657,a,123,a)].
45.25/45.87	43601 status(c11,c1,uns).  [resolve(43531,a,371,b)].
45.25/45.87	43654 status(c11,c1,thm).  [resolve(43601,a,146,a)].
45.25/45.87	43655 $F.  [resolve(43654,a,103,a),unit_del(a,134),unit_del(b,123)].
45.25/45.87	
45.25/45.87	% SZS output end Refutation
45.25/45.87	============================== end of proof ==========================
45.25/45.87	
45.25/45.87	============================== STATISTICS ============================
45.25/45.87	
45.25/45.87	Given=28042. Generated=4185866. Kept=43605. proofs=1.
45.25/45.87	Usable=28041. Sos=7468. Demods=0. Limbo=0, Disabled=8218. Hints=0.
45.25/45.87	Megabytes=29.04.
45.25/45.87	User_CPU=40.66, System_CPU=3.82, Wall_clock=45.
45.25/45.87	
45.25/45.87	============================== end of statistics =====================
45.25/45.87	
45.25/45.87	============================== end of search =========================
45.25/45.87	
45.25/45.87	THEOREM PROVED
45.25/45.87	% SZS status Theorem
45.25/45.87	
45.25/45.87	Exiting with 1 proof.
45.25/45.87	
45.25/45.87	Process 724 exit (max_proofs) Mon Jul  3 04:42:35 2023
45.25/45.87	Prover9 interrupted
45.25/45.87	EOF