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   : n161.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:17:13 CDT 2018
0.03/0.25	% CPUTime    : 
0.07/0.53	============================== Prover9 ===============================
0.07/0.53	Prover9 (32) version 2009-11A, November 2009.
0.07/0.53	Process 11036 was started by sandbox2 on n161.star.cs.uiowa.edu,
0.07/0.53	Sat Jul 14 04:17:13 2018
0.07/0.53	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11004_n161.star.cs.uiowa.edu".
0.07/0.53	============================== end of head ===========================
0.07/0.53	
0.07/0.53	============================== INPUT =================================
0.07/0.53	
0.07/0.53	% Reading from file /tmp/Prover9_11004_n161.star.cs.uiowa.edu
0.07/0.53	
0.07/0.53	set(prolog_style_variables).
0.07/0.53	set(auto2).
0.07/0.53	    % set(auto2) -> set(auto).
0.07/0.53	    % set(auto) -> set(auto_inference).
0.07/0.53	    % set(auto) -> set(auto_setup).
0.07/0.53	    % set(auto_setup) -> set(predicate_elim).
0.07/0.53	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.53	    % set(auto) -> set(auto_limits).
0.07/0.53	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.53	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.53	    % set(auto) -> set(auto_denials).
0.07/0.53	    % set(auto) -> set(auto_process).
0.07/0.53	    % set(auto2) -> assign(new_constants, 1).
0.07/0.53	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.53	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.53	    % set(auto2) -> assign(max_hours, 1).
0.07/0.53	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.53	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.53	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.53	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.53	    % set(auto2) -> set(sort_initial_sos).
0.07/0.53	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.53	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.53	    % set(auto2) -> assign(max_megs, 400).
0.07/0.53	    % set(auto2) -> assign(stats, some).
0.07/0.53	    % set(auto2) -> clear(echo_input).
0.07/0.53	    % set(auto2) -> set(quiet).
0.07/0.53	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.53	    % set(auto2) -> clear(print_given).
0.07/0.53	assign(lrs_ticks,-1).
0.07/0.53	assign(sos_limit,10000).
0.07/0.53	assign(order,kbo).
0.07/0.53	set(lex_order_vars).
0.07/0.53	clear(print_given).
0.07/0.53	
0.07/0.53	% formulas(sos).  % not echoed (18 formulas)
0.07/0.53	
0.07/0.53	============================== end of input ==========================
0.07/0.53	
0.07/0.53	% From the command line: assign(max_seconds, 300).
0.07/0.53	
0.07/0.53	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.53	
0.07/0.53	% Formulas that are not ordinary clauses:
0.07/0.53	1 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	2 (all X all Y (X = Y | greater(X,Y) <-> greater_or_equal(X,Y))) # label(definition_greater_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	3 (all X all Y (smaller(X,Y) | X = Y | greater(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	4 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(meaning_postulate_greater_transitive) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	5 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	6 (all X all Y (smaller_or_equal(X,Y) <-> smaller(X,Y) | X = Y)) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	7 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	8 (all X (fragile_position(X) <-> (all T ((smaller_or_equal(age(X,T),sigma) -> positional_advantage(X,T)) & (greater(age(X,T),sigma) -> -positional_advantage(X,T)))))) # label(definition_3) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	9 (all X all T (organization(X) -> (has_immunity(X,T) -> very_low = hazard_of_mortality(X,T)) & (-has_immunity(X,T) -> (-positional_advantage(X,T) & -is_aligned(X,T) -> high = hazard_of_mortality(X,T)) & (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod1) & (positional_advantage(X,T) & is_aligned(X,T) -> hazard_of_mortality(X,T) = low)))) # label(assumption_17) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	10 (all X all T (organization(X) & zero = age(X,T) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	11 (all X all T (-has_endowment(X) & organization(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	12 (all X all T0 all T (organization(X) & age(X,T0) = zero -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.07/0.53	13 -(all X all T0 all T1 all T2 (organization(X) & fragile_position(X) & zero = age(X,T0) & greater(age(X,T2),sigma) & smaller_or_equal(age(X,T1),sigma) & greater(sigma,zero) & -has_endowment(X) -> hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0) & greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)))) # label(theorem_7) # label(negated_conjecture) # label(non_clause).  [assumption].
0.07/0.53	
0.07/0.53	============================== end of process non-clausal formulas ===
0.07/0.53	
0.07/0.53	============================== PROCESS INITIAL CLAUSES ===============
0.07/0.53	
0.07/0.53	============================== PREDICATE ELIMINATION =================
0.07/0.53	14 has_endowment(A) | -organization(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(11)].
0.07/0.53	15 organization(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.07/0.53	16 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom).  [clausify(7)].
0.07/0.53	Derived: has_endowment(c1) | -has_immunity(c1,A).  [resolve(14,b,15,a)].
0.07/0.53	Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D).  [resolve(14,b,16,b)].
0.07/0.53	17 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom).  [clausify(9)].
0.07/0.53	Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low.  [resolve(17,a,15,a)].
0.07/0.53	Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D).  [resolve(17,a,16,b)].
0.07/0.53	18 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(10)].
0.07/0.53	Derived: age(c1,A) != zero | is_aligned(c1,A).  [resolve(18,a,15,a)].
0.07/0.53	Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D).  [resolve(18,a,16,b)].
0.07/0.53	19 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom).  [clausify(7)].
0.07/0.53	Derived: dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B).  [resolve(19,b,15,a)].
0.07/0.53	Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -dissimilar(A,D,E).  [resolve(19,b,16,b)].
0.07/0.53	20 dissimilar(A,B,C) | -organization(A) | is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom).  [clausify(7)].
0.07/0.53	Derived: dissimilar(c1,A,B) | is_aligned(c1,A) | -is_aligned(c1,B).  [resolve(20,b,15,a)].
0.07/0.53	Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,D,E).  [resolve(20,b,16,b)].
0.07/0.53	21 -organization(A) | has_immunity(A,B) | positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17) # label(axiom).  [clausify(9)].
0.07/0.53	Derived: has_immunity(c1,A) | positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high.  [resolve(21,a,15,a)].
0.07/0.53	Derived: has_immunity(A,B) | positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D).  [resolve(21,a,16,b)].
0.07/0.53	22 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17) # label(axiom).  [clausify(9)].
0.07/0.53	Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2.  [resolve(22,a,15,a)].
0.07/0.53	Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D).  [resolve(22,a,16,b)].
0.07/0.53	23 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17) # label(axiom).  [clausify(9)].
0.07/0.53	Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1.  [resolve(23,a,15,a)].
0.07/0.53	Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D).  [resolve(23,a,16,b)].
0.07/0.53	24 -organization(A) | has_immunity(A,B) | -positional_advantage(A,B) | -is_aligned(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17) # label(axiom).  [clausify(9)].
0.07/0.53	Derived: has_immunity(c1,A) | -positional_advantage(c1,A) | -is_aligned(c1,A) | hazard_of_mortality(c1,A) = low.  [resolve(24,a,15,a)].
0.07/0.53	Derived: has_immunity(A,B) | -positional_advantage(A,B) | -is_aligned(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D).  [resolve(24,a,16,b)].
0.07/0.53	25 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(12)].
0.07/0.53	Derived: age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B).  [resolve(25,a,15,a)].
0.07/0.53	Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(25,a,16,b)].
0.07/0.53	26 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(12)].
0.07/0.53	Derived: age(c1,A) != zero | greater(age(c1,B),sigma) | -dissimilar(c1,A,B).  [resolve(26,a,15,a)].
0.07/0.53	Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(26,a,16,b)].
0.07/0.53	27 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(8)].
0.07/0.53	28 fragile_position(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.07/0.53	29 fragile_position(A) | smaller_or_equal(age(A,f1(A)),sigma) | positional_advantage(A,f1(A)) # label(definition_3) # label(axiom).  [clausify(8)].
0.07/0.53	30 fragile_position(A) | smaller_or_equal(age(A,f1(A)),sigma) | greater(age(A,f1(A)),sigma) # label(definition_3) # label(axiom).  [clausify(8)].
0.07/0.53	Derived: -greater(age(c1,A),sigma) | -positional_advantage(c1,A).  [resolve(27,a,28,a)].
0.07/0.53	Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),sigma) | positional_advantage(A,f1(A)).  [resolve(27,a,29,a)].
0.07/0.53	Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),sigma) | greater(age(A,f1(A)),sigma).  [resolve(27,a,30,a)].
0.07/0.53	31 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(8)].
0.07/0.53	Derived: -smaller_or_equal(age(c1,A),sigma) | positional_advantage(c1,A).  [resolve(31,a,28,a)].
0.07/0.53	Derived: -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),sigma) | positional_advantage(A,f1(A)).  [resolve(31,a,29,a)].
0.07/0.53	Derived: -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),sigma) | greater(age(A,f1(A)),sigma).  [resolve(31,a,30,a)].
0.07/0.53	32 fragile_position(A) | -positional_advantage(A,f1(A)) | greater(age(A,f1(A)),sigma) # label(definition_3) # label(axiom).  [clausify(8)].
0.07/0.53	Derived: -positional_advantage(A,f1(A)) | greater(age(A,f1(A)),sigma) | -greater(age(A,B),sigma) | -positional_advantage(A,B).  [resolve(32,a,27,a)].
0.07/0.53	Derived: -positional_advantage(A,f1(A)) | greater(age(A,f1(A)),sigma) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B).  [resolve(32,a,31,a)].
0.07/0.53	33 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.07/0.53	34 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(3)].
0.07/0.53	Derived: greater(A,B) | A = B | greater(B,A).  [resolve(33,a,34,a)].
0.07/0.53	35 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.07/0.53	36 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(6)].
0.07/0.53	Derived: smaller_or_equal(A,B) | B = A | greater(A,B).  [resolve(36,b,34,a)].
0.07/0.53	Derived: smaller_or_equal(A,B) | -greater(B,A).  [resolve(36,b,35,a)].
0.07/0.53	37 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom).  [clausify(6)].
0.07/0.53	Derived: -smaller_or_equal(A,B) | B = A | greater(B,A).  [resolve(37,b,33,a)].
0.07/0.53	38 A = B | greater(B,A) | -greater_or_equal(B,A) # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.07/0.53	39 A != B | greater_or_equal(B,A) # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.07/0.54	40 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.07/0.54	
0.07/0.54	============================== end predicate elimination =============
0.07/0.54	
0.07/0.54	Auto_denials:  (non-Horn, no changes).
0.07/0.54	
0.07/0.54	Term ordering decisions:
0.07/0.54	
0.07/0.54	% Assigning unary symbol f1 kb_weight 0 and highest precedence (22).
0.07/0.54	Function symbol KB weights:  sigma=1. zero=1. low=1. high=1. mod1=1. mod2=1. very_low=1. c1=1. c2=1. c3=1. c4=1. age=1. hazard_of_mortality=1. f1=0.
0.07/0.54	
0.07/0.54	============================== end of process initial clauses ========
0.07/0.54	
0.07/0.54	============================== CLAUSES FOR SEARCH ====================
0.07/0.54	
0.07/0.54	============================== end of clauses for search =============
0.07/0.54	
0.07/0.54	============================== SEARCH ================================
0.07/0.54	
0.07/0.54	% Starting search at 0.01 seconds.
0.07/0.54	
0.07/0.54	============================== PROOF =================================
0.07/0.54	% SZS status Theorem
0.07/0.54	% SZS output start Refutation
0.07/0.54	
0.07/0.54	% Proof 1 at 0.02 (+ 0.00) seconds.
0.07/0.54	% Length of proof is 82.
0.07/0.54	% Level of proof is 9.
0.07/0.54	% Maximum clause weight is 21.000.
0.07/0.54	% Given clauses 126.
0.07/0.54	
0.07/0.54	1 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	3 (all X all Y (smaller(X,Y) | X = Y | greater(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	4 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(meaning_postulate_greater_transitive) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	5 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	6 (all X all Y (smaller_or_equal(X,Y) <-> smaller(X,Y) | X = Y)) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	7 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	8 (all X (fragile_position(X) <-> (all T ((smaller_or_equal(age(X,T),sigma) -> positional_advantage(X,T)) & (greater(age(X,T),sigma) -> -positional_advantage(X,T)))))) # label(definition_3) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	9 (all X all T (organization(X) -> (has_immunity(X,T) -> very_low = hazard_of_mortality(X,T)) & (-has_immunity(X,T) -> (-positional_advantage(X,T) & -is_aligned(X,T) -> high = hazard_of_mortality(X,T)) & (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod1) & (positional_advantage(X,T) & is_aligned(X,T) -> hazard_of_mortality(X,T) = low)))) # label(assumption_17) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	10 (all X all T (organization(X) & zero = age(X,T) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	11 (all X all T (-has_endowment(X) & organization(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	12 (all X all T0 all T (organization(X) & age(X,T0) = zero -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.07/0.54	13 -(all X all T0 all T1 all T2 (organization(X) & fragile_position(X) & zero = age(X,T0) & greater(age(X,T2),sigma) & smaller_or_equal(age(X,T1),sigma) & greater(sigma,zero) & -has_endowment(X) -> hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0) & greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)))) # label(theorem_7) # label(negated_conjecture) # label(non_clause).  [assumption].
0.07/0.54	14 has_endowment(A) | -organization(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(11)].
0.07/0.54	15 organization(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.07/0.54	16 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom).  [clausify(7)].
0.07/0.54	18 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(10)].
0.07/0.54	19 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom).  [clausify(7)].
0.07/0.54	21 -organization(A) | has_immunity(A,B) | positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17) # label(axiom).  [clausify(9)].
0.07/0.54	24 -organization(A) | has_immunity(A,B) | -positional_advantage(A,B) | -is_aligned(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17) # label(axiom).  [clausify(9)].
0.07/0.54	25 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(12)].
0.07/0.54	26 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(12)].
0.07/0.54	27 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(8)].
0.07/0.54	28 fragile_position(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.07/0.54	31 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(8)].
0.07/0.54	33 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.07/0.54	34 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(3)].
0.07/0.54	35 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.07/0.54	36 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(6)].
0.07/0.54	43 greater(mod1,low) # label(assumption_18b) # label(axiom).  [assumption].
0.07/0.54	45 greater(high,mod1) # label(assumption_18a) # label(axiom).  [assumption].
0.07/0.54	46 greater(sigma,zero) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.07/0.54	47 age(c1,c2) = zero # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.07/0.54	48 greater(age(c1,c4),sigma) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.07/0.54	49 smaller_or_equal(age(c1,c3),sigma) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.07/0.54	50 -has_endowment(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.07/0.54	51 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom).  [clausify(5)].
0.07/0.54	52 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom).  [clausify(7)].
0.07/0.54	53 hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) | -greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.07/0.54	55 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive) # label(axiom).  [clausify(4)].
0.07/0.54	57 has_endowment(c1) | -has_immunity(c1,A).  [resolve(14,b,15,a)].
0.07/0.54	58 -has_immunity(c1,A).  [copy(57),unit_del(a,50)].
0.07/0.54	61 age(c1,A) != zero | is_aligned(c1,A).  [resolve(18,a,15,a)].
0.07/0.54	63 dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B).  [resolve(19,b,15,a)].
0.07/0.54	67 has_immunity(c1,A) | positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high.  [resolve(21,a,15,a)].
0.07/0.54	68 positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high.  [copy(67),unit_del(a,58)].
0.07/0.54	76 has_immunity(c1,A) | -positional_advantage(c1,A) | -is_aligned(c1,A) | hazard_of_mortality(c1,A) = low.  [resolve(24,a,15,a)].
0.07/0.54	77 -positional_advantage(c1,A) | -is_aligned(c1,A) | hazard_of_mortality(c1,A) = low.  [copy(76),unit_del(a,58)].
0.07/0.54	79 age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B).  [resolve(25,a,15,a)].
0.07/0.54	82 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(26,a,16,b)].
0.07/0.54	83 -greater(age(c1,A),sigma) | -positional_advantage(c1,A).  [resolve(27,a,28,a)].
0.07/0.54	86 -smaller_or_equal(age(c1,A),sigma) | positional_advantage(c1,A).  [resolve(31,a,28,a)].
0.07/0.54	91 greater(A,B) | A = B | greater(B,A).  [resolve(33,a,34,a)].
0.07/0.54	93 smaller_or_equal(A,B) | -greater(B,A).  [resolve(36,b,35,a)].
0.07/0.54	95 -greater(A,A).  [factor(51,a,b)].
0.07/0.54	98 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C).  [factor(82,c,d)].
0.07/0.54	101 -greater(mod1,high).  [resolve(51,a,45,a)].
0.07/0.54	110 -greater(mod1,A) | greater(high,A).  [resolve(55,a,45,a)].
0.07/0.54	122 is_aligned(c1,c2).  [resolve(61,a,47,a)].
0.07/0.54	124 age(c1,A) != zero | dissimilar(c1,A,c4).  [resolve(79,b,48,a)].
0.07/0.54	126 -positional_advantage(c1,c4).  [ur(83,a,48,a)].
0.07/0.54	127 positional_advantage(c1,c3).  [resolve(86,a,49,a)].
0.07/0.54	128 -smaller_or_equal(zero,sigma) | positional_advantage(c1,c2).  [para(47(a,1),86(a,1))].
0.07/0.54	132 hazard_of_mortality(c1,c4) = hazard_of_mortality(c1,c3) | greater(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c4)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2).  [resolve(91,a,53,b)].
0.07/0.54	142 smaller_or_equal(zero,sigma).  [resolve(93,b,46,a)].
0.07/0.54	148 positional_advantage(c1,c2).  [back_unit_del(128),unit_del(a,142)].
0.07/0.54	151 -greater(low,high).  [ur(55,a,43,a,c,101,a)].
0.07/0.54	155 dissimilar(c1,c2,A) | is_aligned(c1,A).  [resolve(122,a,63,b)].
0.07/0.54	160 -greater(age(c1,c3),sigma).  [resolve(127,a,83,b)].
0.07/0.54	161 -is_aligned(c1,c3) | hazard_of_mortality(c1,c3) = low.  [resolve(127,a,77,a)].
0.07/0.54	163 is_aligned(c1,c4) | hazard_of_mortality(c1,c4) = high.  [resolve(126,a,68,a)].
0.07/0.54	172 hazard_of_mortality(c1,c2) = low.  [resolve(148,a,77,a),unit_del(a,122)].
0.07/0.54	173 hazard_of_mortality(c1,c4) = hazard_of_mortality(c1,c3) | greater(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c4)) | hazard_of_mortality(c1,c3) != low.  [back_rewrite(132),rewrite([172(20)])].
0.07/0.54	179 -dissimilar(c1,c2,c3).  [ur(98,a,47,a,b,160,a)].
0.07/0.54	183 greater(high,low).  [resolve(110,a,43,a)].
0.07/0.54	220 dissimilar(c1,c2,c4).  [resolve(124,a,47,a)].
0.07/0.54	221 -is_aligned(c1,c4).  [resolve(220,a,52,a),unit_del(a,122)].
0.07/0.54	222 hazard_of_mortality(c1,c4) = high.  [back_unit_del(163),unit_del(a,221)].
0.07/0.54	224 hazard_of_mortality(c1,c3) = high | greater(hazard_of_mortality(c1,c3),high) | hazard_of_mortality(c1,c3) != low.  [back_rewrite(173),rewrite([222(3),222(11)]),flip(a)].
0.07/0.54	231 is_aligned(c1,c3).  [resolve(155,a,179,a)].
0.07/0.54	233 hazard_of_mortality(c1,c3) = low.  [back_unit_del(161),unit_del(a,231)].
0.07/0.54	234 high = low.  [back_rewrite(224),rewrite([233(3),233(6),233(9)]),flip(a),xx(c),unit_del(b,151)].
0.07/0.54	243 $F.  [back_rewrite(183),rewrite([234(1)]),unit_del(a,95)].
0.07/0.54	
0.07/0.54	% SZS output end Refutation
0.07/0.54	============================== end of proof ==========================
0.07/0.54	
0.07/0.54	============================== STATISTICS ============================
0.07/0.54	
0.07/0.54	Given=126. Generated=518. Kept=197. proofs=1.
0.07/0.54	Usable=115. Sos=32. Demods=5. Limbo=9, Disabled=118. Hints=0.
0.07/0.54	Megabytes=0.25.
0.07/0.54	User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
0.07/0.54	
0.07/0.54	============================== end of statistics =====================
0.07/0.54	
0.07/0.54	============================== end of search =========================
0.07/0.54	
0.07/0.54	THEOREM PROVED
0.07/0.54	% SZS status Theorem
0.07/0.54	
0.07/0.54	Exiting with 1 proof.
0.07/0.54	
0.07/0.54	Process 11036 exit (max_proofs) Sat Jul 14 04:17:13 2018
0.07/0.54	Prover9 interrupted
0.07/0.55	EOF