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 : n017.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:04 EDT 2022
% Result : Theorem 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 10:45:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 20917 was started by sandbox on n017.cluster.edu,
% 0.43/0.99 Thu Jun 9 10:45:34 2022
% 0.43/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20764_n017.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_20764_n017.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (10 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99 1 (all X all Y (smaller_or_equal(X,Y) <-> smaller(X,Y) | X = Y)) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 2 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | X = Y)) # label(definition_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 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.43/0.99 6 (all X all Y (smaller(X,Y) | X = Y | greater(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 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))) & (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))) & (stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) & internal_friction(X,T) = internal_friction(X,T0) -> capability(X,T) = capability(X,T0)))) # label(assumption_5) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 8 (all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)))) # label(assumption_7) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 9 (all X all T0 all T (organization(X) -> internal_friction(X,T) = internal_friction(X,T0))) # label(assumption_9) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 10 -(all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> greater(capability(X,T),capability(X,T0)))) # label(lemma_3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99 11 -organization(A) | internal_friction(A,B) = internal_friction(A,C) # label(assumption_9) # label(axiom). [clausify(9)].
% 0.43/0.99 12 organization(c1) # label(lemma_3) # label(negated_conjecture). [clausify(10)].
% 0.43/0.99 Derived: internal_friction(c1,A) = internal_friction(c1,B). [resolve(11,a,12,a)].
% 0.43/0.99 13 -organization(A) | -greater(age(A,B),age(A,C)) | greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) # label(assumption_7) # label(axiom). [clausify(8)].
% 0.43/0.99 Derived: -greater(age(c1,A),age(c1,B)) | greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)). [resolve(13,a,12,a)].
% 0.43/0.99 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.43/0.99 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.43/0.99 15 -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.43/0.99 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(15,a,12,a)].
% 0.43/0.99 16 -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.43/0.99 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(16,a,12,a)].
% 0.43/0.99 17 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.43/0.99 18 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.43/0.99 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(17,b,18,a)].
% 0.43/0.99 19 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.43/0.99 Derived: greater(A,B) | A = B | greater(B,A). [resolve(19,a,18,a)].
% 0.43/0.99 20 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.43/0.99 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(20,a,17,b)].
% 0.43/0.99 21 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.43/0.99 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(21,b,19,a)].
% 0.43/0.99 22 -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(15,a,12,a)].
% 0.43/0.99 Derived: -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | smaller_or_equal(capability(c1,A),capability(c1,B)). [resolve(22,c,17,b)].
% 0.43/0.99 Derived: -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,B),capability(c1,A)). [resolve(22,c,19,a)].
% 0.43/0.99 23 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.43/0.99 24 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.43/0.99 25 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.43/0.99
% 0.43/0.99 ============================== end predicate elimination =============
% 0.43/0.99
% 0.43/0.99 Auto_denials: (non-Horn, no changes).
% 0.43/0.99
% 0.43/0.99 Term ordering decisions:
% 0.43/0.99 Function symbol KB weights: c1=1. c2=1. c3=1. internal_friction=1. stock_of_knowledge=1. capability=1. age=1.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.99
% 0.43/0.99 ============================== end of clauses for search =============
% 0.43/0.99
% 0.43/0.99 ============================== SEARCH ================================
% 0.43/0.99
% 0.43/0.99 % Starting search at 0.01 seconds.
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Theorem
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/0.99 % Length of proof is 21.
% 0.43/0.99 % Level of proof is 6.
% 0.43/0.99 % Maximum clause weight is 21.000.
% 0.43/0.99 % Given clauses 19.
% 0.43/0.99
% 0.43/0.99 1 (all X all Y (smaller_or_equal(X,Y) <-> smaller(X,Y) | X = Y)) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 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))) & (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))) & (stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) & internal_friction(X,T) = internal_friction(X,T0) -> capability(X,T) = capability(X,T0)))) # label(assumption_5) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 8 (all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)))) # label(assumption_7) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 9 (all X all T0 all T (organization(X) -> internal_friction(X,T) = internal_friction(X,T0))) # label(assumption_9) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 10 -(all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> greater(capability(X,T),capability(X,T0)))) # label(lemma_3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.99 11 -organization(A) | internal_friction(A,B) = internal_friction(A,C) # label(assumption_9) # label(axiom). [clausify(9)].
% 0.43/0.99 12 organization(c1) # label(lemma_3) # label(negated_conjecture). [clausify(10)].
% 0.43/0.99 13 -organization(A) | -greater(age(A,B),age(A,C)) | greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) # label(assumption_7) # label(axiom). [clausify(8)].
% 0.43/0.99 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.43/0.99 26 greater(age(c1,c3),age(c1,c2)) # label(lemma_3) # label(negated_conjecture). [clausify(10)].
% 0.43/0.99 28 -greater(capability(c1,c3),capability(c1,c2)) # label(lemma_3) # label(negated_conjecture). [clausify(10)].
% 0.43/0.99 29 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.43/0.99 31 internal_friction(c1,A) = internal_friction(c1,B). [resolve(11,a,12,a)].
% 0.43/0.99 32 -greater(age(c1,A),age(c1,B)) | greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)). [resolve(13,a,12,a)].
% 0.43/0.99 33 -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.43/0.99 43 internal_friction(c1,A) = c_0. [new_symbol(31)].
% 0.43/0.99 44 -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -smaller_or_equal(c_0,c_0) | greater(capability(c1,A),capability(c1,B)). [back_rewrite(33),rewrite([43(7),43(8)])].
% 0.43/0.99 46 smaller_or_equal(A,A). [xx_res(29,b)].
% 0.43/0.99 47 -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | greater(capability(c1,A),capability(c1,B)). [back_unit_del(44),unit_del(b,46)].
% 0.43/0.99 50 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)). [resolve(32,a,26,a)].
% 0.43/0.99 64 $F. [resolve(47,a,50,a),unit_del(a,28)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=19. Generated=76. Kept=37. proofs=1.
% 0.43/0.99 Usable=19. Sos=13. Demods=1. Limbo=0, Disabled=35. Hints=0.
% 0.43/0.99 Megabytes=0.09.
% 0.43/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 THEOREM PROVED
% 0.43/0.99 % SZS status Theorem
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/0.99
% 0.43/0.99 Process 20917 exit (max_proofs) Thu Jun 9 10:45:34 2022
% 0.43/0.99 Prover9 interrupted
%------------------------------------------------------------------------------