TSTP Solution File: MGT044-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT044-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:23:03 EDT 2022
% Result : Unsatisfiable 0.40s 0.97s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT044-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 11:01:27 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.40/0.96 ============================== Prover9 ===============================
% 0.40/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.40/0.96 Process 23912 was started by sandbox2 on n027.cluster.edu,
% 0.40/0.96 Thu Jun 9 11:01:28 2022
% 0.40/0.96 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23759_n027.cluster.edu".
% 0.40/0.96 ============================== end of head ===========================
% 0.40/0.96
% 0.40/0.96 ============================== INPUT =================================
% 0.40/0.96
% 0.40/0.96 % Reading from file /tmp/Prover9_23759_n027.cluster.edu
% 0.40/0.96
% 0.40/0.96 set(prolog_style_variables).
% 0.40/0.96 set(auto2).
% 0.40/0.96 % set(auto2) -> set(auto).
% 0.40/0.96 % set(auto) -> set(auto_inference).
% 0.40/0.96 % set(auto) -> set(auto_setup).
% 0.40/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.40/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.40/0.96 % set(auto) -> set(auto_limits).
% 0.40/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.40/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.40/0.96 % set(auto) -> set(auto_denials).
% 0.40/0.96 % set(auto) -> set(auto_process).
% 0.40/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.40/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.40/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.40/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.40/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.40/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.40/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.40/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.40/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.40/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.40/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.40/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.40/0.96 % set(auto2) -> assign(stats, some).
% 0.40/0.96 % set(auto2) -> clear(echo_input).
% 0.40/0.96 % set(auto2) -> set(quiet).
% 0.40/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.40/0.96 % set(auto2) -> clear(print_given).
% 0.40/0.96 assign(lrs_ticks,-1).
% 0.40/0.96 assign(sos_limit,10000).
% 0.40/0.96 assign(order,kbo).
% 0.40/0.96 set(lex_order_vars).
% 0.40/0.96 clear(print_given).
% 0.40/0.96
% 0.40/0.96 % formulas(sos). % not echoed (19 formulas)
% 0.40/0.96
% 0.40/0.96 ============================== end of input ==========================
% 0.40/0.96
% 0.40/0.96 % From the command line: assign(max_seconds, 300).
% 0.40/0.96
% 0.40/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.40/0.96
% 0.40/0.96 % Formulas that are not ordinary clauses:
% 0.40/0.96
% 0.40/0.96 ============================== end of process non-clausal formulas ===
% 0.40/0.96
% 0.40/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.40/0.96
% 0.40/0.96 ============================== PREDICATE ELIMINATION =================
% 0.40/0.96 1 -organization(A) | internal_friction(A,B) = internal_friction(A,C) # label(assumption_9_36) # label(axiom). [assumption].
% 0.40/0.96 2 organization(sk1) # label(lemma_3_37) # label(negated_conjecture). [assumption].
% 0.40/0.96 Derived: internal_friction(sk1,A) = internal_friction(sk1,B). [resolve(1,a,2,a)].
% 0.40/0.96 3 -organization(A) | -greater(age(A,B),age(A,C)) | greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) # label(assumption_7_35) # label(axiom). [assumption].
% 0.40/0.96 Derived: -greater(age(sk1,A),age(sk1,B)) | greater(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)). [resolve(3,a,2,a)].
% 0.40/0.96 4 -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_32) # label(axiom). [assumption].
% 0.40/0.96 Derived: -greater(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -smaller_or_equal(internal_friction(sk1,A),internal_friction(sk1,B)) | greater(capability(sk1,A),capability(sk1,B)). [resolve(4,a,2,a)].
% 0.40/0.96 5 -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_33) # label(axiom). [assumption].
% 0.40/0.96 Derived: -smaller_or_equal(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | smaller(capability(sk1,A),capability(sk1,B)). [resolve(5,a,2,a)].
% 0.40/0.96 6 -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_34) # label(axiom). [assumption].
% 0.40/0.96 Derived: stock_of_knowledge(sk1,A) != stock_of_knowledge(sk1,B) | internal_friction(sk1,A) != internal_friction(sk1,B) | capability(sk1,A) = capability(sk1,B). [resolve(6,a,2,a)].
% 0.40/0.97 7 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.40/0.97 8 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.40/0.97 Derived: smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(7,a,8,a)].
% 0.40/0.97 9 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.40/0.97 Derived: greater(A,B) | B = A | greater(B,A). [resolve(9,a,8,a)].
% 0.40/0.97 10 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.40/0.97 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(10,b,7,a)].
% 0.40/0.97 11 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.40/0.97 Derived: -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(11,b,9,a)].
% 0.40/0.97 12 -smaller_or_equal(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | smaller(capability(sk1,A),capability(sk1,B)). [resolve(5,a,2,a)].
% 0.40/0.97 Derived: -smaller_or_equal(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | smaller_or_equal(capability(sk1,A),capability(sk1,B)). [resolve(12,c,7,a)].
% 0.40/0.97 Derived: -smaller_or_equal(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | greater(capability(sk1,B),capability(sk1,A)). [resolve(12,c,9,a)].
% 0.40/0.97 13 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.40/0.97 14 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.40/0.97 15 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.40/0.97
% 0.40/0.97 ============================== end predicate elimination =============
% 0.40/0.97
% 0.40/0.97 Auto_denials: (non-Horn, no changes).
% 0.40/0.97
% 0.40/0.97 Term ordering decisions:
% 0.40/0.97 Function symbol KB weights: sk1=1. sk2=1. sk3=1. internal_friction=1. stock_of_knowledge=1. capability=1. age=1.
% 0.40/0.97
% 0.40/0.97 ============================== end of process initial clauses ========
% 0.40/0.97
% 0.40/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.40/0.97
% 0.40/0.97 ============================== end of clauses for search =============
% 0.40/0.97
% 0.40/0.97 ============================== SEARCH ================================
% 0.40/0.97
% 0.40/0.97 % Starting search at 0.01 seconds.
% 0.40/0.97
% 0.40/0.97 ============================== PROOF =================================
% 0.40/0.97 % SZS status Unsatisfiable
% 0.40/0.97 % SZS output start Refutation
% 0.40/0.97
% 0.40/0.97 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.40/0.97 % Length of proof is 16.
% 0.40/0.97 % Level of proof is 5.
% 0.40/0.97 % Maximum clause weight is 21.000.
% 0.40/0.97 % Given clauses 19.
% 0.40/0.97
% 0.40/0.97 1 -organization(A) | internal_friction(A,B) = internal_friction(A,C) # label(assumption_9_36) # label(axiom). [assumption].
% 0.40/0.97 2 organization(sk1) # label(lemma_3_37) # label(negated_conjecture). [assumption].
% 0.40/0.97 3 -organization(A) | -greater(age(A,B),age(A,C)) | greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) # label(assumption_7_35) # label(axiom). [assumption].
% 0.40/0.97 4 -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_32) # label(axiom). [assumption].
% 0.40/0.97 16 greater(age(sk1,sk3),age(sk1,sk2)) # label(lemma_3_38) # label(negated_conjecture). [assumption].
% 0.40/0.97 18 -greater(capability(sk1,sk3),capability(sk1,sk2)) # label(lemma_3_39) # label(negated_conjecture). [assumption].
% 0.40/0.97 19 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom). [assumption].
% 0.40/0.97 21 internal_friction(sk1,A) = internal_friction(sk1,B). [resolve(1,a,2,a)].
% 0.40/0.97 22 -greater(age(sk1,A),age(sk1,B)) | greater(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)). [resolve(3,a,2,a)].
% 0.40/0.97 23 -greater(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -smaller_or_equal(internal_friction(sk1,A),internal_friction(sk1,B)) | greater(capability(sk1,A),capability(sk1,B)). [resolve(4,a,2,a)].
% 0.40/0.97 33 internal_friction(sk1,A) = c_0. [new_symbol(21)].
% 0.40/0.97 34 -greater(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -smaller_or_equal(c_0,c_0) | greater(capability(sk1,A),capability(sk1,B)). [back_rewrite(23),rewrite([33(7),33(8)])].
% 0.40/0.97 36 smaller_or_equal(A,A). [xx_res(19,a)].
% 0.40/0.97 37 -greater(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | greater(capability(sk1,A),capability(sk1,B)). [back_unit_del(34),unit_del(b,36)].
% 0.40/0.97 40 greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)). [resolve(22,a,16,a)].
% 0.40/0.97 54 $F. [resolve(37,a,40,a),unit_del(a,18)].
% 0.40/0.97
% 0.40/0.97 % SZS output end Refutation
% 0.40/0.97 ============================== end of proof ==========================
% 0.40/0.97
% 0.40/0.97 ============================== STATISTICS ============================
% 0.40/0.97
% 0.40/0.97 Given=19. Generated=76. Kept=37. proofs=1.
% 0.40/0.97 Usable=19. Sos=13. Demods=1. Limbo=0, Disabled=35. Hints=0.
% 0.40/0.97 Megabytes=0.07.
% 0.40/0.97 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.40/0.97
% 0.40/0.97 ============================== end of statistics =====================
% 0.40/0.97
% 0.40/0.97 ============================== end of search =========================
% 0.40/0.97
% 0.40/0.97 THEOREM PROVED
% 0.40/0.97 % SZS status Unsatisfiable
% 0.40/0.97
% 0.40/0.97 Exiting with 1 proof.
% 0.40/0.97
% 0.40/0.97 Process 23912 exit (max_proofs) Thu Jun 9 11:01:28 2022
% 0.40/0.97 Prover9 interrupted
%------------------------------------------------------------------------------