0.07/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n002.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit : 1440
0.12/0.33	% WCLimit  : 180
0.12/0.33	% DateTime : Mon Jul  3 04:48:22 EDT 2023
0.12/0.34	% CPUTime  : 
0.73/1.00	============================== Prover9 ===============================
0.73/1.00	Prover9 (32) version 2009-11A, November 2009.
0.73/1.00	Process 2528 was started by sandbox2 on n002.cluster.edu,
0.73/1.00	Mon Jul  3 04:48:22 2023
0.73/1.00	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_2375_n002.cluster.edu".
0.73/1.00	============================== end of head ===========================
0.73/1.00	
0.73/1.00	============================== INPUT =================================
0.73/1.00	
0.73/1.00	% Reading from file /tmp/Prover9_2375_n002.cluster.edu
0.73/1.00	
0.73/1.00	set(prolog_style_variables).
0.73/1.00	set(auto2).
0.73/1.00	    % set(auto2) -> set(auto).
0.73/1.00	    % set(auto) -> set(auto_inference).
0.73/1.00	    % set(auto) -> set(auto_setup).
0.73/1.00	    % set(auto_setup) -> set(predicate_elim).
0.73/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.73/1.00	    % set(auto) -> set(auto_limits).
0.73/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.73/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.73/1.00	    % set(auto) -> set(auto_denials).
0.73/1.00	    % set(auto) -> set(auto_process).
0.73/1.00	    % set(auto2) -> assign(new_constants, 1).
0.73/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.73/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.73/1.00	    % set(auto2) -> assign(max_hours, 1).
0.73/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.73/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.73/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.73/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.73/1.00	    % set(auto2) -> set(sort_initial_sos).
0.73/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.73/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.73/1.00	    % set(auto2) -> assign(max_megs, 400).
0.73/1.00	    % set(auto2) -> assign(stats, some).
0.73/1.00	    % set(auto2) -> clear(echo_input).
0.73/1.00	    % set(auto2) -> set(quiet).
0.73/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.73/1.00	    % set(auto2) -> clear(print_given).
0.73/1.00	assign(lrs_ticks,-1).
0.73/1.00	assign(sos_limit,10000).
0.73/1.00	assign(order,kbo).
0.73/1.00	set(lex_order_vars).
0.73/1.00	clear(print_given).
0.73/1.00	
0.73/1.00	% formulas(sos).  % not echoed (11 formulas)
0.73/1.00	
0.73/1.00	============================== end of input ==========================
0.73/1.00	
0.73/1.00	% From the command line: assign(max_seconds, 1440).
0.73/1.00	
0.73/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.73/1.00	
0.73/1.00	% Formulas that are not ordinary clauses:
0.73/1.00	1 (all X all P1 all P2 all T1 all T2 (organization(X,T1) & reorganization_free(X,T1,T2) & survival_chance(X,P2,T2) & greater(T2,T1) & survival_chance(X,P1,T1) & organization(X,T2) -> greater(P2,P1))) # label(t3_FOL) # label(hypothesis) # label(non_clause).  [assumption].
0.73/1.00	2 (all X all Y -(greater(X,Y) & X = Y)) # label(mp6_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	3 (all X all T (organization(X,T) -> (exists P survival_chance(X,P,T)))) # label(mp12) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	4 (all X all Y all Re all C all P all P1 all P2 all C1 all C2 all Ta all Tb all Tc (organization(Y,Ta) & organization(Y,Tb) & class(Y,C,Ta) & survival_chance(X,P,Ta) & survival_chance(Y,P,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Re,Ta) & survival_chance(X,P1,Tb) & complexity(X,C1,Ta) & greater(C2,C1) & complexity(Y,C2,Ta) & survival_chance(Y,P2,Tb) & reorganization_type(Y,Re,Ta) & class(X,C,Ta) & organization(X,Tb) & organization(X,Ta) -> P1 = P2 | greater(P1,P2))) # label(a11_FOL) # label(hypothesis) # label(non_clause).  [assumption].
0.73/1.00	5 (all X all Y all Re all C all C1 all C2 all Ta all Tb all Tc (reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(Y,Re,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) & complexity(X,C1,Ta) & reorganization_type(X,Re,Ta) & class(Y,C,Ta) & class(X,C,Ta) & organization(Y,Tc) & organization(Y,Ta) & organization(X,Ta) -> greater(Tc,Tb))) # label(a10_FOL) # label(hypothesis) # label(non_clause).  [assumption].
0.73/1.00	6 (all X all T all T1 all T2 (organization(X,T2) & greater(T,T1) & greater(T2,T) & organization(X,T1) -> organization(X,T))) # label(mp13) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	7 (all X all Y -(greater(Y,X) & greater(X,Y))) # label(mp6_2) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	8 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp11) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	9 (all X all Ta all Tb (reorganization(X,Ta,Tb) -> greater(Tb,Ta))) # label(mp7) # label(axiom) # label(non_clause).  [assumption].
1.20/1.49	10 (all X all P1 all P2 all T1 all T2 all Ta all Tb (organization(X,T1) & reorganization(X,Ta,Tb) & survival_chance(X,P1,T1) & -greater(Ta,T1) & greater(T2,T1) & -greater(T2,Tb) & survival_chance(X,P2,T2) & organization(X,T2) -> greater(P1,P2))) # label(t4_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.20/1.49	11 -(all X all Y all Re all C all P all P1 all P2 all C1 all C2 all Ta all Tb all Tc (organization(Y,Ta) & organization(X,Tc) & organization(Y,Tc) & class(X,C,Ta) & survival_chance(X,P,Ta) & survival_chance(Y,P,Ta) & reorganization_type(X,Re,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) & complexity(X,C1,Ta) & survival_chance(Y,P2,Tc) & survival_chance(X,P1,Tc) & reorganization_free(X,Tb,Tc) & reorganization_type(Y,Re,Ta) & reorganization(Y,Ta,Tc) & reorganization(X,Ta,Tb) & class(Y,C,Ta) & organization(X,Ta) -> greater(P1,P2))) # label(t5_FOL) # label(negated_conjecture) # label(non_clause).  [assumption].
1.20/1.49	
1.20/1.49	============================== end of process non-clausal formulas ===
1.20/1.49	
1.20/1.49	============================== PROCESS INITIAL CLAUSES ===============
1.20/1.49	
1.20/1.49	============================== PREDICATE ELIMINATION =================
1.20/1.49	12 -organization(A,B) | -reorganization_free(A,B,C) | -survival_chance(A,D,C) | -greater(C,B) | -survival_chance(A,E,B) | -organization(A,C) | greater(D,E) # label(t3_FOL) # label(hypothesis).  [clausify(1)].
1.20/1.49	13 reorganization_free(c1,c11,c12) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	Derived: -organization(c1,c11) | -survival_chance(c1,A,c12) | -greater(c12,c11) | -survival_chance(c1,B,c11) | -organization(c1,c12) | greater(A,B).  [resolve(12,b,13,a)].
1.20/1.49	
1.20/1.49	============================== end predicate elimination =============
1.20/1.49	
1.20/1.49	Auto_denials:  (non-Horn, no changes).
1.20/1.49	
1.20/1.49	Term ordering decisions:
1.20/1.49	Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. f1=1.
1.20/1.49	
1.20/1.49	============================== end of process initial clauses ========
1.20/1.49	
1.20/1.49	============================== CLAUSES FOR SEARCH ====================
1.20/1.49	
1.20/1.49	============================== end of clauses for search =============
1.20/1.49	
1.20/1.49	============================== SEARCH ================================
1.20/1.49	
1.20/1.49	% Starting search at 0.02 seconds.
1.20/1.49	
1.20/1.49	============================== PROOF =================================
1.20/1.49	% SZS status Theorem
1.20/1.49	% SZS output start Refutation
1.20/1.49	
1.20/1.49	% Proof 1 at 0.50 (+ 0.00) seconds.
1.20/1.49	% Length of proof is 77.
1.20/1.49	% Level of proof is 16.
1.20/1.49	% Maximum clause weight is 69.000.
1.20/1.49	% Given clauses 333.
1.20/1.49	
1.20/1.49	1 (all X all P1 all P2 all T1 all T2 (organization(X,T1) & reorganization_free(X,T1,T2) & survival_chance(X,P2,T2) & greater(T2,T1) & survival_chance(X,P1,T1) & organization(X,T2) -> greater(P2,P1))) # label(t3_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.20/1.49	3 (all X all T (organization(X,T) -> (exists P survival_chance(X,P,T)))) # label(mp12) # label(axiom) # label(non_clause).  [assumption].
1.20/1.49	4 (all X all Y all Re all C all P all P1 all P2 all C1 all C2 all Ta all Tb all Tc (organization(Y,Ta) & organization(Y,Tb) & class(Y,C,Ta) & survival_chance(X,P,Ta) & survival_chance(Y,P,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Re,Ta) & survival_chance(X,P1,Tb) & complexity(X,C1,Ta) & greater(C2,C1) & complexity(Y,C2,Ta) & survival_chance(Y,P2,Tb) & reorganization_type(Y,Re,Ta) & class(X,C,Ta) & organization(X,Tb) & organization(X,Ta) -> P1 = P2 | greater(P1,P2))) # label(a11_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.20/1.49	5 (all X all Y all Re all C all C1 all C2 all Ta all Tb all Tc (reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(Y,Re,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) & complexity(X,C1,Ta) & reorganization_type(X,Re,Ta) & class(Y,C,Ta) & class(X,C,Ta) & organization(Y,Tc) & organization(Y,Ta) & organization(X,Ta) -> greater(Tc,Tb))) # label(a10_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.20/1.49	6 (all X all T all T1 all T2 (organization(X,T2) & greater(T,T1) & greater(T2,T) & organization(X,T1) -> organization(X,T))) # label(mp13) # label(axiom) # label(non_clause).  [assumption].
1.20/1.49	7 (all X all Y -(greater(Y,X) & greater(X,Y))) # label(mp6_2) # label(axiom) # label(non_clause).  [assumption].
1.20/1.49	8 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp11) # label(axiom) # label(non_clause).  [assumption].
1.20/1.49	9 (all X all Ta all Tb (reorganization(X,Ta,Tb) -> greater(Tb,Ta))) # label(mp7) # label(axiom) # label(non_clause).  [assumption].
1.20/1.49	10 (all X all P1 all P2 all T1 all T2 all Ta all Tb (organization(X,T1) & reorganization(X,Ta,Tb) & survival_chance(X,P1,T1) & -greater(Ta,T1) & greater(T2,T1) & -greater(T2,Tb) & survival_chance(X,P2,T2) & organization(X,T2) -> greater(P1,P2))) # label(t4_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.20/1.49	11 -(all X all Y all Re all C all P all P1 all P2 all C1 all C2 all Ta all Tb all Tc (organization(Y,Ta) & organization(X,Tc) & organization(Y,Tc) & class(X,C,Ta) & survival_chance(X,P,Ta) & survival_chance(Y,P,Ta) & reorganization_type(X,Re,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) & complexity(X,C1,Ta) & survival_chance(Y,P2,Tc) & survival_chance(X,P1,Tc) & reorganization_free(X,Tb,Tc) & reorganization_type(Y,Re,Ta) & reorganization(Y,Ta,Tc) & reorganization(X,Ta,Tb) & class(Y,C,Ta) & organization(X,Ta) -> greater(P1,P2))) # label(t5_FOL) # label(negated_conjecture) # label(non_clause).  [assumption].
1.20/1.49	12 -organization(A,B) | -reorganization_free(A,B,C) | -survival_chance(A,D,C) | -greater(C,B) | -survival_chance(A,E,B) | -organization(A,C) | greater(D,E) # label(t3_FOL) # label(hypothesis).  [clausify(1)].
1.20/1.49	13 reorganization_free(c1,c11,c12) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	14 organization(c2,c10) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	15 organization(c1,c12) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	16 organization(c2,c12) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	17 greater(c9,c8) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	18 organization(c1,c10) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	19 class(c1,c4,c10) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	20 survival_chance(c1,c5,c10) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	21 survival_chance(c2,c5,c10) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	22 reorganization_type(c1,c3,c10) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	23 complexity(c2,c9,c10) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	24 complexity(c1,c8,c10) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	25 survival_chance(c2,c7,c12) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	26 survival_chance(c1,c6,c12) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	27 reorganization_type(c2,c3,c10) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	28 reorganization(c2,c10,c12) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	29 reorganization(c1,c10,c11) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	30 class(c2,c4,c10) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	31 -greater(c6,c7) # label(t5_FOL) # label(negated_conjecture).  [clausify(11)].
1.20/1.49	33 -greater(A,B) | -greater(B,A) # label(mp6_2) # label(axiom).  [clausify(7)].
1.20/1.49	34 -reorganization(A,B,C) | greater(C,B) # label(mp7) # label(axiom).  [clausify(9)].
1.20/1.49	35 -organization(A,B) | survival_chance(A,f1(A,B),B) # label(mp12) # label(axiom).  [clausify(3)].
1.20/1.49	36 -greater(A,B) | -greater(B,C) | greater(A,C) # label(mp11) # label(axiom).  [clausify(8)].
1.20/1.49	37 -organization(A,B) | -greater(C,D) | -greater(B,C) | -organization(A,D) | organization(A,C) # label(mp13) # label(axiom).  [clausify(6)].
1.20/1.49	38 -organization(A,B) | -reorganization(A,C,D) | -survival_chance(A,E,B) | greater(C,B) | -greater(F,B) | greater(F,D) | -survival_chance(A,V6,F) | -organization(A,F) | greater(E,V6) # label(t4_FOL) # label(hypothesis).  [clausify(10)].
1.20/1.49	39 -reorganization(A,B,C) | -reorganization(D,B,E) | -reorganization_type(D,F,B) | -complexity(D,V6,B) | -greater(V6,V7) | -complexity(A,V7,B) | -reorganization_type(A,F,B) | -class(D,V8,B) | -class(A,V8,B) | -organization(D,E) | -organization(D,B) | -organization(A,B) | greater(E,C) # label(a10_FOL) # label(hypothesis).  [clausify(5)].
1.20/1.49	40 -organization(A,B) | -organization(A,C) | -class(A,D,B) | -survival_chance(E,F,B) | -survival_chance(A,F,B) | -reorganization(E,B,C) | -reorganization(A,B,V6) | -reorganization_type(E,V7,B) | -survival_chance(E,V8,C) | -complexity(E,V9,B) | -greater(V10,V9) | -complexity(A,V10,B) | -survival_chance(A,V11,C) | -reorganization_type(A,V7,B) | -class(E,D,B) | -organization(E,C) | -organization(E,B) | V11 = V8 | greater(V8,V11) # label(a11_FOL) # label(hypothesis).  [clausify(4)].
1.20/1.49	41 -organization(c1,c11) | -survival_chance(c1,A,c12) | -greater(c12,c11) | -survival_chance(c1,B,c11) | -organization(c1,c12) | greater(A,B).  [resolve(12,b,13,a)].
1.20/1.49	42 -organization(c1,c11) | -survival_chance(c1,A,c12) | -greater(c12,c11) | -survival_chance(c1,B,c11) | greater(A,B).  [copy(41),unit_del(e,15)].
1.20/1.49	43 -greater(A,A).  [factor(33,a,b)].
1.20/1.49	57 greater(c11,c10).  [resolve(34,a,29,a)].
1.20/1.49	69 -organization(c2,A) | -survival_chance(c2,B,A) | greater(c10,A) | -greater(C,A) | greater(C,c12) | -survival_chance(c2,D,C) | -organization(c2,C) | greater(B,D).  [resolve(38,b,28,a)].
1.20/1.49	74 -reorganization(A,c10,B) | -reorganization(c2,c10,C) | -complexity(c2,D,c10) | -greater(D,E) | -complexity(A,E,c10) | -reorganization_type(A,c3,c10) | -class(c2,F,c10) | -class(A,F,c10) | -organization(c2,C) | -organization(A,c10) | greater(C,B).  [resolve(39,c,27,a),unit_del(j,14)].
1.20/1.49	87 -organization(A,c10) | -organization(A,B) | -class(A,C,c10) | -survival_chance(c1,D,c10) | -survival_chance(A,D,c10) | -reorganization(c1,c10,B) | -reorganization(A,c10,E) | -survival_chance(c1,F,B) | -complexity(c1,V6,c10) | -greater(V7,V6) | -complexity(A,V7,c10) | -survival_chance(A,V8,B) | -reorganization_type(A,c3,c10) | -class(c1,C,c10) | -organization(c1,B) | V8 = F | greater(F,V8).  [resolve(40,h,22,a),unit_del(p,18)].
1.20/1.49	102 -organization(c1,c11) | -greater(c12,c11) | -survival_chance(c1,A,c11) | greater(c6,A).  [resolve(42,b,26,a)].
1.20/1.49	108 -organization(A,B) | -greater(B,c11) | -organization(A,c10) | organization(A,c11).  [resolve(57,a,37,b)].
1.20/1.49	111 -greater(c10,c11).  [resolve(57,a,33,b)].
1.20/1.49	142 -organization(c2,A) | -survival_chance(c2,B,A) | greater(c10,A) | -greater(c12,A) | greater(B,c7).  [resolve(69,f,25,a),unit_del(e,43),unit_del(f,16)].
1.20/1.49	174 -reorganization(c1,c10,A) | -reorganization(c2,c10,B) | -complexity(c2,C,c10) | -greater(C,D) | -complexity(c1,D,c10) | -class(c2,E,c10) | -class(c1,E,c10) | -organization(c2,B) | greater(B,A).  [resolve(74,f,22,a),unit_del(i,18)].
1.20/1.49	198 -organization(c2,A) | -class(c2,B,c10) | -survival_chance(c1,C,c10) | -survival_chance(c2,C,c10) | -reorganization(c1,c10,A) | -reorganization(c2,c10,D) | -survival_chance(c1,E,A) | -complexity(c1,F,c10) | -greater(V6,F) | -complexity(c2,V6,c10) | -survival_chance(c2,V7,A) | -class(c1,B,c10) | -organization(c1,A) | V7 = E | greater(E,V7).  [resolve(87,m,27,a),unit_del(a,14)].
1.20/1.49	234 -reorganization(c1,c10,A) | -reorganization(c2,c10,B) | -greater(c9,C) | -complexity(c1,C,c10) | -class(c2,D,c10) | -class(c1,D,c10) | -organization(c2,B) | greater(B,A).  [resolve(174,c,23,a)].
1.20/1.49	236 -reorganization(c1,c10,A) | -reorganization(c2,c10,B) | -class(c2,C,c10) | -class(c1,C,c10) | -organization(c2,B) | greater(B,A).  [resolve(234,d,24,a),unit_del(c,17)].
1.20/1.49	239 -reorganization(c1,c10,A) | -reorganization(c2,c10,B) | -organization(c2,B) | greater(B,A).  [resolve(236,c,30,a),unit_del(c,19)].
1.20/1.49	241 -reorganization(c1,c10,A) | greater(c12,A).  [resolve(239,b,28,a),unit_del(b,16)].
1.20/1.49	242 greater(c12,c11).  [resolve(241,a,29,a)].
1.20/1.49	244 -organization(c1,c11) | -survival_chance(c1,A,c11) | greater(c6,A).  [back_unit_del(102),unit_del(b,242)].
1.20/1.49	246 -organization(A,c12) | -organization(A,c10) | organization(A,c11).  [resolve(242,a,108,b)].
1.20/1.49	256 organization(c2,c11).  [resolve(246,a,16,a),unit_del(a,14)].
1.20/1.49	257 organization(c1,c11).  [resolve(246,a,15,a),unit_del(a,18)].
1.20/1.49	259 -survival_chance(c1,A,c11) | greater(c6,A).  [back_unit_del(244),unit_del(a,257)].
1.20/1.49	261 survival_chance(c2,f1(c2,c11),c11).  [resolve(256,a,35,a)].
1.20/1.49	268 -organization(c2,A) | -class(c2,B,c10) | -survival_chance(c1,C,c10) | -survival_chance(c2,C,c10) | -reorganization(c1,c10,A) | -reorganization(c2,c10,D) | -survival_chance(c1,E,A) | -greater(F,c8) | -complexity(c2,F,c10) | -survival_chance(c2,V6,A) | -class(c1,B,c10) | -organization(c1,A) | V6 = E | greater(E,V6).  [resolve(198,h,24,a)].
1.20/1.49	270 survival_chance(c1,f1(c1,c11),c11).  [resolve(257,a,35,a)].
1.20/1.49	274 greater(f1(c2,c11),c7).  [resolve(261,a,142,b),unit_del(a,256),unit_del(b,111),unit_del(c,242)].
1.20/1.49	290 -greater(c6,f1(c2,c11)).  [ur(36,b,274,a,c,31,a)].
1.20/1.49	310 greater(c6,f1(c1,c11)).  [resolve(259,a,270,a)].
1.20/1.49	321 -survival_chance(c1,f1(c2,c11),c11).  [ur(259,b,290,a)].
1.20/1.49	322 -greater(f1(c1,c11),f1(c2,c11)).  [ur(36,a,310,a,c,290,a)].
1.20/1.49	359 -organization(c2,A) | -class(c2,B,c10) | -survival_chance(c1,C,c10) | -survival_chance(c2,C,c10) | -reorganization(c1,c10,A) | -reorganization(c2,c10,D) | -survival_chance(c1,E,A) | -survival_chance(c2,F,A) | -class(c1,B,c10) | -organization(c1,A) | F = E | greater(E,F).  [resolve(268,i,23,a),unit_del(h,17)].
1.20/1.49	373 -organization(c2,A) | -survival_chance(c1,B,c10) | -survival_chance(c2,B,c10) | -reorganization(c1,c10,A) | -reorganization(c2,c10,C) | -survival_chance(c1,D,A) | -survival_chance(c2,E,A) | -organization(c1,A) | E = D | greater(D,E).  [resolve(359,b,30,a),unit_del(h,19)].
1.20/1.49	374 -survival_chance(c1,A,c10) | -survival_chance(c2,A,c10) | -reorganization(c2,c10,B) | -survival_chance(c1,C,c11) | -survival_chance(c2,D,c11) | D = C | greater(C,D).  [resolve(373,d,29,a),unit_del(a,256),unit_del(g,257)].
1.20/1.49	376 -survival_chance(c1,A,c10) | -survival_chance(c2,A,c10) | -survival_chance(c1,B,c11) | -survival_chance(c2,C,c11) | C = B | greater(B,C).  [resolve(374,c,28,a)].
1.20/1.49	378 -survival_chance(c1,A,c11) | -survival_chance(c2,B,c11) | B = A | greater(A,B).  [resolve(376,b,21,a),unit_del(a,20)].
1.20/1.49	381 -survival_chance(c2,A,c11) | f1(c1,c11) = A | greater(f1(c1,c11),A).  [resolve(378,a,270,a),flip(b)].
1.20/1.49	383 f1(c2,c11) = f1(c1,c11).  [resolve(381,a,261,a),flip(a),unit_del(b,322)].
1.20/1.49	402 $F.  [back_rewrite(321),rewrite([383(4)]),unit_del(a,270)].
1.20/1.49	
1.20/1.49	% SZS output end Refutation
1.20/1.49	============================== end of proof ==========================
1.20/1.49	
1.20/1.49	============================== STATISTICS ============================
1.20/1.49	
1.20/1.49	Given=333. Generated=1217. Kept=387. proofs=1.
1.20/1.49	Usable=247. Sos=0. Demods=1. Limbo=19, Disabled=151. Hints=0.
1.20/1.49	Megabytes=0.41.
1.20/1.49	User_CPU=0.50, System_CPU=0.00, Wall_clock=1.
1.20/1.49	
1.20/1.49	============================== end of statistics =====================
1.20/1.49	
1.20/1.49	============================== end of search =========================
1.20/1.49	
1.20/1.49	THEOREM PROVED
1.20/1.49	% SZS status Theorem
1.20/1.49	
1.20/1.49	Exiting with 1 proof.
1.20/1.49	
1.20/1.49	Process 2528 exit (max_proofs) Mon Jul  3 04:48:23 2023
1.20/1.49	Prover9 interrupted
1.20/1.49	EOF