TSTP Solution File: MGT033+2 by Otter---3.3

View Problem - Process Solution

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

% Computer : n017.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 276.35s 276.56s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : MGT033+2 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n017.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:23:18 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.64/1.85  ----- Otter 3.3f, August 2004 -----
% 1.64/1.85  The process was started by sandbox2 on n017.cluster.edu,
% 1.64/1.85  Wed Jul 27 03:23:18 2022
% 1.64/1.85  The command was "./otter".  The process ID is 20728.
% 1.64/1.85  
% 1.64/1.85  set(prolog_style_variables).
% 1.64/1.85  set(auto).
% 1.64/1.85     dependent: set(auto1).
% 1.64/1.85     dependent: set(process_input).
% 1.64/1.85     dependent: clear(print_kept).
% 1.64/1.85     dependent: clear(print_new_demod).
% 1.64/1.85     dependent: clear(print_back_demod).
% 1.64/1.85     dependent: clear(print_back_sub).
% 1.64/1.85     dependent: set(control_memory).
% 1.64/1.85     dependent: assign(max_mem, 12000).
% 1.64/1.85     dependent: assign(pick_given_ratio, 4).
% 1.64/1.85     dependent: assign(stats_level, 1).
% 1.64/1.85     dependent: assign(max_seconds, 10800).
% 1.64/1.85  clear(print_given).
% 1.64/1.85  
% 1.64/1.85  formula_list(usable).
% 1.64/1.85  all A (A=A).
% 1.64/1.85  all E S1 S2 T (environment(E)&subpopulation(S1,E,T)&subpopulation(S2,E,T)&greater(cardinality_at_time(S1,T),zero)&cardinality_at_time(S2,T)=zero->selection_favors(S1,S2,T)).
% 1.64/1.85  all E T (environment(E)&greater(number_of_organizations(E,T),zero)-> (exists S (subpopulation(S,E,T)&greater(cardinality_at_time(S,T),zero)))).
% 1.64/1.85  all X T (cardinality_at_time(X,t)=zero-> -greater(cardinality_at_time(X,T),zero)).
% 1.64/1.85  all E X T (environment(E)&in_environment(E,T)&greater(appear(X,E),T)->cardinality_at_time(X,T)=zero).
% 1.64/1.85  all E T (environment(E)&greater(number_of_organizations(E,T),zero)->in_environment(E,T)).
% 1.64/1.85  all E T1 T2 T (environment(E)&in_environment(E,T1)&in_environment(E,T2)&greater_or_e_qual(T2,T)&greater_or_e_qual(T,T1)->in_environment(E,T)).
% 1.64/1.85  all E (environment(E)->in_environment(E,start_time(E))).
% 1.64/1.85  all E (environment(E)->greater_or_e_qual(appear(first_movers,E),start_time(E))).
% 1.64/1.85  all E (environment(E)&in_environment(E,appear(first_movers,E))->in_environment(E,appear(an_organisation,E))).
% 1.64/1.85  all E (environment(E)->greater_or_e_qual(appear(first_movers,E),appear(an_organisation,E))).
% 1.64/1.85  all E (environment(E)->greater(number_of_organizations(e,appear(an_organisation,E)),zero)).
% 1.64/1.85  all E T (environment(E)&in_environment(E,T)->subpopulation(first_movers,E,T)&subpopulation(efficient_producers,E,T)).
% 1.64/1.85  all X Y Z (greater(X,Y)&greater(Y,Z)->greater(X,Z)).
% 1.64/1.85  all X Y (greater_or_e_qual(X,Y)<->greater(X,Y)|X=Y).
% 1.64/1.85  all E T (environment(E)&in_environment(E,T)&greater_or_e_qual(T,appear(an_organisation,E))->greater(number_of_organizations(E,T),zero)).
% 1.64/1.85  all E (environment(E)->greater(appear(efficient_producers,e),appear(first_movers,E))).
% 1.64/1.85  all E X T (environment(E)&subpopulation(X,E,T)&greater(cardinality_at_time(X,T),zero)->X=efficient_producers|X=first_movers).
% 1.64/1.85  -(all E T (environment(E)&in_environment(E,T)&greater_or_e_qual(T,appear(first_movers,E))&greater(appear(efficient_producers,E),T)->selection_favors(first_movers,efficient_producers,T))).
% 1.64/1.85  end_of_list.
% 1.64/1.85  
% 1.64/1.85  -------> usable clausifies to:
% 1.64/1.85  
% 1.64/1.85  list(usable).
% 1.64/1.85  0 [] A=A.
% 1.64/1.85  0 [] -environment(E)| -subpopulation(S1,E,T)| -subpopulation(S2,E,T)| -greater(cardinality_at_time(S1,T),zero)|cardinality_at_time(S2,T)!=zero|selection_favors(S1,S2,T).
% 1.64/1.85  0 [] -environment(E)| -greater(number_of_organizations(E,T),zero)|subpopulation($f1(E,T),E,T).
% 1.64/1.85  0 [] -environment(E)| -greater(number_of_organizations(E,T),zero)|greater(cardinality_at_time($f1(E,T),T),zero).
% 1.64/1.85  0 [] cardinality_at_time(X,t)!=zero| -greater(cardinality_at_time(X,T),zero).
% 1.64/1.85  0 [] -environment(E)| -in_environment(E,T)| -greater(appear(X,E),T)|cardinality_at_time(X,T)=zero.
% 1.64/1.85  0 [] -environment(E)| -greater(number_of_organizations(E,T),zero)|in_environment(E,T).
% 1.64/1.85  0 [] -environment(E)| -in_environment(E,T1)| -in_environment(E,T2)| -greater_or_e_qual(T2,T)| -greater_or_e_qual(T,T1)|in_environment(E,T).
% 1.64/1.85  0 [] -environment(E)|in_environment(E,start_time(E)).
% 1.64/1.85  0 [] -environment(E)|greater_or_e_qual(appear(first_movers,E),start_time(E)).
% 1.64/1.85  0 [] -environment(E)| -in_environment(E,appear(first_movers,E))|in_environment(E,appear(an_organisation,E)).
% 1.64/1.85  0 [] -environment(E)|greater_or_e_qual(appear(first_movers,E),appear(an_organisation,E)).
% 1.64/1.85  0 [] -environment(E)|greater(number_of_organizations(e,appear(an_organisation,E)),zero).
% 1.64/1.85  0 [] -environment(E)| -in_environment(E,T)|subpopulation(first_movers,E,T).
% 1.64/1.85  0 [] -environment(E)| -in_environment(E,T)|subpopulation(efficient_producers,E,T).
% 1.64/1.85  0 [] -greater(X,Y)| -greater(Y,Z)|greater(X,Z).
% 1.64/1.85  0 [] -greater_or_e_qual(X,Y)|greater(X,Y)|X=Y.
% 1.64/1.85  0 [] greater_or_e_qual(X,Y)| -greater(X,Y).
% 1.64/1.85  0 [] greater_or_e_qual(X,Y)|X!=Y.
% 1.64/1.85  0 [] -environment(E)| -in_environment(E,T)| -greater_or_e_qual(T,appear(an_organisation,E))|greater(number_of_organizations(E,T),zero).
% 1.64/1.85  0 [] -environment(E)|greater(appear(efficient_producers,e),appear(first_movers,E)).
% 1.64/1.85  0 [] -environment(E)| -subpopulation(X,E,T)| -greater(cardinality_at_time(X,T),zero)|X=efficient_producers|X=first_movers.
% 1.64/1.85  0 [] environment($c2).
% 1.64/1.85  0 [] in_environment($c2,$c1).
% 1.64/1.85  0 [] greater_or_e_qual($c1,appear(first_movers,$c2)).
% 1.64/1.85  0 [] greater(appear(efficient_producers,$c2),$c1).
% 1.64/1.85  0 [] -selection_favors(first_movers,efficient_producers,$c1).
% 1.64/1.85  end_of_list.
% 1.64/1.85  
% 1.64/1.85  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.64/1.85  
% 1.64/1.85  This ia a non-Horn set with equality.  The strategy will be
% 1.64/1.85  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.64/1.85  deletion, with positive clauses in sos and nonpositive
% 1.64/1.85  clauses in usable.
% 1.64/1.85  
% 1.64/1.85     dependent: set(knuth_bendix).
% 1.64/1.85     dependent: set(anl_eq).
% 1.64/1.85     dependent: set(para_from).
% 1.64/1.85     dependent: set(para_into).
% 1.64/1.85     dependent: clear(para_from_right).
% 1.64/1.85     dependent: clear(para_into_right).
% 1.64/1.85     dependent: set(para_from_vars).
% 1.64/1.85     dependent: set(eq_units_both_ways).
% 1.64/1.85     dependent: set(dynamic_demod_all).
% 1.64/1.85     dependent: set(dynamic_demod).
% 1.64/1.85     dependent: set(order_eq).
% 1.64/1.85     dependent: set(back_demod).
% 1.64/1.85     dependent: set(lrpo).
% 1.64/1.85     dependent: set(hyper_res).
% 1.64/1.85     dependent: set(unit_deletion).
% 1.64/1.85     dependent: set(factor).
% 1.64/1.85  
% 1.64/1.85  ------------> process usable:
% 1.64/1.85  ** KEPT (pick-wt=24): 1 [] -environment(A)| -subpopulation(B,A,C)| -subpopulation(D,A,C)| -greater(cardinality_at_time(B,C),zero)|cardinality_at_time(D,C)!=zero|selection_favors(B,D,C).
% 1.64/1.85  ** KEPT (pick-wt=13): 2 [] -environment(A)| -greater(number_of_organizations(A,B),zero)|subpopulation($f1(A,B),A,B).
% 1.64/1.85  ** KEPT (pick-wt=14): 3 [] -environment(A)| -greater(number_of_organizations(A,B),zero)|greater(cardinality_at_time($f1(A,B),B),zero).
% 1.64/1.85  ** KEPT (pick-wt=10): 4 [] cardinality_at_time(A,t)!=zero| -greater(cardinality_at_time(A,B),zero).
% 1.64/1.85  ** KEPT (pick-wt=15): 5 [] -environment(A)| -in_environment(A,B)| -greater(appear(C,A),B)|cardinality_at_time(C,B)=zero.
% 1.64/1.85  ** KEPT (pick-wt=10): 6 [] -environment(A)| -greater(number_of_organizations(A,B),zero)|in_environment(A,B).
% 1.64/1.85  ** KEPT (pick-wt=17): 7 [] -environment(A)| -in_environment(A,B)| -in_environment(A,C)| -greater_or_e_qual(C,D)| -greater_or_e_qual(D,B)|in_environment(A,D).
% 1.64/1.85  ** KEPT (pick-wt=6): 8 [] -environment(A)|in_environment(A,start_time(A)).
% 1.64/1.85  ** KEPT (pick-wt=8): 9 [] -environment(A)|greater_or_e_qual(appear(first_movers,A),start_time(A)).
% 1.64/1.85  ** KEPT (pick-wt=12): 10 [] -environment(A)| -in_environment(A,appear(first_movers,A))|in_environment(A,appear(an_organisation,A)).
% 1.64/1.85  ** KEPT (pick-wt=9): 11 [] -environment(A)|greater_or_e_qual(appear(first_movers,A),appear(an_organisation,A)).
% 1.64/1.85  ** KEPT (pick-wt=9): 12 [] -environment(A)|greater(number_of_organizations(e,appear(an_organisation,A)),zero).
% 1.64/1.85  ** KEPT (pick-wt=9): 13 [] -environment(A)| -in_environment(A,B)|subpopulation(first_movers,A,B).
% 1.64/1.85  ** KEPT (pick-wt=9): 14 [] -environment(A)| -in_environment(A,B)|subpopulation(efficient_producers,A,B).
% 1.64/1.85  ** KEPT (pick-wt=9): 15 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.64/1.85  ** KEPT (pick-wt=9): 16 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.64/1.85  ** KEPT (pick-wt=6): 17 [] greater_or_e_qual(A,B)| -greater(A,B).
% 1.64/1.85  ** KEPT (pick-wt=6): 18 [] greater_or_e_qual(A,B)|A!=B.
% 1.64/1.85  ** KEPT (pick-wt=15): 19 [] -environment(A)| -in_environment(A,B)| -greater_or_e_qual(B,appear(an_organisation,A))|greater(number_of_organizations(A,B),zero).
% 1.64/1.85  ** KEPT (pick-wt=9): 20 [] -environment(A)|greater(appear(efficient_producers,e),appear(first_movers,A)).
% 1.64/1.85  ** KEPT (pick-wt=17): 21 [] -environment(A)| -subpopulation(B,A,C)| -greater(cardinality_at_time(B,C),zero)|B=efficient_producers|B=first_movers.
% 1.64/1.85  ** KEPT (pick-wt=4): 22 [] -selection_favors(first_movers,efficient_producers,$c1).
% 1.64/1.85  
% 1.64/1.85  ------------> process sos:
% 1.64/1.85  ** KEPT (pick-wt=3): 25 [] A=A.
% 1.64/1.85  ** KEPT (pick-wt=2): 26 [] environment($c2).
% 1.64/1.85  ** KEPT (pick-wt=3): 27 [] in_environment($c2,$c1).
% 1.64/1.85  ** KEPT (pick-wt=5): 28 [] greater_or_e_qual($c1,appear(first_movers,$c2)).
% 276.35/276.56  ** KEPT (pick-wt=5): 29 [] greater(appear(efficient_producers,$c2),$c1).
% 276.35/276.56    Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] A=A.
% 276.35/276.56  
% 276.35/276.56  ======= end of input processing =======
% 276.35/276.56  
% 276.35/276.56  =========== start of search ===========
% 276.35/276.56  
% 276.35/276.56  
% 276.35/276.56  Resetting weight limit to 13.
% 276.35/276.56  
% 276.35/276.56  
% 276.35/276.56  Resetting weight limit to 13.
% 276.35/276.56  
% 276.35/276.56  sos_size=2796
% 276.35/276.56  
% 276.35/276.56  Search stopped because sos empty.
% 276.35/276.56  
% 276.35/276.56  
% 276.35/276.56  Search stopped because sos empty.
% 276.35/276.56  
% 276.35/276.56  ============ end of search ============
% 276.35/276.56  
% 276.35/276.56  -------------- statistics -------------
% 276.35/276.56  clauses given               2499
% 276.35/276.56  clauses generated        4111989
% 276.35/276.56  clauses kept                3284
% 276.35/276.56  clauses forward subsumed    2413
% 276.35/276.56  clauses back subsumed        826
% 276.35/276.56  Kbytes malloced             5859
% 276.35/276.56  
% 276.35/276.56  ----------- times (seconds) -----------
% 276.35/276.56  user CPU time        274.70          (0 hr, 4 min, 34 sec)
% 276.35/276.56  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 276.35/276.56  wall-clock time      276             (0 hr, 4 min, 36 sec)
% 276.35/276.56  
% 276.35/276.56  Process 20728 finished Wed Jul 27 03:27:54 2022
% 276.35/276.56  Otter interrupted
% 276.35/276.56  PROOF NOT FOUND
%------------------------------------------------------------------------------