TSTP Solution File: MGT017-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : MGT017-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n021.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:51 EDT 2022

% Result   : Unsatisfiable 0.71s 0.99s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : MGT017-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n021.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 07:37:08 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.71/0.99  ============================== Prover9 ===============================
% 0.71/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99  Process 3288 was started by sandbox on n021.cluster.edu,
% 0.71/0.99  Thu Jun  9 07:37:08 2022
% 0.71/0.99  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3127_n021.cluster.edu".
% 0.71/0.99  ============================== end of head ===========================
% 0.71/0.99  
% 0.71/0.99  ============================== INPUT =================================
% 0.71/0.99  
% 0.71/0.99  % Reading from file /tmp/Prover9_3127_n021.cluster.edu
% 0.71/0.99  
% 0.71/0.99  set(prolog_style_variables).
% 0.71/0.99  set(auto2).
% 0.71/0.99      % set(auto2) -> set(auto).
% 0.71/0.99      % set(auto) -> set(auto_inference).
% 0.71/0.99      % set(auto) -> set(auto_setup).
% 0.71/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99      % set(auto) -> set(auto_limits).
% 0.71/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99      % set(auto) -> set(auto_denials).
% 0.71/0.99      % set(auto) -> set(auto_process).
% 0.71/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99      % set(auto2) -> assign(stats, some).
% 0.71/0.99      % set(auto2) -> clear(echo_input).
% 0.71/0.99      % set(auto2) -> set(quiet).
% 0.71/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99      % set(auto2) -> clear(print_given).
% 0.71/0.99  assign(lrs_ticks,-1).
% 0.71/0.99  assign(sos_limit,10000).
% 0.71/0.99  assign(order,kbo).
% 0.71/0.99  set(lex_order_vars).
% 0.71/0.99  clear(print_given).
% 0.71/0.99  
% 0.71/0.99  % formulas(sos).  % not echoed (16 formulas)
% 0.71/0.99  
% 0.71/0.99  ============================== end of input ==========================
% 0.71/0.99  
% 0.71/0.99  % From the command line: assign(max_seconds, 300).
% 0.71/0.99  
% 0.71/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99  
% 0.71/0.99  % Formulas that are not ordinary clauses:
% 0.71/0.99  
% 0.71/0.99  ============================== end of process non-clausal formulas ===
% 0.71/0.99  
% 0.71/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99  
% 0.71/0.99  ============================== PREDICATE ELIMINATION =================
% 0.71/0.99  
% 0.71/0.99  ============================== end predicate elimination =============
% 0.71/0.99  
% 0.71/0.99  Auto_denials:
% 0.71/0.99    % copying label t17_FOL_16 to answer in negative clause
% 0.71/0.99  
% 0.71/0.99  Term ordering decisions:
% 0.71/0.99  Function symbol KB weights:  sk8=1. sk3=1. sk2=1. sk10=1. sk4=1. sk5=1. sk6=1. sk7=1. sk9=1. sk1=1.
% 0.71/0.99  
% 0.71/0.99  ============================== end of process initial clauses ========
% 0.71/0.99  
% 0.71/0.99  ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.99  
% 0.71/0.99  ============================== end of clauses for search =============
% 0.71/0.99  
% 0.71/0.99  ============================== SEARCH ================================
% 0.71/0.99  
% 0.71/0.99  % Starting search at 0.01 seconds.
% 0.71/0.99  
% 0.71/0.99  ============================== PROOF =================================
% 0.71/0.99  % SZS status Unsatisfiable
% 0.71/0.99  % SZS output start Refutation
% 0.71/0.99  
% 0.71/0.99  % Proof 1 at 0.02 (+ 0.00) seconds: t17_FOL_16.
% 0.71/0.99  % Length of proof is 21.
% 0.71/0.99  % Level of proof is 3.
% 0.71/0.99  % Maximum clause weight is 47.000.
% 0.71/0.99  % Given clauses 23.
% 0.71/0.99  
% 0.71/0.99  1 organization(sk2,sk8) # label(t17_FOL_4) # label(negated_conjecture).  [assumption].
% 0.71/0.99  2 organization(sk3,sk8) # label(t17_FOL_5) # label(negated_conjecture).  [assumption].
% 0.71/0.99  3 organization(sk3,sk10) # label(t17_FOL_6) # label(negated_conjecture).  [assumption].
% 0.71/0.99  4 greater(sk7,sk6) # label(t17_FOL_15) # label(negated_conjecture).  [assumption].
% 0.71/0.99  5 class(sk2,sk5,sk8) # label(t17_FOL_7) # label(negated_conjecture).  [assumption].
% 0.71/0.99  6 class(sk3,sk5,sk8) # label(t17_FOL_8) # label(negated_conjecture).  [assumption].
% 0.71/0.99  7 reorganization(sk2,sk8,sk9) # label(t17_FOL_9) # label(negated_conjecture).  [assumption].
% 0.71/0.99  8 reorganization(sk3,sk8,sk10) # label(t17_FOL_10) # label(negated_conjecture).  [assumption].
% 0.71/0.99  9 reorganization_type(sk2,sk4,sk8) # label(t17_FOL_11) # label(negated_conjecture).  [assumption].
% 0.71/0.99  10 reorganization_type(sk3,sk4,sk8) # label(t17_FOL_12) # label(negated_conjecture).  [assumption].
% 0.71/0.99  11 size(sk2,sk6,sk8) # label(t17_FOL_13) # label(negated_conjecture).  [assumption].
% 0.71/0.99  12 size(sk3,sk7,sk8) # label(t17_FOL_14) # label(negated_conjecture).  [assumption].
% 0.71/0.99  13 -greater(sk10,sk9) # label(t17_FOL_16) # label(negated_conjecture) # answer(t17_FOL_16).  [assumption].
% 0.71/0.99  14 -organization(A,B) | inertia(A,sk1(B,A),B) # label(mp5_1) # label(axiom).  [assumption].
% 0.71/0.99  15 -organization(A,B) | -organization(C,D) | -class(A,E,B) | -class(C,E,D) | -size(A,F,B) | -size(C,V6,D) | -inertia(A,V7,B) | -inertia(C,V8,D) | -greater(V6,F) | greater(V8,V7) # label(a5_FOL_2) # label(hypothesis).  [assumption].
% 0.71/0.99  16 -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) | -inertia(A,V7,B) | -inertia(C,V8,B) | -greater(V8,V7) | greater(D,F) # label(a13_FOL_3) # label(hypothesis).  [assumption].
% 0.71/0.99  18 inertia(sk3,sk1(sk8,sk3),sk8).  [ur(14,a,2,a)].
% 0.71/0.99  19 inertia(sk2,sk1(sk8,sk2),sk8).  [ur(14,a,1,a)].
% 0.71/0.99  60 greater(sk1(sk8,sk3),sk1(sk8,sk2)).  [ur(15,a,1,a,b,2,a,c,5,a,d,6,a,e,11,a,f,12,a,g,19,a,h,18,a,i,4,a)].
% 0.71/0.99  61 -greater(sk1(sk8,sk3),sk1(sk8,sk2)) # answer(t17_FOL_16).  [ur(16,a,1,a,b,2,a,c,3,a,d,5,a,e,6,a,f,7,a,g,8,a,h,9,a,i,10,a,j,19,a,k,18,a,m,13,a)].
% 0.71/0.99  62 $F # answer(t17_FOL_16).  [resolve(61,a,60,a)].
% 0.71/0.99  
% 0.71/0.99  % SZS output end Refutation
% 0.71/0.99  ============================== end of proof ==========================
% 0.71/0.99  
% 0.71/0.99  ============================== STATISTICS ============================
% 0.71/0.99  
% 0.71/0.99  Given=23. Generated=62. Kept=61. proofs=1.
% 0.71/0.99  Usable=20. Sos=35. Demods=0. Limbo=1, Disabled=20. Hints=0.
% 0.71/0.99  Megabytes=0.12.
% 0.71/0.99  User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.71/0.99  
% 0.71/0.99  ============================== end of statistics =====================
% 0.71/0.99  
% 0.71/0.99  ============================== end of search =========================
% 0.71/0.99  
% 0.71/0.99  THEOREM PROVED
% 0.71/0.99  % SZS status Unsatisfiable
% 0.71/0.99  
% 0.71/0.99  Exiting with 1 proof.
% 0.71/0.99  
% 0.71/0.99  Process 3288 exit (max_proofs) Thu Jun  9 07:37:08 2022
% 0.71/0.99  Prover9 interrupted
%------------------------------------------------------------------------------