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 : n027.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 : 1920
0.12/0.33	% WCLimit  : 240
0.12/0.33	% DateTime : Wed Jul 30 01:59:49 EDT 2025
0.12/0.33	% CPUTime  : 
0.83/1.09	============================== Prover9 ===============================
0.83/1.09	Prover9 (32) version 2009-11A, November 2009.
0.83/1.09	Process 4131 was started by sandbox2 on n027.cluster.edu,
0.83/1.09	Wed Jul 30 01:59:50 2025
0.83/1.09	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1920 -f /tmp/Prover9_3893_n027.cluster.edu".
0.83/1.09	============================== end of head ===========================
0.83/1.09	
0.83/1.09	============================== INPUT =================================
0.83/1.09	
0.83/1.09	% Reading from file /tmp/Prover9_3893_n027.cluster.edu
0.83/1.09	
0.83/1.09	set(prolog_style_variables).
0.83/1.09	set(auto2).
0.83/1.09	    % set(auto2) -> set(auto).
0.83/1.09	    % set(auto) -> set(auto_inference).
0.83/1.09	    % set(auto) -> set(auto_setup).
0.83/1.09	    % set(auto_setup) -> set(predicate_elim).
0.83/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.83/1.09	    % set(auto) -> set(auto_limits).
0.83/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.83/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.83/1.09	    % set(auto) -> set(auto_denials).
0.83/1.09	    % set(auto) -> set(auto_process).
0.83/1.09	    % set(auto2) -> assign(new_constants, 1).
0.83/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.83/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.83/1.09	    % set(auto2) -> assign(max_hours, 1).
0.83/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.83/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.83/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.83/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.83/1.09	    % set(auto2) -> set(sort_initial_sos).
0.83/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.83/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.83/1.09	    % set(auto2) -> assign(max_megs, 400).
0.83/1.09	    % set(auto2) -> assign(stats, some).
0.83/1.09	    % set(auto2) -> clear(echo_input).
0.83/1.09	    % set(auto2) -> set(quiet).
0.83/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.83/1.09	    % set(auto2) -> clear(print_given).
0.83/1.09	assign(lrs_ticks,-1).
0.83/1.09	assign(sos_limit,10000).
0.83/1.09	assign(order,kbo).
0.83/1.09	set(lex_order_vars).
0.83/1.09	clear(print_given).
0.83/1.09	
0.83/1.09	% formulas(sos).  % not echoed (14 formulas)
0.83/1.09	
0.83/1.09	============================== end of input ==========================
0.83/1.09	
0.83/1.09	% From the command line: assign(max_seconds, 1920).
0.83/1.09	
0.83/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.83/1.09	
0.83/1.09	% Formulas that are not ordinary clauses:
0.83/1.09	1 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	2 (all X all Y (smaller(X,Y) | greater(X,Y) | Y = X)) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	3 (all X all Y all Z (greater(Y,Z) & greater(X,Y) -> greater(X,Z))) # label(meaning_postulate_greater_transitive) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	4 (all X all Y (greater_or_equal(X,Y) <-> X = Y | greater(X,Y))) # label(definition_greater_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	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.83/1.09	6 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	7 (all X all T0 all T (organization(X) & has_immunity(X,T0) & -has_immunity(X,T) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(assumption_3) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	8 (all X all T (-has_endowment(X) & organization(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	9 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	10 (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.83/1.09	11 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	12 (all X all T0 all T (organization(X) & is_aligned(X,T0) & -is_aligned(X,T) -> greater(capability(X,T0),capability(X,T)))) # label(assumption_14) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	13 (all X all T0 all T (organization(X) & zero = age(X,T0) -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	14 -(all X all T0 all T1 all T2 (organization(X) & -has_endowment(X) & smaller_or_equal(age(X,T1),sigma) & greater(age(X,T2),sigma) & greater(sigma,zero) & zero = age(X,T0) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)))) # label(theorem_5) # label(negated_conjecture) # label(non_clause).  [assumption].
0.83/1.09	
0.83/1.09	============================== end of process non-clausal formulas ===
0.83/1.09	
0.83/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.83/1.09	
0.83/1.09	============================== PREDICATE ELIMINATION =================
0.83/1.09	15 has_endowment(A) | -organization(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(8)].
0.83/1.09	16 organization(c1) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.83/1.09	17 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom).  [clausify(9)].
0.83/1.09	Derived: has_endowment(c1) | -has_immunity(c1,A).  [resolve(15,b,16,a)].
0.83/1.09	Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D).  [resolve(15,b,17,b)].
0.83/1.09	18 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(11)].
0.83/1.09	Derived: age(c1,A) != zero | is_aligned(c1,A).  [resolve(18,a,16,a)].
0.83/1.09	Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D).  [resolve(18,a,17,b)].
0.83/1.09	19 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom).  [clausify(9)].
0.83/1.09	Derived: dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B).  [resolve(19,b,16,a)].
0.83/1.09	Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -dissimilar(A,D,E).  [resolve(19,b,17,b)].
0.83/1.09	20 dissimilar(A,B,C) | -organization(A) | is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom).  [clausify(9)].
0.83/1.09	Derived: dissimilar(c1,A,B) | is_aligned(c1,A) | -is_aligned(c1,B).  [resolve(20,b,16,a)].
0.83/1.09	Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,D,E).  [resolve(20,b,17,b)].
0.83/1.09	21 -organization(A) | -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_3) # label(axiom).  [clausify(7)].
0.83/1.09	Derived: -has_immunity(c1,A) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(21,a,16,a)].
0.83/1.09	Derived: -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -dissimilar(A,D,E).  [resolve(21,a,17,b)].
0.83/1.09	22 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) # label(assumption_14) # label(axiom).  [clausify(12)].
0.83/1.09	Derived: -is_aligned(c1,A) | is_aligned(c1,B) | greater(capability(c1,A),capability(c1,B)).  [resolve(22,a,16,a)].
0.83/1.09	Derived: -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) | -dissimilar(A,D,E).  [resolve(22,a,17,b)].
0.83/1.09	23 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(13)].
0.83/1.09	Derived: age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B).  [resolve(23,a,16,a)].
0.83/1.09	Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(23,a,17,b)].
0.83/1.09	24 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(13)].
0.83/1.09	Derived: age(c1,A) != zero | greater(age(c1,B),sigma) | -dissimilar(c1,A,B).  [resolve(24,a,16,a)].
0.83/1.09	Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(24,a,17,b)].
0.83/1.09	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(10)].
0.83/1.09	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.83/1.10	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.83/1.10	26 A = B | smaller(B,A) | -smaller_or_equal(B,A) # label(definition_smaller_or_equal) # label(axiom).  [clausify(5)].
0.83/1.10	27 smaller_or_equal(age(c1,c3),sigma) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.83/1.10	28 A != B | smaller_or_equal(B,A) # label(definition_smaller_or_equal) # label(axiom).  [clausify(5)].
0.83/1.10	29 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(5)].
0.83/1.10	Derived: sigma = age(c1,c3) | smaller(age(c1,c3),sigma).  [resolve(26,c,27,a)].
0.83/1.10	30 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.83/1.10	31 smaller(A,B) | greater(A,B) | B = A # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(2)].
0.83/1.10	Derived: greater(A,B) | greater(B,A) | A = B.  [resolve(30,a,31,a)].
0.83/1.10	32 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.83/1.10	33 sigma = age(c1,c3) | smaller(age(c1,c3),sigma).  [resolve(26,c,27,a)].
0.83/1.10	Derived: sigma = age(c1,c3) | greater(sigma,age(c1,c3)).  [resolve(33,b,30,a)].
0.83/1.10	34 -greater_or_equal(A,B) | B = A | greater(A,B) # label(definition_greater_or_equal) # label(axiom).  [clausify(4)].
0.83/1.10	35 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom).  [clausify(4)].
0.83/1.10	36 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom).  [clausify(4)].
0.83/1.10	
0.83/1.10	============================== end predicate elimination =============
0.83/1.10	
0.83/1.10	Auto_denials:  (non-Horn, no changes).
0.83/1.10	
0.83/1.10	Term ordering decisions:
0.83/1.10	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.83/1.10	
0.83/1.10	============================== end of process initial clauses ========
0.83/1.10	
0.83/1.10	============================== CLAUSES FOR SEARCH ====================
0.83/1.10	
0.83/1.10	============================== end of clauses for search =============
0.83/1.10	
0.83/1.10	============================== SEARCH ================================
0.83/1.10	
0.83/1.10	% Starting search at 0.02 seconds.
0.83/1.10	
0.83/1.10	============================== PROOF =================================
0.83/1.10	% SZS status Theorem
0.83/1.10	% SZS output start Refutation
0.83/1.10	
0.83/1.10	% Proof 1 at 0.02 (+ 0.00) seconds.
0.83/1.10	% Length of proof is 54.
0.83/1.10	% Level of proof is 9.
0.83/1.10	% Maximum clause weight is 18.000.
0.83/1.10	% Given clauses 52.
0.83/1.10	
0.83/1.10	1 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.83/1.10	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.83/1.10	6 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.83/1.10	8 (all X all T (-has_endowment(X) & organization(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause).  [assumption].
0.83/1.10	9 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause).  [assumption].
0.83/1.10	10 (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.83/1.10	11 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause).  [assumption].
0.83/1.10	12 (all X all T0 all T (organization(X) & is_aligned(X,T0) & -is_aligned(X,T) -> greater(capability(X,T0),capability(X,T)))) # label(assumption_14) # label(axiom) # label(non_clause).  [assumption].
0.83/1.10	13 (all X all T0 all T (organization(X) & zero = age(X,T0) -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause).  [assumption].
0.83/1.10	14 -(all X all T0 all T1 all T2 (organization(X) & -has_endowment(X) & smaller_or_equal(age(X,T1),sigma) & greater(age(X,T2),sigma) & greater(sigma,zero) & zero = age(X,T0) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)))) # label(theorem_5) # label(negated_conjecture) # label(non_clause).  [assumption].
0.83/1.10	15 has_endowment(A) | -organization(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom).  [clausify(8)].
0.83/1.10	16 organization(c1) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.83/1.10	17 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom).  [clausify(9)].
0.83/1.10	18 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom).  [clausify(11)].
0.83/1.10	19 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom).  [clausify(9)].
0.83/1.10	22 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) # label(assumption_14) # label(axiom).  [clausify(12)].
0.83/1.10	23 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(13)].
0.83/1.10	24 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom).  [clausify(13)].
0.83/1.10	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(10)].
0.83/1.10	26 A = B | smaller(B,A) | -smaller_or_equal(B,A) # label(definition_smaller_or_equal) # label(axiom).  [clausify(5)].
0.83/1.10	27 smaller_or_equal(age(c1,c3),sigma) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.83/1.10	30 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(1)].
0.83/1.10	33 sigma = age(c1,c3) | smaller(age(c1,c3),sigma).  [resolve(26,c,27,a)].
0.83/1.10	38 greater(age(c1,c4),sigma) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.83/1.10	39 age(c1,c2) = zero # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.83/1.10	40 -has_endowment(c1) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.83/1.10	41 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom).  [clausify(6)].
0.83/1.10	42 -greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) # label(theorem_5) # label(negated_conjecture).  [clausify(14)].
0.83/1.10	43 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom).  [clausify(9)].
0.83/1.10	46 has_endowment(c1) | -has_immunity(c1,A).  [resolve(15,b,16,a)].
0.83/1.10	47 -has_immunity(c1,A).  [copy(46),unit_del(a,40)].
0.83/1.10	49 age(c1,A) != zero | is_aligned(c1,A).  [resolve(18,a,16,a)].
0.83/1.10	51 dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B).  [resolve(19,b,16,a)].
0.83/1.10	58 -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) | -dissimilar(A,D,E).  [resolve(22,a,17,b)].
0.83/1.10	59 age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B).  [resolve(23,a,16,a)].
0.83/1.10	62 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E).  [resolve(24,a,17,b)].
0.83/1.10	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.83/1.10	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.83/1.10	67 sigma = age(c1,c3) | greater(sigma,age(c1,c3)).  [resolve(33,b,30,a)].
0.83/1.10	68 age(c1,c3) = sigma | greater(sigma,age(c1,c3)).  [copy(67),flip(a)].
0.83/1.10	69 -greater(A,A).  [factor(41,a,b)].
0.83/1.10	72 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C).  [factor(62,c,d)].
0.83/1.10	79 is_aligned(c1,c2).  [resolve(49,a,39,a)].
0.83/1.10	80 age(c1,A) != zero | dissimilar(c1,A,c4).  [resolve(59,b,38,a)].
0.83/1.10	81 -greater(capability(c1,c3),capability(c1,c4)).  [ur(64,b,42,a)].
0.83/1.10	92 age(c1,c3) = sigma | -greater(age(c1,c3),sigma).  [resolve(68,b,41,b)].
0.83/1.10	98 dissimilar(c1,c2,A) | is_aligned(c1,A).  [resolve(79,a,51,b)].
0.83/1.10	106 is_aligned(c1,A) | greater(age(c1,A),sigma).  [resolve(98,a,72,c),rewrite([39(5)]),xx(b)].
0.83/1.10	110 dissimilar(c1,c2,c4).  [resolve(80,a,39,a)].
0.83/1.10	111 -is_aligned(c1,c4).  [resolve(110,a,43,a),unit_del(a,79)].
0.83/1.10	125 -is_aligned(c1,c3).  [ur(58,b,111,a,c,81,a,d,110,a)].
0.83/1.10	127 greater(age(c1,c3),sigma).  [resolve(125,a,106,a)].
0.83/1.10	132 age(c1,c3) = sigma.  [back_unit_del(92),unit_del(b,127)].
0.83/1.10	134 $F.  [back_rewrite(127),rewrite([132(3)]),unit_del(a,69)].
0.83/1.10	
0.83/1.10	% SZS output end Refutation
0.83/1.10	============================== end of proof ==========================
0.83/1.10	
0.83/1.10	============================== STATISTICS ============================
0.83/1.10	
0.83/1.10	Given=52. Generated=233. Kept=93. proofs=1.
0.83/1.10	Usable=51. Sos=30. Demods=2. Limbo=2, Disabled=61. Hints=0.
0.83/1.10	Megabytes=0.14.
0.83/1.10	User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
0.83/1.10	
0.83/1.10	============================== end of statistics =====================
0.83/1.10	
0.83/1.10	============================== end of search =========================
0.83/1.10	
0.83/1.10	THEOREM PROVED
0.83/1.10	% SZS status Theorem
0.83/1.10	
0.83/1.10	Exiting with 1 proof.
0.83/1.10	
0.83/1.10	Process 4131 exit (max_proofs) Wed Jul 30 01:59:50 2025
0.83/1.10	Prover9 interrupted
0.83/1.10	EOF