0.00/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.11	% Command  : tptp2X_and_run_prover9 %d %s
0.10/0.32	% Computer : n004.cluster.edu
0.10/0.32	% Model    : x86_64 x86_64
0.10/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory   : 8042.1875MB
0.10/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit : 1440
0.10/0.32	% WCLimit  : 180
0.10/0.32	% DateTime : Mon Jul  3 04:11:00 EDT 2023
0.10/0.32	% CPUTime  : 
0.75/1.06	============================== Prover9 ===============================
0.75/1.06	Prover9 (32) version 2009-11A, November 2009.
0.75/1.06	Process 17258 was started by sandbox2 on n004.cluster.edu,
0.75/1.06	Mon Jul  3 04:11:01 2023
0.75/1.06	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_17105_n004.cluster.edu".
0.75/1.06	============================== end of head ===========================
0.75/1.06	
0.75/1.06	============================== INPUT =================================
0.75/1.06	
0.75/1.06	% Reading from file /tmp/Prover9_17105_n004.cluster.edu
0.75/1.06	
0.75/1.06	set(prolog_style_variables).
0.75/1.06	set(auto2).
0.75/1.06	    % set(auto2) -> set(auto).
0.75/1.06	    % set(auto) -> set(auto_inference).
0.75/1.06	    % set(auto) -> set(auto_setup).
0.75/1.06	    % set(auto_setup) -> set(predicate_elim).
0.75/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.75/1.06	    % set(auto) -> set(auto_limits).
0.75/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.75/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.75/1.06	    % set(auto) -> set(auto_denials).
0.75/1.06	    % set(auto) -> set(auto_process).
0.75/1.06	    % set(auto2) -> assign(new_constants, 1).
0.75/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.75/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.75/1.06	    % set(auto2) -> assign(max_hours, 1).
0.75/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.75/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.75/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.75/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.75/1.06	    % set(auto2) -> set(sort_initial_sos).
0.75/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.75/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.75/1.06	    % set(auto2) -> assign(max_megs, 400).
0.75/1.06	    % set(auto2) -> assign(stats, some).
0.75/1.06	    % set(auto2) -> clear(echo_input).
0.75/1.06	    % set(auto2) -> set(quiet).
0.75/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.75/1.06	    % set(auto2) -> clear(print_given).
0.75/1.06	assign(lrs_ticks,-1).
0.75/1.06	assign(sos_limit,10000).
0.75/1.06	assign(order,kbo).
0.75/1.06	set(lex_order_vars).
0.75/1.06	clear(print_given).
0.75/1.06	
0.75/1.06	% formulas(sos).  % not echoed (10 formulas)
0.75/1.06	
0.75/1.06	============================== end of input ==========================
0.75/1.06	
0.75/1.06	% From the command line: assign(max_seconds, 1440).
0.75/1.06	
0.75/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.75/1.06	
0.75/1.06	% Formulas that are not ordinary clauses:
0.75/1.06	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.75/1.06	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.75/1.06	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.75/1.06	4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	5 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	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.75/1.06	7 (all X all T0 all T (organization(X) -> (greater(external_ties(X,T),external_ties(X,T0)) -> greater(position(X,T),position(X,T0))) & (external_ties(X,T0) = external_ties(X,T) -> position(X,T) = position(X,T0)))) # label(assumption_6) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	8 (all X all T0 all T (organization(X) -> (greater(internal_friction(X,T),internal_friction(X,T0)) & smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) -> smaller(capability(X,T),capability(X,T0))) & (internal_friction(X,T) = internal_friction(X,T0) & stock_of_knowledge(X,T0) = stock_of_knowledge(X,T) -> capability(X,T0) = capability(X,T)) & (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) -> greater(capability(X,T),capability(X,T0))))) # label(assumption_5) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	9 (all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) -> (greater(position(X,T),position(X,T0)) & greater_or_equal(capability(X,T),capability(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (position(X,T) = position(X,T0) & capability(X,T) = capability(X,T0) -> hazard_of_mortality(X,T0) = hazard_of_mortality(X,T)) & (greater(capability(X,T),capability(X,T0)) & greater_or_equal(position(X,T),position(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))))) # label(assumption_4) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	10 -(all X all T0 all T (-has_immunity(X,T) & -has_immunity(X,T0) & organization(X) -> (smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) & greater_or_equal(external_ties(X,T),external_ties(X,T0)) & greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) & greater(external_ties(X,T),external_ties(X,T0)) & greater_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))))) # label(lemma_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.75/1.06	
0.75/1.06	============================== end of process non-clausal formulas ===
0.75/1.06	
0.75/1.06	============================== PROCESS INITIAL CLAUSES ===============
0.75/1.06	
0.75/1.06	============================== PREDICATE ELIMINATION =================
0.75/1.06	11 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6) # label(axiom).  [clausify(7)].
0.75/1.06	12 organization(c1) # label(lemma_1) # label(negated_conjecture).  [clausify(10)].
0.75/1.06	Derived: -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)).  [resolve(11,a,12,a)].
0.75/1.06	13 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom).  [clausify(7)].
0.75/1.06	Derived: external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B).  [resolve(13,a,12,a)].
0.75/1.06	14 -organization(A) | -greater(internal_friction(A,B),internal_friction(A,C)) | -smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | smaller(capability(A,B),capability(A,C)) # label(assumption_5) # label(axiom).  [clausify(8)].
0.75/1.06	Derived: -greater(internal_friction(c1,A),internal_friction(c1,B)) | -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | smaller(capability(c1,A),capability(c1,B)).  [resolve(14,a,12,a)].
0.75/1.06	15 -organization(A) | internal_friction(A,B) != internal_friction(A,C) | stock_of_knowledge(A,B) != stock_of_knowledge(A,C) | capability(A,B) = capability(A,C) # label(assumption_5) # label(axiom).  [clausify(8)].
0.75/1.06	Derived: internal_friction(c1,A) != internal_friction(c1,B) | stock_of_knowledge(c1,A) != stock_of_knowledge(c1,B) | capability(c1,A) = capability(c1,B).  [resolve(15,a,12,a)].
0.75/1.06	16 -organization(A) | -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -smaller_or_equal(internal_friction(A,B),internal_friction(A,C)) | greater(capability(A,B),capability(A,C)) # label(assumption_5) # label(axiom).  [clausify(8)].
0.75/1.06	Derived: -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -smaller_or_equal(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,A),capability(c1,B)).  [resolve(16,a,12,a)].
0.75/1.06	17 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(position(A,C),position(A,B)) | -greater_or_equal(capability(A,C),capability(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4) # label(axiom).  [clausify(9)].
0.75/1.06	Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater(position(c1,B),position(c1,A)) | -greater_or_equal(capability(c1,B),capability(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(17,a,12,a)].
0.75/1.06	18 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | position(A,C) != position(A,B) | capability(A,C) != capability(A,B) | hazard_of_mortality(A,C) = hazard_of_mortality(A,B) # label(assumption_4) # label(axiom).  [clausify(9)].
0.75/1.06	Derived: has_immunity(c1,A) | has_immunity(c1,B) | position(c1,B) != position(c1,A) | capability(c1,B) != capability(c1,A) | hazard_of_mortality(c1,B) = hazard_of_mortality(c1,A).  [resolve(18,a,12,a)].
0.80/1.09	19 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | -greater_or_equal(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4) # label(axiom).  [clausify(9)].
0.80/1.09	Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(19,a,12,a)].
0.80/1.09	
0.80/1.09	============================== end predicate elimination =============
0.80/1.09	
0.80/1.09	Auto_denials:  (non-Horn, no changes).
0.80/1.09	
0.80/1.09	Term ordering decisions:
0.80/1.09	Function symbol KB weights:  c1=1. c2=1. c3=1. stock_of_knowledge=1. capability=1. external_ties=1. position=1. internal_friction=1. hazard_of_mortality=1.
0.80/1.09	
0.80/1.09	============================== end of process initial clauses ========
0.80/1.09	
0.80/1.09	============================== CLAUSES FOR SEARCH ====================
0.80/1.09	
0.80/1.09	============================== end of clauses for search =============
0.80/1.09	
0.80/1.09	============================== SEARCH ================================
0.80/1.09	
0.80/1.09	% Starting search at 0.01 seconds.
0.80/1.09	
0.80/1.09	============================== PROOF =================================
0.80/1.09	% SZS status Theorem
0.80/1.09	% SZS output start Refutation
0.80/1.09	
0.80/1.09	% Proof 1 at 0.03 (+ 0.00) seconds.
0.80/1.09	% Length of proof is 64.
0.80/1.09	% Level of proof is 16.
0.80/1.09	% Maximum clause weight is 27.000.
0.80/1.09	% Given clauses 130.
0.80/1.09	
0.80/1.09	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.80/1.09	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.80/1.09	4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
0.80/1.09	5 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
0.80/1.09	7 (all X all T0 all T (organization(X) -> (greater(external_ties(X,T),external_ties(X,T0)) -> greater(position(X,T),position(X,T0))) & (external_ties(X,T0) = external_ties(X,T) -> position(X,T) = position(X,T0)))) # label(assumption_6) # label(axiom) # label(non_clause).  [assumption].
0.80/1.09	8 (all X all T0 all T (organization(X) -> (greater(internal_friction(X,T),internal_friction(X,T0)) & smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) -> smaller(capability(X,T),capability(X,T0))) & (internal_friction(X,T) = internal_friction(X,T0) & stock_of_knowledge(X,T0) = stock_of_knowledge(X,T) -> capability(X,T0) = capability(X,T)) & (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) -> greater(capability(X,T),capability(X,T0))))) # label(assumption_5) # label(axiom) # label(non_clause).  [assumption].
0.80/1.09	9 (all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) -> (greater(position(X,T),position(X,T0)) & greater_or_equal(capability(X,T),capability(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (position(X,T) = position(X,T0) & capability(X,T) = capability(X,T0) -> hazard_of_mortality(X,T0) = hazard_of_mortality(X,T)) & (greater(capability(X,T),capability(X,T0)) & greater_or_equal(position(X,T),position(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))))) # label(assumption_4) # label(axiom) # label(non_clause).  [assumption].
0.80/1.09	10 -(all X all T0 all T (-has_immunity(X,T) & -has_immunity(X,T0) & organization(X) -> (smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) & greater_or_equal(external_ties(X,T),external_ties(X,T0)) & greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) & greater(external_ties(X,T),external_ties(X,T0)) & greater_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))))) # label(lemma_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.80/1.09	11 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6) # label(axiom).  [clausify(7)].
0.80/1.09	12 organization(c1) # label(lemma_1) # label(negated_conjecture).  [clausify(10)].
0.80/1.09	13 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom).  [clausify(7)].
0.80/1.09	14 -organization(A) | -greater(internal_friction(A,B),internal_friction(A,C)) | -smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | smaller(capability(A,B),capability(A,C)) # label(assumption_5) # label(axiom).  [clausify(8)].
0.80/1.09	15 -organization(A) | internal_friction(A,B) != internal_friction(A,C) | stock_of_knowledge(A,B) != stock_of_knowledge(A,C) | capability(A,B) = capability(A,C) # label(assumption_5) # label(axiom).  [clausify(8)].
0.80/1.09	16 -organization(A) | -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -smaller_or_equal(internal_friction(A,B),internal_friction(A,C)) | greater(capability(A,B),capability(A,C)) # label(assumption_5) # label(axiom).  [clausify(8)].
0.80/1.09	17 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(position(A,C),position(A,B)) | -greater_or_equal(capability(A,C),capability(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4) # label(axiom).  [clausify(9)].
0.80/1.09	19 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | -greater_or_equal(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4) # label(axiom).  [clausify(9)].
0.80/1.09	20 smaller_or_equal(internal_friction(c1,c3),internal_friction(c1,c2)) # label(lemma_1) # label(negated_conjecture).  [clausify(10)].
0.80/1.09	22 greater_or_equal(external_ties(c1,c3),external_ties(c1,c2)) | greater(external_ties(c1,c3),external_ties(c1,c2)) # label(lemma_1) # label(negated_conjecture).  [clausify(10)].
0.80/1.09	24 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater(external_ties(c1,c3),external_ties(c1,c2)) # label(lemma_1) # label(negated_conjecture).  [clausify(10)].
0.80/1.09	25 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater_or_equal(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) # label(lemma_1) # label(negated_conjecture).  [clausify(10)].
0.80/1.09	26 -has_immunity(c1,c3) # label(lemma_1) # label(negated_conjecture).  [clausify(10)].
0.80/1.09	27 -has_immunity(c1,c2) # label(lemma_1) # label(negated_conjecture).  [clausify(10)].
0.80/1.09	28 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom).  [clausify(4)].
0.80/1.09	29 -smaller(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c2)) # label(lemma_1) # label(negated_conjecture).  [clausify(10)].
0.80/1.09	30 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
0.80/1.09	32 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.80/1.09	33 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.80/1.09	35 greater(A,B) | -smaller(B,A) # label(definition_smaller) # label(axiom).  [clausify(5)].
0.80/1.09	36 -smaller_or_equal(A,B) | B = A | smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
0.80/1.09	37 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
0.80/1.09	39 -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)).  [resolve(11,a,12,a)].
0.80/1.09	40 external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B).  [resolve(13,a,12,a)].
0.80/1.09	41 -greater(internal_friction(c1,A),internal_friction(c1,B)) | -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | smaller(capability(c1,A),capability(c1,B)).  [resolve(14,a,12,a)].
0.80/1.09	42 internal_friction(c1,A) != internal_friction(c1,B) | stock_of_knowledge(c1,A) != stock_of_knowledge(c1,B) | capability(c1,A) = capability(c1,B).  [resolve(15,a,12,a)].
0.80/1.09	43 -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -smaller_or_equal(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,A),capability(c1,B)).  [resolve(16,a,12,a)].
0.80/1.09	44 has_immunity(c1,A) | has_immunity(c1,B) | -greater(position(c1,B),position(c1,A)) | -greater_or_equal(capability(c1,B),capability(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(17,a,12,a)].
0.80/1.09	46 has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(19,a,12,a)].
0.80/1.09	47 -greater(A,A).  [factor(28,a,b)].
0.80/1.09	50 smaller_or_equal(A,A).  [xx_res(30,b)].
0.80/1.09	57 internal_friction(c1,c3) = internal_friction(c1,c2) | smaller(internal_friction(c1,c3),internal_friction(c1,c2)).  [resolve(36,a,20,a),flip(a)].
0.80/1.09	58 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2).  [resolve(37,a,25,b),flip(b),merge(c)].
0.80/1.09	60 greater(external_ties(c1,c3),external_ties(c1,c2)) | external_ties(c1,c3) = external_ties(c1,c2).  [resolve(37,a,22,a),flip(b),merge(c)].
0.80/1.09	63 greater(position(c1,c3),position(c1,c2)) | greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)).  [resolve(39,a,24,b)].
0.80/1.09	64 -greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater(capability(c1,c3),capability(c1,c2)).  [resolve(43,b,20,a)].
0.80/1.09	97 internal_friction(c1,c3) = internal_friction(c1,c2) | greater(internal_friction(c1,c2),internal_friction(c1,c3)).  [resolve(57,b,35,b)].
0.80/1.09	107 external_ties(c1,c3) = external_ties(c1,c2) | greater(position(c1,c3),position(c1,c2)).  [resolve(60,a,39,a)].
0.80/1.09	118 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater_or_equal(position(c1,c3),position(c1,c2)).  [resolve(63,a,32,b)].
0.80/1.09	120 greater(capability(c1,c3),capability(c1,c2)) | stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2).  [resolve(64,a,58,a)].
0.80/1.09	136 external_ties(c1,c3) = external_ties(c1,c2) | greater_or_equal(position(c1,c3),position(c1,c2)).  [resolve(107,b,32,b)].
0.80/1.09	143 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | -greater(capability(c1,c3),capability(c1,c2)).  [resolve(118,b,46,d),unit_del(b,27),unit_del(c,26),unit_del(e,29)].
0.80/1.09	181 external_ties(c1,c3) = external_ties(c1,c2) | -greater(capability(c1,c3),capability(c1,c2)).  [resolve(136,b,46,d),unit_del(b,27),unit_del(c,26),unit_del(e,29)].
0.80/1.09	185 external_ties(c1,c3) = external_ties(c1,c2) | stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2).  [resolve(181,b,120,a)].
0.80/1.09	190 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2) | position(c1,c3) = position(c1,c2).  [resolve(185,a,40,a)].
0.80/1.09	203 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2) | greater_or_equal(position(c1,c3),position(c1,c2)).  [resolve(190,b,33,b(flip))].
0.80/1.09	216 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2) | -greater(capability(c1,c3),capability(c1,c2)).  [resolve(203,b,46,d),unit_del(b,27),unit_del(c,26),unit_del(e,29)].
0.80/1.09	217 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2).  [resolve(216,b,120,a),merge(b)].
0.80/1.09	221 -greater(capability(c1,c3),capability(c1,c2)).  [back_rewrite(143),rewrite([217(3)]),unit_del(a,47)].
0.80/1.09	233 greater(position(c1,c3),position(c1,c2)).  [back_rewrite(63),rewrite([217(10)]),unit_del(b,47)].
0.80/1.09	242 -smaller(capability(c1,c2),capability(c1,c3)).  [ur(35,a,221,a)].
0.80/1.09	251 -greater_or_equal(capability(c1,c3),capability(c1,c2)).  [ur(44,a,27,a,b,26,a,c,233,a,e,29,a)].
0.80/1.09	254 capability(c1,c3) != capability(c1,c2).  [ur(33,a,251,a),flip(a)].
0.80/1.09	256 internal_friction(c1,c3) != internal_friction(c1,c2).  [ur(42,b,217,a,c,254,a)].
0.80/1.09	264 greater(internal_friction(c1,c2),internal_friction(c1,c3)).  [back_unit_del(97),unit_del(a,256)].
0.80/1.09	272 $F.  [ur(41,a,264,a,c,242,a),rewrite([217(6)]),unit_del(a,50)].
0.80/1.09	
0.80/1.09	% SZS output end Refutation
0.80/1.09	============================== end of proof ==========================
0.80/1.09	
0.80/1.09	============================== STATISTICS ============================
0.80/1.09	
0.80/1.09	Given=130. Generated=628. Kept=252. proofs=1.
0.80/1.09	Usable=76. Sos=75. Demods=1. Limbo=0, Disabled=137. Hints=0.
0.80/1.09	Megabytes=0.34.
0.80/1.09	User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
0.80/1.09	
0.80/1.09	============================== end of statistics =====================
0.80/1.09	
0.80/1.09	============================== end of search =========================
0.80/1.09	
0.80/1.09	THEOREM PROVED
0.80/1.09	% SZS status Theorem
0.80/1.09	
0.80/1.09	Exiting with 1 proof.
0.80/1.09	
0.80/1.09	Process 17258 exit (max_proofs) Mon Jul  3 04:11:01 2023
0.80/1.09	Prover9 interrupted
0.80/1.09	EOF