0.04/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.35	% Computer   : n005.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   : 1200
0.13/0.35	% DateTime   : Tue Jul 13 16:21:03 EDT 2021
0.13/0.35	% CPUTime    : 
0.46/1.06	============================== Prover9 ===============================
0.46/1.06	Prover9 (32) version 2009-11A, November 2009.
0.46/1.06	Process 28028 was started by sandbox2 on n005.cluster.edu,
0.46/1.06	Tue Jul 13 16:21:04 2021
0.46/1.06	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_27761_n005.cluster.edu".
0.46/1.06	============================== end of head ===========================
0.46/1.06	
0.46/1.06	============================== INPUT =================================
0.46/1.06	
0.46/1.06	% Reading from file /tmp/Prover9_27761_n005.cluster.edu
0.46/1.06	
0.46/1.06	set(prolog_style_variables).
0.46/1.06	set(auto2).
0.46/1.06	    % set(auto2) -> set(auto).
0.46/1.06	    % set(auto) -> set(auto_inference).
0.46/1.06	    % set(auto) -> set(auto_setup).
0.46/1.06	    % set(auto_setup) -> set(predicate_elim).
0.46/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.46/1.06	    % set(auto) -> set(auto_limits).
0.46/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.46/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.46/1.06	    % set(auto) -> set(auto_denials).
0.46/1.06	    % set(auto) -> set(auto_process).
0.46/1.06	    % set(auto2) -> assign(new_constants, 1).
0.46/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.46/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.46/1.06	    % set(auto2) -> assign(max_hours, 1).
0.46/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.46/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.46/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.46/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.46/1.06	    % set(auto2) -> set(sort_initial_sos).
0.46/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.46/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.46/1.06	    % set(auto2) -> assign(max_megs, 400).
0.46/1.06	    % set(auto2) -> assign(stats, some).
0.46/1.06	    % set(auto2) -> clear(echo_input).
0.46/1.06	    % set(auto2) -> set(quiet).
0.46/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.46/1.06	    % set(auto2) -> clear(print_given).
0.46/1.06	assign(lrs_ticks,-1).
0.46/1.06	assign(sos_limit,10000).
0.46/1.06	assign(order,kbo).
0.46/1.06	set(lex_order_vars).
0.46/1.06	clear(print_given).
0.46/1.06	
0.46/1.06	% formulas(sos).  % not echoed (13 formulas)
0.46/1.06	
0.46/1.06	============================== end of input ==========================
0.46/1.06	
0.46/1.06	% From the command line: assign(max_seconds, 1200).
0.46/1.06	
0.46/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.46/1.06	
0.46/1.06	% Formulas that are not ordinary clauses:
0.46/1.06	1 (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) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(Y,Re,Ta) & complexity(X,C1,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) & survival_chance(Y,P2,Tb) & survival_chance(X,P1,Tb) & reorganization_type(X,Re,Ta) & survival_chance(Y,P,Ta) & survival_chance(X,P,Ta) & class(Y,C,Ta) & class(X,C,Ta) & organization(Y,Tb) & organization(X,Tb) & organization(X,Ta) -> P2 = P1 | greater(P1,P2))) # label(a11_FOL) # label(hypothesis) # label(non_clause).  [assumption].
0.46/1.06	2 (all X all Y all Re all C all C1 all C2 all Ta all Tb all Tc (organization(X,Ta) & class(X,C,Ta) & reorganization(X,Ta,Tb) & reorganization_type(X,Re,Ta) & complexity(X,C1,Ta) & greater(C2,C1) & complexity(Y,C2,Ta) & reorganization_type(Y,Re,Ta) & reorganization(Y,Ta,Tc) & class(Y,C,Ta) & organization(Y,Tc) & organization(Y,Ta) -> greater(Tc,Tb))) # label(a10_FOL) # label(hypothesis) # label(non_clause).  [assumption].
0.46/1.06	3 (all X all Y all P1 all P2 all T (survival_chance(Y,P2,T) & survival_chance(X,P1,T) -> P1 = P2 | greater(P2,P1) | greater(P1,P2))) # label(mp14) # label(axiom) # label(non_clause).  [assumption].
0.46/1.06	4 (all X all Ta all Tb (reorganization(X,Ta,Tb) -> greater(Tb,Ta))) # label(mp7) # label(axiom) # label(non_clause).  [assumption].
0.46/1.06	5 (all X all Y all Z (greater(Y,Z) & greater(X,Y) -> greater(X,Z))) # label(mp11) # label(axiom) # label(non_clause).  [assumption].
0.46/1.06	6 (all X all T (organization(X,T) -> (exists P survival_chance(X,P,T)))) # label(mp12) # label(axiom) # label(non_clause).  [assumption].
0.46/1.06	7 (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.46/1.06	8 (all X all P1 all P2 all T1 all T2 (organization(X,T1) & greater(T2,T1) & survival_chance(X,P2,T2) & survival_chance(X,P1,T1) & reorganization_free(X,T1,T2) & organization(X,T2) -> greater(P2,P1))) # label(t3_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.67/2.04	9 (all X all P1 all P2 all T1 all T2 all Ta all Tb (organization(X,T1) & organization(X,T2) & survival_chance(X,P1,T1) & -greater(Ta,T1) & greater(T2,T1) & -greater(T2,Tb) & survival_chance(X,P2,T2) & reorganization(X,Ta,Tb) -> greater(P1,P2))) # label(t4_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.67/2.04	10 (all X all Y -(greater(Y,X) & greater(X,Y))) # label(mp6_2) # label(axiom) # label(non_clause).  [assumption].
1.67/2.04	11 (all X all Y -(Y = X & greater(X,Y))) # label(mp6_1) # label(axiom) # label(non_clause).  [assumption].
1.67/2.04	12 (all X all Y all Px1 all Px2 all Py1 all Py2 all T1 all T2 (greater(T2,T1) & survival_chance(X,Px1,T1) & survival_chance(X,Px2,T2) & greater(Py1,Px2) & greater(Px2,Px1) & survival_chance(Y,Py2,T2) & survival_chance(Y,Py1,T1) -> (exists T0 exists Px0 exists Py0 (greater(T2,T0) & Px0 = Py0 & survival_chance(Y,Py0,T0) & survival_chance(X,Px0,T0) & greater(T0,T1))))) # label(a15_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.67/2.04	13 -(all X all Y all Re all C all P all P1 all P2 all C1 all C2 all T all Ta all Tb all Tc (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,T) & greater(C2,C1) & (T = Tc -> greater(P1,P2)) & complexity(Y,C2,Ta) & complexity(X,C1,Ta) & survival_chance(Y,P2,T) & reorganization_free(X,Tb,Tc) & reorganization_type(Y,Re,Ta) & class(X,C,Ta) & organization(Y,Tc) & organization(X,Tc) & organization(Y,Ta) & organization(X,Ta) -> (T = Tb -> greater(P1,P2) | P2 = P1))) # label(t5_plus_FOL) # label(negated_conjecture) # label(non_clause).  [assumption].
1.67/2.04	
1.67/2.04	============================== end of process non-clausal formulas ===
1.67/2.04	
1.67/2.04	============================== PROCESS INITIAL CLAUSES ===============
1.67/2.04	
1.67/2.04	============================== PREDICATE ELIMINATION =================
1.67/2.04	14 -organization(A,B) | -greater(C,B) | -survival_chance(A,D,C) | -survival_chance(A,E,B) | -reorganization_free(A,B,C) | -organization(A,C) | greater(D,E) # label(t3_FOL) # label(hypothesis).  [clausify(8)].
1.67/2.04	15 reorganization_free(c1,c12,c13) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.67/2.04	Derived: -organization(c1,c12) | -greater(c13,c12) | -survival_chance(c1,A,c13) | -survival_chance(c1,B,c12) | -organization(c1,c13) | greater(A,B).  [resolve(14,e,15,a)].
1.67/2.04	
1.67/2.04	============================== end predicate elimination =============
1.67/2.04	
1.67/2.04	Auto_denials:  (non-Horn, no changes).
1.67/2.04	
1.67/2.04	Term ordering decisions:
1.67/2.04	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. c13=1. f1=1. f2=1. f3=1. f4=1.
1.67/2.04	
1.67/2.04	============================== end of process initial clauses ========
1.67/2.04	
1.67/2.04	============================== CLAUSES FOR SEARCH ====================
1.67/2.04	
1.67/2.04	============================== end of clauses for search =============
1.67/2.04	
1.67/2.04	============================== SEARCH ================================
1.67/2.04	
1.67/2.04	% Starting search at 0.02 seconds.
1.67/2.04	
1.67/2.04	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 38 (0.00 of 0.31 sec).
1.67/2.04	
1.67/2.04	============================== PROOF =================================
1.67/2.04	% SZS status Theorem
1.67/2.04	% SZS output start Refutation
1.67/2.04	
1.67/2.04	% Proof 1 at 0.98 (+ 0.01) seconds.
1.67/2.04	% Length of proof is 48.
1.67/2.04	% Level of proof is 10.
1.67/2.04	% Maximum clause weight is 69.000.
1.67/2.04	% Given clauses 1392.
1.67/2.04	
1.67/2.04	1 (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) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(Y,Re,Ta) & complexity(X,C1,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) & survival_chance(Y,P2,Tb) & survival_chance(X,P1,Tb) & reorganization_type(X,Re,Ta) & survival_chance(Y,P,Ta) & survival_chance(X,P,Ta) & class(Y,C,Ta) & class(X,C,Ta) & organization(Y,Tb) & organization(X,Tb) & organization(X,Ta) -> P2 = P1 | greater(P1,P2))) # label(a11_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.67/2.04	2 (all X all Y all Re all C all C1 all C2 all Ta all Tb all Tc (organization(X,Ta) & class(X,C,Ta) & reorganization(X,Ta,Tb) & reorganization_type(X,Re,Ta) & complexity(X,C1,Ta) & greater(C2,C1) & complexity(Y,C2,Ta) & reorganization_type(Y,Re,Ta) & reorganization(Y,Ta,Tc) & class(Y,C,Ta) & organization(Y,Tc) & organization(Y,Ta) -> greater(Tc,Tb))) # label(a10_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.77/2.04	4 (all X all Ta all Tb (reorganization(X,Ta,Tb) -> greater(Tb,Ta))) # label(mp7) # label(axiom) # label(non_clause).  [assumption].
1.77/2.04	7 (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.77/2.04	13 -(all X all Y all Re all C all P all P1 all P2 all C1 all C2 all T all Ta all Tb all Tc (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,T) & greater(C2,C1) & (T = Tc -> greater(P1,P2)) & complexity(Y,C2,Ta) & complexity(X,C1,Ta) & survival_chance(Y,P2,T) & reorganization_free(X,Tb,Tc) & reorganization_type(Y,Re,Ta) & class(X,C,Ta) & organization(Y,Tc) & organization(X,Tc) & organization(Y,Ta) & organization(X,Ta) -> (T = Tb -> greater(P1,P2) | P2 = P1))) # label(t5_plus_FOL) # label(negated_conjecture) # label(non_clause).  [assumption].
1.77/2.04	16 greater(c9,c8) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	17 organization(c2,c13) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	18 organization(c1,c13) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	19 organization(c2,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	20 organization(c1,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	21 c10 = c12 # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	22 c12 = c10.  [copy(21),flip(a)].
1.77/2.04	23 class(c2,c4,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	24 survival_chance(c1,c5,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	25 survival_chance(c2,c5,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	26 reorganization(c1,c11,c12) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	27 reorganization(c1,c11,c10).  [copy(26),rewrite([22(3)])].
1.77/2.04	28 reorganization(c2,c11,c13) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	29 reorganization_type(c1,c3,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	30 survival_chance(c1,c6,c10) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	31 complexity(c2,c9,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	32 complexity(c1,c8,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	33 survival_chance(c2,c7,c10) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	34 reorganization_type(c2,c3,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	35 class(c1,c4,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	36 -greater(c6,c7) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	37 c7 != c6 # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.77/2.04	42 -reorganization(A,B,C) | greater(C,B) # label(mp7) # label(axiom).  [clausify(4)].
1.77/2.04	45 -organization(A,B) | -greater(C,D) | -greater(B,C) | -organization(A,D) | organization(A,C) # label(mp13) # label(axiom).  [clausify(7)].
1.77/2.04	53 -organization(A,B) | -class(A,C,B) | -reorganization(A,B,D) | -reorganization_type(A,E,B) | -complexity(A,F,B) | -greater(V6,F) | -complexity(V7,V6,B) | -reorganization_type(V7,E,B) | -reorganization(V7,B,V8) | -class(V7,C,B) | -organization(V7,V8) | -organization(V7,B) | greater(V8,D) # label(a10_FOL) # label(hypothesis).  [clausify(2)].
1.77/2.04	54 -organization(A,B) | -reorganization(C,B,D) | -reorganization(A,B,E) | -reorganization_type(A,F,B) | -complexity(C,V6,B) | -complexity(A,V7,B) | -greater(V7,V6) | -survival_chance(A,V8,D) | -survival_chance(C,V9,D) | -reorganization_type(C,F,B) | -survival_chance(A,V10,B) | -survival_chance(C,V10,B) | -class(A,V11,B) | -class(C,V11,B) | -organization(A,D) | -organization(C,D) | -organization(C,B) | V8 = V9 | greater(V9,V8) # label(a11_FOL) # label(hypothesis).  [clausify(1)].
1.77/2.04	98 greater(c10,c11).  [resolve(42,a,27,a)].
1.77/2.04	108 -greater(A,B) | -greater(c13,A) | -organization(c1,B) | organization(c1,A).  [resolve(45,a,18,a)].
1.77/2.04	109 -greater(A,B) | -greater(c13,A) | -organization(c2,B) | organization(c2,A).  [resolve(45,a,17,a)].
1.77/2.04	424 -class(c1,A,c11) | -reorganization(c1,c11,B) | -complexity(c1,C,c11) | -greater(D,C) | -complexity(E,D,c11) | -reorganization_type(E,c3,c11) | -reorganization(E,c11,F) | -class(E,A,c11) | -organization(E,F) | -organization(E,c11) | greater(F,B).  [resolve(53,d,29,a),unit_del(a,20)].
1.77/2.04	860 -greater(A,c11) | -greater(c13,A) | organization(c1,A).  [resolve(108,c,20,a)].
1.77/2.04	861 -greater(c13,c10) | organization(c1,c10).  [resolve(860,a,98,a)].
1.77/2.04	862 -greater(A,c11) | -greater(c13,A) | organization(c2,A).  [resolve(109,c,19,a)].
1.77/2.04	865 -greater(c13,c10) | organization(c2,c10).  [resolve(862,a,98,a)].
1.77/2.04	2088 -class(c1,A,c11) | -reorganization(c1,c11,B) | -complexity(c1,C,c11) | -greater(D,C) | -complexity(c2,D,c11) | -reorganization(c2,c11,E) | -class(c2,A,c11) | -organization(c2,E) | greater(E,B).  [resolve(424,f,34,a),unit_del(i,19)].
1.77/2.04	2089 -class(c1,A,c11) | -reorganization(c1,c11,B) | -greater(C,c8) | -complexity(c2,C,c11) | -reorganization(c2,c11,D) | -class(c2,A,c11) | -organization(c2,D) | greater(D,B).  [resolve(2088,c,32,a)].
1.77/2.04	2091 -class(c1,A,c11) | -reorganization(c1,c11,B) | -reorganization(c2,c11,C) | -class(c2,A,c11) | -organization(c2,C) | greater(C,B).  [resolve(2089,d,31,a),unit_del(c,16)].
1.77/2.04	2092 -reorganization(c1,c11,A) | -reorganization(c2,c11,B) | -organization(c2,B) | greater(B,A).  [resolve(2091,d,23,a),unit_del(a,35)].
1.77/2.04	2094 -reorganization(c1,c11,A) | greater(c13,A).  [resolve(2092,b,28,a),unit_del(b,17)].
1.77/2.04	2095 greater(c13,c10).  [resolve(2094,a,27,a)].
1.77/2.04	2232 organization(c2,c10).  [back_unit_del(865),unit_del(a,2095)].
1.77/2.04	2233 organization(c1,c10).  [back_unit_del(861),unit_del(a,2095)].
1.77/2.04	2432 $F.  [ur(54,a,19,a,b,27,a,c,28,a,d,34,a,e,32,a,f,31,a,g,16,a,h,33,a,i,30,a,j,29,a,k,25,a,l,24,a,m,23,a,n,35,a,o,2232,a,q,20,a,r,37,a,s,36,a),unit_del(a,2233)].
1.77/2.04	
1.77/2.04	% SZS output end Refutation
1.77/2.04	============================== end of proof ==========================
1.77/2.04	
1.77/2.04	============================== STATISTICS ============================
1.77/2.04	
1.77/2.04	Given=1392. Generated=9161. Kept=2412. proofs=1.
1.77/2.04	Usable=1190. Sos=854. Demods=1. Limbo=10, Disabled=397. Hints=0.
1.77/2.04	Megabytes=4.05.
1.77/2.04	User_CPU=0.98, System_CPU=0.01, Wall_clock=1.
1.77/2.04	
1.77/2.04	============================== end of statistics =====================
1.77/2.04	
1.77/2.04	============================== end of search =========================
1.77/2.04	
1.77/2.04	THEOREM PROVED
1.77/2.04	% SZS status Theorem
1.77/2.04	
1.77/2.04	Exiting with 1 proof.
1.77/2.04	
1.77/2.04	Process 28028 exit (max_proofs) Tue Jul 13 16:21:05 2021
1.77/2.04	Prover9 interrupted
1.77/2.04	EOF