0.00/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.03/0.25	% Computer   : n023.star.cs.uiowa.edu
0.03/0.25	% Model      : x86_64 x86_64
0.03/0.25	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.25	% Memory     : 32218.625MB
0.03/0.25	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.25	% CPULimit   : 300
0.03/0.25	% DateTime   : Sat Jul 14 04:16:46 CDT 2018
0.03/0.25	% CPUTime    : 
0.07/0.49	============================== Prover9 ===============================
0.07/0.49	Prover9 (32) version 2009-11A, November 2009.
0.07/0.49	Process 55329 was started by sandbox on n023.star.cs.uiowa.edu,
0.07/0.49	Sat Jul 14 04:16:46 2018
0.07/0.49	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_55297_n023.star.cs.uiowa.edu".
0.07/0.49	============================== end of head ===========================
0.07/0.49	
0.07/0.49	============================== INPUT =================================
0.07/0.49	
0.07/0.49	% Reading from file /tmp/Prover9_55297_n023.star.cs.uiowa.edu
0.07/0.49	
0.07/0.49	set(prolog_style_variables).
0.07/0.49	set(auto2).
0.07/0.49	    % set(auto2) -> set(auto).
0.07/0.49	    % set(auto) -> set(auto_inference).
0.07/0.49	    % set(auto) -> set(auto_setup).
0.07/0.49	    % set(auto_setup) -> set(predicate_elim).
0.07/0.49	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.49	    % set(auto) -> set(auto_limits).
0.07/0.49	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.49	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.49	    % set(auto) -> set(auto_denials).
0.07/0.49	    % set(auto) -> set(auto_process).
0.07/0.49	    % set(auto2) -> assign(new_constants, 1).
0.07/0.49	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.49	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.49	    % set(auto2) -> assign(max_hours, 1).
0.07/0.49	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.49	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.49	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.49	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.49	    % set(auto2) -> set(sort_initial_sos).
0.07/0.49	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.49	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.49	    % set(auto2) -> assign(max_megs, 400).
0.07/0.49	    % set(auto2) -> assign(stats, some).
0.07/0.49	    % set(auto2) -> clear(echo_input).
0.07/0.49	    % set(auto2) -> set(quiet).
0.07/0.49	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.49	    % set(auto2) -> clear(print_given).
0.07/0.49	assign(lrs_ticks,-1).
0.07/0.49	assign(sos_limit,10000).
0.07/0.49	assign(order,kbo).
0.07/0.49	set(lex_order_vars).
0.07/0.49	clear(print_given).
0.07/0.49	
0.07/0.49	% formulas(sos).  % not echoed (13 formulas)
0.07/0.49	
0.07/0.49	============================== end of input ==========================
0.07/0.49	
0.07/0.49	% From the command line: assign(max_seconds, 300).
0.07/0.49	
0.07/0.49	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.49	
0.07/0.49	% Formulas that are not ordinary clauses:
0.07/0.49	1 (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.07/0.49	2 (all X all Y -(greater(X,Y) & Y = X)) # label(mp6_1) # label(axiom) # label(non_clause).  [assumption].
0.07/0.49	3 (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(X,Tb) & class(X,C,Ta) & survival_chance(X,P,Ta) & survival_chance(Y,P,Ta) & reorganization(Y,Ta,Tc) & reorganization_type(X,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(Y,Re,Ta) & reorganization(X,Ta,Tb) & class(Y,C,Ta) & organization(Y,Tb) & organization(Y,Ta) & organization(X,Ta) -> P2 = P1 | greater(P1,P2))) # label(a11_FOL) # label(hypothesis) # label(non_clause).  [assumption].
0.07/0.49	4 (all X all Y all P1 all P2 all T (survival_chance(Y,P2,T) & survival_chance(X,P1,T) -> greater(P1,P2) | greater(P2,P1) | P2 = P1)) # label(mp14) # label(axiom) # label(non_clause).  [assumption].
0.07/0.49	5 (all X all P1 all P2 all T1 all T2 all Ta all Tb (organization(X,T1) & organization(X,T2) & reorganization(X,Ta,Tb) & -greater(Ta,T1) & greater(T2,T1) & -greater(T2,Tb) & survival_chance(X,P2,T2) & survival_chance(X,P1,T1) -> greater(P1,P2))) # label(t4_FOL) # label(hypothesis) # label(non_clause).  [assumption].
0.07/0.49	6 (all X all Y all Px1 all Px2 all Py1 all Py2 all T1 all T2 (greater(T2,T1) & survival_chance(X,Px2,T2) & greater(Px2,Px1) & greater(Py1,Px2) & survival_chance(Y,Py2,T2) & survival_chance(Y,Py1,T1) & survival_chance(X,Px1,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].
0.07/0.49	7 (all X all Ta all Tb (reorganization(X,Ta,Tb) -> greater(Tb,Ta))) # label(mp7) # label(axiom) # label(non_clause).  [assumption].
1.30/1.54	8 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(mp6_2) # label(axiom) # label(non_clause).  [assumption].
1.30/1.54	9 (all X all T (organization(X,T) -> (exists P survival_chance(X,P,T)))) # label(mp12) # label(axiom) # label(non_clause).  [assumption].
1.30/1.54	10 (all X all Y all Re all C all C1 all C2 all Ta all Tb all Tc (organization(X,Ta) & class(Y,C,Ta) & reorganization(X,Ta,Tb) & complexity(X,C1,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) & reorganization_type(Y,Re,Ta) & reorganization_type(X,Re,Ta) & reorganization(Y,Ta,Tc) & class(X,C,Ta) & organization(Y,Tc) & organization(Y,Ta) -> greater(Tc,Tb))) # label(a10_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.30/1.54	11 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp11) # label(axiom) # label(non_clause).  [assumption].
1.30/1.54	12 (all X all P1 all P2 all T1 all T2 (organization(X,T2) & survival_chance(X,P1,T1) & survival_chance(X,P2,T2) & greater(T2,T1) & reorganization_free(X,T1,T2) & organization(X,T1) -> greater(P2,P1))) # label(t3_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.30/1.54	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 (organization(X,Ta) & organization(Y,Ta) & organization(X,Tc) & class(X,C,Ta) & reorganization_type(Y,Re,Ta) & reorganization_free(X,Tb,Tc) & greater(C2,C1) & (Tc = T -> greater(P1,P2)) & complexity(Y,C2,Ta) & complexity(X,C1,Ta) & survival_chance(Y,P2,T) & survival_chance(X,P1,T) & reorganization_type(X,Re,Ta) & reorganization(Y,Ta,Tc) & reorganization(X,Ta,Tb) & survival_chance(Y,P,Ta) & survival_chance(X,P,Ta) & class(Y,C,Ta) & organization(Y,Tc) -> (Tb = T -> greater(P1,P2) | P1 = P2))) # label(t5_plus_FOL) # label(negated_conjecture) # label(non_clause).  [assumption].
1.30/1.54	
1.30/1.54	============================== end of process non-clausal formulas ===
1.30/1.54	
1.30/1.54	============================== PROCESS INITIAL CLAUSES ===============
1.30/1.54	
1.30/1.54	============================== PREDICATE ELIMINATION =================
1.30/1.54	14 -organization(A,B) | -survival_chance(A,C,D) | -survival_chance(A,E,B) | -greater(B,D) | -reorganization_free(A,D,B) | -organization(A,D) | greater(E,C) # label(t3_FOL) # label(hypothesis).  [clausify(12)].
1.30/1.54	15 reorganization_free(c1,c12,c13) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	Derived: -organization(c1,c13) | -survival_chance(c1,A,c12) | -survival_chance(c1,B,c13) | -greater(c13,c12) | -organization(c1,c12) | greater(B,A).  [resolve(14,e,15,a)].
1.30/1.54	
1.30/1.54	============================== end predicate elimination =============
1.30/1.54	
1.30/1.54	Auto_denials:  (non-Horn, no changes).
1.30/1.54	
1.30/1.54	Term ordering decisions:
1.30/1.54	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. f4=1. f1=1. f2=1. f3=1.
1.30/1.54	
1.30/1.54	============================== end of process initial clauses ========
1.30/1.54	
1.30/1.54	============================== CLAUSES FOR SEARCH ====================
1.30/1.54	
1.30/1.54	============================== end of clauses for search =============
1.30/1.54	
1.30/1.54	============================== SEARCH ================================
1.30/1.54	
1.30/1.54	% Starting search at 0.02 seconds.
1.30/1.54	
1.30/1.54	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 38 (0.00 of 0.33 sec).
1.30/1.54	
1.30/1.54	============================== PROOF =================================
1.30/1.54	% SZS status Theorem
1.30/1.54	% SZS output start Refutation
1.30/1.54	
1.30/1.54	% Proof 1 at 1.04 (+ 0.01) seconds.
1.30/1.54	% Length of proof is 47.
1.30/1.54	% Level of proof is 10.
1.30/1.54	% Maximum clause weight is 69.000.
1.30/1.54	% Given clauses 1392.
1.30/1.54	
1.30/1.54	1 (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.30/1.54	3 (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(X,Tb) & class(X,C,Ta) & survival_chance(X,P,Ta) & survival_chance(Y,P,Ta) & reorganization(Y,Ta,Tc) & reorganization_type(X,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(Y,Re,Ta) & reorganization(X,Ta,Tb) & class(Y,C,Ta) & organization(Y,Tb) & organization(Y,Ta) & organization(X,Ta) -> P2 = P1 | greater(P1,P2))) # label(a11_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.30/1.54	7 (all X all Ta all Tb (reorganization(X,Ta,Tb) -> greater(Tb,Ta))) # label(mp7) # label(axiom) # label(non_clause).  [assumption].
1.30/1.54	10 (all X all Y all Re all C all C1 all C2 all Ta all Tb all Tc (organization(X,Ta) & class(Y,C,Ta) & reorganization(X,Ta,Tb) & complexity(X,C1,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) & reorganization_type(Y,Re,Ta) & reorganization_type(X,Re,Ta) & reorganization(Y,Ta,Tc) & class(X,C,Ta) & organization(Y,Tc) & organization(Y,Ta) -> greater(Tc,Tb))) # label(a10_FOL) # label(hypothesis) # label(non_clause).  [assumption].
1.30/1.54	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 (organization(X,Ta) & organization(Y,Ta) & organization(X,Tc) & class(X,C,Ta) & reorganization_type(Y,Re,Ta) & reorganization_free(X,Tb,Tc) & greater(C2,C1) & (Tc = T -> greater(P1,P2)) & complexity(Y,C2,Ta) & complexity(X,C1,Ta) & survival_chance(Y,P2,T) & survival_chance(X,P1,T) & reorganization_type(X,Re,Ta) & reorganization(Y,Ta,Tc) & reorganization(X,Ta,Tb) & survival_chance(Y,P,Ta) & survival_chance(X,P,Ta) & class(Y,C,Ta) & organization(Y,Tc) -> (Tb = T -> greater(P1,P2) | P1 = P2))) # label(t5_plus_FOL) # label(negated_conjecture) # label(non_clause).  [assumption].
1.30/1.54	16 organization(c1,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	17 organization(c2,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	18 organization(c1,c13) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	19 greater(c9,c8) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	20 organization(c2,c13) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	21 c12 = c10 # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	22 class(c1,c4,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	23 reorganization_type(c2,c3,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	24 complexity(c2,c9,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	25 complexity(c1,c8,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	26 survival_chance(c2,c7,c10) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	27 survival_chance(c1,c6,c10) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	28 reorganization_type(c1,c3,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	29 reorganization(c2,c11,c13) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	30 reorganization(c1,c11,c12) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	31 reorganization(c1,c11,c10).  [copy(30),rewrite([21(3)])].
1.30/1.54	32 survival_chance(c2,c5,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	33 survival_chance(c1,c5,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	34 class(c2,c4,c11) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	35 -greater(c6,c7) # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	36 c7 != c6 # label(t5_plus_FOL) # label(negated_conjecture).  [clausify(13)].
1.30/1.54	41 -reorganization(A,B,C) | greater(C,B) # label(mp7) # label(axiom).  [clausify(7)].
1.30/1.54	44 -organization(A,B) | -greater(C,D) | -greater(B,C) | -organization(A,D) | organization(A,C) # label(mp13) # label(axiom).  [clausify(1)].
1.30/1.54	52 -organization(A,B) | -class(C,D,B) | -reorganization(A,B,E) | -complexity(A,F,B) | -complexity(C,V6,B) | -greater(V6,F) | -reorganization_type(C,V7,B) | -reorganization_type(A,V7,B) | -reorganization(C,B,V8) | -class(A,D,B) | -organization(C,V8) | -organization(C,B) | greater(V8,E) # label(a10_FOL) # label(hypothesis).  [clausify(10)].
1.30/1.54	53 -organization(A,B) | -class(A,C,D) | -survival_chance(A,E,D) | -survival_chance(F,E,D) | -reorganization(F,D,V6) | -reorganization_type(A,V7,D) | -complexity(A,V8,D) | -complexity(F,V9,D) | -greater(V9,V8) | -survival_chance(F,V10,B) | -survival_chance(A,V11,B) | -reorganization_type(F,V7,D) | -reorganization(A,D,B) | -class(F,C,D) | -organization(F,B) | -organization(F,D) | -organization(A,D) | V10 = V11 | greater(V11,V10) # label(a11_FOL) # label(hypothesis).  [clausify(3)].
1.30/1.54	96 greater(c10,c11).  [resolve(41,a,31,a)].
1.30/1.54	105 -greater(A,B) | -greater(c13,A) | -organization(c2,B) | organization(c2,A).  [resolve(44,a,20,a)].
1.30/1.54	106 -greater(A,B) | -greater(c13,A) | -organization(c1,B) | organization(c1,A).  [resolve(44,a,18,a)].
1.30/1.54	423 -organization(A,c11) | -class(c2,B,c11) | -reorganization(A,c11,C) | -complexity(A,D,c11) | -complexity(c2,E,c11) | -greater(E,D) | -reorganization_type(A,c3,c11) | -reorganization(c2,c11,F) | -class(A,B,c11) | -organization(c2,F) | greater(F,C).  [resolve(52,g,23,a),unit_del(k,17)].
1.30/1.54	855 -greater(A,c11) | -greater(c13,A) | organization(c2,A).  [resolve(105,c,17,a)].
1.30/1.54	856 -greater(c13,c10) | organization(c2,c10).  [resolve(855,a,96,a)].
1.30/1.54	857 -greater(A,c11) | -greater(c13,A) | organization(c1,A).  [resolve(106,c,16,a)].
1.30/1.54	860 -greater(c13,c10) | organization(c1,c10).  [resolve(857,a,96,a)].
1.30/1.54	2087 -class(c2,A,c11) | -reorganization(c1,c11,B) | -complexity(c1,C,c11) | -complexity(c2,D,c11) | -greater(D,C) | -reorganization(c2,c11,E) | -class(c1,A,c11) | -organization(c2,E) | greater(E,B).  [resolve(423,g,28,a),unit_del(a,16)].
1.30/1.54	2088 -class(c2,A,c11) | -reorganization(c1,c11,B) | -complexity(c2,C,c11) | -greater(C,c8) | -reorganization(c2,c11,D) | -class(c1,A,c11) | -organization(c2,D) | greater(D,B).  [resolve(2087,c,25,a)].
1.30/1.54	2090 -class(c2,A,c11) | -reorganization(c1,c11,B) | -reorganization(c2,c11,C) | -class(c1,A,c11) | -organization(c2,C) | greater(C,B).  [resolve(2088,c,24,a),unit_del(c,19)].
1.30/1.54	2091 -reorganization(c1,c11,A) | -reorganization(c2,c11,B) | -organization(c2,B) | greater(B,A).  [resolve(2090,a,34,a),unit_del(c,22)].
1.30/1.54	2093 -reorganization(c1,c11,A) | greater(c13,A).  [resolve(2091,b,29,a),unit_del(b,20)].
1.30/1.54	2094 greater(c13,c10).  [resolve(2093,a,31,a)].
1.30/1.54	2231 organization(c1,c10).  [back_unit_del(860),unit_del(a,2094)].
1.30/1.54	2232 organization(c2,c10).  [back_unit_del(856),unit_del(a,2094)].
1.30/1.54	2432 $F.  [ur(53,a,2231,a,b,22,a,c,33,a,d,32,a,e,29,a,f,28,a,g,25,a,h,24,a,i,19,a,j,26,a,k,27,a,l,23,a,m,31,a,n,34,a,p,17,a,q,16,a,r,36,a,s,35,a),unit_del(a,2232)].
1.30/1.54	
1.30/1.54	% SZS output end Refutation
1.30/1.54	============================== end of proof ==========================
1.30/1.54	
1.30/1.54	============================== STATISTICS ============================
1.30/1.54	
1.30/1.54	Given=1392. Generated=9167. Kept=2413. proofs=1.
1.30/1.54	Usable=1190. Sos=854. Demods=1. Limbo=11, Disabled=397. Hints=0.
1.30/1.54	Megabytes=4.17.
1.30/1.54	User_CPU=1.05, System_CPU=0.01, Wall_clock=1.
1.30/1.54	
1.30/1.54	============================== end of statistics =====================
1.30/1.54	
1.30/1.54	============================== end of search =========================
1.30/1.54	
1.30/1.54	THEOREM PROVED
1.30/1.54	% SZS status Theorem
1.30/1.54	
1.30/1.54	Exiting with 1 proof.
1.30/1.54	
1.30/1.54	Process 55329 exit (max_proofs) Sat Jul 14 04:16:47 2018
1.30/1.54	Prover9 interrupted
1.30/1.54	EOF