TSTP Solution File: MGT005-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT005-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:22:47 EDT 2022
% Result : Unsatisfiable 1.54s 1.84s
% Output : Refutation 1.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT005-2 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 10:45:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.54/1.84 ============================== Prover9 ===============================
% 1.54/1.84 Prover9 (32) version 2009-11A, November 2009.
% 1.54/1.84 Process 22149 was started by sandbox on n022.cluster.edu,
% 1.54/1.84 Thu Jun 9 10:45:20 2022
% 1.54/1.84 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21978_n022.cluster.edu".
% 1.54/1.84 ============================== end of head ===========================
% 1.54/1.84
% 1.54/1.84 ============================== INPUT =================================
% 1.54/1.84
% 1.54/1.84 % Reading from file /tmp/Prover9_21978_n022.cluster.edu
% 1.54/1.84
% 1.54/1.84 set(prolog_style_variables).
% 1.54/1.84 set(auto2).
% 1.54/1.84 % set(auto2) -> set(auto).
% 1.54/1.84 % set(auto) -> set(auto_inference).
% 1.54/1.84 % set(auto) -> set(auto_setup).
% 1.54/1.84 % set(auto_setup) -> set(predicate_elim).
% 1.54/1.84 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.54/1.84 % set(auto) -> set(auto_limits).
% 1.54/1.84 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.54/1.84 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.54/1.84 % set(auto) -> set(auto_denials).
% 1.54/1.84 % set(auto) -> set(auto_process).
% 1.54/1.84 % set(auto2) -> assign(new_constants, 1).
% 1.54/1.84 % set(auto2) -> assign(fold_denial_max, 3).
% 1.54/1.84 % set(auto2) -> assign(max_weight, "200.000").
% 1.54/1.84 % set(auto2) -> assign(max_hours, 1).
% 1.54/1.84 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.54/1.84 % set(auto2) -> assign(max_seconds, 0).
% 1.54/1.84 % set(auto2) -> assign(max_minutes, 5).
% 1.54/1.84 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.54/1.84 % set(auto2) -> set(sort_initial_sos).
% 1.54/1.84 % set(auto2) -> assign(sos_limit, -1).
% 1.54/1.84 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.54/1.84 % set(auto2) -> assign(max_megs, 400).
% 1.54/1.84 % set(auto2) -> assign(stats, some).
% 1.54/1.84 % set(auto2) -> clear(echo_input).
% 1.54/1.84 % set(auto2) -> set(quiet).
% 1.54/1.84 % set(auto2) -> clear(print_initial_clauses).
% 1.54/1.84 % set(auto2) -> clear(print_given).
% 1.54/1.84 assign(lrs_ticks,-1).
% 1.54/1.84 assign(sos_limit,10000).
% 1.54/1.84 assign(order,kbo).
% 1.54/1.84 set(lex_order_vars).
% 1.54/1.84 clear(print_given).
% 1.54/1.84
% 1.54/1.84 % formulas(sos). % not echoed (38 formulas)
% 1.54/1.84
% 1.54/1.84 ============================== end of input ==========================
% 1.54/1.84
% 1.54/1.84 % From the command line: assign(max_seconds, 300).
% 1.54/1.84
% 1.54/1.84 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.54/1.84
% 1.54/1.84 % Formulas that are not ordinary clauses:
% 1.54/1.84
% 1.54/1.84 ============================== end of process non-clausal formulas ===
% 1.54/1.84
% 1.54/1.84 ============================== PROCESS INITIAL CLAUSES ===============
% 1.54/1.84
% 1.54/1.84 ============================== PREDICATE ELIMINATION =================
% 1.54/1.84 1 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -survival_chance(A,D,B) | -survival_chance(A,E,C) | -greater(C,B) | greater(E,D) # label(t3_FOL_33) # label(hypothesis). [assumption].
% 1.54/1.84 2 reorganization_free(sk5,sk16,sk17) # label(t5_plus_FOL_54) # label(negated_conjecture). [assumption].
% 1.54/1.84 Derived: -organization(sk5,sk16) | -organization(sk5,sk17) | -survival_chance(sk5,A,sk16) | -survival_chance(sk5,B,sk17) | -greater(sk17,sk16) | greater(B,A). [resolve(1,c,2,a)].
% 1.54/1.84
% 1.54/1.84 ============================== end predicate elimination =============
% 1.54/1.84
% 1.54/1.84 Auto_denials: (non-Horn, no changes).
% 1.54/1.84
% 1.54/1.84 Term ordering decisions:
% 1.54/1.84 Function symbol KB weights: sk15=1. sk5=1. sk6=1. sk17=1. sk16=1. sk14=1. p1=1. p2=1. sk10=1. sk11=1. sk12=1. sk13=1. sk7=1. sk8=1. sk9=1. sk1=1. sk2=1. sk3=1. sk4=1.
% 1.54/1.84
% 1.54/1.84 ============================== end of process initial clauses ========
% 1.54/1.84
% 1.54/1.84 ============================== CLAUSES FOR SEARCH ====================
% 1.54/1.84
% 1.54/1.84 ============================== end of clauses for search =============
% 1.54/1.84
% 1.54/1.84 ============================== SEARCH ================================
% 1.54/1.84
% 1.54/1.84 % Starting search at 0.03 seconds.
% 1.54/1.84
% 1.54/1.84 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 42 (0.00 of 0.39 sec).
% 1.54/1.84
% 1.54/1.84 ============================== PROOF =================================
% 1.54/1.84 % SZS status Unsatisfiable
% 1.54/1.84 % SZS output start Refutation
% 1.54/1.84
% 1.54/1.84 % Proof 1 at 0.86 (+ 0.01) seconds.
% 1.54/1.84 % Length of proof is 44.
% 1.54/1.84 % Level of proof is 9.
% 1.54/1.84 % Maximum clause weight is 69.000.
% 1.54/1.84 % Given clauses 1372.
% 1.54/1.84
% 1.54/1.84 3 organization(sk5,sk15) # label(t5_plus_FOL_42) # label(negated_conjecture). [assumption].
% 1.54/1.84 4 organization(sk6,sk15) # label(t5_plus_FOL_43) # label(negated_conjecture). [assumption].
% 1.54/1.84 5 organization(sk5,sk17) # label(t5_plus_FOL_44) # label(negated_conjecture). [assumption].
% 1.54/1.84 6 organization(sk6,sk17) # label(t5_plus_FOL_45) # label(negated_conjecture). [assumption].
% 1.54/1.84 7 greater(sk13,sk12) # label(t5_plus_FOL_59) # label(negated_conjecture). [assumption].
% 1.54/1.84 8 sk14 = sk16 # label(t5_plus_FOL_61) # label(negated_conjecture). [assumption].
% 1.54/1.84 9 class(sk5,sk8,sk15) # label(t5_plus_FOL_46) # label(negated_conjecture). [assumption].
% 1.54/1.84 10 class(sk6,sk8,sk15) # label(t5_plus_FOL_47) # label(negated_conjecture). [assumption].
% 1.54/1.84 11 survival_chance(sk5,sk9,sk15) # label(t5_plus_FOL_48) # label(negated_conjecture). [assumption].
% 1.54/1.84 12 survival_chance(sk6,sk9,sk15) # label(t5_plus_FOL_49) # label(negated_conjecture). [assumption].
% 1.54/1.84 13 reorganization(sk5,sk15,sk16) # label(t5_plus_FOL_50) # label(negated_conjecture). [assumption].
% 1.54/1.84 14 reorganization(sk6,sk15,sk17) # label(t5_plus_FOL_51) # label(negated_conjecture). [assumption].
% 1.54/1.84 15 reorganization_type(sk5,sk7,sk15) # label(t5_plus_FOL_52) # label(negated_conjecture). [assumption].
% 1.54/1.84 16 reorganization_type(sk6,sk7,sk15) # label(t5_plus_FOL_53) # label(negated_conjecture). [assumption].
% 1.54/1.84 17 survival_chance(sk5,sk10,sk14) # label(t5_plus_FOL_55) # label(negated_conjecture). [assumption].
% 1.54/1.84 18 survival_chance(sk5,sk10,sk16). [copy(17),rewrite([8(3)])].
% 1.54/1.84 19 survival_chance(sk6,sk11,sk14) # label(t5_plus_FOL_56) # label(negated_conjecture). [assumption].
% 1.54/1.84 20 survival_chance(sk6,sk11,sk16). [copy(19),rewrite([8(3)])].
% 1.54/1.84 21 complexity(sk5,sk12,sk15) # label(t5_plus_FOL_57) # label(negated_conjecture). [assumption].
% 1.54/1.84 22 complexity(sk6,sk13,sk15) # label(t5_plus_FOL_58) # label(negated_conjecture). [assumption].
% 1.54/1.84 23 -greater(sk10,sk11) # label(t5_plus_FOL_62) # label(negated_conjecture). [assumption].
% 1.54/1.84 24 sk10 != sk11 # label(t5_plus_FOL_63) # label(negated_conjecture). [assumption].
% 1.54/1.84 25 sk11 != sk10. [copy(24),flip(a)].
% 1.54/1.84 30 -reorganization(A,B,C) | greater(C,B) # label(mp7_32) # label(axiom). [assumption].
% 1.54/1.84 33 -organization(A,B) | -organization(A,C) | -greater(D,B) | -greater(C,D) | organization(A,D) # label(mp13_31) # label(axiom). [assumption].
% 1.54/1.84 43 -organization(A,B) | -organization(C,B) | -organization(C,D) | -class(A,E,B) | -class(C,E,B) | -reorganization(A,B,F) | -reorganization(C,B,D) | -reorganization_type(A,V6,B) | -reorganization_type(C,V6,B) | -complexity(A,V7,B) | -complexity(C,V8,B) | -greater(V8,V7) | greater(D,F) # label(a10_FOL_35) # label(hypothesis). [assumption].
% 1.54/1.84 44 -organization(A,B) | -organization(C,B) | -organization(A,D) | -organization(C,D) | -class(A,E,B) | -class(C,E,B) | -survival_chance(A,F,B) | -survival_chance(C,F,B) | -reorganization(A,B,D) | -reorganization(C,B,V6) | -reorganization_type(A,V7,B) | -reorganization_type(C,V7,B) | -survival_chance(A,V8,D) | -survival_chance(C,V9,D) | -complexity(A,V10,B) | -complexity(C,V11,B) | -greater(V11,V10) | greater(V8,V9) | V8 = V9 # label(a11_FOL_36) # label(hypothesis). [assumption].
% 1.54/1.84 89 greater(sk16,sk15). [resolve(30,a,13,a)].
% 1.54/1.84 99 -organization(sk6,A) | -greater(B,sk15) | -greater(A,B) | organization(sk6,B). [resolve(33,a,4,a)].
% 1.54/1.84 100 -organization(sk5,A) | -greater(B,sk15) | -greater(A,B) | organization(sk5,B). [resolve(33,a,3,a)].
% 1.54/1.84 412 -organization(A,sk15) | -organization(A,B) | -class(sk5,C,sk15) | -class(A,C,sk15) | -reorganization(sk5,sk15,D) | -reorganization(A,sk15,B) | -reorganization_type(A,sk7,sk15) | -complexity(sk5,E,sk15) | -complexity(A,F,sk15) | -greater(F,E) | greater(B,D). [resolve(43,h,15,a),unit_del(a,3)].
% 1.54/1.84 847 -greater(A,sk15) | -greater(sk17,A) | organization(sk6,A). [resolve(99,a,6,a)].
% 1.54/1.84 848 -greater(sk17,sk16) | organization(sk6,sk16). [resolve(847,a,89,a)].
% 1.54/1.84 849 -greater(A,sk15) | -greater(sk17,A) | organization(sk5,A). [resolve(100,a,5,a)].
% 1.54/1.84 852 -greater(sk17,sk16) | organization(sk5,sk16). [resolve(849,a,89,a)].
% 1.54/1.84 2030 -organization(sk6,A) | -class(sk5,B,sk15) | -class(sk6,B,sk15) | -reorganization(sk5,sk15,C) | -reorganization(sk6,sk15,A) | -complexity(sk5,D,sk15) | -complexity(sk6,E,sk15) | -greater(E,D) | greater(A,C). [resolve(412,g,16,a),unit_del(a,4)].
% 1.54/1.84 2031 -organization(sk6,A) | -class(sk5,B,sk15) | -class(sk6,B,sk15) | -reorganization(sk5,sk15,C) | -reorganization(sk6,sk15,A) | -complexity(sk6,D,sk15) | -greater(D,sk12) | greater(A,C). [resolve(2030,f,21,a)].
% 1.54/1.84 2033 -organization(sk6,A) | -class(sk5,B,sk15) | -class(sk6,B,sk15) | -reorganization(sk5,sk15,C) | -reorganization(sk6,sk15,A) | greater(A,C). [resolve(2031,f,22,a),unit_del(f,7)].
% 1.54/1.84 2034 -organization(sk6,A) | -reorganization(sk5,sk15,B) | -reorganization(sk6,sk15,A) | greater(A,B). [resolve(2033,c,10,a),unit_del(b,9)].
% 1.54/1.84 2036 -reorganization(sk5,sk15,A) | greater(sk17,A). [resolve(2034,c,14,a),unit_del(a,6)].
% 1.54/1.84 2037 greater(sk17,sk16). [resolve(2036,a,13,a)].
% 1.54/1.84 2176 organization(sk5,sk16). [back_unit_del(852),unit_del(a,2037)].
% 1.54/1.84 2177 organization(sk6,sk16). [back_unit_del(848),unit_del(a,2037)].
% 1.54/1.84 2378 $F. [ur(44,a,3,a,b,4,a,c,2176,a,e,9,a,f,10,a,g,11,a,h,12,a,i,13,a,j,14,a,k,15,a,l,16,a,m,18,a,n,20,a,o,21,a,p,22,a,q,7,a,r,23,a,s,25,a(flip)),unit_del(a,2177)].
% 1.54/1.84
% 1.54/1.84 % SZS output end Refutation
% 1.54/1.84 ============================== end of proof ==========================
% 1.54/1.84
% 1.54/1.84 ============================== STATISTICS ============================
% 1.54/1.84
% 1.54/1.84 Given=1372. Generated=9072. Kept=2368. proofs=1.
% 1.54/1.84 Usable=1163. Sos=836. Demods=1. Limbo=11, Disabled=397. Hints=0.
% 1.54/1.84 Megabytes=4.22.
% 1.54/1.84 User_CPU=0.86, System_CPU=0.01, Wall_clock=1.
% 1.54/1.84
% 1.54/1.84 ============================== end of statistics =====================
% 1.54/1.84
% 1.54/1.84 ============================== end of search =========================
% 1.54/1.84
% 1.54/1.84 THEOREM PROVED
% 1.54/1.84 % SZS status Unsatisfiable
% 1.54/1.84
% 1.54/1.84 Exiting with 1 proof.
% 1.54/1.84
% 1.54/1.84 Process 22149 exit (max_proofs) Thu Jun 9 10:45:21 2022
% 1.54/1.84 Prover9 interrupted
%------------------------------------------------------------------------------