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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : MGT035-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:06:06 EDT 2022

% Result   : Unknown 210.54s 210.73s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : MGT035-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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:05:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.67/1.86  ----- Otter 3.3f, August 2004 -----
% 1.67/1.86  The process was started by sandbox on n008.cluster.edu,
% 1.67/1.86  Wed Jul 27 04:05:23 2022
% 1.67/1.86  The command was "./otter".  The process ID is 23644.
% 1.67/1.86  
% 1.67/1.86  set(prolog_style_variables).
% 1.67/1.86  set(auto).
% 1.67/1.86     dependent: set(auto1).
% 1.67/1.86     dependent: set(process_input).
% 1.67/1.86     dependent: clear(print_kept).
% 1.67/1.86     dependent: clear(print_new_demod).
% 1.67/1.86     dependent: clear(print_back_demod).
% 1.67/1.86     dependent: clear(print_back_sub).
% 1.67/1.86     dependent: set(control_memory).
% 1.67/1.86     dependent: assign(max_mem, 12000).
% 1.67/1.86     dependent: assign(pick_given_ratio, 4).
% 1.67/1.86     dependent: assign(stats_level, 1).
% 1.67/1.86     dependent: assign(max_seconds, 10800).
% 1.67/1.86  clear(print_given).
% 1.67/1.86  
% 1.67/1.86  list(usable).
% 1.67/1.86  0 [] A=A.
% 1.67/1.86  0 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.67/1.86  0 [] -in_environment(A,B)| -in_environment(A,C)|greater(C,B)|C=B|greater(B,C).
% 1.67/1.86  0 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.67/1.86  0 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.67/1.86  0 [] A!=B|greater_or_e_qual(A,B).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(B,C,A,D)| -greater_or_e_qual(growth_rate(C,D),zero)| -greater(zero,growth_rate(B,D))|outcompetes(C,B,D).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(B,C,A,D)| -outcompetes(C,B,D)|greater_or_e_qual(growth_rate(C,D),zero).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(B,C,A,D)| -outcompetes(C,B,D)|greater(zero,growth_rate(B,D)).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(first_movers,B)=zero|greater(growth_rate(first_movers,B),zero)|greater(growth_rate(efficient_producers,B),zero).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(first_movers,B)=zero|greater(growth_rate(first_movers,B),zero)|greater(zero,growth_rate(first_movers,B)).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(first_movers,B)=zero|greater(zero,growth_rate(efficient_producers,B))|greater(growth_rate(efficient_producers,B),zero).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(first_movers,B)=zero|greater(zero,growth_rate(efficient_producers,B))|greater(zero,growth_rate(first_movers,B)).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(efficient_producers,B)=zero|greater(growth_rate(first_movers,B),zero)|greater(growth_rate(efficient_producers,B),zero).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(efficient_producers,B)=zero|greater(growth_rate(first_movers,B),zero)|greater(zero,growth_rate(first_movers,B)).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(efficient_producers,B)=zero|greater(zero,growth_rate(efficient_producers,B))|greater(growth_rate(efficient_producers,B),zero).
% 1.67/1.86  0 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(efficient_producers,B)=zero|greater(zero,growth_rate(efficient_producers,B))|greater(zero,growth_rate(first_movers,B)).
% 1.67/1.86  0 [] -environment(A)| -stable(A)|in_environment(A,sk1(A)).
% 1.67/1.86  0 [] -environment(A)| -stable(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,sk1(A))|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)).
% 1.67/1.86  0 [] -environment(A)| -stable(A)|in_environment(A,sk2(A)).
% 1.67/1.86  0 [] -environment(A)| -stable(A)|greater_or_e_qual(sk2(A),e_quilibrium(A)).
% 1.67/1.86  0 [] environment(sk3).
% 1.67/1.86  0 [] stable(sk3).
% 1.67/1.86  0 [] -in_environment(sk3,A)|subpopulations(first_movers,efficient_producers,sk3,sk4(A)).
% 1.67/1.86  0 [] -in_environment(sk3,A)|greater_or_e_qual(sk4(A),A).
% 1.67/1.86  0 [] -in_environment(sk3,A)| -outcompetes(efficient_producers,first_movers,sk4(A)).
% 1.67/1.86  end_of_list.
% 1.67/1.86  
% 1.67/1.86  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.67/1.86  
% 1.67/1.86  This ia a non-Horn set with equality.  The strategy will be
% 1.67/1.86  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.67/1.86  deletion, with positive clauses in sos and nonpositive
% 1.67/1.86  clauses in usable.
% 1.67/1.86  
% 1.67/1.86     dependent: set(knuth_bendix).
% 1.67/1.86     dependent: set(anl_eq).
% 1.67/1.86     dependent: set(para_from).
% 1.67/1.86     dependent: set(para_into).
% 1.67/1.86     dependent: clear(para_from_right).
% 1.67/1.86     dependent: clear(para_into_right).
% 1.67/1.86     dependent: set(para_from_vars).
% 1.67/1.86     dependent: set(eq_units_both_ways).
% 1.67/1.86     dependent: set(dynamic_demod_all).
% 1.67/1.86     dependent: set(dynamic_demod).
% 1.67/1.86     dependent: set(order_eq).
% 1.67/1.86     dependent: set(back_demod).
% 1.67/1.86     dependent: set(lrpo).
% 1.67/1.86     dependent: set(hyper_res).
% 1.67/1.86     dependent: set(unit_deletion).
% 1.67/1.86     dependent: set(factor).
% 1.67/1.86  
% 1.67/1.86  ------------> process usable:
% 1.67/1.86  ** KEPT (pick-wt=9): 1 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.67/1.86  ** KEPT (pick-wt=15): 2 [] -in_environment(A,B)| -in_environment(A,C)|greater(C,B)|C=B|greater(B,C).
% 1.67/1.86  ** KEPT (pick-wt=9): 3 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.67/1.86  ** KEPT (pick-wt=6): 4 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.67/1.86  ** KEPT (pick-wt=6): 5 [] A!=B|greater_or_e_qual(A,B).
% 1.67/1.86  ** KEPT (pick-wt=21): 6 [] -environment(A)| -subpopulations(B,C,A,D)| -greater_or_e_qual(growth_rate(C,D),zero)| -greater(zero,growth_rate(B,D))|outcompetes(C,B,D).
% 1.67/1.86  ** KEPT (pick-wt=16): 7 [] -environment(A)| -subpopulations(B,C,A,D)| -outcompetes(C,B,D)|greater_or_e_qual(growth_rate(C,D),zero).
% 1.67/1.86  ** KEPT (pick-wt=16): 8 [] -environment(A)| -subpopulations(B,C,A,D)| -outcompetes(C,B,D)|greater(zero,growth_rate(B,D)).
% 1.67/1.86  ** KEPT (pick-wt=26): 9 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(first_movers,B)=zero|greater(growth_rate(first_movers,B),zero)|greater(growth_rate(efficient_producers,B),zero).
% 1.67/1.86  ** KEPT (pick-wt=26): 10 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(first_movers,B)=zero|greater(growth_rate(first_movers,B),zero)|greater(zero,growth_rate(first_movers,B)).
% 1.67/1.86  ** KEPT (pick-wt=26): 11 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(first_movers,B)=zero|greater(zero,growth_rate(efficient_producers,B))|greater(growth_rate(efficient_producers,B),zero).
% 1.67/1.86  ** KEPT (pick-wt=26): 12 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(first_movers,B)=zero|greater(zero,growth_rate(efficient_producers,B))|greater(zero,growth_rate(first_movers,B)).
% 1.67/1.86  ** KEPT (pick-wt=26): 13 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(efficient_producers,B)=zero|greater(growth_rate(first_movers,B),zero)|greater(growth_rate(efficient_producers,B),zero).
% 1.67/1.86  ** KEPT (pick-wt=26): 14 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(efficient_producers,B)=zero|greater(growth_rate(first_movers,B),zero)|greater(zero,growth_rate(first_movers,B)).
% 1.67/1.86  ** KEPT (pick-wt=26): 15 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(efficient_producers,B)=zero|greater(zero,growth_rate(efficient_producers,B))|greater(growth_rate(efficient_producers,B),zero).
% 1.67/1.86  ** KEPT (pick-wt=26): 16 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,e_quilibrium(A))|growth_rate(efficient_producers,B)=zero|greater(zero,growth_rate(efficient_producers,B))|greater(zero,growth_rate(first_movers,B)).
% 1.67/1.86  ** KEPT (pick-wt=8): 17 [] -environment(A)| -stable(A)|in_environment(A,sk1(A)).
% 1.67/1.86  ** KEPT (pick-wt=20): 18 [] -environment(A)| -stable(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,sk1(A))|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)).
% 1.67/1.86  ** KEPT (pick-wt=8): 19 [] -environment(A)| -stable(A)|in_environment(A,sk2(A)).
% 1.67/1.86  ** KEPT (pick-wt=9): 20 [] -environment(A)| -stable(A)|greater_or_e_qual(sk2(A),e_quilibrium(A)).
% 1.67/1.86  ** KEPT (pick-wt=9): 21 [] -in_environment(sk3,A)|subpopulations(first_movers,efficient_producers,sk3,sk4(A)).
% 1.67/1.86  ** KEPT (pick-wt=7): 22 [] -in_environment(sk3,A)|greater_or_e_qual(sk4(A),A).
% 210.54/210.73  ** KEPT (pick-wt=8): 23 [] -in_environment(sk3,A)| -outcompetes(efficient_producers,first_movers,sk4(A)).
% 210.54/210.73  
% 210.54/210.73  ------------> process sos:
% 210.54/210.73  ** KEPT (pick-wt=3): 25 [] A=A.
% 210.54/210.73  ** KEPT (pick-wt=2): 26 [] environment(sk3).
% 210.54/210.73  ** KEPT (pick-wt=2): 27 [] stable(sk3).
% 210.54/210.73    Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] A=A.
% 210.54/210.73  25 back subsumes 24.
% 210.54/210.73  
% 210.54/210.73  ======= end of input processing =======
% 210.54/210.73  
% 210.54/210.73  =========== start of search ===========
% 210.54/210.73  
% 210.54/210.73  
% 210.54/210.73  Resetting weight limit to 18.
% 210.54/210.73  
% 210.54/210.73  
% 210.54/210.73  Resetting weight limit to 18.
% 210.54/210.73  
% 210.54/210.73  sos_size=2972
% 210.54/210.73  
% 210.54/210.73  Search stopped because sos empty.
% 210.54/210.73  
% 210.54/210.73  
% 210.54/210.73  Search stopped because sos empty.
% 210.54/210.73  
% 210.54/210.73  ============ end of search ============
% 210.54/210.73  
% 210.54/210.73  -------------- statistics -------------
% 210.54/210.73  clauses given               3202
% 210.54/210.73  clauses generated        1787003
% 210.54/210.73  clauses kept                3494
% 210.54/210.73  clauses forward subsumed   12791
% 210.54/210.73  clauses back subsumed        328
% 210.54/210.73  Kbytes malloced             5859
% 210.54/210.73  
% 210.54/210.73  ----------- times (seconds) -----------
% 210.54/210.73  user CPU time        208.88          (0 hr, 3 min, 28 sec)
% 210.54/210.73  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 210.54/210.73  wall-clock time      211             (0 hr, 3 min, 31 sec)
% 210.54/210.73  
% 210.54/210.73  Process 23644 finished Wed Jul 27 04:08:54 2022
% 210.54/210.73  Otter interrupted
% 210.54/210.73  PROOF NOT FOUND
%------------------------------------------------------------------------------