0.03/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n009.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit : 1440
0.12/0.33	% WCLimit  : 180
0.12/0.33	% DateTime : Mon Jul  3 03:24:56 EDT 2023
0.12/0.33	% CPUTime  : 
0.72/0.98	============================== Prover9 ===============================
0.72/0.98	Prover9 (32) version 2009-11A, November 2009.
0.72/0.98	Process 4671 was started by sandbox2 on n009.cluster.edu,
0.72/0.98	Mon Jul  3 03:24:57 2023
0.72/0.98	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_4289_n009.cluster.edu".
0.72/0.98	============================== end of head ===========================
0.72/0.98	
0.72/0.98	============================== INPUT =================================
0.72/0.98	
0.72/0.98	% Reading from file /tmp/Prover9_4289_n009.cluster.edu
0.72/0.98	
0.72/0.98	set(prolog_style_variables).
0.72/0.98	set(auto2).
0.72/0.98	    % set(auto2) -> set(auto).
0.72/0.98	    % set(auto) -> set(auto_inference).
0.72/0.98	    % set(auto) -> set(auto_setup).
0.72/0.98	    % set(auto_setup) -> set(predicate_elim).
0.72/0.98	    % set(auto_setup) -> assign(eq_defs, unfold).
0.72/0.98	    % set(auto) -> set(auto_limits).
0.72/0.98	    % set(auto_limits) -> assign(max_weight, "100.000").
0.72/0.98	    % set(auto_limits) -> assign(sos_limit, 20000).
0.72/0.98	    % set(auto) -> set(auto_denials).
0.72/0.98	    % set(auto) -> set(auto_process).
0.72/0.98	    % set(auto2) -> assign(new_constants, 1).
0.72/0.98	    % set(auto2) -> assign(fold_denial_max, 3).
0.72/0.98	    % set(auto2) -> assign(max_weight, "200.000").
0.72/0.98	    % set(auto2) -> assign(max_hours, 1).
0.72/0.98	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.72/0.98	    % set(auto2) -> assign(max_seconds, 0).
0.72/0.98	    % set(auto2) -> assign(max_minutes, 5).
0.72/0.98	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.72/0.98	    % set(auto2) -> set(sort_initial_sos).
0.72/0.98	    % set(auto2) -> assign(sos_limit, -1).
0.72/0.98	    % set(auto2) -> assign(lrs_ticks, 3000).
0.72/0.98	    % set(auto2) -> assign(max_megs, 400).
0.72/0.98	    % set(auto2) -> assign(stats, some).
0.72/0.98	    % set(auto2) -> clear(echo_input).
0.72/0.98	    % set(auto2) -> set(quiet).
0.72/0.98	    % set(auto2) -> clear(print_initial_clauses).
0.72/0.98	    % set(auto2) -> clear(print_given).
0.72/0.98	assign(lrs_ticks,-1).
0.72/0.98	assign(sos_limit,10000).
0.72/0.98	assign(order,kbo).
0.72/0.98	set(lex_order_vars).
0.72/0.98	clear(print_given).
0.72/0.98	
0.72/0.98	% formulas(sos).  % not echoed (14 formulas)
0.72/0.98	
0.72/0.98	============================== end of input ==========================
0.72/0.98	
0.72/0.98	% From the command line: assign(max_seconds, 1440).
0.72/0.98	
0.72/0.98	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.72/0.98	
0.72/0.98	% Formulas that are not ordinary clauses:
0.72/0.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].
0.72/0.98	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.72/0.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].
0.72/0.98	4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.72/0.98	5 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.72/0.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].
0.72/0.98	7 (all X all T0 all T (organization(X) & age(X,T0) = zero -> (dissimilar(X,T0,T) <-> greater(age(X,T),sigma)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.72/0.98	8 (all X all T0 all T (-has_immunity(X,T) & has_immunity(X,T0) & organization(X) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(assumption_3) # label(axiom) # label(non_clause).  [assumption].
0.72/0.98	9 (all X all T (age(X,T) = zero & organization(X) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.72/0.98	10 (all X all T0 all T (-is_aligned(X,T) & is_aligned(X,T0) & organization(X) -> greater(capability(X,T0),capability(X,T)))) # label(assumption_14) # label(axiom) # label(non_clause).  [assumption].
0.72/0.98	11 (all X all T0 all T (-has_immunity(X,T0) & greater(capability(X,T),capability(X,T0)) & -has_immunity(X,T) & organization(X) -> greater(hazard_of_mortality(X,T0),hazard_of_mortality(X,T)))) # label(assumption_16) # label(axiom) # label(non_clause).  [assumption].
0.72/0.98	12 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.72/0.98	13 (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.72/0.98	14 -(all X all T0 all T1 all T2 (organization(X) & zero = age(X,T0) & smaller_or_equal(age(X,T1),sigma) & greater(sigma,zero) & greater(age(X,T2),sigma) & -has_endowment(X) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)))) # label(theorem_5) # label(negated_conjecture) # label(non_clause).  [assumption].
0.72/0.98	
0.72/0.98	============================== end of process non-clausal formulas ===
0.72/0.98	
0.72/0.98	============================== PROCESS INITIAL CLAUSES ===============
0.72/0.98	
0.72/0.98	============================== PREDICATE ELIMINATION =================
0.72/0.98	15 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(12)].
0.72/0.98	16 organization(c1) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.72/0.98	17 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom).  [clausify(13)].
0.72/0.98	Derived: has_endowment(c1) | -has_immunity(c1,A).  [resolve(15,a,16,a)].
0.72/0.98	Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D).  [resolve(15,a,17,b)].
0.72/0.98	18 age(A,B) != zero | -organization(A) | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(9)].
0.72/0.98	Derived: age(c1,A) != zero | is_aligned(c1,A).  [resolve(18,b,16,a)].
0.72/0.98	Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D).  [resolve(18,b,17,b)].
0.72/0.98	19 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,C) | is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(13)].
0.72/0.98	Derived: dissimilar(c1,A,B) | -is_aligned(c1,B) | is_aligned(c1,A).  [resolve(19,b,16,a)].
0.72/0.98	Derived: dissimilar(A,B,C) | -is_aligned(A,C) | is_aligned(A,B) | -dissimilar(A,D,E).  [resolve(19,b,17,b)].
0.72/0.98	20 dissimilar(A,B,C) | -organization(A) | is_aligned(A,C) | -is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(13)].
0.72/0.98	Derived: dissimilar(c1,A,B) | is_aligned(c1,B) | -is_aligned(c1,A).  [resolve(20,b,16,a)].
0.72/0.98	Derived: dissimilar(A,B,C) | is_aligned(A,C) | -is_aligned(A,B) | -dissimilar(A,D,E).  [resolve(20,b,17,b)].
0.72/0.98	21 has_immunity(A,B) | -has_immunity(A,C) | -organization(A) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) # label(assumption_3) # label(axiom).  [clausify(8)].
0.72/0.98	Derived: has_immunity(c1,A) | -has_immunity(c1,B) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)).  [resolve(21,c,16,a)].
0.72/0.98	Derived: has_immunity(A,B) | -has_immunity(A,C) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) | -dissimilar(A,D,E).  [resolve(21,c,17,b)].
0.72/0.98	22 is_aligned(A,B) | -is_aligned(A,C) | -organization(A) | greater(capability(A,C),capability(A,B)) # label(assumption_14) # label(axiom).  [clausify(10)].
0.72/0.98	Derived: is_aligned(c1,A) | -is_aligned(c1,B) | greater(capability(c1,B),capability(c1,A)).  [resolve(22,c,16,a)].
0.72/0.98	Derived: is_aligned(A,B) | -is_aligned(A,C) | greater(capability(A,C),capability(A,B)) | -dissimilar(A,D,E).  [resolve(22,c,17,b)].
0.72/0.98	23 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(7)].
0.72/0.98	Derived: age(c1,A) != zero | -dissimilar(c1,A,B) | greater(age(c1,B),sigma).  [resolve(23,a,16,a)].
0.72/0.98	Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(23,a,17,b)].
0.72/0.98	24 -organization(A) | age(A,B) != zero | dissimilar(A,B,C) | -greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(7)].
0.72/0.98	Derived: age(c1,A) != zero | dissimilar(c1,A,B) | -greater(age(c1,B),sigma).  [resolve(24,a,16,a)].
0.72/0.98	Derived: age(A,B) != zero | dissimilar(A,B,C) | -greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(24,a,17,b)].
0.72/0.98	25 has_immunity(A,B) | -greater(capability(A,C),capability(A,B)) | has_immunity(A,C) | -organization(A) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) # label(assumption_16) # label(axiom).  [clausify(11)].
0.72/0.98	Derived: has_immunity(c1,A) | -greater(capability(c1,B),capability(c1,A)) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)).  [resolve(25,d,16,a)].
0.72/0.99	Derived: has_immunity(A,B) | -greater(capability(A,C),capability(A,B)) | has_immunity(A,C) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) | -dissimilar(A,D,E).  [resolve(25,d,17,b)].
0.72/0.99	26 -smaller_or_equal(A,B) | B = A | smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
0.72/0.99	27 smaller_or_equal(age(c1,c3),sigma) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.72/0.99	28 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
0.72/0.99	29 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
0.72/0.99	Derived: sigma = age(c1,c3) | smaller(age(c1,c3),sigma).  [resolve(26,a,27,a)].
0.72/0.99	30 greater(A,B) | -smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(5)].
0.72/0.99	31 greater(A,B) | B = A | smaller(A,B) # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(6)].
0.72/0.99	32 -greater(A,B) | smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(5)].
0.72/0.99	Derived: greater(A,B) | greater(B,A) | A = B.  [resolve(30,b,31,c)].
0.72/0.99	33 sigma = age(c1,c3) | smaller(age(c1,c3),sigma).  [resolve(26,a,27,a)].
0.72/0.99	Derived: sigma = age(c1,c3) | greater(sigma,age(c1,c3)).  [resolve(33,b,30,b)].
0.72/0.99	34 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.72/0.99	35 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.72/0.99	36 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.72/0.99	
0.72/0.99	============================== end predicate elimination =============
0.72/0.99	
0.72/0.99	Auto_denials:  (non-Horn, no changes).
0.72/0.99	
0.72/0.99	Term ordering decisions:
0.72/0.99	Function symbol KB weights:  sigma=1. zero=1. c1=1. c2=1. c3=1. c4=1. age=1. capability=1. hazard_of_mortality=1.
0.72/0.99	
0.72/0.99	============================== end of process initial clauses ========
0.72/0.99	
0.72/0.99	============================== CLAUSES FOR SEARCH ====================
0.72/0.99	
0.72/0.99	============================== end of clauses for search =============
0.72/0.99	
0.72/0.99	============================== SEARCH ================================
0.72/0.99	
0.72/0.99	% Starting search at 0.02 seconds.
0.72/0.99	
0.72/0.99	============================== PROOF =================================
0.72/0.99	% SZS status Theorem
0.72/0.99	% SZS output start Refutation
0.72/0.99	
0.72/0.99	% Proof 1 at 0.02 (+ 0.00) seconds.
0.72/0.99	% Length of proof is 54.
0.72/0.99	% Level of proof is 9.
0.72/0.99	% Maximum clause weight is 18.000.
0.72/0.99	% Given clauses 52.
0.72/0.99	
0.72/0.99	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.72/0.99	4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	5 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	7 (all X all T0 all T (organization(X) & age(X,T0) = zero -> (dissimilar(X,T0,T) <-> greater(age(X,T),sigma)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	9 (all X all T (age(X,T) = zero & organization(X) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	10 (all X all T0 all T (-is_aligned(X,T) & is_aligned(X,T0) & organization(X) -> greater(capability(X,T0),capability(X,T)))) # label(assumption_14) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	11 (all X all T0 all T (-has_immunity(X,T0) & greater(capability(X,T),capability(X,T0)) & -has_immunity(X,T) & organization(X) -> greater(hazard_of_mortality(X,T0),hazard_of_mortality(X,T)))) # label(assumption_16) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	12 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	13 (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.72/0.99	14 -(all X all T0 all T1 all T2 (organization(X) & zero = age(X,T0) & smaller_or_equal(age(X,T1),sigma) & greater(sigma,zero) & greater(age(X,T2),sigma) & -has_endowment(X) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)))) # label(theorem_5) # label(negated_conjecture) # label(non_clause).  [assumption].
0.72/0.99	15 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(12)].
0.72/0.99	16 organization(c1) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.72/0.99	17 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom).  [clausify(13)].
0.72/0.99	18 age(A,B) != zero | -organization(A) | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(9)].
0.72/0.99	20 dissimilar(A,B,C) | -organization(A) | is_aligned(A,C) | -is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(13)].
0.72/0.99	22 is_aligned(A,B) | -is_aligned(A,C) | -organization(A) | greater(capability(A,C),capability(A,B)) # label(assumption_14) # label(axiom).  [clausify(10)].
0.72/0.99	23 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(7)].
0.72/0.99	24 -organization(A) | age(A,B) != zero | dissimilar(A,B,C) | -greater(age(A,C),sigma) # label(assumption_15) # label(axiom).  [clausify(7)].
0.72/0.99	25 has_immunity(A,B) | -greater(capability(A,C),capability(A,B)) | has_immunity(A,C) | -organization(A) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) # label(assumption_16) # label(axiom).  [clausify(11)].
0.72/0.99	26 -smaller_or_equal(A,B) | B = A | smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
0.72/0.99	27 smaller_or_equal(age(c1,c3),sigma) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.72/0.99	30 greater(A,B) | -smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(5)].
0.72/0.99	33 sigma = age(c1,c3) | smaller(age(c1,c3),sigma).  [resolve(26,a,27,a)].
0.72/0.99	38 age(c1,c2) = zero # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.72/0.99	39 greater(age(c1,c4),sigma) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.72/0.99	40 -has_endowment(c1) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.72/0.99	41 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom).  [clausify(4)].
0.72/0.99	42 -greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.72/0.99	43 -dissimilar(A,B,C) | -is_aligned(A,C) | -is_aligned(A,B) # label(definition_2) # label(axiom).  [clausify(13)].
0.72/0.99	46 has_endowment(c1) | -has_immunity(c1,A).  [resolve(15,a,16,a)].
0.72/0.99	47 -has_immunity(c1,A).  [copy(46),unit_del(a,40)].
0.72/0.99	49 age(c1,A) != zero | is_aligned(c1,A).  [resolve(18,b,16,a)].
0.72/0.99	53 dissimilar(c1,A,B) | is_aligned(c1,B) | -is_aligned(c1,A).  [resolve(20,b,16,a)].
0.72/0.99	58 is_aligned(A,B) | -is_aligned(A,C) | greater(capability(A,C),capability(A,B)) | -dissimilar(A,D,E).  [resolve(22,c,17,b)].
0.72/0.99	60 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E).  [resolve(23,a,17,b)].
0.72/0.99	61 age(c1,A) != zero | dissimilar(c1,A,B) | -greater(age(c1,B),sigma).  [resolve(24,a,16,a)].
0.72/0.99	63 has_immunity(c1,A) | -greater(capability(c1,B),capability(c1,A)) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)).  [resolve(25,d,16,a)].
0.72/0.99	64 -greater(capability(c1,A),capability(c1,B)) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [copy(63),unit_del(a,47),unit_del(c,47)].
0.72/0.99	67 sigma = age(c1,c3) | greater(sigma,age(c1,c3)).  [resolve(33,b,30,b)].
0.72/0.99	68 age(c1,c3) = sigma | greater(sigma,age(c1,c3)).  [copy(67),flip(a)].
0.72/0.99	69 -greater(A,A).  [factor(41,a,b)].
0.72/0.99	72 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma).  [factor(60,b,d)].
0.72/0.99	79 is_aligned(c1,c2).  [resolve(49,a,38,a)].
0.72/0.99	80 age(c1,A) != zero | dissimilar(c1,A,c4).  [resolve(61,c,39,a)].
0.72/0.99	81 -greater(capability(c1,c3),capability(c1,c4)).  [ur(64,b,42,a)].
0.72/0.99	92 age(c1,c3) = sigma | -greater(age(c1,c3),sigma).  [resolve(68,b,41,b)].
0.72/0.99	97 dissimilar(c1,c2,A) | is_aligned(c1,A).  [resolve(79,a,53,c)].
0.72/0.99	107 is_aligned(c1,A) | greater(age(c1,A),sigma).  [resolve(97,a,72,b),rewrite([38(5)]),xx(b)].
0.72/0.99	110 dissimilar(c1,c2,c4).  [resolve(80,a,38,a)].
0.72/0.99	111 -is_aligned(c1,c4).  [resolve(110,a,43,a),unit_del(b,79)].
0.72/0.99	124 -is_aligned(c1,c3).  [ur(58,a,111,a,c,81,a,d,110,a)].
0.72/0.99	126 greater(age(c1,c3),sigma).  [resolve(124,a,107,a)].
0.72/0.99	131 age(c1,c3) = sigma.  [back_unit_del(92),unit_del(b,126)].
0.72/0.99	133 $F.  [back_rewrite(126),rewrite([131(3)]),unit_del(a,69)].
0.72/0.99	
0.72/0.99	% SZS output end Refutation
0.72/0.99	============================== end of proof ==========================
0.72/0.99	
0.72/0.99	============================== STATISTICS ============================
0.72/0.99	
0.72/0.99	Given=52. Generated=233. Kept=92. proofs=1.
0.72/0.99	Usable=51. Sos=29. Demods=2. Limbo=2, Disabled=61. Hints=0.
0.72/0.99	Megabytes=0.14.
0.72/0.99	User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
0.72/0.99	
0.72/0.99	============================== end of statistics =====================
0.72/0.99	
0.72/0.99	============================== end of search =========================
0.72/0.99	
0.72/0.99	THEOREM PROVED
0.72/0.99	% SZS status Theorem
0.72/0.99	
0.72/0.99	Exiting with 1 proof.
0.72/0.99	
0.72/0.99	Process 4671 exit (max_proofs) Mon Jul  3 03:24:57 2023
0.72/0.99	Prover9 interrupted
0.72/0.99	EOF