0.08/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n028.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	% DateTime   : Wed Jul  1 17:32:05 EDT 2020
0.13/0.34	% CPUTime    : 
0.78/1.08	============================== Prover9 ===============================
0.78/1.08	Prover9 (32) version 2009-11A, November 2009.
0.78/1.08	Process 19868 was started by sandbox on n028.cluster.edu,
0.78/1.08	Wed Jul  1 17:32:06 2020
0.78/1.08	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_19455_n028.cluster.edu".
0.78/1.08	============================== end of head ===========================
0.78/1.08	
0.78/1.08	============================== INPUT =================================
0.78/1.08	
0.78/1.08	% Reading from file /tmp/Prover9_19455_n028.cluster.edu
0.78/1.08	
0.78/1.08	set(prolog_style_variables).
0.78/1.08	set(auto2).
0.78/1.08	    % set(auto2) -> set(auto).
0.78/1.08	    % set(auto) -> set(auto_inference).
0.78/1.08	    % set(auto) -> set(auto_setup).
0.78/1.08	    % set(auto_setup) -> set(predicate_elim).
0.78/1.08	    % set(auto_setup) -> assign(eq_defs, unfold).
0.78/1.08	    % set(auto) -> set(auto_limits).
0.78/1.08	    % set(auto_limits) -> assign(max_weight, "100.000").
0.78/1.08	    % set(auto_limits) -> assign(sos_limit, 20000).
0.78/1.08	    % set(auto) -> set(auto_denials).
0.78/1.08	    % set(auto) -> set(auto_process).
0.78/1.08	    % set(auto2) -> assign(new_constants, 1).
0.78/1.08	    % set(auto2) -> assign(fold_denial_max, 3).
0.78/1.08	    % set(auto2) -> assign(max_weight, "200.000").
0.78/1.08	    % set(auto2) -> assign(max_hours, 1).
0.78/1.08	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.78/1.08	    % set(auto2) -> assign(max_seconds, 0).
0.78/1.08	    % set(auto2) -> assign(max_minutes, 5).
0.78/1.08	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.78/1.08	    % set(auto2) -> set(sort_initial_sos).
0.78/1.08	    % set(auto2) -> assign(sos_limit, -1).
0.78/1.08	    % set(auto2) -> assign(lrs_ticks, 3000).
0.78/1.08	    % set(auto2) -> assign(max_megs, 400).
0.78/1.08	    % set(auto2) -> assign(stats, some).
0.78/1.08	    % set(auto2) -> clear(echo_input).
0.78/1.08	    % set(auto2) -> set(quiet).
0.78/1.08	    % set(auto2) -> clear(print_initial_clauses).
0.78/1.08	    % set(auto2) -> clear(print_given).
0.78/1.08	assign(lrs_ticks,-1).
0.78/1.08	assign(sos_limit,10000).
0.78/1.08	assign(order,kbo).
0.78/1.08	set(lex_order_vars).
0.78/1.08	clear(print_given).
0.78/1.08	
0.78/1.08	% formulas(sos).  % not echoed (18 formulas)
0.78/1.08	
0.78/1.08	============================== end of input ==========================
0.78/1.08	
0.78/1.08	% From the command line: assign(max_seconds, 960).
0.78/1.08	
0.78/1.08	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.78/1.08	
0.78/1.08	% Formulas that are not ordinary clauses:
0.78/1.08	1 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.78/1.08	2 (all X all Y -(greater(Y,X) & greater(X,Y))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.78/1.08	3 (all X all Y (greater(X,Y) | X = Y | smaller(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause).  [assumption].
0.78/1.08	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.78/1.08	5 (all X all Y (X = Y | smaller(X,Y) <-> smaller_or_equal(X,Y))) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.78/1.08	6 (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.78/1.08	7 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.08	8 (all X all T0 all T (-(is_aligned(X,T) <-> is_aligned(X,T0)) & organization(X) <-> dissimilar(X,T0,T))) # label(definition_2) # label(axiom) # label(non_clause).  [assumption].
0.78/1.08	9 (all X all T0 all T (zero = age(X,T0) & organization(X) -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.78/1.08	10 (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.78/1.08	11 (all X all T (organization(X) -> (-has_immunity(X,T) -> (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-positional_advantage(X,T) & -is_aligned(X,T) -> hazard_of_mortality(X,T) = high) & (positional_advantage(X,T) & -is_aligned(X,T) -> hazard_of_mortality(X,T) = mod1) & (is_aligned(X,T) & positional_advantage(X,T) -> low = hazard_of_mortality(X,T))) & (has_immunity(X,T) -> very_low = hazard_of_mortality(X,T)))) # label(assumption_17) # label(axiom) # label(non_clause).  [assumption].
0.78/1.09	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.78/1.09	13 -(all X all T0 all T1 all T2 (greater(sigma,zero) & greater(age(X,T2),sigma) & smaller_or_equal(age(X,T1),sigma) & zero = age(X,T0) & -has_endowment(X) & fragile_position(X) & organization(X) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_7) # label(negated_conjecture) # label(non_clause).  [assumption].
0.78/1.09	
0.78/1.09	============================== end of process non-clausal formulas ===
0.78/1.09	
0.78/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.78/1.09	
0.78/1.09	============================== PREDICATE ELIMINATION =================
0.78/1.09	14 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(10)].
0.78/1.09	15 fragile_position(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.78/1.09	16 fragile_position(A) | smaller_or_equal(age(A,f1(A)),sigma) | positional_advantage(A,f1(A)) # label(definition_3) # label(axiom).  [clausify(10)].
0.78/1.09	17 fragile_position(A) | smaller_or_equal(age(A,f1(A)),sigma) | greater(age(A,f1(A)),sigma) # label(definition_3) # label(axiom).  [clausify(10)].
0.78/1.09	Derived: -greater(age(c1,A),sigma) | -positional_advantage(c1,A).  [resolve(14,a,15,a)].
0.78/1.09	Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),sigma) | positional_advantage(A,f1(A)).  [resolve(14,a,16,a)].
0.78/1.09	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(14,a,17,a)].
0.78/1.09	18 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(10)].
0.78/1.09	Derived: -smaller_or_equal(age(c1,A),sigma) | positional_advantage(c1,A).  [resolve(18,a,15,a)].
0.78/1.09	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(18,a,16,a)].
0.78/1.09	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(18,a,17,a)].
0.78/1.09	19 fragile_position(A) | -positional_advantage(A,f1(A)) | greater(age(A,f1(A)),sigma) # label(definition_3) # label(axiom).  [clausify(10)].
0.78/1.09	Derived: -positional_advantage(A,f1(A)) | greater(age(A,f1(A)),sigma) | -greater(age(A,B),sigma) | -positional_advantage(A,B).  [resolve(19,a,14,a)].
0.78/1.09	Derived: -positional_advantage(A,f1(A)) | greater(age(A,f1(A)),sigma) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B).  [resolve(19,a,18,a)].
0.78/1.09	20 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(7)].
0.78/1.09	21 organization(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.78/1.09	22 organization(A) | -dissimilar(A,B,C) # label(definition_2) # label(axiom).  [clausify(8)].
0.78/1.09	Derived: has_endowment(c1) | -has_immunity(c1,A).  [resolve(20,a,21,a)].
0.78/1.09	Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D).  [resolve(20,a,22,a)].
0.78/1.09	23 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom).  [clausify(11)].
0.78/1.09	Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low.  [resolve(23,a,21,a)].
0.78/1.09	Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D).  [resolve(23,a,22,a)].
0.78/1.09	24 age(A,B) != zero | -organization(A) | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(12)].
0.78/1.09	Derived: age(c1,A) != zero | is_aligned(c1,A).  [resolve(24,b,21,a)].
0.78/1.09	Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D).  [resolve(24,b,22,a)].
0.78/1.09	25 -is_aligned(A,B) | is_aligned(A,C) | -organization(A) | dissimilar(A,C,B) # label(definition_2) # label(axiom).  [clausify(8)].
0.78/1.09	Derived: -is_aligned(c1,A) | is_aligned(c1,B) | dissimilar(c1,B,A).  [resolve(25,c,21,a)].
0.78/1.09	Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -dissimilar(A,D,E).  [resolve(25,c,22,a)].
0.78/1.09	26 is_aligned(A,B) | -is_aligned(A,C) | -organization(A) | dissimilar(A,C,B) # label(definition_2) # label(axiom).  [clausify(8)].
0.78/1.09	Derived: is_aligned(c1,A) | -is_aligned(c1,B) | dissimilar(c1,B,A).  [resolve(26,c,21,a)].
0.78/1.09	Derived: is_aligned(A,B) | -is_aligned(A,C) | dissimilar(A,C,B) | -dissimilar(A,D,E).  [resolve(26,c,22,a)].
0.78/1.09	27 age(A,B) != zero | -organization(A) | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(9)].
0.78/1.09	Derived: age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B).  [resolve(27,b,21,a)].
0.78/1.09	Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(27,b,22,a)].
0.78/1.09	28 age(A,B) != zero | -organization(A) | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(9)].
0.78/1.09	Derived: age(c1,A) != zero | greater(age(c1,B),sigma) | -dissimilar(c1,A,B).  [resolve(28,b,21,a)].
0.78/1.09	Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(28,b,22,a)].
0.78/1.09	29 -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(11)].
0.78/1.09	Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2.  [resolve(29,a,21,a)].
0.78/1.09	Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D).  [resolve(29,a,22,a)].
0.78/1.09	30 -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(11)].
0.78/1.09	Derived: has_immunity(c1,A) | positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high.  [resolve(30,a,21,a)].
0.78/1.09	Derived: has_immunity(A,B) | positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D).  [resolve(30,a,22,a)].
0.78/1.09	31 -organization(A) | has_immunity(A,B) | -positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17) # label(axiom).  [clausify(11)].
0.78/1.09	Derived: has_immunity(c1,A) | -positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = mod1.  [resolve(31,a,21,a)].
0.78/1.09	Derived: has_immunity(A,B) | -positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D).  [resolve(31,a,22,a)].
0.78/1.09	32 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17) # label(axiom).  [clausify(11)].
0.78/1.09	Derived: has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low.  [resolve(32,a,21,a)].
0.78/1.09	Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D).  [resolve(32,a,22,a)].
0.78/1.09	33 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.78/1.09	34 greater(A,B) | B = A | smaller(A,B) # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(3)].
0.78/1.09	Derived: greater(A,B) | greater(B,A) | A = B.  [resolve(33,a,34,c)].
0.78/1.09	35 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.78/1.09	36 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(5)].
0.78/1.09	Derived: smaller_or_equal(A,B) | greater(A,B) | B = A.  [resolve(36,a,34,c)].
0.78/1.09	Derived: smaller_or_equal(A,B) | -greater(B,A).  [resolve(36,a,35,a)].
0.78/1.09	37 A = B | smaller(B,A) | -smaller_or_equal(B,A) # label(definition_smaller_or_equal) # label(axiom).  [clausify(5)].
0.78/1.09	Derived: A = B | -smaller_or_equal(B,A) | greater(A,B).  [resolve(37,b,33,a)].
0.78/1.09	38 A = B | greater(B,A) | -greater_or_equal(B,A) # label(definition_greater_or_equal) # label(axiom).  [clausify(6)].
0.78/1.09	39 A != B | greater_or_equal(B,A) # label(definition_greater_or_equal) # label(axiom).  [clausify(6)].
0.78/1.11	40 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal) # label(axiom).  [clausify(6)].
0.78/1.11	
0.78/1.11	============================== end predicate elimination =============
0.78/1.11	
0.78/1.11	Auto_denials:  (non-Horn, no changes).
0.78/1.11	
0.78/1.11	Term ordering decisions:
0.78/1.11	
0.78/1.11	% Assigning unary symbol f1 kb_weight 0 and highest precedence (22).
0.78/1.11	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.78/1.11	
0.78/1.11	============================== end of process initial clauses ========
0.78/1.11	
0.78/1.11	============================== CLAUSES FOR SEARCH ====================
0.78/1.11	
0.78/1.11	============================== end of clauses for search =============
0.78/1.11	
0.78/1.11	============================== SEARCH ================================
0.78/1.11	
0.78/1.11	% Starting search at 0.02 seconds.
0.78/1.11	
0.78/1.11	============================== PROOF =================================
0.78/1.11	% SZS status Theorem
0.78/1.11	% SZS output start Refutation
0.78/1.11	
0.78/1.11	% Proof 1 at 0.03 (+ 0.00) seconds.
0.78/1.11	% Length of proof is 84.
0.78/1.11	% Level of proof is 9.
0.78/1.11	% Maximum clause weight is 21.000.
0.78/1.11	% Given clauses 126.
0.78/1.11	
0.78/1.11	1 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.78/1.11	2 (all X all Y -(greater(Y,X) & greater(X,Y))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.78/1.11	3 (all X all Y (greater(X,Y) | X = Y | smaller(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause).  [assumption].
0.78/1.11	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.78/1.11	5 (all X all Y (X = Y | smaller(X,Y) <-> smaller_or_equal(X,Y))) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.78/1.11	7 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.11	8 (all X all T0 all T (-(is_aligned(X,T) <-> is_aligned(X,T0)) & organization(X) <-> dissimilar(X,T0,T))) # label(definition_2) # label(axiom) # label(non_clause).  [assumption].
0.78/1.11	9 (all X all T0 all T (zero = age(X,T0) & organization(X) -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.78/1.11	10 (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.78/1.11	11 (all X all T (organization(X) -> (-has_immunity(X,T) -> (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-positional_advantage(X,T) & -is_aligned(X,T) -> hazard_of_mortality(X,T) = high) & (positional_advantage(X,T) & -is_aligned(X,T) -> hazard_of_mortality(X,T) = mod1) & (is_aligned(X,T) & positional_advantage(X,T) -> low = hazard_of_mortality(X,T))) & (has_immunity(X,T) -> very_low = hazard_of_mortality(X,T)))) # label(assumption_17) # label(axiom) # label(non_clause).  [assumption].
0.78/1.11	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.78/1.11	13 -(all X all T0 all T1 all T2 (greater(sigma,zero) & greater(age(X,T2),sigma) & smaller_or_equal(age(X,T1),sigma) & zero = age(X,T0) & -has_endowment(X) & fragile_position(X) & organization(X) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_7) # label(negated_conjecture) # label(non_clause).  [assumption].
0.78/1.11	14 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(10)].
0.78/1.11	15 fragile_position(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.78/1.11	18 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3) # label(axiom).  [clausify(10)].
0.78/1.11	20 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(7)].
0.78/1.11	21 organization(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.78/1.11	22 organization(A) | -dissimilar(A,B,C) # label(definition_2) # label(axiom).  [clausify(8)].
0.78/1.11	24 age(A,B) != zero | -organization(A) | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(12)].
0.78/1.11	26 is_aligned(A,B) | -is_aligned(A,C) | -organization(A) | dissimilar(A,C,B) # label(definition_2) # label(axiom).  [clausify(8)].
0.78/1.11	27 age(A,B) != zero | -organization(A) | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(9)].
0.78/1.11	28 age(A,B) != zero | -organization(A) | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(9)].
0.78/1.11	30 -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(11)].
0.78/1.11	32 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17) # label(axiom).  [clausify(11)].
0.78/1.11	33 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.78/1.11	34 greater(A,B) | B = A | smaller(A,B) # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(3)].
0.78/1.11	35 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.78/1.11	36 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(5)].
0.78/1.11	41 greater(high,mod2) # label(assumption_18d) # label(axiom).  [assumption].
0.78/1.11	42 greater(mod1,low) # label(assumption_18b) # label(axiom).  [assumption].
0.78/1.11	43 greater(high,mod1) # label(assumption_18a) # label(axiom).  [assumption].
0.78/1.11	44 greater(mod2,low) # label(assumption_18e) # label(axiom).  [assumption].
0.78/1.11	46 greater(sigma,zero) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.78/1.11	47 greater(age(c1,c4),sigma) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.78/1.11	48 smaller_or_equal(age(c1,c3),sigma) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.78/1.11	49 age(c1,c2) = zero # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.78/1.11	50 -has_endowment(c1) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.78/1.11	51 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom).  [clausify(2)].
0.78/1.11	52 -is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,C,B) # label(definition_2) # label(axiom).  [clausify(8)].
0.78/1.11	53 -greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) # label(theorem_7) # label(negated_conjecture).  [clausify(13)].
0.78/1.11	55 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive) # label(axiom).  [clausify(4)].
0.78/1.11	57 -greater(age(c1,A),sigma) | -positional_advantage(c1,A).  [resolve(14,a,15,a)].
0.78/1.11	60 -smaller_or_equal(age(c1,A),sigma) | positional_advantage(c1,A).  [resolve(18,a,15,a)].
0.78/1.11	65 has_endowment(c1) | -has_immunity(c1,A).  [resolve(20,a,21,a)].
0.78/1.11	66 -has_immunity(c1,A).  [copy(65),unit_del(a,50)].
0.78/1.11	69 age(c1,A) != zero | is_aligned(c1,A).  [resolve(24,b,21,a)].
0.78/1.11	73 is_aligned(c1,A) | -is_aligned(c1,B) | dissimilar(c1,B,A).  [resolve(26,c,21,a)].
0.78/1.11	75 age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B).  [resolve(27,b,21,a)].
0.78/1.11	78 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(28,b,22,a)].
0.78/1.11	82 has_immunity(c1,A) | positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high.  [resolve(30,a,21,a)].
0.78/1.11	83 positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high.  [copy(82),unit_del(a,66)].
0.78/1.11	88 has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low.  [resolve(32,a,21,a)].
0.78/1.11	89 -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low.  [copy(88),unit_del(a,66)].
0.78/1.11	91 greater(A,B) | greater(B,A) | A = B.  [resolve(33,a,34,c)].
0.78/1.11	93 smaller_or_equal(A,B) | -greater(B,A).  [resolve(36,a,35,a)].
0.78/1.11	95 -greater(A,A).  [factor(51,a,b)].
0.78/1.11	98 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C).  [factor(78,c,d)].
0.78/1.11	102 -greater(low,mod2).  [resolve(51,a,44,a)].
0.78/1.11	112 -greater(mod1,A) | greater(high,A).  [resolve(55,a,43,a)].
0.78/1.11	122 -positional_advantage(c1,c4).  [ur(57,a,47,a)].
0.78/1.11	123 positional_advantage(c1,c3).  [resolve(60,a,48,a)].
0.78/1.11	124 -smaller_or_equal(zero,sigma) | positional_advantage(c1,c2).  [para(49(a,1),60(a,1))].
0.78/1.11	125 is_aligned(c1,c2).  [resolve(69,a,49,a)].
0.78/1.11	126 age(c1,A) != zero | dissimilar(c1,A,c4).  [resolve(75,b,47,a)].
0.78/1.11	135 greater(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c4)) | hazard_of_mortality(c1,c4) = hazard_of_mortality(c1,c3) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2).  [resolve(91,a,53,a)].
0.78/1.11	145 smaller_or_equal(zero,sigma).  [resolve(93,b,46,a)].
0.78/1.11	151 positional_advantage(c1,c2).  [back_unit_del(124),unit_del(a,145)].
0.78/1.11	156 -greater(low,high).  [ur(55,b,41,a,c,102,a)].
0.78/1.11	157 -is_aligned(c1,c3) | hazard_of_mortality(c1,c3) = low.  [resolve(123,a,89,b)].
0.78/1.11	162 -greater(age(c1,c3),sigma).  [resolve(123,a,57,b)].
0.78/1.11	163 is_aligned(c1,A) | dissimilar(c1,c2,A).  [resolve(125,a,73,b)].
0.78/1.11	166 is_aligned(c1,c4) | hazard_of_mortality(c1,c4) = high.  [resolve(122,a,83,a)].
0.78/1.11	175 hazard_of_mortality(c1,c2) = low.  [resolve(151,a,89,b),unit_del(a,125)].
0.78/1.11	176 greater(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c4)) | hazard_of_mortality(c1,c4) = hazard_of_mortality(c1,c3) | hazard_of_mortality(c1,c3) != low.  [back_rewrite(135),rewrite([175(20)])].
0.78/1.11	182 -dissimilar(c1,c2,c3).  [ur(98,a,49,a,b,162,a)].
0.78/1.11	189 greater(high,low).  [resolve(112,a,42,a)].
0.78/1.11	216 dissimilar(c1,c2,c4).  [resolve(126,a,49,a)].
0.78/1.11	217 -is_aligned(c1,c4).  [resolve(216,a,52,c),unit_del(b,125)].
0.78/1.11	218 hazard_of_mortality(c1,c4) = high.  [back_unit_del(166),unit_del(a,217)].
0.78/1.11	220 greater(hazard_of_mortality(c1,c3),high) | hazard_of_mortality(c1,c3) = high | hazard_of_mortality(c1,c3) != low.  [back_rewrite(176),rewrite([218(6),218(8)]),flip(b)].
0.78/1.11	234 is_aligned(c1,c3).  [resolve(163,b,182,a)].
0.78/1.11	236 hazard_of_mortality(c1,c3) = low.  [back_unit_del(157),unit_del(a,234)].
0.78/1.11	237 high = low.  [back_rewrite(220),rewrite([236(3),236(6),236(9)]),flip(b),xx(c),unit_del(a,156)].
0.78/1.11	246 $F.  [back_rewrite(189),rewrite([237(1)]),unit_del(a,95)].
0.78/1.11	
0.78/1.11	% SZS output end Refutation
0.78/1.11	============================== end of proof ==========================
0.78/1.11	
0.78/1.11	============================== STATISTICS ============================
0.78/1.11	
0.78/1.11	Given=126. Generated=504. Kept=200. proofs=1.
0.78/1.11	Usable=114. Sos=33. Demods=5. Limbo=9, Disabled=121. Hints=0.
0.78/1.11	Megabytes=0.25.
0.78/1.11	User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
0.78/1.11	
0.78/1.11	============================== end of statistics =====================
0.78/1.11	
0.78/1.11	============================== end of search =========================
0.78/1.11	
0.78/1.11	THEOREM PROVED
0.78/1.11	% SZS status Theorem
0.78/1.11	
0.78/1.11	Exiting with 1 proof.
0.78/1.11	
0.78/1.11	Process 19868 exit (max_proofs) Wed Jul  1 17:32:06 2020
0.78/1.11	Prover9 interrupted
0.78/1.11	EOF