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