0.11/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n023.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit : 960
0.13/0.34	% WCLimit  : 120
0.13/0.34	% DateTime : Tue Aug  9 02:27:58 EDT 2022
0.13/0.34	% CPUTime  : 
0.42/1.08	============================== Prover9 ===============================
0.42/1.08	Prover9 (32) version 2009-11A, November 2009.
0.42/1.08	Process 19963 was started by sandbox on n023.cluster.edu,
0.42/1.08	Tue Aug  9 02:27:58 2022
0.42/1.08	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_19780_n023.cluster.edu".
0.42/1.08	============================== end of head ===========================
0.42/1.08	
0.42/1.08	============================== INPUT =================================
0.42/1.08	
0.42/1.08	% Reading from file /tmp/Prover9_19780_n023.cluster.edu
0.42/1.08	
0.42/1.08	set(prolog_style_variables).
0.42/1.08	set(auto2).
0.42/1.08	    % set(auto2) -> set(auto).
0.42/1.08	    % set(auto) -> set(auto_inference).
0.42/1.08	    % set(auto) -> set(auto_setup).
0.42/1.08	    % set(auto_setup) -> set(predicate_elim).
0.42/1.08	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/1.08	    % set(auto) -> set(auto_limits).
0.42/1.08	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/1.08	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/1.08	    % set(auto) -> set(auto_denials).
0.42/1.08	    % set(auto) -> set(auto_process).
0.42/1.08	    % set(auto2) -> assign(new_constants, 1).
0.42/1.08	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/1.08	    % set(auto2) -> assign(max_weight, "200.000").
0.42/1.08	    % set(auto2) -> assign(max_hours, 1).
0.42/1.08	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/1.08	    % set(auto2) -> assign(max_seconds, 0).
0.42/1.08	    % set(auto2) -> assign(max_minutes, 5).
0.42/1.08	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/1.08	    % set(auto2) -> set(sort_initial_sos).
0.42/1.08	    % set(auto2) -> assign(sos_limit, -1).
0.42/1.08	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/1.08	    % set(auto2) -> assign(max_megs, 400).
0.42/1.08	    % set(auto2) -> assign(stats, some).
0.42/1.08	    % set(auto2) -> clear(echo_input).
0.42/1.08	    % set(auto2) -> set(quiet).
0.42/1.08	    % set(auto2) -> clear(print_initial_clauses).
0.42/1.08	    % set(auto2) -> clear(print_given).
0.42/1.08	assign(lrs_ticks,-1).
0.42/1.08	assign(sos_limit,10000).
0.42/1.08	assign(order,kbo).
0.42/1.08	set(lex_order_vars).
0.42/1.08	clear(print_given).
0.42/1.08	
0.42/1.08	% formulas(sos).  % not echoed (18 formulas)
0.42/1.08	
0.42/1.08	============================== end of input ==========================
0.42/1.08	
0.42/1.08	% From the command line: assign(max_seconds, 960).
0.42/1.08	
0.42/1.08	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/1.08	
0.42/1.08	% Formulas that are not ordinary clauses:
0.42/1.08	1 (all X all Y (smaller(X,Y) | X = Y <-> smaller_or_equal(X,Y))) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	2 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	3 (all X all Y -(greater(Y,X) & greater(X,Y))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	4 (all X all Y (greater(X,Y) | X = Y <-> greater_or_equal(X,Y))) # label(definition_greater_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	5 (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.42/1.08	6 (all X all Y (X = Y | greater(X,Y) | smaller(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	7 (all X (fragile_position(X) <-> (all T ((greater(age(X,T),sigma) -> -positional_advantage(X,T)) & (smaller_or_equal(age(X,T),sigma) -> positional_advantage(X,T)))))) # label(definition_3) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	8 (all X all T0 all T (organization(X) & zero = age(X,T0) -> (dissimilar(X,T0,T) <-> greater(age(X,T),sigma)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	9 (all X all T (organization(X) -> (-has_immunity(X,T) -> (positional_advantage(X,T) & is_aligned(X,T) -> hazard_of_mortality(X,T) = low) & (-positional_advantage(X,T) & is_aligned(X,T) -> hazard_of_mortality(X,T) = mod2) & (-positional_advantage(X,T) & -is_aligned(X,T) -> hazard_of_mortality(X,T) = high) & (-is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod1)) & (has_immunity(X,T) -> very_low = hazard_of_mortality(X,T)))) # label(assumption_17) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	10 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T) <-> is_aligned(X,T0)))) # label(definition_2) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	11 (all X all T (-has_endowment(X) & organization(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	12 (all X all T (age(X,T) = zero & organization(X) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	13 -(all X all T0 all T1 all T2 (zero = age(X,T0) & greater(age(X,T2),sigma) & smaller_or_equal(age(X,T1),sigma) & greater(sigma,zero) & -has_endowment(X) & fragile_position(X) & organization(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.42/1.08	
0.42/1.08	============================== end of process non-clausal formulas ===
0.42/1.08	
0.42/1.08	============================== PROCESS INITIAL CLAUSES ===============
0.42/1.08	
0.42/1.08	============================== PREDICATE ELIMINATION =================
0.42/1.08	14 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(7)].
0.42/1.08	15 fragile_position(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.42/1.08	16 fragile_position(A) | positional_advantage(A,f1(A)) | smaller_or_equal(age(A,f1(A)),sigma) # label(definition_3) # label(axiom).  [clausify(7)].
0.42/1.08	17 fragile_position(A) | greater(age(A,f1(A)),sigma) | smaller_or_equal(age(A,f1(A)),sigma) # label(definition_3) # label(axiom).  [clausify(7)].
0.42/1.08	Derived: -greater(age(c1,A),sigma) | -positional_advantage(c1,A).  [resolve(14,a,15,a)].
0.42/1.08	Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | positional_advantage(A,f1(A)) | smaller_or_equal(age(A,f1(A)),sigma).  [resolve(14,a,16,a)].
0.42/1.08	Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | greater(age(A,f1(A)),sigma) | smaller_or_equal(age(A,f1(A)),sigma).  [resolve(14,a,17,a)].
0.42/1.08	18 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(7)].
0.42/1.08	Derived: -smaller_or_equal(age(c1,A),sigma) | positional_advantage(c1,A).  [resolve(18,a,15,a)].
0.42/1.08	Derived: -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) | positional_advantage(A,f1(A)) | smaller_or_equal(age(A,f1(A)),sigma).  [resolve(18,a,16,a)].
0.42/1.08	Derived: -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) | greater(age(A,f1(A)),sigma) | smaller_or_equal(age(A,f1(A)),sigma).  [resolve(18,a,17,a)].
0.42/1.08	19 fragile_position(A) | greater(age(A,f1(A)),sigma) | -positional_advantage(A,f1(A)) # label(definition_3) # label(axiom).  [clausify(7)].
0.42/1.08	Derived: greater(age(A,f1(A)),sigma) | -positional_advantage(A,f1(A)) | -greater(age(A,B),sigma) | -positional_advantage(A,B).  [resolve(19,a,14,a)].
0.42/1.08	Derived: greater(age(A,f1(A)),sigma) | -positional_advantage(A,f1(A)) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B).  [resolve(19,a,18,a)].
0.42/1.08	20 has_endowment(A) | -organization(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(11)].
0.42/1.08	21 organization(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.42/1.08	22 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom).  [clausify(10)].
0.42/1.08	Derived: has_endowment(c1) | -has_immunity(c1,A).  [resolve(20,b,21,a)].
0.42/1.08	Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D).  [resolve(20,b,22,b)].
0.42/1.08	23 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom).  [clausify(9)].
0.42/1.08	Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low.  [resolve(23,a,21,a)].
0.42/1.08	Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D).  [resolve(23,a,22,b)].
0.42/1.08	24 age(A,B) != zero | -organization(A) | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(12)].
0.42/1.08	Derived: age(c1,A) != zero | is_aligned(c1,A).  [resolve(24,b,21,a)].
0.42/1.08	Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D).  [resolve(24,b,22,b)].
0.42/1.08	25 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,C) | is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(10)].
0.42/1.08	Derived: dissimilar(c1,A,B) | -is_aligned(c1,B) | is_aligned(c1,A).  [resolve(25,b,21,a)].
0.42/1.08	Derived: dissimilar(A,B,C) | -is_aligned(A,C) | is_aligned(A,B) | -dissimilar(A,D,E).  [resolve(25,b,22,b)].
0.42/1.08	26 dissimilar(A,B,C) | -organization(A) | is_aligned(A,C) | -is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(10)].
0.42/1.08	Derived: dissimilar(c1,A,B) | is_aligned(c1,B) | -is_aligned(c1,A).  [resolve(26,b,21,a)].
0.42/1.08	Derived: dissimilar(A,B,C) | is_aligned(A,C) | -is_aligned(A,B) | -dissimilar(A,D,E).  [resolve(26,b,22,b)].
0.42/1.08	27 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(8)].
0.42/1.08	Derived: age(c1,A) != zero | -dissimilar(c1,A,B) | greater(age(c1,B),sigma).  [resolve(27,a,21,a)].
0.42/1.08	Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(27,a,22,b)].
0.42/1.08	28 -organization(A) | age(A,B) != zero | dissimilar(A,B,C) | -greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(8)].
0.42/1.08	Derived: age(c1,A) != zero | dissimilar(c1,A,B) | -greater(age(c1,B),sigma).  [resolve(28,a,21,a)].
0.42/1.08	Derived: age(A,B) != zero | dissimilar(A,B,C) | -greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(28,a,22,b)].
0.42/1.08	29 -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.42/1.08	Derived: has_immunity(c1,A) | -positional_advantage(c1,A) | -is_aligned(c1,A) | hazard_of_mortality(c1,A) = low.  [resolve(29,a,21,a)].
0.42/1.08	Derived: has_immunity(A,B) | -positional_advantage(A,B) | -is_aligned(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D).  [resolve(29,a,22,b)].
0.42/1.08	30 -organization(A) | has_immunity(A,B) | positional_advantage(A,B) | -is_aligned(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17) # label(axiom).  [clausify(9)].
0.42/1.08	Derived: has_immunity(c1,A) | positional_advantage(c1,A) | -is_aligned(c1,A) | hazard_of_mortality(c1,A) = mod2.  [resolve(30,a,21,a)].
0.42/1.08	Derived: has_immunity(A,B) | positional_advantage(A,B) | -is_aligned(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D).  [resolve(30,a,22,b)].
0.42/1.08	31 -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.42/1.08	Derived: has_immunity(c1,A) | positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high.  [resolve(31,a,21,a)].
0.42/1.08	Derived: has_immunity(A,B) | positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D).  [resolve(31,a,22,b)].
0.42/1.08	32 -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.42/1.08	Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1.  [resolve(32,a,21,a)].
0.42/1.08	Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D).  [resolve(32,a,22,b)].
0.42/1.08	33 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
0.42/1.08	34 A = B | greater(B,A) | smaller(B,A) # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(6)].
0.42/1.08	Derived: smaller_or_equal(A,B) | B = A | greater(A,B).  [resolve(33,a,34,c)].
0.42/1.08	35 -greater(A,B) | smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(2)].
0.42/1.08	Derived: -greater(A,B) | smaller_or_equal(B,A).  [resolve(35,b,33,a)].
0.42/1.08	36 greater(A,B) | -smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(2)].
0.42/1.08	Derived: greater(A,B) | A = B | greater(B,A).  [resolve(36,b,34,c)].
0.42/1.08	37 smaller(A,B) | B = A | -smaller_or_equal(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
0.42/1.08	Derived: A = B | -smaller_or_equal(B,A) | greater(A,B).  [resolve(37,a,36,b)].
0.42/1.08	38 greater(A,B) | B = A | -greater_or_equal(A,B) # label(definition_greater_or_equal) # label(axiom).  [clausify(4)].
0.42/1.08	39 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal) # label(axiom).  [clausify(4)].
0.81/1.10	40 A != B | greater_or_equal(B,A) # label(definition_greater_or_equal) # label(axiom).  [clausify(4)].
0.81/1.10	
0.81/1.10	============================== end predicate elimination =============
0.81/1.10	
0.81/1.10	Auto_denials:  (non-Horn, no changes).
0.81/1.10	
0.81/1.10	Term ordering decisions:
0.81/1.10	
0.81/1.10	% Assigning unary symbol f1 kb_weight 0 and highest precedence (22).
0.81/1.10	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.81/1.10	
0.81/1.10	============================== end of process initial clauses ========
0.81/1.10	
0.81/1.10	============================== CLAUSES FOR SEARCH ====================
0.81/1.10	
0.81/1.10	============================== end of clauses for search =============
0.81/1.10	
0.81/1.10	============================== SEARCH ================================
0.81/1.10	
0.81/1.10	% Starting search at 0.02 seconds.
0.81/1.10	
0.81/1.10	============================== PROOF =================================
0.81/1.10	% SZS status Theorem
0.81/1.10	% SZS output start Refutation
0.81/1.10	
0.81/1.10	% Proof 1 at 0.03 (+ 0.00) seconds.
0.81/1.10	% Length of proof is 82.
0.81/1.10	% Level of proof is 9.
0.81/1.10	% Maximum clause weight is 21.000.
0.81/1.10	% Given clauses 126.
0.81/1.10	
0.81/1.10	1 (all X all Y (smaller(X,Y) | X = Y <-> smaller_or_equal(X,Y))) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	2 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	3 (all X all Y -(greater(Y,X) & greater(X,Y))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	5 (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.81/1.10	6 (all X all Y (X = Y | greater(X,Y) | smaller(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	7 (all X (fragile_position(X) <-> (all T ((greater(age(X,T),sigma) -> -positional_advantage(X,T)) & (smaller_or_equal(age(X,T),sigma) -> positional_advantage(X,T)))))) # label(definition_3) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	8 (all X all T0 all T (organization(X) & zero = age(X,T0) -> (dissimilar(X,T0,T) <-> greater(age(X,T),sigma)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	9 (all X all T (organization(X) -> (-has_immunity(X,T) -> (positional_advantage(X,T) & is_aligned(X,T) -> hazard_of_mortality(X,T) = low) & (-positional_advantage(X,T) & is_aligned(X,T) -> hazard_of_mortality(X,T) = mod2) & (-positional_advantage(X,T) & -is_aligned(X,T) -> hazard_of_mortality(X,T) = high) & (-is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod1)) & (has_immunity(X,T) -> very_low = hazard_of_mortality(X,T)))) # label(assumption_17) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	10 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T) <-> is_aligned(X,T0)))) # label(definition_2) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	11 (all X all T (-has_endowment(X) & organization(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	12 (all X all T (age(X,T) = zero & organization(X) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.81/1.10	13 -(all X all T0 all T1 all T2 (zero = age(X,T0) & greater(age(X,T2),sigma) & smaller_or_equal(age(X,T1),sigma) & greater(sigma,zero) & -has_endowment(X) & fragile_position(X) & organization(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.81/1.10	14 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(7)].
0.81/1.10	15 fragile_position(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.81/1.10	18 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(7)].
0.81/1.10	20 has_endowment(A) | -organization(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(11)].
0.81/1.10	21 organization(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.81/1.10	22 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom).  [clausify(10)].
0.81/1.10	24 age(A,B) != zero | -organization(A) | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(12)].
0.81/1.10	26 dissimilar(A,B,C) | -organization(A) | is_aligned(A,C) | -is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(10)].
0.81/1.10	27 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(8)].
0.81/1.10	28 -organization(A) | age(A,B) != zero | dissimilar(A,B,C) | -greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(8)].
0.81/1.10	29 -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.81/1.10	31 -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.81/1.10	33 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
0.81/1.10	34 A = B | greater(B,A) | smaller(B,A) # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(6)].
0.81/1.10	35 -greater(A,B) | smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(2)].
0.81/1.10	36 greater(A,B) | -smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(2)].
0.81/1.10	42 greater(high,mod2) # label(assumption_18d) # label(axiom).  [assumption].
0.81/1.10	45 greater(mod2,low) # label(assumption_18e) # label(axiom).  [assumption].
0.81/1.10	46 greater(sigma,zero) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.81/1.10	47 age(c1,c2) = zero # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.81/1.10	48 greater(age(c1,c4),sigma) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.81/1.10	49 smaller_or_equal(age(c1,c3),sigma) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.81/1.10	50 -has_endowment(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.81/1.10	51 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom).  [clausify(3)].
0.81/1.10	52 -dissimilar(A,B,C) | -is_aligned(A,C) | -is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(10)].
0.81/1.10	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.81/1.10	55 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive) # label(axiom).  [clausify(5)].
0.81/1.10	57 -greater(age(c1,A),sigma) | -positional_advantage(c1,A).  [resolve(14,a,15,a)].
0.81/1.10	60 -smaller_or_equal(age(c1,A),sigma) | positional_advantage(c1,A).  [resolve(18,a,15,a)].
0.81/1.10	65 has_endowment(c1) | -has_immunity(c1,A).  [resolve(20,b,21,a)].
0.81/1.10	66 -has_immunity(c1,A).  [copy(65),unit_del(a,50)].
0.81/1.10	69 age(c1,A) != zero | is_aligned(c1,A).  [resolve(24,b,21,a)].
0.81/1.10	73 dissimilar(c1,A,B) | is_aligned(c1,B) | -is_aligned(c1,A).  [resolve(26,b,21,a)].
0.81/1.10	76 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(27,a,22,b)].
0.81/1.10	77 age(c1,A) != zero | dissimilar(c1,A,B) | -greater(age(c1,B),sigma).  [resolve(28,a,21,a)].
0.81/1.10	79 has_immunity(c1,A) | -positional_advantage(c1,A) | -is_aligned(c1,A) | hazard_of_mortality(c1,A) = low.  [resolve(29,a,21,a)].
0.81/1.10	80 -positional_advantage(c1,A) | -is_aligned(c1,A) | hazard_of_mortality(c1,A) = low.  [copy(79),unit_del(a,66)].
0.81/1.10	85 has_immunity(c1,A) | positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high.  [resolve(31,a,21,a)].
0.81/1.10	86 positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high.  [copy(85),unit_del(a,66)].
0.81/1.10	92 -greater(A,B) | smaller_or_equal(B,A).  [resolve(35,b,33,a)].
0.81/1.10	93 greater(A,B) | A = B | greater(B,A).  [resolve(36,b,34,c)].
0.81/1.10	95 -greater(A,A).  [factor(51,a,b)].
0.81/1.10	98 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma).  [factor(76,b,d)].
0.81/1.10	101 -greater(low,mod2).  [resolve(51,a,45,a)].
0.81/1.10	113 -greater(mod2,A) | greater(high,A).  [resolve(55,a,42,a)].
0.81/1.10	122 -positional_advantage(c1,c4).  [ur(57,a,48,a)].
0.81/1.10	123 positional_advantage(c1,c3).  [resolve(60,a,49,a)].
0.81/1.10	124 -smaller_or_equal(zero,sigma) | positional_advantage(c1,c2).  [para(47(a,1),60(a,1))].
0.81/1.10	125 is_aligned(c1,c2).  [resolve(69,a,47,a)].
0.81/1.10	126 age(c1,A) != zero | dissimilar(c1,A,c4).  [resolve(77,c,48,a)].
0.81/1.10	138 smaller_or_equal(zero,sigma).  [resolve(92,a,46,a)].
0.81/1.10	144 positional_advantage(c1,c2).  [back_unit_del(124),unit_del(a,138)].
0.81/1.10	148 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(93,a,53,b)].
0.81/1.10	154 -greater(low,high).  [ur(55,b,42,a,c,101,a)].
0.81/1.10	158 -is_aligned(c1,c3) | hazard_of_mortality(c1,c3) = low.  [resolve(123,a,80,a)].
0.81/1.10	162 -greater(age(c1,c3),sigma).  [resolve(123,a,57,b)].
0.81/1.10	163 dissimilar(c1,c2,A) | is_aligned(c1,A).  [resolve(125,a,73,c)].
0.81/1.10	166 is_aligned(c1,c4) | hazard_of_mortality(c1,c4) = high.  [resolve(122,a,86,a)].
0.81/1.10	175 hazard_of_mortality(c1,c2) = low.  [resolve(144,a,80,a),unit_del(a,125)].
0.81/1.10	176 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(148),rewrite([175(20)])].
0.81/1.10	182 -dissimilar(c1,c2,c3).  [ur(98,a,47,a,c,162,a)].
0.81/1.10	199 greater(high,low).  [resolve(113,a,45,a)].
0.81/1.10	216 dissimilar(c1,c2,c4).  [resolve(126,a,47,a)].
0.81/1.10	217 -is_aligned(c1,c4).  [resolve(216,a,52,a),unit_del(b,125)].
0.81/1.10	218 hazard_of_mortality(c1,c4) = high.  [back_unit_del(166),unit_del(a,217)].
0.81/1.10	220 hazard_of_mortality(c1,c3) = high | greater(hazard_of_mortality(c1,c3),high) | hazard_of_mortality(c1,c3) != low.  [back_rewrite(176),rewrite([218(3),218(11)]),flip(a)].
0.81/1.10	234 is_aligned(c1,c3).  [resolve(163,a,182,a)].
0.81/1.10	236 hazard_of_mortality(c1,c3) = low.  [back_unit_del(158),unit_del(a,234)].
0.81/1.10	237 high = low.  [back_rewrite(220),rewrite([236(3),236(6),236(9)]),flip(a),xx(c),unit_del(b,154)].
0.81/1.10	246 $F.  [back_rewrite(199),rewrite([237(1)]),unit_del(a,95)].
0.81/1.10	
0.81/1.10	% SZS output end Refutation
0.81/1.10	============================== end of proof ==========================
0.81/1.10	
0.81/1.10	============================== STATISTICS ============================
0.81/1.10	
0.81/1.10	Given=126. Generated=503. Kept=200. proofs=1.
0.81/1.10	Usable=115. Sos=33. Demods=5. Limbo=9, Disabled=120. Hints=0.
0.81/1.10	Megabytes=0.25.
0.81/1.10	User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
0.81/1.10	
0.81/1.10	============================== end of statistics =====================
0.81/1.10	
0.81/1.10	============================== end of search =========================
0.81/1.10	
0.81/1.10	THEOREM PROVED
0.81/1.10	% SZS status Theorem
0.81/1.10	
0.81/1.10	Exiting with 1 proof.
0.81/1.10	
0.81/1.10	Process 19963 exit (max_proofs) Tue Aug  9 02:27:58 2022
0.81/1.10	Prover9 interrupted
0.81/1.10	EOF