TSTP Solution File: MGT022+1 by Otter---3.3

View Problem - Process Solution

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

% Computer : n004.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:06:02 EDT 2022

% Result   : Theorem 1.59s 1.80s
% Output   : Refutation 1.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   14 (   7 unt;   3 nHn;  14 RR)
%            Number of literals    :   27 (   0 equ;  11 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ constant(A)
    | ~ decreases(A) ),
    file('MGT022+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ environment(A)
    | ~ subpopulations(B,C,A,D)
    | ~ greater(resilience(C),resilience(B))
    | ~ decreases(resources(A,D))
    | increases(difference(disbanding_rate(B,D),disbanding_rate(C,D))) ),
    file('MGT022+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ environment(A)
    | ~ subpopulations(B,C,A,D)
    | ~ greater(resilience(C),resilience(B))
    | ~ constant(resources(A,D))
    | constant(difference(disbanding_rate(B,D),disbanding_rate(C,D))) ),
    file('MGT022+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ increases(difference(disbanding_rate(first_movers,dollar_c1),disbanding_rate(efficient_producers,dollar_c1)))
    | constant(resources(dollar_c2,dollar_c1)) ),
    file('MGT022+1.p',unknown),
    [] ).

cnf(6,axiom,
    greater(resilience(efficient_producers),resilience(first_movers)),
    file('MGT022+1.p',unknown),
    [] ).

cnf(7,axiom,
    environment(dollar_c2),
    file('MGT022+1.p',unknown),
    [] ).

cnf(8,axiom,
    subpopulations(first_movers,efficient_producers,dollar_c2,dollar_c1),
    file('MGT022+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( decreases(resources(dollar_c2,dollar_c1))
    | constant(resources(dollar_c2,dollar_c1)) ),
    file('MGT022+1.p',unknown),
    [] ).

cnf(10,axiom,
    ( decreases(resources(dollar_c2,dollar_c1))
    | decreases(difference(disbanding_rate(first_movers,dollar_c1),disbanding_rate(efficient_producers,dollar_c1))) ),
    file('MGT022+1.p',unknown),
    [] ).

cnf(11,plain,
    ( constant(resources(dollar_c2,dollar_c1))
    | increases(difference(disbanding_rate(first_movers,dollar_c1),disbanding_rate(efficient_producers,dollar_c1))) ),
    inference(hyper,[status(thm)],[9,2,7,8,6]),
    [iquote('hyper,9,2,7,8,6')] ).

cnf(14,plain,
    constant(resources(dollar_c2,dollar_c1)),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[11,4])]),
    [iquote('hyper,11,4,factor_simp')] ).

cnf(15,plain,
    constant(difference(disbanding_rate(first_movers,dollar_c1),disbanding_rate(efficient_producers,dollar_c1))),
    inference(hyper,[status(thm)],[14,3,7,8,6]),
    [iquote('hyper,14,3,7,8,6')] ).

cnf(16,plain,
    decreases(difference(disbanding_rate(first_movers,dollar_c1),disbanding_rate(efficient_producers,dollar_c1))),
    inference(hyper,[status(thm)],[14,1,10]),
    [iquote('hyper,14,1,10')] ).

cnf(17,plain,
    $false,
    inference(hyper,[status(thm)],[16,1,15]),
    [iquote('hyper,16,1,15')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : MGT022+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n004.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 03:59:36 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.59/1.80  ----- Otter 3.3f, August 2004 -----
% 1.59/1.80  The process was started by sandbox on n004.cluster.edu,
% 1.59/1.80  Wed Jul 27 03:59:36 2022
% 1.59/1.80  The command was "./otter".  The process ID is 3082.
% 1.59/1.80  
% 1.59/1.80  set(prolog_style_variables).
% 1.59/1.80  set(auto).
% 1.59/1.80     dependent: set(auto1).
% 1.59/1.80     dependent: set(process_input).
% 1.59/1.80     dependent: clear(print_kept).
% 1.59/1.80     dependent: clear(print_new_demod).
% 1.59/1.80     dependent: clear(print_back_demod).
% 1.59/1.80     dependent: clear(print_back_sub).
% 1.59/1.80     dependent: set(control_memory).
% 1.59/1.80     dependent: assign(max_mem, 12000).
% 1.59/1.80     dependent: assign(pick_given_ratio, 4).
% 1.59/1.80     dependent: assign(stats_level, 1).
% 1.59/1.80     dependent: assign(max_seconds, 10800).
% 1.59/1.80  clear(print_given).
% 1.59/1.80  
% 1.59/1.80  formula_list(usable).
% 1.59/1.80  all X (constant(X)-> -decreases(X)).
% 1.59/1.80  all E S1 S2 T (environment(E)&subpopulations(S1,S2,E,T)&greater(resilience(S2),resilience(S1))-> (decreases(resources(E,T))->increases(difference(disbanding_rate(S1,T),disbanding_rate(S2,T))))& (constant(resources(E,T))->constant(difference(disbanding_rate(S1,T),disbanding_rate(S2,T))))).
% 1.59/1.80  greater(resilience(efficient_producers),resilience(first_movers)).
% 1.59/1.80  -(all E T (environment(E)&subpopulations(first_movers,efficient_producers,E,T)-> (decreases(resources(E,T))->increases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T))))& (constant(resources(E,T))-> -decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T)))))).
% 1.59/1.80  end_of_list.
% 1.59/1.80  
% 1.59/1.80  -------> usable clausifies to:
% 1.59/1.80  
% 1.59/1.80  list(usable).
% 1.59/1.80  0 [] -constant(X)| -decreases(X).
% 1.59/1.80  0 [] -environment(E)| -subpopulations(S1,S2,E,T)| -greater(resilience(S2),resilience(S1))| -decreases(resources(E,T))|increases(difference(disbanding_rate(S1,T),disbanding_rate(S2,T))).
% 1.59/1.80  0 [] -environment(E)| -subpopulations(S1,S2,E,T)| -greater(resilience(S2),resilience(S1))| -constant(resources(E,T))|constant(difference(disbanding_rate(S1,T),disbanding_rate(S2,T))).
% 1.59/1.80  0 [] greater(resilience(efficient_producers),resilience(first_movers)).
% 1.59/1.80  0 [] environment($c2).
% 1.59/1.80  0 [] subpopulations(first_movers,efficient_producers,$c2,$c1).
% 1.59/1.80  0 [] decreases(resources($c2,$c1))|constant(resources($c2,$c1)).
% 1.59/1.80  0 [] decreases(resources($c2,$c1))|decreases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1))).
% 1.59/1.80  0 [] -increases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1)))|constant(resources($c2,$c1)).
% 1.59/1.80  0 [] -increases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1)))|decreases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1))).
% 1.59/1.80  end_of_list.
% 1.59/1.80  
% 1.59/1.80  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.59/1.80  
% 1.59/1.80  This is a non-Horn set without equality.  The strategy will
% 1.59/1.80  be ordered hyper_res, unit deletion, and factoring, with
% 1.59/1.80  satellites in sos and with nuclei in usable.
% 1.59/1.80  
% 1.59/1.80     dependent: set(hyper_res).
% 1.59/1.80     dependent: set(factor).
% 1.59/1.80     dependent: set(unit_deletion).
% 1.59/1.80  
% 1.59/1.80  ------------> process usable:
% 1.59/1.80  ** KEPT (pick-wt=4): 1 [] -constant(A)| -decreases(A).
% 1.59/1.80  ** KEPT (pick-wt=24): 2 [] -environment(A)| -subpopulations(B,C,A,D)| -greater(resilience(C),resilience(B))| -decreases(resources(A,D))|increases(difference(disbanding_rate(B,D),disbanding_rate(C,D))).
% 1.59/1.80  ** KEPT (pick-wt=24): 3 [] -environment(A)| -subpopulations(B,C,A,D)| -greater(resilience(C),resilience(B))| -constant(resources(A,D))|constant(difference(disbanding_rate(B,D),disbanding_rate(C,D))).
% 1.59/1.80  ** KEPT (pick-wt=12): 4 [] -increases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1)))|constant(resources($c2,$c1)).
% 1.59/1.80  ** KEPT (pick-wt=16): 5 [] -increases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1)))|decreases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1))).
% 1.59/1.80  
% 1.59/1.80  ------------> process sos:
% 1.59/1.80  ** KEPT (pick-wt=5): 6 [] greater(resilience(efficient_producers),resilience(first_movers)).
% 1.59/1.80  ** KEPT (pick-wt=2): 7 [] environment($c2).
% 1.59/1.80  ** KEPT (pick-wt=5): 8 [] subpopulations(first_movers,efficient_producers,$c2,$c1).
% 1.59/1.80  ** KEPT (pick-wt=8): 9 [] decreases(resources($c2,$c1))|constant(resources($c2,$c1)).
% 1.59/1.80  ** KEPT (pick-wt=12): 10 [] decreases(resources($c2,$c1))|decreases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1))).
% 1.59/1.80  
% 1.59/1.80  ======= end of input processing =======
% 1.59/1.80  
% 1.59/1.80  =========== start of search ===========
% 1.59/1.80  
% 1.59/1.80  -------- PROOF -------- 
% 1.59/1.80  
% 1.59/1.80  -----> EMPTY CLAUSE at   0.00 sec ----> 17 [hyper,16,1,15] $F.
% 1.59/1.80  
% 1.59/1.80  Length of proof is 4.  Level of proof is 3.
% 1.59/1.80  
% 1.59/1.80  ---------------- PROOF ----------------
% 1.59/1.80  % SZS status Theorem
% 1.59/1.80  % SZS output start Refutation
% See solution above
% 1.59/1.80  ------------ end of proof -------------
% 1.59/1.80  
% 1.59/1.80  
% 1.59/1.80  Search stopped by max_proofs option.
% 1.59/1.80  
% 1.59/1.80  
% 1.59/1.80  Search stopped by max_proofs option.
% 1.59/1.80  
% 1.59/1.80  ============ end of search ============
% 1.59/1.80  
% 1.59/1.80  -------------- statistics -------------
% 1.59/1.80  clauses given                  9
% 1.59/1.80  clauses generated              7
% 1.59/1.80  clauses kept                  16
% 1.59/1.80  clauses forward subsumed       0
% 1.59/1.80  clauses back subsumed          7
% 1.59/1.80  Kbytes malloced              976
% 1.59/1.80  
% 1.59/1.80  ----------- times (seconds) -----------
% 1.59/1.80  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.59/1.80  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.59/1.80  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.59/1.80  
% 1.59/1.80  That finishes the proof of the theorem.
% 1.59/1.80  
% 1.59/1.80  Process 3082 finished Wed Jul 27 03:59:37 2022
% 1.59/1.80  Otter interrupted
% 1.59/1.80  PROOF FOUND
%------------------------------------------------------------------------------