0.07/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.15 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.36 % Computer : n010.cluster.edu 0.13/0.36 % Model : x86_64 x86_64 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.36 % Memory : 8042.1875MB 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.36 % CPULimit : 960 0.13/0.36 % WCLimit : 120 0.13/0.36 % DateTime : Tue Aug 9 02:01:05 EDT 2022 0.13/0.36 % CPUTime : 0.86/1.18 ============================== Prover9 =============================== 0.86/1.18 Prover9 (32) version 2009-11A, November 2009. 0.86/1.18 Process 20181 was started by sandbox on n010.cluster.edu, 0.86/1.18 Tue Aug 9 02:01:06 2022 0.86/1.18 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_19935_n010.cluster.edu". 0.86/1.18 ============================== end of head =========================== 0.86/1.18 0.86/1.18 ============================== INPUT ================================= 0.86/1.18 0.86/1.18 % Reading from file /tmp/Prover9_19935_n010.cluster.edu 0.86/1.18 0.86/1.18 set(prolog_style_variables). 0.86/1.18 set(auto2). 0.86/1.18 % set(auto2) -> set(auto). 0.86/1.18 % set(auto) -> set(auto_inference). 0.86/1.18 % set(auto) -> set(auto_setup). 0.86/1.18 % set(auto_setup) -> set(predicate_elim). 0.86/1.18 % set(auto_setup) -> assign(eq_defs, unfold). 0.86/1.18 % set(auto) -> set(auto_limits). 0.86/1.18 % set(auto_limits) -> assign(max_weight, "100.000"). 0.86/1.18 % set(auto_limits) -> assign(sos_limit, 20000). 0.86/1.18 % set(auto) -> set(auto_denials). 0.86/1.18 % set(auto) -> set(auto_process). 0.86/1.18 % set(auto2) -> assign(new_constants, 1). 0.86/1.18 % set(auto2) -> assign(fold_denial_max, 3). 0.86/1.18 % set(auto2) -> assign(max_weight, "200.000"). 0.86/1.18 % set(auto2) -> assign(max_hours, 1). 0.86/1.18 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.86/1.18 % set(auto2) -> assign(max_seconds, 0). 0.86/1.18 % set(auto2) -> assign(max_minutes, 5). 0.86/1.18 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.86/1.18 % set(auto2) -> set(sort_initial_sos). 0.86/1.18 % set(auto2) -> assign(sos_limit, -1). 0.86/1.18 % set(auto2) -> assign(lrs_ticks, 3000). 0.86/1.18 % set(auto2) -> assign(max_megs, 400). 0.86/1.18 % set(auto2) -> assign(stats, some). 0.86/1.18 % set(auto2) -> clear(echo_input). 0.86/1.18 % set(auto2) -> set(quiet). 0.86/1.18 % set(auto2) -> clear(print_initial_clauses). 0.86/1.18 % set(auto2) -> clear(print_given). 0.86/1.18 assign(lrs_ticks,-1). 0.86/1.18 assign(sos_limit,10000). 0.86/1.18 assign(order,kbo). 0.86/1.18 set(lex_order_vars). 0.86/1.18 clear(print_given). 0.86/1.18 0.86/1.18 % formulas(sos). % not echoed (10 formulas) 0.86/1.18 0.86/1.18 ============================== end of input ========================== 0.86/1.18 0.86/1.18 % From the command line: assign(max_seconds, 960). 0.86/1.18 0.86/1.18 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.86/1.18 0.86/1.18 % Formulas that are not ordinary clauses: 0.86/1.18 1 (all X all Y (smaller(X,Y) | X = Y <-> smaller_or_equal(X,Y))) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.86/1.18 2 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption]. 0.86/1.18 3 (all X all Y -(greater(Y,X) & greater(X,Y))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption]. 0.86/1.18 4 (all X all Y (greater(X,Y) | X = Y <-> greater_or_equal(X,Y))) # label(definition_greater_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.86/1.18 5 (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.86/1.18 6 (all X all Y (X = Y | greater(X,Y) | smaller(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause). [assumption]. 0.86/1.18 7 (all X all T0 all T (organization(X) -> (smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) & greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) -> greater(capability(X,T),capability(X,T0))) & (stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) & internal_friction(X,T) = internal_friction(X,T0) -> capability(X,T0) = capability(X,T)) & (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))))) # label(assumption_5) # label(axiom) # label(non_clause). [assumption]. 0.86/1.18 8 (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.86/1.18 9 (all X all T0 all T (-has_immunity(X,T0) & -has_immunity(X,T) & organization(X) -> (greater_or_equal(position(X,T),position(X,T0)) & greater(capability(X,T),capability(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (capability(X,T0) = capability(X,T) & position(X,T0) = position(X,T) -> hazard_of_mortality(X,T0) = hazard_of_mortality(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))))) # label(assumption_4) # label(axiom) # label(non_clause). [assumption]. 0.86/1.18 10 -(all X all T0 all T (-has_immunity(X,T) & -has_immunity(X,T0) & organization(X) -> (greater_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & greater(external_ties(X,T),external_ties(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & greater_or_equal(external_ties(X,T),external_ties(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))))) # label(lemma_1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.86/1.18 0.86/1.18 ============================== end of process non-clausal formulas === 0.86/1.18 0.86/1.18 ============================== PROCESS INITIAL CLAUSES =============== 0.86/1.18 0.86/1.18 ============================== PREDICATE ELIMINATION ================= 0.86/1.18 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(8)]. 0.86/1.18 12 organization(c1) # label(lemma_1) # label(negated_conjecture). [clausify(10)]. 0.86/1.18 Derived: -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)). [resolve(11,a,12,a)]. 0.86/1.18 13 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom). [clausify(8)]. 0.86/1.18 Derived: external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(13,a,12,a)]. 0.86/1.18 14 -organization(A) | -smaller_or_equal(internal_friction(A,B),internal_friction(A,C)) | -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | greater(capability(A,B),capability(A,C)) # label(assumption_5) # label(axiom). [clausify(7)]. 0.86/1.18 Derived: -smaller_or_equal(internal_friction(c1,A),internal_friction(c1,B)) | -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | greater(capability(c1,A),capability(c1,B)). [resolve(14,a,12,a)]. 0.86/1.18 15 -organization(A) | stock_of_knowledge(A,B) != stock_of_knowledge(A,C) | internal_friction(A,B) != internal_friction(A,C) | capability(A,B) = capability(A,C) # label(assumption_5) # label(axiom). [clausify(7)]. 0.86/1.18 Derived: stock_of_knowledge(c1,A) != stock_of_knowledge(c1,B) | internal_friction(c1,A) != internal_friction(c1,B) | capability(c1,A) = capability(c1,B). [resolve(15,a,12,a)]. 0.86/1.18 16 -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(7)]. 0.86/1.18 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(16,a,12,a)]. 0.86/1.18 17 has_immunity(A,B) | has_immunity(A,C) | -organization(A) | -greater_or_equal(position(A,C),position(A,B)) | -greater(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.86/1.18 Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater_or_equal(position(c1,B),position(c1,A)) | -greater(capability(c1,B),capability(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(17,c,12,a)]. 0.86/1.18 18 has_immunity(A,B) | has_immunity(A,C) | -organization(A) | capability(A,C) != capability(A,B) | position(A,C) != position(A,B) | hazard_of_mortality(A,C) = hazard_of_mortality(A,B) # label(assumption_4) # label(axiom). [clausify(9)]. 0.86/1.18 Derived: has_immunity(c1,A) | has_immunity(c1,B) | capability(c1,B) != capability(c1,A) | position(c1,B) != position(c1,A) | hazard_of_mortality(c1,B) = hazard_of_mortality(c1,A). [resolve(18,c,12,a)]. 0.86/1.19 19 has_immunity(A,B) | has_immunity(A,C) | -organization(A) | -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.86/1.19 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(19,c,12,a)]. 0.86/1.19 0.86/1.19 ============================== end predicate elimination ============= 0.86/1.19 0.86/1.19 Auto_denials: (non-Horn, no changes). 0.86/1.19 0.86/1.19 Term ordering decisions: 0.86/1.19 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.86/1.19 0.86/1.19 ============================== end of process initial clauses ======== 0.86/1.19 0.86/1.19 ============================== CLAUSES FOR SEARCH ==================== 0.86/1.19 0.86/1.19 ============================== end of clauses for search ============= 0.86/1.19 0.86/1.19 ============================== SEARCH ================================ 0.86/1.19 0.86/1.19 % Starting search at 0.01 seconds. 0.86/1.19 0.86/1.19 ============================== PROOF ================================= 0.86/1.19 % SZS status Theorem 0.86/1.19 % SZS output start Refutation 0.86/1.19 0.86/1.19 % Proof 1 at 0.02 (+ 0.00) seconds. 0.86/1.19 % Length of proof is 64. 0.86/1.19 % Level of proof is 16. 0.86/1.19 % Maximum clause weight is 27.000. 0.86/1.19 % Given clauses 130. 0.86/1.19 0.86/1.19 1 (all X all Y (smaller(X,Y) | X = Y <-> smaller_or_equal(X,Y))) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.86/1.19 2 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption]. 0.86/1.19 3 (all X all Y -(greater(Y,X) & greater(X,Y))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption]. 0.86/1.19 4 (all X all Y (greater(X,Y) | X = Y <-> greater_or_equal(X,Y))) # label(definition_greater_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.86/1.19 7 (all X all T0 all T (organization(X) -> (smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) & greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) -> greater(capability(X,T),capability(X,T0))) & (stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) & internal_friction(X,T) = internal_friction(X,T0) -> capability(X,T0) = capability(X,T)) & (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))))) # label(assumption_5) # label(axiom) # label(non_clause). [assumption]. 0.86/1.19 8 (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.86/1.19 9 (all X all T0 all T (-has_immunity(X,T0) & -has_immunity(X,T) & organization(X) -> (greater_or_equal(position(X,T),position(X,T0)) & greater(capability(X,T),capability(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (capability(X,T0) = capability(X,T) & position(X,T0) = position(X,T) -> hazard_of_mortality(X,T0) = hazard_of_mortality(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))))) # label(assumption_4) # label(axiom) # label(non_clause). [assumption]. 0.86/1.19 10 -(all X all T0 all T (-has_immunity(X,T) & -has_immunity(X,T0) & organization(X) -> (greater_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & greater(external_ties(X,T),external_ties(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & greater_or_equal(external_ties(X,T),external_ties(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))))) # label(lemma_1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.86/1.19 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(8)]. 0.86/1.19 12 organization(c1) # label(lemma_1) # label(negated_conjecture). [clausify(10)]. 0.86/1.19 13 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom). [clausify(8)]. 0.86/1.19 14 -organization(A) | -smaller_or_equal(internal_friction(A,B),internal_friction(A,C)) | -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | greater(capability(A,B),capability(A,C)) # label(assumption_5) # label(axiom). [clausify(7)]. 0.86/1.19 15 -organization(A) | stock_of_knowledge(A,B) != stock_of_knowledge(A,C) | internal_friction(A,B) != internal_friction(A,C) | capability(A,B) = capability(A,C) # label(assumption_5) # label(axiom). [clausify(7)]. 0.86/1.19 16 -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(7)]. 0.86/1.19 17 has_immunity(A,B) | has_immunity(A,C) | -organization(A) | -greater_or_equal(position(A,C),position(A,B)) | -greater(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.86/1.19 19 has_immunity(A,B) | has_immunity(A,C) | -organization(A) | -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.86/1.19 20 smaller_or_equal(internal_friction(c1,c3),internal_friction(c1,c2)) # label(lemma_1) # label(negated_conjecture). [clausify(10)]. 0.86/1.19 22 greater_or_equal(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) # label(lemma_1) # label(negated_conjecture). [clausify(10)]. 0.86/1.19 24 greater(external_ties(c1,c3),external_ties(c1,c2)) | greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) # label(lemma_1) # label(negated_conjecture). [clausify(10)]. 0.86/1.19 25 greater(external_ties(c1,c3),external_ties(c1,c2)) | greater_or_equal(external_ties(c1,c3),external_ties(c1,c2)) # label(lemma_1) # label(negated_conjecture). [clausify(10)]. 0.86/1.19 26 -has_immunity(c1,c3) # label(lemma_1) # label(negated_conjecture). [clausify(10)]. 0.86/1.19 27 -has_immunity(c1,c2) # label(lemma_1) # label(negated_conjecture). [clausify(10)]. 0.86/1.19 28 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom). [clausify(3)]. 0.86/1.19 29 -smaller(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c2)) # label(lemma_1) # label(negated_conjecture). [clausify(10)]. 0.86/1.19 31 A != B | smaller_or_equal(B,A) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)]. 0.86/1.19 33 greater(A,B) | -smaller(B,A) # label(definition_smaller) # label(axiom). [clausify(2)]. 0.86/1.19 34 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(4)]. 0.86/1.19 35 A != B | greater_or_equal(B,A) # label(definition_greater_or_equal) # label(axiom). [clausify(4)]. 0.86/1.19 36 smaller(A,B) | B = A | -smaller_or_equal(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)]. 0.86/1.19 37 greater(A,B) | B = A | -greater_or_equal(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(4)]. 0.86/1.19 39 -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)). [resolve(11,a,12,a)]. 0.86/1.19 40 external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(13,a,12,a)]. 0.86/1.19 41 -smaller_or_equal(internal_friction(c1,A),internal_friction(c1,B)) | -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | greater(capability(c1,A),capability(c1,B)). [resolve(14,a,12,a)]. 0.86/1.19 42 stock_of_knowledge(c1,A) != stock_of_knowledge(c1,B) | internal_friction(c1,A) != internal_friction(c1,B) | capability(c1,A) = capability(c1,B). [resolve(15,a,12,a)]. 0.86/1.19 43 -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(16,a,12,a)]. 0.86/1.19 44 has_immunity(c1,A) | has_immunity(c1,B) | -greater_or_equal(position(c1,B),position(c1,A)) | -greater(capability(c1,B),capability(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(17,c,12,a)]. 0.86/1.19 46 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(19,c,12,a)]. 0.86/1.19 47 -greater(A,A). [factor(28,a,b)]. 0.86/1.19 51 smaller_or_equal(A,A). [xx_res(31,a)]. 0.86/1.19 57 smaller(internal_friction(c1,c3),internal_friction(c1,c2)) | internal_friction(c1,c3) = internal_friction(c1,c2). [resolve(36,c,20,a),flip(b)]. 0.86/1.19 58 greater(external_ties(c1,c3),external_ties(c1,c2)) | external_ties(c1,c3) = external_ties(c1,c2). [resolve(37,c,25,b),flip(b),merge(c)]. 0.86/1.19 59 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2). [resolve(37,c,22,a),flip(b),merge(c)]. 0.86/1.19 62 greater(position(c1,c3),position(c1,c2)) | greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)). [resolve(39,a,24,a)]. 0.86/1.19 63 -greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater(capability(c1,c3),capability(c1,c2)). [resolve(41,a,20,a)]. 0.86/1.19 96 internal_friction(c1,c3) = internal_friction(c1,c2) | greater(internal_friction(c1,c2),internal_friction(c1,c3)). [resolve(57,a,33,b)]. 0.86/1.19 99 external_ties(c1,c3) = external_ties(c1,c2) | greater(position(c1,c3),position(c1,c2)). [resolve(58,a,39,a)]. 0.86/1.19 116 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater_or_equal(position(c1,c3),position(c1,c2)). [resolve(62,a,34,a)]. 0.86/1.19 119 greater(capability(c1,c3),capability(c1,c2)) | stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2). [resolve(63,a,59,a)]. 0.86/1.19 131 external_ties(c1,c3) = external_ties(c1,c2) | greater_or_equal(position(c1,c3),position(c1,c2)). [resolve(99,b,34,a)]. 0.90/1.19 141 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | -greater(capability(c1,c3),capability(c1,c2)). [resolve(116,b,44,c),unit_del(b,27),unit_del(c,26),unit_del(e,29)]. 0.90/1.19 166 external_ties(c1,c3) = external_ties(c1,c2) | -greater(capability(c1,c3),capability(c1,c2)). [resolve(131,b,44,c),unit_del(b,27),unit_del(c,26),unit_del(e,29)]. 0.90/1.19 184 external_ties(c1,c3) = external_ties(c1,c2) | stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2). [resolve(166,b,119,a)]. 0.90/1.19 191 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2) | position(c1,c3) = position(c1,c2). [resolve(184,a,40,a)]. 0.90/1.19 204 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2) | greater_or_equal(position(c1,c3),position(c1,c2)). [resolve(191,b,35,a(flip))]. 0.90/1.19 217 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2) | -greater(capability(c1,c3),capability(c1,c2)). [resolve(204,b,44,c),unit_del(b,27),unit_del(c,26),unit_del(e,29)]. 0.90/1.19 218 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2). [resolve(217,b,119,a),merge(b)]. 0.90/1.19 223 -greater(capability(c1,c3),capability(c1,c2)). [back_rewrite(141),rewrite([218(3)]),unit_del(a,47)]. 0.90/1.19 234 greater(position(c1,c3),position(c1,c2)). [back_rewrite(62),rewrite([218(10)]),unit_del(b,47)]. 0.90/1.19 241 -smaller(capability(c1,c2),capability(c1,c3)). [ur(33,a,223,a)]. 0.90/1.19 250 -greater_or_equal(capability(c1,c3),capability(c1,c2)). [ur(46,a,27,a,b,26,a,c,234,a,e,29,a)]. 0.90/1.19 253 capability(c1,c3) != capability(c1,c2). [ur(35,b,250,a),flip(a)]. 0.90/1.19 255 internal_friction(c1,c3) != internal_friction(c1,c2). [ur(42,a,218,a,c,253,a)]. 0.90/1.19 263 greater(internal_friction(c1,c2),internal_friction(c1,c3)). [back_unit_del(96),unit_del(a,255)]. 0.90/1.19 271 $F. [ur(43,a,263,a,c,241,a),rewrite([218(6)]),unit_del(a,51)]. 0.90/1.19 0.90/1.19 % SZS output end Refutation 0.90/1.19 ============================== end of proof ========================== 0.90/1.19 0.90/1.19 ============================== STATISTICS ============================ 0.90/1.19 0.90/1.19 Given=130. Generated=631. Kept=251. proofs=1. 0.90/1.19 Usable=76. Sos=75. Demods=1. Limbo=0, Disabled=136. Hints=0. 0.90/1.19 Megabytes=0.34. 0.90/1.19 User_CPU=0.02, System_CPU=0.00, Wall_clock=0. 0.90/1.19 0.90/1.19 ============================== end of statistics ===================== 0.90/1.19 0.90/1.19 ============================== end of search ========================= 0.90/1.19 0.90/1.19 THEOREM PROVED 0.90/1.19 % SZS status Theorem 0.90/1.19 0.90/1.19 Exiting with 1 proof. 0.90/1.19 0.90/1.19 Process 20181 exit (max_proofs) Tue Aug 9 02:01:06 2022 0.90/1.19 Prover9 interrupted 0.90/1.20 EOF