0.11/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.14/0.34	% Computer : n028.cluster.edu
0.14/0.34	% Model    : x86_64 x86_64
0.14/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory   : 8042.1875MB
0.14/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit : 1440
0.14/0.34	% WCLimit  : 180
0.14/0.34	% DateTime : Mon Jul  3 05:33:58 EDT 2023
0.14/0.34	% CPUTime  : 
0.47/1.02	============================== Prover9 ===============================
0.47/1.02	Prover9 (32) version 2009-11A, November 2009.
0.47/1.02	Process 15295 was started by sandbox2 on n028.cluster.edu,
0.47/1.02	Mon Jul  3 05:33:59 2023
0.47/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_14904_n028.cluster.edu".
0.47/1.02	============================== end of head ===========================
0.47/1.02	
0.47/1.02	============================== INPUT =================================
0.47/1.02	
0.47/1.02	% Reading from file /tmp/Prover9_14904_n028.cluster.edu
0.47/1.02	
0.47/1.02	set(prolog_style_variables).
0.47/1.02	set(auto2).
0.47/1.02	    % set(auto2) -> set(auto).
0.47/1.02	    % set(auto) -> set(auto_inference).
0.47/1.02	    % set(auto) -> set(auto_setup).
0.47/1.02	    % set(auto_setup) -> set(predicate_elim).
0.47/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.47/1.02	    % set(auto) -> set(auto_limits).
0.47/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.47/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.47/1.02	    % set(auto) -> set(auto_denials).
0.47/1.02	    % set(auto) -> set(auto_process).
0.47/1.02	    % set(auto2) -> assign(new_constants, 1).
0.47/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.47/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.47/1.02	    % set(auto2) -> assign(max_hours, 1).
0.47/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.47/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.47/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.47/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.47/1.02	    % set(auto2) -> set(sort_initial_sos).
0.47/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.47/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.47/1.02	    % set(auto2) -> assign(max_megs, 400).
0.47/1.02	    % set(auto2) -> assign(stats, some).
0.47/1.02	    % set(auto2) -> clear(echo_input).
0.47/1.02	    % set(auto2) -> set(quiet).
0.47/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.47/1.02	    % set(auto2) -> clear(print_given).
0.47/1.02	assign(lrs_ticks,-1).
0.47/1.02	assign(sos_limit,10000).
0.47/1.02	assign(order,kbo).
0.47/1.02	set(lex_order_vars).
0.47/1.02	clear(print_given).
0.47/1.02	
0.47/1.02	% formulas(sos).  % not echoed (20 formulas)
0.47/1.02	
0.47/1.02	============================== end of input ==========================
0.47/1.02	
0.47/1.02	% From the command line: assign(max_seconds, 1440).
0.47/1.02	
0.47/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.47/1.02	
0.47/1.02	% Formulas that are not ordinary clauses:
0.47/1.02	1 (all X all Y (smaller_or_equal(X,Y) <-> X = Y | smaller(X,Y))) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.47/1.02	2 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | Y = X)) # label(definition_greater_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.47/1.02	3 (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.47/1.02	4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.47/1.02	5 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.47/1.02	6 (all X all Y (greater(X,Y) | X = Y | smaller(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause).  [assumption].
0.47/1.02	7 (all X all T (organization(X) -> (-has_immunity(X,T) -> (is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = low) & (-positional_advantage(X,T) & -is_aligned(X,T) -> hazard_of_mortality(X,T) = high) & (is_aligned(X,T) & -positional_advantage(X,T) -> mod2 = hazard_of_mortality(X,T)) & (-is_aligned(X,T) & positional_advantage(X,T) -> mod1 = 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.47/1.02	8 (all X all T0 all T (age(X,T0) = zero & organization(X) -> (dissimilar(X,T0,T) <-> greater(age(X,T),sigma)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.47/1.02	9 (all X (has_endowment(X) <-> (all T (organization(X) & (smaller_or_equal(age(X,T),eta) -> has_immunity(X,T)) & (greater(age(X,T),eta) -> -has_immunity(X,T)))))) # label(definition_1) # label(axiom) # label(non_clause).  [assumption].
0.47/1.02	10 (all X all T (-has_endowment(X) & organization(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	11 (all X ((all T ((greater(age(X,T),tau) -> positional_advantage(X,T)) & (smaller_or_equal(age(X,T),tau) -> -positional_advantage(X,T)))) <-> robust_position(X))) # label(definition_4) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	12 (all X all T (organization(X) & zero = age(X,T) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	13 (all X all T0 all T (organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)) <-> dissimilar(X,T0,T))) # label(definition_2) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	14 -(all X all T0 all T1 all T2 all T3 (organization(X) & -has_endowment(X) & smaller_or_equal(age(X,T1),tau) & greater(age(X,T2),tau) & greater(age(X,T3),sigma) & smaller_or_equal(age(X,T2),sigma) & greater(sigma,tau) & greater(tau,zero) & greater(sigma,zero) & age(X,T0) = zero & robust_position(X) -> smaller(hazard_of_mortality(X,T2),hazard_of_mortality(X,T3)) & hazard_of_mortality(X,T0) = hazard_of_mortality(X,T1) & smaller(hazard_of_mortality(X,T3),hazard_of_mortality(X,T1)))) # label(theorem_10) # label(negated_conjecture) # label(non_clause).  [assumption].
0.77/1.03	
0.77/1.03	============================== end of process non-clausal formulas ===
0.77/1.03	
0.77/1.03	============================== PROCESS INITIAL CLAUSES ===============
0.77/1.03	
0.77/1.03	============================== PREDICATE ELIMINATION =================
0.77/1.03	15 has_endowment(A) | -organization(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(10)].
0.77/1.03	16 organization(c1) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
0.77/1.03	17 -has_endowment(A) | organization(A) # label(definition_1) # label(axiom).  [clausify(9)].
0.77/1.03	18 organization(A) | -dissimilar(A,B,C) # label(definition_2) # label(axiom).  [clausify(13)].
0.77/1.03	Derived: has_endowment(c1) | -has_immunity(c1,A).  [resolve(15,b,16,a)].
0.77/1.03	Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D).  [resolve(15,b,18,a)].
0.77/1.03	19 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom).  [clausify(7)].
0.77/1.03	Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low.  [resolve(19,a,16,a)].
0.77/1.03	Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -has_endowment(A).  [resolve(19,a,17,b)].
0.77/1.03	Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D).  [resolve(19,a,18,a)].
0.77/1.03	20 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(12)].
0.77/1.03	Derived: age(c1,A) != zero | is_aligned(c1,A).  [resolve(20,a,16,a)].
0.77/1.03	Derived: age(A,B) != zero | is_aligned(A,B) | -has_endowment(A).  [resolve(20,a,17,b)].
0.77/1.03	Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D).  [resolve(20,a,18,a)].
0.77/1.03	21 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2) # label(axiom).  [clausify(13)].
0.77/1.03	Derived: -is_aligned(c1,A) | is_aligned(c1,B) | dissimilar(c1,A,B).  [resolve(21,a,16,a)].
0.77/1.03	Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -has_endowment(A).  [resolve(21,a,17,b)].
0.77/1.03	Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(21,a,18,a)].
0.77/1.03	22 -organization(A) | is_aligned(A,B) | -is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2) # label(axiom).  [clausify(13)].
0.77/1.03	Derived: is_aligned(c1,A) | -is_aligned(c1,B) | dissimilar(c1,A,B).  [resolve(22,a,16,a)].
0.77/1.03	Derived: is_aligned(A,B) | -is_aligned(A,C) | dissimilar(A,B,C) | -has_endowment(A).  [resolve(22,a,17,b)].
0.77/1.03	Derived: is_aligned(A,B) | -is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(22,a,18,a)].
0.77/1.03	23 has_endowment(A) | -organization(A) | smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) # label(definition_1) # label(axiom).  [clausify(9)].
0.77/1.03	Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)).  [resolve(23,b,16,a)].
0.77/1.03	Derived: has_endowment(A) | smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) | -dissimilar(A,B,C).  [resolve(23,b,18,a)].
0.77/1.03	24 has_endowment(A) | -organization(A) | -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) # label(definition_1) # label(axiom).  [clausify(9)].
0.77/1.03	25 -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(7)].
0.77/1.03	Derived: has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low.  [resolve(25,a,16,a)].
0.77/1.03	Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -has_endowment(A).  [resolve(25,a,17,b)].
0.77/1.03	Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D).  [resolve(25,a,18,a)].
0.77/1.03	26 -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(7)].
0.77/1.03	Derived: has_immunity(c1,A) | positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high.  [resolve(26,a,16,a)].
0.77/1.03	Derived: has_immunity(A,B) | positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = high | -has_endowment(A).  [resolve(26,a,17,b)].
0.77/1.03	Derived: has_immunity(A,B) | positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D).  [resolve(26,a,18,a)].
0.77/1.03	27 -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(7)].
0.77/1.03	Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2.  [resolve(27,a,16,a)].
0.77/1.03	Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -has_endowment(A).  [resolve(27,a,17,b)].
0.77/1.03	Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D).  [resolve(27,a,18,a)].
0.77/1.03	28 -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(7)].
0.77/1.03	Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1.  [resolve(28,a,16,a)].
0.77/1.03	Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -has_endowment(A).  [resolve(28,a,17,b)].
0.77/1.03	Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D).  [resolve(28,a,18,a)].
0.77/1.03	29 age(A,B) != zero | -organization(A) | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(8)].
0.77/1.03	Derived: age(c1,A) != zero | -dissimilar(c1,A,B) | greater(age(c1,B),sigma).  [resolve(29,b,16,a)].
0.77/1.03	Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -has_endowment(A).  [resolve(29,b,17,b)].
0.77/1.03	Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(29,b,18,a)].
0.77/1.03	30 age(A,B) != zero | -organization(A) | dissimilar(A,B,C) | -greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(8)].
0.77/1.03	Derived: age(c1,A) != zero | dissimilar(c1,A,B) | -greater(age(c1,B),sigma).  [resolve(30,b,16,a)].
0.77/1.03	Derived: age(A,B) != zero | dissimilar(A,B,C) | -greater(age(A,C),sigma) | -has_endowment(A).  [resolve(30,b,17,b)].
0.77/1.03	Derived: age(A,B) != zero | dissimilar(A,B,C) | -greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(30,b,18,a)].
0.77/1.03	31 has_endowment(A) | -organization(A) | smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) # label(definition_1) # label(axiom).  [clausify(9)].
0.77/1.03	Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta).  [resolve(31,b,16,a)].
0.77/1.03	Derived: has_endowment(A) | smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C).  [resolve(31,b,18,a)].
0.77/1.03	32 -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | -robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
0.77/1.03	33 robust_position(c1) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	34 greater(age(A,f2(A)),tau) | positional_advantage(A,f2(A)) | robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
1.66/1.98	35 greater(age(A,f2(A)),tau) | smaller_or_equal(age(A,f2(A)),tau) | robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
1.66/1.98	Derived: -smaller_or_equal(age(c1,A),tau) | -positional_advantage(c1,A).  [resolve(32,c,33,a)].
1.66/1.98	Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | greater(age(A,f2(A)),tau) | positional_advantage(A,f2(A)).  [resolve(32,c,34,c)].
1.66/1.98	Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | greater(age(A,f2(A)),tau) | smaller_or_equal(age(A,f2(A)),tau).  [resolve(32,c,35,c)].
1.66/1.98	36 -greater(age(A,B),tau) | positional_advantage(A,B) | -robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
1.66/1.98	Derived: -greater(age(c1,A),tau) | positional_advantage(c1,A).  [resolve(36,c,33,a)].
1.66/1.98	Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | greater(age(A,f2(A)),tau) | positional_advantage(A,f2(A)).  [resolve(36,c,34,c)].
1.66/1.98	Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | greater(age(A,f2(A)),tau) | smaller_or_equal(age(A,f2(A)),tau).  [resolve(36,c,35,c)].
1.66/1.98	37 -positional_advantage(A,f2(A)) | smaller_or_equal(age(A,f2(A)),tau) | robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
1.66/1.98	Derived: -positional_advantage(A,f2(A)) | smaller_or_equal(age(A,f2(A)),tau) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B).  [resolve(37,c,32,c)].
1.66/1.98	Derived: -positional_advantage(A,f2(A)) | smaller_or_equal(age(A,f2(A)),tau) | -greater(age(A,B),tau) | positional_advantage(A,B).  [resolve(37,c,36,c)].
1.66/1.98	38 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
1.66/1.98	39 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
1.66/1.98	40 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
1.66/1.98	
1.66/1.98	============================== end predicate elimination =============
1.66/1.98	
1.66/1.98	Auto_denials:  (non-Horn, no changes).
1.66/1.98	
1.66/1.98	Term ordering decisions:
1.66/1.98	Function symbol KB weights:  tau=1. zero=1. sigma=1. eta=1. low=1. mod1=1. mod2=1. high=1. very_low=1. c1=1. c2=1. c3=1. c4=1. c5=1. age=1. hazard_of_mortality=1. f1=1. f2=1.
1.66/1.98	
1.66/1.98	============================== end of process initial clauses ========
1.66/1.98	
1.66/1.98	============================== CLAUSES FOR SEARCH ====================
1.66/1.98	
1.66/1.98	============================== end of clauses for search =============
1.66/1.98	
1.66/1.98	============================== SEARCH ================================
1.66/1.98	
1.66/1.98	% Starting search at 0.02 seconds.
1.66/1.98	
1.66/1.98	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 113 (0.00 of 0.26 sec).
1.66/1.98	
1.66/1.98	Low Water (keep): wt=15.000, iters=3373
1.66/1.98	
1.66/1.98	============================== PROOF =================================
1.66/1.98	% SZS status Theorem
1.66/1.98	% SZS output start Refutation
1.66/1.98	
1.66/1.98	% Proof 1 at 0.94 (+ 0.03) seconds.
1.66/1.98	% Length of proof is 106.
1.66/1.98	% Level of proof is 15.
1.66/1.98	% Maximum clause weight is 21.000.
1.66/1.98	% Given clauses 1544.
1.66/1.98	
1.66/1.98	1 (all X all Y (smaller_or_equal(X,Y) <-> X = Y | smaller(X,Y))) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause).  [assumption].
1.66/1.98	3 (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].
1.66/1.98	4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
1.66/1.98	5 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
1.66/1.98	6 (all X all Y (greater(X,Y) | X = Y | smaller(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause).  [assumption].
1.66/1.98	7 (all X all T (organization(X) -> (-has_immunity(X,T) -> (is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = low) & (-positional_advantage(X,T) & -is_aligned(X,T) -> hazard_of_mortality(X,T) = high) & (is_aligned(X,T) & -positional_advantage(X,T) -> mod2 = hazard_of_mortality(X,T)) & (-is_aligned(X,T) & positional_advantage(X,T) -> mod1 = 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].
1.66/1.98	8 (all X all T0 all T (age(X,T0) = zero & organization(X) -> (dissimilar(X,T0,T) <-> greater(age(X,T),sigma)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
1.66/1.98	10 (all X all T (-has_endowment(X) & organization(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
1.66/1.98	11 (all X ((all T ((greater(age(X,T),tau) -> positional_advantage(X,T)) & (smaller_or_equal(age(X,T),tau) -> -positional_advantage(X,T)))) <-> robust_position(X))) # label(definition_4) # label(axiom) # label(non_clause).  [assumption].
1.66/1.98	12 (all X all T (organization(X) & zero = age(X,T) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
1.66/1.98	13 (all X all T0 all T (organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)) <-> dissimilar(X,T0,T))) # label(definition_2) # label(axiom) # label(non_clause).  [assumption].
1.66/1.98	14 -(all X all T0 all T1 all T2 all T3 (organization(X) & -has_endowment(X) & smaller_or_equal(age(X,T1),tau) & greater(age(X,T2),tau) & greater(age(X,T3),sigma) & smaller_or_equal(age(X,T2),sigma) & greater(sigma,tau) & greater(tau,zero) & greater(sigma,zero) & age(X,T0) = zero & robust_position(X) -> smaller(hazard_of_mortality(X,T2),hazard_of_mortality(X,T3)) & hazard_of_mortality(X,T0) = hazard_of_mortality(X,T1) & smaller(hazard_of_mortality(X,T3),hazard_of_mortality(X,T1)))) # label(theorem_10) # label(negated_conjecture) # label(non_clause).  [assumption].
1.66/1.98	15 has_endowment(A) | -organization(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(10)].
1.66/1.98	16 organization(c1) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	18 organization(A) | -dissimilar(A,B,C) # label(definition_2) # label(axiom).  [clausify(13)].
1.66/1.98	20 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(12)].
1.66/1.98	21 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2) # label(axiom).  [clausify(13)].
1.66/1.98	25 -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(7)].
1.66/1.98	27 -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(7)].
1.66/1.98	28 -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(7)].
1.66/1.98	29 age(A,B) != zero | -organization(A) | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(8)].
1.66/1.98	30 age(A,B) != zero | -organization(A) | dissimilar(A,B,C) | -greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(8)].
1.66/1.98	32 -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | -robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
1.66/1.98	33 robust_position(c1) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	36 -greater(age(A,B),tau) | positional_advantage(A,B) | -robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
1.66/1.98	43 greater(mod2,mod1) # label(assumption_19) # label(axiom).  [assumption].
1.66/1.98	46 greater(mod1,low) # label(assumption_18b) # label(axiom).  [assumption].
1.66/1.98	47 greater(sigma,tau) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	48 greater(tau,zero) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	50 smaller_or_equal(age(c1,c3),tau) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	51 greater(age(c1,c4),tau) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	52 greater(age(c1,c5),sigma) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	53 smaller_or_equal(age(c1,c4),sigma) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	54 age(c1,c2) = zero # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	55 greater(A,B) | B = A | smaller(A,B) # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(6)].
1.66/1.98	56 -has_endowment(c1) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	57 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom).  [clausify(4)].
1.66/1.98	59 -is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,B,C) # label(definition_2) # label(axiom).  [clausify(13)].
1.66/1.98	60 -smaller(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c5)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) | -smaller(hazard_of_mortality(c1,c5),hazard_of_mortality(c1,c3)) # label(theorem_10) # label(negated_conjecture).  [clausify(14)].
1.66/1.98	62 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
1.66/1.98	63 -greater(A,B) | smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(5)].
1.66/1.98	64 greater(A,B) | -smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(5)].
1.66/1.98	65 -smaller_or_equal(A,B) | B = A | smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
1.66/1.98	66 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive) # label(axiom).  [clausify(3)].
1.66/1.98	69 has_endowment(c1) | -has_immunity(c1,A).  [resolve(15,b,16,a)].
1.66/1.98	70 -has_immunity(c1,A).  [copy(69),unit_del(a,56)].
1.66/1.98	74 age(c1,A) != zero | is_aligned(c1,A).  [resolve(20,a,16,a)].
1.66/1.98	77 -is_aligned(c1,A) | is_aligned(c1,B) | dissimilar(c1,A,B).  [resolve(21,a,16,a)].
1.66/1.98	86 has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low.  [resolve(25,a,16,a)].
1.66/1.98	87 -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low.  [copy(86),unit_del(a,70)].
1.66/1.98	94 has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2.  [resolve(27,a,16,a)].
1.66/1.98	95 -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2.  [copy(94),unit_del(a,70)].
1.66/1.98	98 has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1.  [resolve(28,a,16,a)].
1.66/1.98	99 is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1.  [copy(98),unit_del(a,70)].
1.66/1.98	104 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(29,b,18,a)].
1.66/1.98	105 age(c1,A) != zero | dissimilar(c1,A,B) | -greater(age(c1,B),sigma).  [resolve(30,b,16,a)].
1.66/1.98	110 -smaller_or_equal(age(c1,A),tau) | -positional_advantage(c1,A).  [resolve(32,c,33,a)].
1.66/1.98	113 -greater(age(c1,A),tau) | positional_advantage(c1,A).  [resolve(36,c,33,a)].
1.66/1.98	118 -greater(A,A).  [factor(57,a,b)].
1.66/1.98	121 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma).  [factor(104,b,d)].
1.66/1.98	140 smaller(zero,tau).  [resolve(63,a,48,a)].
1.66/1.98	142 smaller(low,mod1).  [resolve(63,a,46,a)].
1.66/1.98	145 smaller(mod1,mod2).  [resolve(63,a,43,a)].
1.66/1.98	148 greater(A,B) | greater(B,A) | A = B.  [resolve(64,b,55,c)].
1.66/1.98	149 age(c1,c4) = sigma | smaller(age(c1,c4),sigma).  [resolve(65,a,53,a),flip(a)].
1.66/1.98	151 -greater(sigma,A) | greater(age(c1,c5),A).  [resolve(66,a,52,a)].
1.66/1.98	167 -greater(A,mod1) | greater(A,low).  [resolve(66,b,46,a)].
1.66/1.98	173 is_aligned(c1,c2).  [resolve(74,a,54,a)].
1.66/1.98	176 age(c1,A) != zero | dissimilar(c1,A,c5).  [resolve(105,c,52,a)].
1.66/1.98	177 -positional_advantage(c1,c3).  [resolve(110,a,50,a)].
1.66/1.98	178 -smaller_or_equal(zero,tau) | -positional_advantage(c1,c2).  [para(54(a,1),110(a,1))].
1.66/1.98	179 positional_advantage(c1,c4).  [resolve(113,a,51,a)].
1.66/1.98	180 -smaller(A,A).  [ur(64,a,118,a)].
1.66/1.98	192 smaller_or_equal(zero,tau).  [resolve(140,a,62,b)].
1.66/1.98	193 -positional_advantage(c1,c2).  [back_unit_del(178),unit_del(a,192)].
1.66/1.98	207 -greater(age(c1,c3),tau).  [ur(113,b,177,a)].
1.66/1.98	210 hazard_of_mortality(c1,c2) = mod2.  [resolve(173,a,95,a),unit_del(a,193)].
1.66/1.98	212 is_aligned(c1,A) | dissimilar(c1,c2,A).  [resolve(173,a,77,a)].
1.66/1.98	215 -smaller(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c5)) | hazard_of_mortality(c1,c3) != mod2 | -smaller(hazard_of_mortality(c1,c5),hazard_of_mortality(c1,c3)).  [back_rewrite(60),rewrite([210(13)])].
1.66/1.98	217 -is_aligned(c1,c4) | hazard_of_mortality(c1,c4) = low.  [resolve(179,a,87,b)].
1.66/1.98	251 age(c1,c4) = sigma | greater(sigma,age(c1,c4)).  [resolve(149,b,64,b)].
1.66/1.98	266 -greater(age(c1,c3),sigma).  [ur(66,b,47,a,c,207,a)].
1.66/1.98	277 greater(age(c1,c5),tau).  [resolve(151,a,47,a)].
1.66/1.98	279 -dissimilar(c1,c2,c3).  [ur(121,a,54,a,c,266,a)].
1.66/1.98	298 positional_advantage(c1,c5).  [resolve(277,a,113,a)].
1.66/1.98	307 is_aligned(c1,c5) | hazard_of_mortality(c1,c5) = mod1.  [resolve(298,a,99,b)].
1.66/1.98	322 greater(A,low) | greater(mod1,A) | mod1 = A.  [resolve(167,a,148,b)].
1.66/1.98	342 is_aligned(c1,c3).  [resolve(212,b,279,a)].
1.66/1.98	343 is_aligned(c1,A) | greater(age(c1,A),sigma).  [resolve(212,b,121,b),rewrite([54(5)]),xx(b)].
1.66/1.98	344 hazard_of_mortality(c1,c3) = mod2.  [resolve(342,a,95,a),unit_del(a,177)].
1.66/1.98	349 -smaller(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c5)) | -smaller(hazard_of_mortality(c1,c5),mod2).  [back_rewrite(215),rewrite([344(10),344(16)]),xx(b)].
1.66/1.98	351 dissimilar(c1,c2,c5).  [resolve(176,a,54,a)].
1.66/1.98	353 -is_aligned(c1,c5).  [resolve(351,a,59,c),unit_del(a,173)].
1.66/1.98	354 hazard_of_mortality(c1,c5) = mod1.  [back_unit_del(307),unit_del(a,353)].
1.66/1.98	357 -smaller(hazard_of_mortality(c1,c4),mod1).  [back_rewrite(349),rewrite([354(6),354(8)]),unit_del(b,145)].
1.66/1.98	362 -greater(mod1,hazard_of_mortality(c1,c4)).  [ur(63,b,357,a)].
1.66/1.98	380 greater(age(c1,c4),sigma) | hazard_of_mortality(c1,c4) = low.  [resolve(343,a,217,a)].
1.66/1.98	670 greater(hazard_of_mortality(c1,c4),low) | hazard_of_mortality(c1,c4) = mod1.  [resolve(322,b,362,a),flip(b)].
1.66/1.98	1189 age(c1,c4) = sigma | -greater(age(c1,c4),sigma).  [resolve(251,b,57,b)].
1.66/1.98	2029 hazard_of_mortality(c1,c4) = low | smaller(sigma,age(c1,c4)).  [resolve(380,a,63,a)].
1.66/1.98	5050 hazard_of_mortality(c1,c4) = mod1 | smaller(low,hazard_of_mortality(c1,c4)).  [resolve(670,a,63,a)].
1.66/1.98	5999 age(c1,c4) = sigma | hazard_of_mortality(c1,c4) = low.  [resolve(1189,b,380,a)].
1.66/1.98	6040 age(c1,c4) = sigma.  [para(5999(b,1),357(a,1)),unit_del(b,142)].
1.66/1.98	6337 hazard_of_mortality(c1,c4) = low.  [back_rewrite(2029),rewrite([6040(9)]),unit_del(b,180)].
1.66/1.98	6342 mod1 = low.  [back_rewrite(5050),rewrite([6337(3),6337(7)]),flip(a),unit_del(b,180)].
1.66/1.98	6618 $F.  [back_rewrite(142),rewrite([6342(2)]),unit_del(a,180)].
1.66/1.98	
1.66/1.98	% SZS output end Refutation
1.66/1.98	============================== end of proof ==========================
1.66/1.98	
1.66/1.98	============================== STATISTICS ============================
1.66/1.98	
1.66/1.98	Given=1544. Generated=34267. Kept=6570. proofs=1.
1.66/1.98	Usable=878. Sos=2023. Demods=7. Limbo=276, Disabled=3491. Hints=0.
1.66/1.98	Megabytes=6.46.
1.66/1.98	User_CPU=0.94, System_CPU=0.03, Wall_clock=1.
1.66/1.98	
1.66/1.98	============================== end of statistics =====================
1.66/1.98	
1.66/1.98	============================== end of search =========================
1.66/1.98	
1.66/1.98	THEOREM PROVED
1.66/1.98	% SZS status Theorem
1.66/1.98	
1.66/1.98	Exiting with 1 proof.
1.66/1.98	
1.66/1.98	Process 15295 exit (max_proofs) Mon Jul  3 05:34:00 2023
1.66/1.98	Prover9 interrupted
1.66/1.98	EOF