0.07/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n019.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 : 1440
0.13/0.34	% WCLimit  : 180
0.13/0.34	% DateTime : Mon Jul  3 04:23:05 EDT 2023
0.13/0.34	% CPUTime  : 
0.45/1.00	============================== Prover9 ===============================
0.45/1.00	Prover9 (32) version 2009-11A, November 2009.
0.45/1.00	Process 5274 was started by sandbox2 on n019.cluster.edu,
0.45/1.00	Mon Jul  3 04:23:05 2023
0.45/1.00	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_4865_n019.cluster.edu".
0.45/1.00	============================== end of head ===========================
0.45/1.00	
0.45/1.00	============================== INPUT =================================
0.45/1.00	
0.45/1.00	% Reading from file /tmp/Prover9_4865_n019.cluster.edu
0.45/1.00	
0.45/1.00	set(prolog_style_variables).
0.45/1.00	set(auto2).
0.45/1.00	    % set(auto2) -> set(auto).
0.45/1.00	    % set(auto) -> set(auto_inference).
0.45/1.00	    % set(auto) -> set(auto_setup).
0.45/1.00	    % set(auto_setup) -> set(predicate_elim).
0.45/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.45/1.00	    % set(auto) -> set(auto_limits).
0.45/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.45/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.45/1.00	    % set(auto) -> set(auto_denials).
0.45/1.00	    % set(auto) -> set(auto_process).
0.45/1.00	    % set(auto2) -> assign(new_constants, 1).
0.45/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.45/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.45/1.00	    % set(auto2) -> assign(max_hours, 1).
0.45/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.45/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.45/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.45/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.45/1.00	    % set(auto2) -> set(sort_initial_sos).
0.45/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.45/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.45/1.00	    % set(auto2) -> assign(max_megs, 400).
0.45/1.00	    % set(auto2) -> assign(stats, some).
0.45/1.00	    % set(auto2) -> clear(echo_input).
0.45/1.00	    % set(auto2) -> set(quiet).
0.45/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.45/1.00	    % set(auto2) -> clear(print_given).
0.45/1.00	assign(lrs_ticks,-1).
0.45/1.00	assign(sos_limit,10000).
0.45/1.00	assign(order,kbo).
0.45/1.00	set(lex_order_vars).
0.45/1.00	clear(print_given).
0.45/1.00	
0.45/1.00	% formulas(sos).  % not echoed (14 formulas)
0.45/1.00	
0.45/1.00	============================== end of input ==========================
0.45/1.00	
0.45/1.00	% From the command line: assign(max_seconds, 1440).
0.45/1.00	
0.45/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.45/1.00	
0.45/1.00	% Formulas that are not ordinary clauses:
0.45/1.00	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.45/1.00	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.45/1.00	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.45/1.00	4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.45/1.00	5 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.45/1.00	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.45/1.00	7 (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.45/1.00	8 (all X all T (age(X,T) = zero & organization(X) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.45/1.00	9 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.00	10 (all X all T0 all T (zero = age(X,T0) & organization(X) -> (dissimilar(X,T0,T) <-> greater(age(X,T),sigma)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.45/1.00	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.45/1.00	12 (all X all T (organization(X) -> (has_immunity(X,T) -> very_low = hazard_of_mortality(X,T)) & (-has_immunity(X,T) -> (is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = low) & (-is_aligned(X,T) & positional_advantage(X,T) -> mod1 = hazard_of_mortality(X,T)) & (is_aligned(X,T) & -positional_advantage(X,T) -> mod2 = hazard_of_mortality(X,T)) & (-is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = high)))) # label(assumption_17) # label(axiom) # label(non_clause).  [assumption].
0.45/1.00	13 -(all X all T0 all T1 all T2 (organization(X) & -has_endowment(X) & age(X,T0) = zero & greater(sigma,zero) & greater(tau,zero) & sigma = tau & smaller_or_equal(age(X,T1),sigma) & greater(age(X,T2),sigma) & robust_position(X) -> hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0) & smaller(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)))) # label(theorem_8) # label(negated_conjecture) # label(non_clause).  [assumption].
0.45/1.00	
0.45/1.00	============================== end of process non-clausal formulas ===
0.45/1.00	
0.45/1.00	============================== PROCESS INITIAL CLAUSES ===============
0.45/1.00	
0.45/1.00	============================== PREDICATE ELIMINATION =================
0.45/1.00	14 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(9)].
0.45/1.00	15 organization(c1) # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.00	16 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom).  [clausify(7)].
0.45/1.00	Derived: has_endowment(c1) | -has_immunity(c1,A).  [resolve(14,a,15,a)].
0.45/1.00	Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D).  [resolve(14,a,16,b)].
0.45/1.00	17 age(A,B) != zero | -organization(A) | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(8)].
0.45/1.00	Derived: age(c1,A) != zero | is_aligned(c1,A).  [resolve(17,b,15,a)].
0.45/1.00	Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D).  [resolve(17,b,16,b)].
0.45/1.00	18 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom).  [clausify(12)].
0.45/1.00	Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low.  [resolve(18,a,15,a)].
0.45/1.00	Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D).  [resolve(18,a,16,b)].
0.45/1.00	19 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,C) | is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(7)].
0.45/1.00	Derived: dissimilar(c1,A,B) | -is_aligned(c1,B) | is_aligned(c1,A).  [resolve(19,b,15,a)].
0.45/1.00	Derived: dissimilar(A,B,C) | -is_aligned(A,C) | is_aligned(A,B) | -dissimilar(A,D,E).  [resolve(19,b,16,b)].
0.45/1.00	20 dissimilar(A,B,C) | -organization(A) | is_aligned(A,C) | -is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(7)].
0.45/1.00	Derived: dissimilar(c1,A,B) | is_aligned(c1,B) | -is_aligned(c1,A).  [resolve(20,b,15,a)].
0.45/1.00	Derived: dissimilar(A,B,C) | is_aligned(A,C) | -is_aligned(A,B) | -dissimilar(A,D,E).  [resolve(20,b,16,b)].
0.45/1.00	21 age(A,B) != zero | -organization(A) | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(10)].
0.45/1.00	Derived: age(c1,A) != zero | -dissimilar(c1,A,B) | greater(age(c1,B),sigma).  [resolve(21,b,15,a)].
0.45/1.00	Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(21,b,16,b)].
0.45/1.00	22 age(A,B) != zero | -organization(A) | dissimilar(A,B,C) | -greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(10)].
0.45/1.00	Derived: age(c1,A) != zero | dissimilar(c1,A,B) | -greater(age(c1,B),sigma).  [resolve(22,b,15,a)].
0.45/1.00	Derived: age(A,B) != zero | dissimilar(A,B,C) | -greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(22,b,16,b)].
0.45/1.00	23 -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(12)].
0.45/1.00	Derived: has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low.  [resolve(23,a,15,a)].
0.45/1.00	Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D).  [resolve(23,a,16,b)].
0.45/1.00	24 -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(12)].
0.45/1.01	Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1.  [resolve(24,a,15,a)].
0.45/1.01	Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D).  [resolve(24,a,16,b)].
0.45/1.01	25 -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(12)].
0.45/1.01	Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2.  [resolve(25,a,15,a)].
0.45/1.01	Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D).  [resolve(25,a,16,b)].
0.45/1.01	26 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17) # label(axiom).  [clausify(12)].
0.45/1.01	Derived: has_immunity(c1,A) | is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = high.  [resolve(26,a,15,a)].
0.45/1.01	Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D).  [resolve(26,a,16,b)].
0.45/1.01	27 -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | -robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
0.45/1.01	28 robust_position(c1) # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.01	29 greater(age(A,f1(A)),tau) | positional_advantage(A,f1(A)) | robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
0.45/1.01	30 greater(age(A,f1(A)),tau) | smaller_or_equal(age(A,f1(A)),tau) | robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
0.45/1.01	Derived: -smaller_or_equal(age(c1,A),tau) | -positional_advantage(c1,A).  [resolve(27,c,28,a)].
0.45/1.01	Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | greater(age(A,f1(A)),tau) | positional_advantage(A,f1(A)).  [resolve(27,c,29,c)].
0.45/1.01	Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | greater(age(A,f1(A)),tau) | smaller_or_equal(age(A,f1(A)),tau).  [resolve(27,c,30,c)].
0.45/1.01	31 -greater(age(A,B),tau) | positional_advantage(A,B) | -robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
0.45/1.01	Derived: -greater(age(c1,A),tau) | positional_advantage(c1,A).  [resolve(31,c,28,a)].
0.45/1.01	Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | greater(age(A,f1(A)),tau) | positional_advantage(A,f1(A)).  [resolve(31,c,29,c)].
0.45/1.01	Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | greater(age(A,f1(A)),tau) | smaller_or_equal(age(A,f1(A)),tau).  [resolve(31,c,30,c)].
0.45/1.01	32 -positional_advantage(A,f1(A)) | smaller_or_equal(age(A,f1(A)),tau) | robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
0.45/1.01	Derived: -positional_advantage(A,f1(A)) | smaller_or_equal(age(A,f1(A)),tau) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B).  [resolve(32,c,27,c)].
0.45/1.01	Derived: -positional_advantage(A,f1(A)) | smaller_or_equal(age(A,f1(A)),tau) | -greater(age(A,B),tau) | positional_advantage(A,B).  [resolve(32,c,31,c)].
0.45/1.01	33 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.45/1.01	34 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.45/1.01	35 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.45/1.01	
0.45/1.01	============================== end predicate elimination =============
0.45/1.01	
0.45/1.01	Auto_denials:  (non-Horn, no changes).
0.45/1.01	
0.45/1.01	Term ordering decisions:
0.45/1.01	
0.45/1.01	% Assigning unary symbol f1 kb_weight 0 and highest precedence (24).
0.45/1.01	Function symbol KB weights:  tau=1. zero=1. sigma=1. mod1=1. mod2=1. high=1. low=1. very_low=1. c1=1. c2=1. c3=1. c4=1. age=1. hazard_of_mortality=1. f1=0.
0.45/1.01	
0.45/1.01	============================== end of process initial clauses ========
0.45/1.01	
0.45/1.01	============================== CLAUSES FOR SEARCH ====================
0.45/1.01	
0.45/1.01	============================== end of clauses for search =============
0.45/1.01	
0.45/1.01	============================== SEARCH ================================
0.45/1.01	
0.45/1.01	% Starting search at 0.02 seconds.
0.45/1.02	
0.45/1.02	============================== PROOF =================================
0.45/1.02	% SZS status Theorem
0.45/1.02	% SZS output start Refutation
0.45/1.02	
0.45/1.02	% Proof 1 at 0.03 (+ 0.00) seconds.
0.45/1.02	% Length of proof is 72.
0.45/1.02	% Level of proof is 11.
0.45/1.02	% Maximum clause weight is 18.000.
0.45/1.02	% Given clauses 106.
0.45/1.02	
0.45/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.45/1.02	5 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	7 (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.45/1.02	8 (all X all T (age(X,T) = zero & organization(X) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	9 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	10 (all X all T0 all T (zero = age(X,T0) & organization(X) -> (dissimilar(X,T0,T) <-> greater(age(X,T),sigma)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	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.45/1.02	12 (all X all T (organization(X) -> (has_immunity(X,T) -> very_low = hazard_of_mortality(X,T)) & (-has_immunity(X,T) -> (is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = low) & (-is_aligned(X,T) & positional_advantage(X,T) -> mod1 = hazard_of_mortality(X,T)) & (is_aligned(X,T) & -positional_advantage(X,T) -> mod2 = hazard_of_mortality(X,T)) & (-is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = high)))) # label(assumption_17) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	13 -(all X all T0 all T1 all T2 (organization(X) & -has_endowment(X) & age(X,T0) = zero & greater(sigma,zero) & greater(tau,zero) & sigma = tau & smaller_or_equal(age(X,T1),sigma) & greater(age(X,T2),sigma) & robust_position(X) -> hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0) & smaller(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)))) # label(theorem_8) # label(negated_conjecture) # label(non_clause).  [assumption].
0.45/1.02	14 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(9)].
0.45/1.02	15 organization(c1) # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.02	16 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom).  [clausify(7)].
0.45/1.02	17 age(A,B) != zero | -organization(A) | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(8)].
0.45/1.02	20 dissimilar(A,B,C) | -organization(A) | is_aligned(A,C) | -is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(7)].
0.45/1.02	21 age(A,B) != zero | -organization(A) | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(10)].
0.45/1.02	22 age(A,B) != zero | -organization(A) | dissimilar(A,B,C) | -greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(10)].
0.45/1.02	24 -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(12)].
0.45/1.02	25 -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(12)].
0.45/1.02	27 -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | -robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
0.45/1.02	28 robust_position(c1) # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.02	31 -greater(age(A,B),tau) | positional_advantage(A,B) | -robust_position(A) # label(definition_4) # label(axiom).  [clausify(11)].
0.45/1.02	36 greater(mod2,mod1) # label(assumption_19) # label(axiom).  [assumption].
0.45/1.02	38 greater(tau,zero) # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.02	39 tau = sigma # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.02	40 sigma = tau.  [copy(39),flip(a)].
0.45/1.02	41 age(c1,c2) = zero # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.02	42 smaller_or_equal(age(c1,c3),sigma) # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.02	43 smaller_or_equal(age(c1,c3),tau).  [copy(42),rewrite([40(4)])].
0.45/1.02	44 greater(age(c1,c4),sigma) # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.02	45 greater(age(c1,c4),tau).  [copy(44),rewrite([40(4)])].
0.45/1.02	47 -has_endowment(c1) # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.02	49 -dissimilar(A,B,C) | -is_aligned(A,C) | -is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(7)].
0.45/1.02	50 hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) | -smaller(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) # label(theorem_8) # label(negated_conjecture).  [clausify(13)].
0.45/1.02	52 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
0.45/1.02	53 -greater(A,B) | smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(5)].
0.45/1.02	58 has_endowment(c1) | -has_immunity(c1,A).  [resolve(14,a,15,a)].
0.45/1.02	59 -has_immunity(c1,A).  [copy(58),unit_del(a,47)].
0.45/1.02	61 age(c1,A) != zero | is_aligned(c1,A).  [resolve(17,b,15,a)].
0.45/1.02	66 dissimilar(c1,A,B) | is_aligned(c1,B) | -is_aligned(c1,A).  [resolve(20,b,15,a)].
0.45/1.02	70 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(21,b,16,b)].
0.45/1.02	71 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),tau) | -dissimilar(A,D,E).  [copy(70),rewrite([40(6)])].
0.45/1.02	72 age(c1,A) != zero | dissimilar(c1,A,B) | -greater(age(c1,B),sigma).  [resolve(22,b,15,a)].
0.45/1.02	73 age(c1,A) != zero | dissimilar(c1,A,B) | -greater(age(c1,B),tau).  [copy(72),rewrite([40(9)])].
0.45/1.02	79 has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1.  [resolve(24,a,15,a)].
0.45/1.02	80 is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1.  [copy(79),unit_del(a,59)].
0.45/1.02	82 has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2.  [resolve(25,a,15,a)].
0.45/1.02	83 -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2.  [copy(82),unit_del(a,59)].
0.45/1.02	88 -smaller_or_equal(age(c1,A),tau) | -positional_advantage(c1,A).  [resolve(27,c,28,a)].
0.45/1.02	91 -greater(age(c1,A),tau) | positional_advantage(c1,A).  [resolve(31,c,28,a)].
0.45/1.02	99 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),tau).  [factor(71,b,d)].
0.45/1.02	109 smaller(zero,tau).  [resolve(53,a,38,a)].
0.45/1.02	119 is_aligned(c1,c2).  [resolve(61,a,41,a)].
0.45/1.02	120 age(c1,A) != zero | dissimilar(c1,A,c4).  [resolve(73,c,45,a)].
0.45/1.02	122 -positional_advantage(c1,c3).  [resolve(88,a,43,a)].
0.45/1.02	123 -smaller_or_equal(zero,tau) | -positional_advantage(c1,c2).  [para(41(a,1),88(a,1))].
0.45/1.02	124 positional_advantage(c1,c4).  [resolve(91,a,45,a)].
0.45/1.02	131 -greater(age(c1,c3),tau).  [ur(91,b,122,a)].
0.45/1.02	132 smaller_or_equal(zero,tau).  [resolve(109,a,52,b)].
0.45/1.02	133 -positional_advantage(c1,c2).  [back_unit_del(123),unit_del(a,132)].
0.45/1.02	135 hazard_of_mortality(c1,c2) = mod2.  [resolve(119,a,83,a),unit_del(a,133)].
0.45/1.02	136 dissimilar(c1,c2,A) | is_aligned(c1,A).  [resolve(119,a,66,c)].
0.45/1.02	140 hazard_of_mortality(c1,c3) != mod2 | -smaller(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)).  [back_rewrite(50),rewrite([135(6)])].
0.45/1.02	146 is_aligned(c1,c4) | hazard_of_mortality(c1,c4) = mod1.  [resolve(124,a,80,b)].
0.45/1.02	162 -dissimilar(c1,c2,c3).  [ur(99,a,41,a,c,131,a)].
0.45/1.02	178 is_aligned(c1,c3).  [resolve(136,a,162,a)].
0.45/1.02	180 hazard_of_mortality(c1,c3) = mod2.  [resolve(178,a,83,a),unit_del(a,122)].
0.45/1.02	185 -smaller(hazard_of_mortality(c1,c4),mod2).  [back_rewrite(140),rewrite([180(3),180(9)]),xx(a)].
0.45/1.02	188 -greater(mod2,hazard_of_mortality(c1,c4)).  [ur(53,b,185,a)].
0.45/1.02	192 dissimilar(c1,c2,c4).  [resolve(120,a,41,a)].
0.45/1.02	195 -is_aligned(c1,c4).  [resolve(192,a,49,a),unit_del(b,119)].
0.45/1.02	196 hazard_of_mortality(c1,c4) = mod1.  [back_unit_del(146),unit_del(a,195)].
0.45/1.02	197 $F.  [back_rewrite(188),rewrite([196(4)]),unit_del(a,36)].
0.45/1.02	
0.45/1.02	% SZS output end Refutation
0.45/1.02	============================== end of proof ==========================
0.45/1.02	
0.45/1.02	============================== STATISTICS ============================
0.45/1.02	
0.45/1.02	Given=106. Generated=380. Kept=149. proofs=1.
0.45/1.02	Usable=100. Sos=28. Demods=5. Limbo=1, Disabled=91. Hints=0.
0.45/1.02	Megabytes=0.23.
0.45/1.02	User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
0.45/1.02	
0.45/1.02	============================== end of statistics =====================
0.45/1.02	
0.45/1.02	============================== end of search =========================
0.45/1.02	
0.45/1.02	THEOREM PROVED
0.45/1.02	% SZS status Theorem
0.45/1.02	
0.45/1.02	Exiting with 1 proof.
0.45/1.02	
0.45/1.02	Process 5274 exit (max_proofs) Mon Jul  3 04:23:05 2023
0.45/1.02	Prover9 interrupted
0.45/1.03	EOF