TSTP Solution File: MGT001-1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : MGT001-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n008.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  : 300s
% DateTime : Wed Jul 27 13:05:55 EDT 2022

% Result   : Unsatisfiable 1.71s 1.91s
% Output   : Refutation 1.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   28 (  21 unt;   0 nHn;  28 RR)
%            Number of literals    :   68 (   0 equ;  41 neg)
%            Maximal clause size   :   11 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   44 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ organization(A,B)
    | reliability(A,sk1(B,A),B) ),
    file('MGT001-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ organization(A,B)
    | accountability(A,sk2(B,A),B) ),
    file('MGT001-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ organization(A,B)
    | reproducibility(A,sk3(B,A),B) ),
    file('MGT001-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ organization(A,B)
    | ~ organization(C,D)
    | ~ reliability(A,E,B)
    | ~ reliability(C,F,D)
    | ~ accountability(A,G,B)
    | ~ accountability(C,H,D)
    | ~ survival_chance(A,I,B)
    | ~ survival_chance(C,J,D)
    | ~ greater(F,E)
    | ~ greater(H,G)
    | greater(J,I) ),
    file('MGT001-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ organization(A,B)
    | ~ organization(C,D)
    | ~ reliability(A,E,B)
    | ~ reliability(C,F,D)
    | ~ accountability(A,G,B)
    | ~ accountability(C,H,D)
    | ~ reproducibility(A,I,B)
    | ~ reproducibility(C,J,D)
    | ~ greater(J,I)
    | greater(F,E) ),
    file('MGT001-1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ organization(A,B)
    | ~ organization(C,D)
    | ~ reliability(A,E,B)
    | ~ reliability(C,F,D)
    | ~ accountability(A,G,B)
    | ~ accountability(C,H,D)
    | ~ reproducibility(A,I,B)
    | ~ reproducibility(C,J,D)
    | ~ greater(J,I)
    | greater(H,G) ),
    file('MGT001-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ organization(A,B)
    | ~ organization(C,D)
    | ~ reorganization_free(A,B,B)
    | ~ reorganization_free(C,D,D)
    | ~ reproducibility(A,E,B)
    | ~ reproducibility(C,F,D)
    | ~ inertia(A,G,B)
    | ~ inertia(C,H,D)
    | ~ greater(H,G)
    | greater(F,E) ),
    file('MGT001-1.p',unknown),
    [] ).

cnf(10,axiom,
    ~ greater(sk11,sk10),
    file('MGT001-1.p',unknown),
    [] ).

cnf(11,axiom,
    organization(sk4,sk6),
    file('MGT001-1.p',unknown),
    [] ).

cnf(12,axiom,
    organization(sk5,sk7),
    file('MGT001-1.p',unknown),
    [] ).

cnf(13,axiom,
    reorganization_free(sk4,sk6,sk6),
    file('MGT001-1.p',unknown),
    [] ).

cnf(14,axiom,
    reorganization_free(sk5,sk7,sk7),
    file('MGT001-1.p',unknown),
    [] ).

cnf(15,axiom,
    inertia(sk4,sk8,sk6),
    file('MGT001-1.p',unknown),
    [] ).

cnf(16,axiom,
    inertia(sk5,sk9,sk7),
    file('MGT001-1.p',unknown),
    [] ).

cnf(17,axiom,
    survival_chance(sk4,sk10,sk6),
    file('MGT001-1.p',unknown),
    [] ).

cnf(18,axiom,
    survival_chance(sk5,sk11,sk7),
    file('MGT001-1.p',unknown),
    [] ).

cnf(19,axiom,
    greater(sk9,sk8),
    file('MGT001-1.p',unknown),
    [] ).

cnf(20,plain,
    reproducibility(sk4,sk3(sk6,sk4),sk6),
    inference(hyper,[status(thm)],[11,3]),
    [iquote('hyper,11,3')] ).

cnf(21,plain,
    accountability(sk4,sk2(sk6,sk4),sk6),
    inference(hyper,[status(thm)],[11,2]),
    [iquote('hyper,11,2')] ).

cnf(22,plain,
    reliability(sk4,sk1(sk6,sk4),sk6),
    inference(hyper,[status(thm)],[11,1]),
    [iquote('hyper,11,1')] ).

cnf(23,plain,
    reproducibility(sk5,sk3(sk7,sk5),sk7),
    inference(hyper,[status(thm)],[12,3]),
    [iquote('hyper,12,3')] ).

cnf(24,plain,
    accountability(sk5,sk2(sk7,sk5),sk7),
    inference(hyper,[status(thm)],[12,2]),
    [iquote('hyper,12,2')] ).

cnf(25,plain,
    reliability(sk5,sk1(sk7,sk5),sk7),
    inference(hyper,[status(thm)],[12,1]),
    [iquote('hyper,12,1')] ).

cnf(26,plain,
    greater(sk3(sk7,sk5),sk3(sk6,sk4)),
    inference(hyper,[status(thm)],[23,9,11,12,13,14,20,15,16,19]),
    [iquote('hyper,23,9,11,12,13,14,20,15,16,19')] ).

cnf(27,plain,
    greater(sk2(sk7,sk5),sk2(sk6,sk4)),
    inference(hyper,[status(thm)],[26,6,11,12,22,25,21,24,20,23]),
    [iquote('hyper,26,6,11,12,22,25,21,24,20,23')] ).

cnf(28,plain,
    greater(sk1(sk7,sk5),sk1(sk6,sk4)),
    inference(hyper,[status(thm)],[26,5,11,12,22,25,21,24,20,23]),
    [iquote('hyper,26,5,11,12,22,25,21,24,20,23')] ).

cnf(29,plain,
    greater(sk11,sk10),
    inference(hyper,[status(thm)],[28,4,11,12,22,25,21,24,17,18,27]),
    [iquote('hyper,28,4,11,12,22,25,21,24,17,18,27')] ).

cnf(30,plain,
    $false,
    inference(binary,[status(thm)],[29,10]),
    [iquote('binary,29.1,10.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : MGT001-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n008.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  : 300
% 0.12/0.33  % DateTime : Wed Jul 27 04:03:38 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.71/1.91  ----- Otter 3.3f, August 2004 -----
% 1.71/1.91  The process was started by sandbox2 on n008.cluster.edu,
% 1.71/1.91  Wed Jul 27 04:03:38 2022
% 1.71/1.91  The command was "./otter".  The process ID is 17426.
% 1.71/1.91  
% 1.71/1.91  set(prolog_style_variables).
% 1.71/1.91  set(auto).
% 1.71/1.91     dependent: set(auto1).
% 1.71/1.91     dependent: set(process_input).
% 1.71/1.91     dependent: clear(print_kept).
% 1.71/1.91     dependent: clear(print_new_demod).
% 1.71/1.91     dependent: clear(print_back_demod).
% 1.71/1.91     dependent: clear(print_back_sub).
% 1.71/1.91     dependent: set(control_memory).
% 1.71/1.91     dependent: assign(max_mem, 12000).
% 1.71/1.91     dependent: assign(pick_given_ratio, 4).
% 1.71/1.91     dependent: assign(stats_level, 1).
% 1.71/1.91     dependent: assign(max_seconds, 10800).
% 1.71/1.91  clear(print_given).
% 1.71/1.91  
% 1.71/1.91  list(usable).
% 1.71/1.91  0 [] -organization(A,B)|reliability(A,sk1(B,A),B).
% 1.71/1.91  0 [] -organization(A,B)|accountability(A,sk2(B,A),B).
% 1.71/1.91  0 [] -organization(A,B)|reproducibility(A,sk3(B,A),B).
% 1.71/1.91  0 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -survival_chance(A,I,B)| -survival_chance(C,J,D)| -greater(F,E)| -greater(H,G)|greater(J,I).
% 1.71/1.91  0 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)| -greater(J,I)|greater(F,E).
% 1.71/1.91  0 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)| -greater(J,I)|greater(H,G).
% 1.71/1.91  0 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)| -greater(F,E)| -greater(H,G)|greater(J,I).
% 1.71/1.91  0 [] -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -reproducibility(A,E,B)| -reproducibility(C,F,D)| -inertia(A,G,B)| -inertia(C,H,D)| -greater(F,E)|greater(H,G).
% 1.71/1.91  0 [] -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -reproducibility(A,E,B)| -reproducibility(C,F,D)| -inertia(A,G,B)| -inertia(C,H,D)| -greater(H,G)|greater(F,E).
% 1.71/1.91  0 [] organization(sk4,sk6).
% 1.71/1.91  0 [] organization(sk5,sk7).
% 1.71/1.91  0 [] reorganization_free(sk4,sk6,sk6).
% 1.71/1.91  0 [] reorganization_free(sk5,sk7,sk7).
% 1.71/1.91  0 [] inertia(sk4,sk8,sk6).
% 1.71/1.91  0 [] inertia(sk5,sk9,sk7).
% 1.71/1.91  0 [] survival_chance(sk4,sk10,sk6).
% 1.71/1.91  0 [] survival_chance(sk5,sk11,sk7).
% 1.71/1.91  0 [] greater(sk9,sk8).
% 1.71/1.91  0 [] -greater(sk11,sk10).
% 1.71/1.91  end_of_list.
% 1.71/1.91  
% 1.71/1.91  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=11.
% 1.71/1.91  
% 1.71/1.91  This is a Horn set without equality.  The strategy will
% 1.71/1.91  be hyperresolution, with satellites in sos and nuclei
% 1.71/1.91  in usable.
% 1.71/1.91  
% 1.71/1.91     dependent: set(hyper_res).
% 1.71/1.91     dependent: clear(order_hyper).
% 1.71/1.91  
% 1.71/1.91  ------------> process usable:
% 1.71/1.91  ** KEPT (pick-wt=9): 1 [] -organization(A,B)|reliability(A,sk1(B,A),B).
% 1.71/1.91  ** KEPT (pick-wt=9): 2 [] -organization(A,B)|accountability(A,sk2(B,A),B).
% 1.71/1.91  ** KEPT (pick-wt=9): 3 [] -organization(A,B)|reproducibility(A,sk3(B,A),B).
% 1.71/1.91  ** KEPT (pick-wt=39): 4 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -survival_chance(A,I,B)| -survival_chance(C,J,D)| -greater(F,E)| -greater(H,G)|greater(J,I).
% 1.71/1.91  ** KEPT (pick-wt=36): 5 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)| -greater(J,I)|greater(F,E).
% 1.71/1.91  ** KEPT (pick-wt=36): 6 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)| -greater(J,I)|greater(H,G).
% 1.71/1.91  ** KEPT (pick-wt=39): 7 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)| -greater(F,E)| -greater(H,G)|greater(J,I).
% 1.71/1.91  ** KEPT (pick-wt=36): 8 [] -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -reproducibility(A,E,B)| -reproducibility(C,F,D)| -inertia(A,G,B)| -inertia(C,H,D)| -greater(F,E)|greater(H,G).
% 1.71/1.91  ** KEPT (pick-wt=36): 9 [] -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -reproducibility(A,E,B)| -reproducibility(C,F,D)| -inertia(A,G,B)| -inertia(C,H,D)| -greater(H,G)|greater(F,E).
% 1.71/1.91  ** KEPT (pick-wt=3): 10 [] -greater(sk11,sk10).
% 1.71/1.91  
% 1.71/1.91  ------------> process sos:
% 1.71/1.91  ** KEPT (pick-wt=3): 11 [] organization(sk4,sk6).
% 1.71/1.91  ** KEPT (pick-wt=3): 12 [] organization(sk5,sk7).
% 1.71/1.91  ** KEPT (pick-wt=4): 13 [] reorganization_free(sk4,sk6,sk6).
% 1.71/1.91  ** KEPT (pick-wt=4): 14 [] reorganization_free(sk5,sk7,sk7).
% 1.71/1.91  ** KEPT (pick-wt=4): 15 [] inertia(sk4,sk8,sk6).
% 1.71/1.91  ** KEPT (pick-wt=4): 16 [] inertia(sk5,sk9,sk7).
% 1.71/1.91  ** KEPT (pick-wt=4): 17 [] survival_chance(sk4,sk10,sk6).
% 1.71/1.91  ** KEPT (pick-wt=4): 18 [] survival_chance(sk5,sk11,sk7).
% 1.71/1.91  ** KEPT (pick-wt=3): 19 [] greater(sk9,sk8).
% 1.71/1.91  
% 1.71/1.91  ======= end of input processing =======
% 1.71/1.91  
% 1.71/1.91  =========== start of search ===========
% 1.71/1.91  
% 1.71/1.91  -------- PROOF -------- 
% 1.71/1.91  
% 1.71/1.91  ----> UNIT CONFLICT at   0.00 sec ----> 30 [binary,29.1,10.1] $F.
% 1.71/1.91  
% 1.71/1.91  Length of proof is 10.  Level of proof is 4.
% 1.71/1.91  
% 1.71/1.91  ---------------- PROOF ----------------
% 1.71/1.91  % SZS status Unsatisfiable
% 1.71/1.91  % SZS output start Refutation
% See solution above
% 1.71/1.91  ------------ end of proof -------------
% 1.71/1.91  
% 1.71/1.91  
% 1.71/1.91  Search stopped by max_proofs option.
% 1.71/1.91  
% 1.71/1.91  
% 1.71/1.91  Search stopped by max_proofs option.
% 1.71/1.91  
% 1.71/1.91  ============ end of search ============
% 1.71/1.91  
% 1.71/1.91  -------------- statistics -------------
% 1.71/1.91  clauses given                 18
% 1.71/1.91  clauses generated             12
% 1.71/1.91  clauses kept                  29
% 1.71/1.91  clauses forward subsumed       2
% 1.71/1.91  clauses back subsumed          0
% 1.71/1.91  Kbytes malloced              976
% 1.71/1.91  
% 1.71/1.91  ----------- times (seconds) -----------
% 1.71/1.91  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.71/1.91  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.71/1.91  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.71/1.91  
% 1.71/1.91  That finishes the proof of the theorem.
% 1.71/1.91  
% 1.71/1.91  Process 17426 finished Wed Jul 27 04:03:40 2022
% 1.71/1.91  Otter interrupted
% 1.71/1.91  PROOF FOUND
%------------------------------------------------------------------------------