TSTP Solution File: MGT024+1 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : MGT024+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n032.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  : 0s
% DateTime : Sun Jul 17 21:57:42 EDT 2022

% Result   : Theorem 0.61s 1.02s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : MGT024+1 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.10  % Command  : bliksem %s
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % DateTime : Thu Jun  9 07:44:22 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.61/1.02  *** allocated 10000 integers for termspace/termends
% 0.61/1.02  *** allocated 10000 integers for clauses
% 0.61/1.02  *** allocated 10000 integers for justifications
% 0.61/1.02  Bliksem 1.12
% 0.61/1.02  
% 0.61/1.02  
% 0.61/1.02  Automatic Strategy Selection
% 0.61/1.02  
% 0.61/1.02  
% 0.61/1.02  Clauses:
% 0.61/1.02  
% 0.61/1.02  { ! environment( X ), ! subpopulations( first_movers, efficient_producers, 
% 0.61/1.02    X, Y ), in_environment( X, Y ) }.
% 0.61/1.02  { ! environment( X ), ! subpopulations( first_movers, efficient_producers, 
% 0.61/1.02    X, Y ), greater( number_of_organizations( X, Y ), zero ) }.
% 0.61/1.02  { ! environment( X ), ! greater_or_equal( Y, equilibrium( X ) ), ! greater
% 0.61/1.02    ( equilibrium( X ), Y ) }.
% 0.61/1.02  { ! environment( X ), ! in_environment( X, Y ), ! greater( 
% 0.61/1.02    number_of_organizations( X, Y ), zero ), ! greater( equilibrium( X ), Y )
% 0.61/1.02    , decreases( resources( X, Y ) ) }.
% 0.61/1.02  { ! environment( X ), ! in_environment( X, Y ), ! greater( 
% 0.61/1.02    number_of_organizations( X, Y ), zero ), greater( equilibrium( X ), Y ), 
% 0.61/1.02    constant( resources( X, Y ) ) }.
% 0.61/1.02  { ! environment( X ), ! in_environment( X, Y ), ! decreases( resources( X, 
% 0.61/1.02    Y ) ), ! decreases( number_of_organizations( X, Y ) ) }.
% 0.61/1.02  { ! environment( X ), ! in_environment( X, Y ), ! constant( resources( X, Y
% 0.61/1.02     ) ), constant( number_of_organizations( X, Y ) ) }.
% 0.61/1.02  { alpha2( X ), greater( growth_rate( efficient_producers, X ), zero ) }.
% 0.61/1.02  { alpha2( X ), greater( zero, growth_rate( first_movers, X ) ) }.
% 0.61/1.02  { ! alpha2( X ), alpha1( X ), greater( growth_rate( first_movers, X ), zero
% 0.61/1.02     ) }.
% 0.61/1.02  { ! alpha2( X ), alpha1( X ), greater( zero, growth_rate( 
% 0.61/1.02    efficient_producers, X ) ) }.
% 0.61/1.02  { ! alpha1( X ), alpha2( X ) }.
% 0.61/1.02  { ! greater( growth_rate( first_movers, X ), zero ), ! greater( zero, 
% 0.61/1.02    growth_rate( efficient_producers, X ) ), alpha2( X ) }.
% 0.61/1.02  { ! alpha1( X ), alpha3( X ), growth_rate( first_movers, X ) = zero }.
% 0.61/1.02  { ! alpha1( X ), alpha3( X ), growth_rate( efficient_producers, X ) = zero
% 0.61/1.02     }.
% 0.61/1.02  { ! alpha3( X ), alpha1( X ) }.
% 0.61/1.02  { ! growth_rate( first_movers, X ) = zero, ! growth_rate( 
% 0.61/1.02    efficient_producers, X ) = zero, alpha1( X ) }.
% 0.61/1.02  { ! alpha3( X ), ! environment( Y ), ! subpopulations( first_movers, 
% 0.61/1.02    efficient_producers, Y, X ), ! constant( number_of_organizations( Y, X )
% 0.61/1.02     ) }.
% 0.61/1.02  { environment( skol1( Y ) ), alpha3( X ) }.
% 0.61/1.02  { subpopulations( first_movers, efficient_producers, skol1( X ), X ), 
% 0.61/1.02    alpha3( X ) }.
% 0.61/1.02  { constant( number_of_organizations( skol1( X ), X ) ), alpha3( X ) }.
% 0.61/1.02  { environment( skol3 ) }.
% 0.61/1.02  { subpopulations( first_movers, efficient_producers, skol3, skol2 ) }.
% 0.61/1.02  { greater_or_equal( skol2, equilibrium( skol3 ) ) }.
% 0.61/1.02  { ! growth_rate( first_movers, skol2 ) = zero, ! growth_rate( 
% 0.61/1.02    efficient_producers, skol2 ) = zero }.
% 0.61/1.02  { ! greater( growth_rate( first_movers, skol2 ), zero ), ! greater( zero, 
% 0.61/1.02    growth_rate( efficient_producers, skol2 ) ) }.
% 0.61/1.02  { ! greater( growth_rate( efficient_producers, skol2 ), zero ), ! greater( 
% 0.61/1.02    zero, growth_rate( first_movers, skol2 ) ) }.
% 0.61/1.02  
% 0.61/1.02  percentage equality = 0.083333, percentage horn = 0.629630
% 0.61/1.02  This is a problem with some equality
% 0.61/1.02  
% 0.61/1.02  
% 0.61/1.02  
% 0.61/1.02  Options Used:
% 0.61/1.02  
% 0.61/1.02  useres =            1
% 0.61/1.02  useparamod =        1
% 0.61/1.02  useeqrefl =         1
% 0.61/1.02  useeqfact =         1
% 0.61/1.02  usefactor =         1
% 0.61/1.02  usesimpsplitting =  0
% 0.61/1.02  usesimpdemod =      5
% 0.61/1.02  usesimpres =        3
% 0.61/1.02  
% 0.61/1.02  resimpinuse      =  1000
% 0.61/1.02  resimpclauses =     20000
% 0.61/1.02  substype =          eqrewr
% 0.61/1.02  backwardsubs =      1
% 0.61/1.02  selectoldest =      5
% 0.61/1.02  
% 0.61/1.02  litorderings [0] =  split
% 0.61/1.02  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.61/1.02  
% 0.61/1.02  termordering =      kbo
% 0.61/1.02  
% 0.61/1.02  litapriori =        0
% 0.61/1.02  termapriori =       1
% 0.61/1.02  litaposteriori =    0
% 0.61/1.02  termaposteriori =   0
% 0.61/1.02  demodaposteriori =  0
% 0.61/1.02  ordereqreflfact =   0
% 0.61/1.02  
% 0.61/1.02  litselect =         negord
% 0.61/1.02  
% 0.61/1.02  maxweight =         15
% 0.61/1.02  maxdepth =          30000
% 0.61/1.02  maxlength =         115
% 0.61/1.02  maxnrvars =         195
% 0.61/1.02  excuselevel =       1
% 0.61/1.02  increasemaxweight = 1
% 0.61/1.02  
% 0.61/1.02  maxselected =       10000000
% 0.61/1.02  maxnrclauses =      10000000
% 0.61/1.02  
% 0.61/1.02  showgenerated =    0
% 0.61/1.02  showkept =         0
% 0.61/1.02  showselected =     0
% 0.61/1.02  showdeleted =      0
% 0.61/1.02  showresimp =       1
% 0.61/1.02  showstatus =       2000
% 0.61/1.02  
% 0.61/1.02  prologoutput =     0
% 0.61/1.02  nrgoals =          5000000
% 0.61/1.02  totalproof =       1
% 0.61/1.02  
% 0.61/1.02  Symbols occurring in the translation:
% 0.61/1.02  
% 0.61/1.02  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.61/1.02  .  [1, 2]      (w:1, o:26, a:1, s:1, b:0), 
% 0.61/1.02  !  [4, 1]      (w:0, o:13, a:1, s:1, b:0), 
% 0.61/1.02  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.61/1.02  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.61/1.02  environment  [37, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.61/1.02  first_movers  [38, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.61/1.02  efficient_producers  [39, 0]      (w:1, o:8, a:1, s:1, b:0), 
% 0.61/1.02  subpopulations  [40, 4]      (w:1, o:56, a:1, s:1, b:0), 
% 0.61/1.02  in_environment  [41, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 0.61/1.02  number_of_organizations  [42, 2]      (w:1, o:51, a:1, s:1, b:0), 
% 0.61/1.02  zero  [43, 0]      (w:1, o:10, a:1, s:1, b:0), 
% 0.61/1.02  greater  [44, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 0.61/1.02  equilibrium  [45, 1]      (w:1, o:21, a:1, s:1, b:0), 
% 0.61/1.02  greater_or_equal  [46, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 0.61/1.02  resources  [47, 2]      (w:1, o:54, a:1, s:1, b:0), 
% 0.61/1.02  decreases  [48, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.61/1.02  constant  [49, 1]      (w:1, o:18, a:1, s:1, b:0), 
% 0.61/1.02  growth_rate  [50, 2]      (w:1, o:55, a:1, s:1, b:0), 
% 0.61/1.02  alpha1  [51, 1]      (w:1, o:22, a:1, s:1, b:1), 
% 0.61/1.02  alpha2  [52, 1]      (w:1, o:23, a:1, s:1, b:1), 
% 0.61/1.02  alpha3  [53, 1]      (w:1, o:24, a:1, s:1, b:1), 
% 0.61/1.02  skol1  [54, 1]      (w:1, o:25, a:1, s:1, b:1), 
% 0.61/1.02  skol2  [55, 0]      (w:1, o:11, a:1, s:1, b:1), 
% 0.61/1.02  skol3  [56, 0]      (w:1, o:12, a:1, s:1, b:1).
% 0.61/1.02  
% 0.61/1.02  
% 0.61/1.02  Starting Search:
% 0.61/1.02  
% 0.61/1.02  
% 0.61/1.02  Bliksems!, er is een bewijs:
% 0.61/1.02  % SZS status Theorem
% 0.61/1.02  % SZS output start Refutation
% 0.61/1.02  
% 0.61/1.02  (0) {G0,W10,D2,L3,V2,M3} I { ! environment( X ), ! subpopulations( 
% 0.61/1.02    first_movers, efficient_producers, X, Y ), in_environment( X, Y ) }.
% 0.61/1.02  (1) {G0,W12,D3,L3,V2,M3} I { ! environment( X ), ! subpopulations( 
% 0.61/1.02    first_movers, efficient_producers, X, Y ), greater( 
% 0.61/1.02    number_of_organizations( X, Y ), zero ) }.
% 0.61/1.02  (2) {G0,W10,D3,L3,V2,M3} I { ! environment( X ), ! greater_or_equal( Y, 
% 0.61/1.02    equilibrium( X ) ), ! greater( equilibrium( X ), Y ) }.
% 0.61/1.02  (4) {G0,W18,D3,L5,V2,M5} I { ! environment( X ), ! in_environment( X, Y ), 
% 0.61/1.02    ! greater( number_of_organizations( X, Y ), zero ), greater( equilibrium
% 0.61/1.02    ( X ), Y ), constant( resources( X, Y ) ) }.
% 0.61/1.02  (6) {G0,W13,D3,L4,V2,M4} I { ! environment( X ), ! in_environment( X, Y ), 
% 0.61/1.02    ! constant( resources( X, Y ) ), constant( number_of_organizations( X, Y
% 0.61/1.02     ) ) }.
% 0.61/1.02  (7) {G0,W7,D3,L2,V1,M2} I { alpha2( X ), greater( growth_rate( 
% 0.61/1.02    efficient_producers, X ), zero ) }.
% 0.61/1.02  (8) {G0,W7,D3,L2,V1,M2} I { alpha2( X ), greater( zero, growth_rate( 
% 0.61/1.02    first_movers, X ) ) }.
% 0.61/1.02  (9) {G0,W9,D3,L3,V1,M3} I { ! alpha2( X ), alpha1( X ), greater( 
% 0.61/1.02    growth_rate( first_movers, X ), zero ) }.
% 0.61/1.02  (10) {G0,W9,D3,L3,V1,M3} I { ! alpha2( X ), alpha1( X ), greater( zero, 
% 0.61/1.02    growth_rate( efficient_producers, X ) ) }.
% 0.61/1.02  (13) {G0,W9,D3,L3,V1,M3} I { ! alpha1( X ), alpha3( X ), growth_rate( 
% 0.61/1.02    first_movers, X ) ==> zero }.
% 0.61/1.02  (14) {G0,W9,D3,L3,V1,M3} I { ! alpha1( X ), alpha3( X ), growth_rate( 
% 0.61/1.02    efficient_producers, X ) ==> zero }.
% 0.61/1.02  (17) {G0,W13,D3,L4,V2,M4} I { ! alpha3( X ), ! environment( Y ), ! 
% 0.61/1.02    subpopulations( first_movers, efficient_producers, Y, X ), ! constant( 
% 0.61/1.02    number_of_organizations( Y, X ) ) }.
% 0.61/1.02  (21) {G0,W2,D2,L1,V0,M1} I { environment( skol3 ) }.
% 0.61/1.02  (22) {G0,W5,D2,L1,V0,M1} I { subpopulations( first_movers, 
% 0.61/1.02    efficient_producers, skol3, skol2 ) }.
% 0.61/1.02  (23) {G0,W4,D3,L1,V0,M1} I { greater_or_equal( skol2, equilibrium( skol3 )
% 0.61/1.02     ) }.
% 0.61/1.02  (24) {G0,W10,D3,L2,V0,M2} I { ! growth_rate( first_movers, skol2 ) ==> zero
% 0.61/1.02    , ! growth_rate( efficient_producers, skol2 ) ==> zero }.
% 0.61/1.02  (25) {G0,W10,D3,L2,V0,M2} I { ! greater( growth_rate( first_movers, skol2 )
% 0.61/1.02    , zero ), ! greater( zero, growth_rate( efficient_producers, skol2 ) )
% 0.61/1.02     }.
% 0.61/1.02  (26) {G0,W10,D3,L2,V0,M2} I { ! greater( growth_rate( efficient_producers, 
% 0.61/1.02    skol2 ), zero ), ! greater( zero, growth_rate( first_movers, skol2 ) )
% 0.61/1.02     }.
% 0.61/1.02  (29) {G1,W3,D2,L1,V0,M1} R(22,0);r(21) { in_environment( skol3, skol2 ) }.
% 0.61/1.02  (36) {G1,W5,D3,L1,V0,M1} R(1,22);r(21) { greater( number_of_organizations( 
% 0.61/1.02    skol3, skol2 ), zero ) }.
% 0.61/1.02  (43) {G1,W4,D3,L1,V0,M1} R(2,23);r(21) { ! greater( equilibrium( skol3 ), 
% 0.61/1.02    skol2 ) }.
% 0.61/1.02  (59) {G2,W11,D3,L3,V0,M3} R(4,36);r(21) { ! in_environment( skol3, skol2 )
% 0.61/1.02    , greater( equilibrium( skol3 ), skol2 ), constant( resources( skol3, 
% 0.61/1.02    skol2 ) ) }.
% 0.61/1.02  (91) {G2,W8,D3,L2,V0,M2} R(6,29);r(21) { ! constant( resources( skol3, 
% 0.61/1.02    skol2 ) ), constant( number_of_organizations( skol3, skol2 ) ) }.
% 0.61/1.02  (102) {G1,W2,D2,L1,V0,M1} R(26,7);r(8) { alpha2( skol2 ) }.
% 0.61/1.02  (104) {G2,W7,D3,L2,V0,M2} R(102,10) { alpha1( skol2 ), greater( zero, 
% 0.61/1.02    growth_rate( efficient_producers, skol2 ) ) }.
% 0.61/1.02  (105) {G2,W7,D3,L2,V0,M2} R(102,9) { alpha1( skol2 ), greater( growth_rate
% 0.61/1.02    ( first_movers, skol2 ), zero ) }.
% 0.61/1.02  (113) {G3,W2,D2,L1,V0,M1} R(25,105);r(104) { alpha1( skol2 ) }.
% 0.61/1.02  (129) {G1,W6,D3,L2,V0,M2} R(17,22);r(21) { ! alpha3( skol2 ), ! constant( 
% 0.61/1.02    number_of_organizations( skol3, skol2 ) ) }.
% 0.61/1.02  (134) {G3,W6,D3,L2,V0,M2} R(129,91) { ! alpha3( skol2 ), ! constant( 
% 0.61/1.02    resources( skol3, skol2 ) ) }.
% 0.61/1.02  (150) {G4,W2,D2,L1,V0,M1} R(24,13);d(14);q;r(113) { alpha3( skol2 ) }.
% 0.61/1.02  (151) {G5,W4,D3,L1,V0,M1} R(150,134) { ! constant( resources( skol3, skol2
% 0.61/1.02     ) ) }.
% 0.61/1.02  (184) {G6,W0,D0,L0,V0,M0} S(59);r(29);r(43);r(151) {  }.
% 0.61/1.02  
% 0.61/1.02  
% 0.61/1.02  % SZS output end Refutation
% 0.61/1.02  found a proof!
% 0.61/1.02  
% 0.61/1.02  
% 0.61/1.02  Unprocessed initial clauses:
% 0.61/1.02  
% 0.61/1.02  (186) {G0,W10,D2,L3,V2,M3}  { ! environment( X ), ! subpopulations( 
% 0.61/1.02    first_movers, efficient_producers, X, Y ), in_environment( X, Y ) }.
% 0.61/1.02  (187) {G0,W12,D3,L3,V2,M3}  { ! environment( X ), ! subpopulations( 
% 0.61/1.02    first_movers, efficient_producers, X, Y ), greater( 
% 0.61/1.02    number_of_organizations( X, Y ), zero ) }.
% 0.61/1.02  (188) {G0,W10,D3,L3,V2,M3}  { ! environment( X ), ! greater_or_equal( Y, 
% 0.61/1.02    equilibrium( X ) ), ! greater( equilibrium( X ), Y ) }.
% 0.61/1.02  (189) {G0,W18,D3,L5,V2,M5}  { ! environment( X ), ! in_environment( X, Y )
% 0.61/1.02    , ! greater( number_of_organizations( X, Y ), zero ), ! greater( 
% 0.61/1.02    equilibrium( X ), Y ), decreases( resources( X, Y ) ) }.
% 0.61/1.02  (190) {G0,W18,D3,L5,V2,M5}  { ! environment( X ), ! in_environment( X, Y )
% 0.61/1.02    , ! greater( number_of_organizations( X, Y ), zero ), greater( 
% 0.61/1.02    equilibrium( X ), Y ), constant( resources( X, Y ) ) }.
% 0.61/1.02  (191) {G0,W13,D3,L4,V2,M4}  { ! environment( X ), ! in_environment( X, Y )
% 0.61/1.02    , ! decreases( resources( X, Y ) ), ! decreases( number_of_organizations
% 0.61/1.02    ( X, Y ) ) }.
% 0.61/1.02  (192) {G0,W13,D3,L4,V2,M4}  { ! environment( X ), ! in_environment( X, Y )
% 0.61/1.02    , ! constant( resources( X, Y ) ), constant( number_of_organizations( X, 
% 0.61/1.02    Y ) ) }.
% 0.61/1.02  (193) {G0,W7,D3,L2,V1,M2}  { alpha2( X ), greater( growth_rate( 
% 0.61/1.02    efficient_producers, X ), zero ) }.
% 0.61/1.02  (194) {G0,W7,D3,L2,V1,M2}  { alpha2( X ), greater( zero, growth_rate( 
% 0.61/1.02    first_movers, X ) ) }.
% 0.61/1.02  (195) {G0,W9,D3,L3,V1,M3}  { ! alpha2( X ), alpha1( X ), greater( 
% 0.61/1.02    growth_rate( first_movers, X ), zero ) }.
% 0.61/1.02  (196) {G0,W9,D3,L3,V1,M3}  { ! alpha2( X ), alpha1( X ), greater( zero, 
% 0.61/1.02    growth_rate( efficient_producers, X ) ) }.
% 0.61/1.02  (197) {G0,W4,D2,L2,V1,M2}  { ! alpha1( X ), alpha2( X ) }.
% 0.61/1.02  (198) {G0,W12,D3,L3,V1,M3}  { ! greater( growth_rate( first_movers, X ), 
% 0.61/1.02    zero ), ! greater( zero, growth_rate( efficient_producers, X ) ), alpha2
% 0.61/1.02    ( X ) }.
% 0.61/1.02  (199) {G0,W9,D3,L3,V1,M3}  { ! alpha1( X ), alpha3( X ), growth_rate( 
% 0.61/1.02    first_movers, X ) = zero }.
% 0.61/1.02  (200) {G0,W9,D3,L3,V1,M3}  { ! alpha1( X ), alpha3( X ), growth_rate( 
% 0.61/1.02    efficient_producers, X ) = zero }.
% 0.61/1.02  (201) {G0,W4,D2,L2,V1,M2}  { ! alpha3( X ), alpha1( X ) }.
% 0.61/1.02  (202) {G0,W12,D3,L3,V1,M3}  { ! growth_rate( first_movers, X ) = zero, ! 
% 0.61/1.02    growth_rate( efficient_producers, X ) = zero, alpha1( X ) }.
% 0.61/1.02  (203) {G0,W13,D3,L4,V2,M4}  { ! alpha3( X ), ! environment( Y ), ! 
% 0.61/1.02    subpopulations( first_movers, efficient_producers, Y, X ), ! constant( 
% 0.61/1.02    number_of_organizations( Y, X ) ) }.
% 0.61/1.02  (204) {G0,W5,D3,L2,V2,M2}  { environment( skol1( Y ) ), alpha3( X ) }.
% 0.61/1.02  (205) {G0,W8,D3,L2,V1,M2}  { subpopulations( first_movers, 
% 0.61/1.02    efficient_producers, skol1( X ), X ), alpha3( X ) }.
% 0.61/1.02  (206) {G0,W7,D4,L2,V1,M2}  { constant( number_of_organizations( skol1( X )
% 0.61/1.02    , X ) ), alpha3( X ) }.
% 0.61/1.02  (207) {G0,W2,D2,L1,V0,M1}  { environment( skol3 ) }.
% 0.61/1.02  (208) {G0,W5,D2,L1,V0,M1}  { subpopulations( first_movers, 
% 0.61/1.02    efficient_producers, skol3, skol2 ) }.
% 0.61/1.02  (209) {G0,W4,D3,L1,V0,M1}  { greater_or_equal( skol2, equilibrium( skol3 )
% 0.61/1.02     ) }.
% 0.61/1.02  (210) {G0,W10,D3,L2,V0,M2}  { ! growth_rate( first_movers, skol2 ) = zero, 
% 0.61/1.02    ! growth_rate( efficient_producers, skol2 ) = zero }.
% 0.61/1.02  (211) {G0,W10,D3,L2,V0,M2}  { ! greater( growth_rate( first_movers, skol2 )
% 0.61/1.02    , zero ), ! greater( zero, growth_rate( efficient_producers, skol2 ) )
% 0.61/1.02     }.
% 0.61/1.02  (212) {G0,W10,D3,L2,V0,M2}  { ! greater( growth_rate( efficient_producers, 
% 0.61/1.02    skol2 ), zero ), ! greater( zero, growth_rate( first_movers, skol2 ) )
% 0.61/1.02     }.
% 0.61/1.02  
% 0.61/1.02  
% 0.61/1.02  Total Proof:
% 0.61/1.02  
% 0.61/1.02  subsumption: (0) {G0,W10,D2,L3,V2,M3} I { ! environment( X ), ! 
% 0.61/1.02    subpopulations( first_movers, efficient_producers, X, Y ), in_environment
% 0.61/1.02    ( X, Y ) }.
% 0.61/1.02  parent0: (186) {G0,W10,D2,L3,V2,M3}  { ! environment( X ), ! subpopulations
% 0.61/1.02    ( first_movers, efficient_producers, X, Y ), in_environment( X, Y ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02     Y := Y
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02     2 ==> 2
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (1) {G0,W12,D3,L3,V2,M3} I { ! environment( X ), ! 
% 0.61/1.02    subpopulations( first_movers, efficient_producers, X, Y ), greater( 
% 0.61/1.02    number_of_organizations( X, Y ), zero ) }.
% 0.61/1.02  parent0: (187) {G0,W12,D3,L3,V2,M3}  { ! environment( X ), ! subpopulations
% 0.61/1.02    ( first_movers, efficient_producers, X, Y ), greater( 
% 0.61/1.02    number_of_organizations( X, Y ), zero ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02     Y := Y
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02     2 ==> 2
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (2) {G0,W10,D3,L3,V2,M3} I { ! environment( X ), ! 
% 0.61/1.02    greater_or_equal( Y, equilibrium( X ) ), ! greater( equilibrium( X ), Y )
% 0.61/1.02     }.
% 0.61/1.02  parent0: (188) {G0,W10,D3,L3,V2,M3}  { ! environment( X ), ! 
% 0.61/1.02    greater_or_equal( Y, equilibrium( X ) ), ! greater( equilibrium( X ), Y )
% 0.61/1.02     }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02     Y := Y
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02     2 ==> 2
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (4) {G0,W18,D3,L5,V2,M5} I { ! environment( X ), ! 
% 0.61/1.02    in_environment( X, Y ), ! greater( number_of_organizations( X, Y ), zero
% 0.61/1.02     ), greater( equilibrium( X ), Y ), constant( resources( X, Y ) ) }.
% 0.61/1.02  parent0: (190) {G0,W18,D3,L5,V2,M5}  { ! environment( X ), ! in_environment
% 0.61/1.02    ( X, Y ), ! greater( number_of_organizations( X, Y ), zero ), greater( 
% 0.61/1.02    equilibrium( X ), Y ), constant( resources( X, Y ) ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02     Y := Y
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02     2 ==> 2
% 0.61/1.02     3 ==> 3
% 0.61/1.02     4 ==> 4
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (6) {G0,W13,D3,L4,V2,M4} I { ! environment( X ), ! 
% 0.61/1.02    in_environment( X, Y ), ! constant( resources( X, Y ) ), constant( 
% 0.61/1.02    number_of_organizations( X, Y ) ) }.
% 0.61/1.02  parent0: (192) {G0,W13,D3,L4,V2,M4}  { ! environment( X ), ! in_environment
% 0.61/1.02    ( X, Y ), ! constant( resources( X, Y ) ), constant( 
% 0.61/1.02    number_of_organizations( X, Y ) ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02     Y := Y
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02     2 ==> 2
% 0.61/1.02     3 ==> 3
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (7) {G0,W7,D3,L2,V1,M2} I { alpha2( X ), greater( growth_rate
% 0.61/1.02    ( efficient_producers, X ), zero ) }.
% 0.61/1.02  parent0: (193) {G0,W7,D3,L2,V1,M2}  { alpha2( X ), greater( growth_rate( 
% 0.61/1.02    efficient_producers, X ), zero ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (8) {G0,W7,D3,L2,V1,M2} I { alpha2( X ), greater( zero, 
% 0.61/1.02    growth_rate( first_movers, X ) ) }.
% 0.61/1.02  parent0: (194) {G0,W7,D3,L2,V1,M2}  { alpha2( X ), greater( zero, 
% 0.61/1.02    growth_rate( first_movers, X ) ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (9) {G0,W9,D3,L3,V1,M3} I { ! alpha2( X ), alpha1( X ), 
% 0.61/1.02    greater( growth_rate( first_movers, X ), zero ) }.
% 0.61/1.02  parent0: (195) {G0,W9,D3,L3,V1,M3}  { ! alpha2( X ), alpha1( X ), greater( 
% 0.61/1.02    growth_rate( first_movers, X ), zero ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02     2 ==> 2
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (10) {G0,W9,D3,L3,V1,M3} I { ! alpha2( X ), alpha1( X ), 
% 0.61/1.02    greater( zero, growth_rate( efficient_producers, X ) ) }.
% 0.61/1.02  parent0: (196) {G0,W9,D3,L3,V1,M3}  { ! alpha2( X ), alpha1( X ), greater( 
% 0.61/1.02    zero, growth_rate( efficient_producers, X ) ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02     2 ==> 2
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (13) {G0,W9,D3,L3,V1,M3} I { ! alpha1( X ), alpha3( X ), 
% 0.61/1.02    growth_rate( first_movers, X ) ==> zero }.
% 0.61/1.02  parent0: (199) {G0,W9,D3,L3,V1,M3}  { ! alpha1( X ), alpha3( X ), 
% 0.61/1.02    growth_rate( first_movers, X ) = zero }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02     2 ==> 2
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (14) {G0,W9,D3,L3,V1,M3} I { ! alpha1( X ), alpha3( X ), 
% 0.61/1.02    growth_rate( efficient_producers, X ) ==> zero }.
% 0.61/1.02  parent0: (200) {G0,W9,D3,L3,V1,M3}  { ! alpha1( X ), alpha3( X ), 
% 0.61/1.02    growth_rate( efficient_producers, X ) = zero }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02     2 ==> 2
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (17) {G0,W13,D3,L4,V2,M4} I { ! alpha3( X ), ! environment( Y
% 0.61/1.02     ), ! subpopulations( first_movers, efficient_producers, Y, X ), ! 
% 0.61/1.02    constant( number_of_organizations( Y, X ) ) }.
% 0.61/1.02  parent0: (203) {G0,W13,D3,L4,V2,M4}  { ! alpha3( X ), ! environment( Y ), !
% 0.61/1.02     subpopulations( first_movers, efficient_producers, Y, X ), ! constant( 
% 0.61/1.02    number_of_organizations( Y, X ) ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := X
% 0.61/1.02     Y := Y
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02     2 ==> 2
% 0.61/1.02     3 ==> 3
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (21) {G0,W2,D2,L1,V0,M1} I { environment( skol3 ) }.
% 0.61/1.02  parent0: (207) {G0,W2,D2,L1,V0,M1}  { environment( skol3 ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (22) {G0,W5,D2,L1,V0,M1} I { subpopulations( first_movers, 
% 0.61/1.02    efficient_producers, skol3, skol2 ) }.
% 0.61/1.02  parent0: (208) {G0,W5,D2,L1,V0,M1}  { subpopulations( first_movers, 
% 0.61/1.02    efficient_producers, skol3, skol2 ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (23) {G0,W4,D3,L1,V0,M1} I { greater_or_equal( skol2, 
% 0.61/1.02    equilibrium( skol3 ) ) }.
% 0.61/1.02  parent0: (209) {G0,W4,D3,L1,V0,M1}  { greater_or_equal( skol2, equilibrium
% 0.61/1.02    ( skol3 ) ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  *** allocated 15000 integers for clauses
% 0.61/1.02  subsumption: (24) {G0,W10,D3,L2,V0,M2} I { ! growth_rate( first_movers, 
% 0.61/1.02    skol2 ) ==> zero, ! growth_rate( efficient_producers, skol2 ) ==> zero
% 0.61/1.02     }.
% 0.61/1.02  parent0: (210) {G0,W10,D3,L2,V0,M2}  { ! growth_rate( first_movers, skol2 )
% 0.61/1.02     = zero, ! growth_rate( efficient_producers, skol2 ) = zero }.
% 0.61/1.02  substitution0:
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (25) {G0,W10,D3,L2,V0,M2} I { ! greater( growth_rate( 
% 0.61/1.02    first_movers, skol2 ), zero ), ! greater( zero, growth_rate( 
% 0.61/1.02    efficient_producers, skol2 ) ) }.
% 0.61/1.02  parent0: (211) {G0,W10,D3,L2,V0,M2}  { ! greater( growth_rate( first_movers
% 0.61/1.02    , skol2 ), zero ), ! greater( zero, growth_rate( efficient_producers, 
% 0.61/1.02    skol2 ) ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (26) {G0,W10,D3,L2,V0,M2} I { ! greater( growth_rate( 
% 0.61/1.02    efficient_producers, skol2 ), zero ), ! greater( zero, growth_rate( 
% 0.61/1.02    first_movers, skol2 ) ) }.
% 0.61/1.02  parent0: (212) {G0,W10,D3,L2,V0,M2}  { ! greater( growth_rate( 
% 0.61/1.02    efficient_producers, skol2 ), zero ), ! greater( zero, growth_rate( 
% 0.61/1.02    first_movers, skol2 ) ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02     1 ==> 1
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  resolution: (260) {G1,W5,D2,L2,V0,M2}  { ! environment( skol3 ), 
% 0.61/1.02    in_environment( skol3, skol2 ) }.
% 0.61/1.02  parent0[1]: (0) {G0,W10,D2,L3,V2,M3} I { ! environment( X ), ! 
% 0.61/1.02    subpopulations( first_movers, efficient_producers, X, Y ), in_environment
% 0.61/1.02    ( X, Y ) }.
% 0.61/1.02  parent1[0]: (22) {G0,W5,D2,L1,V0,M1} I { subpopulations( first_movers, 
% 0.61/1.02    efficient_producers, skol3, skol2 ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := skol3
% 0.61/1.02     Y := skol2
% 0.61/1.02  end
% 0.61/1.02  substitution1:
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  resolution: (261) {G1,W3,D2,L1,V0,M1}  { in_environment( skol3, skol2 ) }.
% 0.61/1.02  parent0[0]: (260) {G1,W5,D2,L2,V0,M2}  { ! environment( skol3 ), 
% 0.61/1.02    in_environment( skol3, skol2 ) }.
% 0.61/1.02  parent1[0]: (21) {G0,W2,D2,L1,V0,M1} I { environment( skol3 ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02  end
% 0.61/1.02  substitution1:
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  subsumption: (29) {G1,W3,D2,L1,V0,M1} R(22,0);r(21) { in_environment( skol3
% 0.61/1.02    , skol2 ) }.
% 0.61/1.02  parent0: (261) {G1,W3,D2,L1,V0,M1}  { in_environment( skol3, skol2 ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02  end
% 0.61/1.02  permutation0:
% 0.61/1.02     0 ==> 0
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  resolution: (262) {G1,W7,D3,L2,V0,M2}  { ! environment( skol3 ), greater( 
% 0.61/1.02    number_of_organizations( skol3, skol2 ), zero ) }.
% 0.61/1.02  parent0[1]: (1) {G0,W12,D3,L3,V2,M3} I { ! environment( X ), ! 
% 0.61/1.02    subpopulations( first_movers, efficient_producers, X, Y ), greater( 
% 0.61/1.02    number_of_organizations( X, Y ), zero ) }.
% 0.61/1.02  parent1[0]: (22) {G0,W5,D2,L1,V0,M1} I { subpopulations( first_movers, 
% 0.61/1.02    efficient_producers, skol3, skol2 ) }.
% 0.61/1.02  substitution0:
% 0.61/1.02     X := skol3
% 0.61/1.02     Y := skol2
% 0.61/1.02  end
% 0.61/1.02  substitution1:
% 0.61/1.02  end
% 0.61/1.02  
% 0.61/1.02  resolution: (263) {G1,W5,D3,L1,V0,M1}  { greater( number_of_organizations( 
% 0.61/1.02    skol3, skol2 ), zero ) }.
% 0.61/1.02  parent0[0]: (262) {G1,W7,D3,L2,V0,M2}  { ! environment( skol3 ), greater( 
% 0.61/1.02    number_of_organizations( skol3, skol2 ), zero ) }.
% 0.61/1.03  parent1[0]: (21) {G0,W2,D2,L1,V0,M1} I { environment( skol3 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (36) {G1,W5,D3,L1,V0,M1} R(1,22);r(21) { greater( 
% 0.61/1.03    number_of_organizations( skol3, skol2 ), zero ) }.
% 0.61/1.03  parent0: (263) {G1,W5,D3,L1,V0,M1}  { greater( number_of_organizations( 
% 0.61/1.03    skol3, skol2 ), zero ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (264) {G1,W6,D3,L2,V0,M2}  { ! environment( skol3 ), ! greater
% 0.61/1.03    ( equilibrium( skol3 ), skol2 ) }.
% 0.61/1.03  parent0[1]: (2) {G0,W10,D3,L3,V2,M3} I { ! environment( X ), ! 
% 0.61/1.03    greater_or_equal( Y, equilibrium( X ) ), ! greater( equilibrium( X ), Y )
% 0.61/1.03     }.
% 0.61/1.03  parent1[0]: (23) {G0,W4,D3,L1,V0,M1} I { greater_or_equal( skol2, 
% 0.61/1.03    equilibrium( skol3 ) ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03     X := skol3
% 0.61/1.03     Y := skol2
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (265) {G1,W4,D3,L1,V0,M1}  { ! greater( equilibrium( skol3 ), 
% 0.61/1.03    skol2 ) }.
% 0.61/1.03  parent0[0]: (264) {G1,W6,D3,L2,V0,M2}  { ! environment( skol3 ), ! greater
% 0.61/1.03    ( equilibrium( skol3 ), skol2 ) }.
% 0.61/1.03  parent1[0]: (21) {G0,W2,D2,L1,V0,M1} I { environment( skol3 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (43) {G1,W4,D3,L1,V0,M1} R(2,23);r(21) { ! greater( 
% 0.61/1.03    equilibrium( skol3 ), skol2 ) }.
% 0.61/1.03  parent0: (265) {G1,W4,D3,L1,V0,M1}  { ! greater( equilibrium( skol3 ), 
% 0.61/1.03    skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (266) {G1,W13,D3,L4,V0,M4}  { ! environment( skol3 ), ! 
% 0.61/1.03    in_environment( skol3, skol2 ), greater( equilibrium( skol3 ), skol2 ), 
% 0.61/1.03    constant( resources( skol3, skol2 ) ) }.
% 0.61/1.03  parent0[2]: (4) {G0,W18,D3,L5,V2,M5} I { ! environment( X ), ! 
% 0.61/1.03    in_environment( X, Y ), ! greater( number_of_organizations( X, Y ), zero
% 0.61/1.03     ), greater( equilibrium( X ), Y ), constant( resources( X, Y ) ) }.
% 0.61/1.03  parent1[0]: (36) {G1,W5,D3,L1,V0,M1} R(1,22);r(21) { greater( 
% 0.61/1.03    number_of_organizations( skol3, skol2 ), zero ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03     X := skol3
% 0.61/1.03     Y := skol2
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (267) {G1,W11,D3,L3,V0,M3}  { ! in_environment( skol3, skol2 )
% 0.61/1.03    , greater( equilibrium( skol3 ), skol2 ), constant( resources( skol3, 
% 0.61/1.03    skol2 ) ) }.
% 0.61/1.03  parent0[0]: (266) {G1,W13,D3,L4,V0,M4}  { ! environment( skol3 ), ! 
% 0.61/1.03    in_environment( skol3, skol2 ), greater( equilibrium( skol3 ), skol2 ), 
% 0.61/1.03    constant( resources( skol3, skol2 ) ) }.
% 0.61/1.03  parent1[0]: (21) {G0,W2,D2,L1,V0,M1} I { environment( skol3 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (59) {G2,W11,D3,L3,V0,M3} R(4,36);r(21) { ! in_environment( 
% 0.61/1.03    skol3, skol2 ), greater( equilibrium( skol3 ), skol2 ), constant( 
% 0.61/1.03    resources( skol3, skol2 ) ) }.
% 0.61/1.03  parent0: (267) {G1,W11,D3,L3,V0,M3}  { ! in_environment( skol3, skol2 ), 
% 0.61/1.03    greater( equilibrium( skol3 ), skol2 ), constant( resources( skol3, skol2
% 0.61/1.03     ) ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03     1 ==> 1
% 0.61/1.03     2 ==> 2
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (268) {G1,W10,D3,L3,V0,M3}  { ! environment( skol3 ), ! 
% 0.61/1.03    constant( resources( skol3, skol2 ) ), constant( number_of_organizations
% 0.61/1.03    ( skol3, skol2 ) ) }.
% 0.61/1.03  parent0[1]: (6) {G0,W13,D3,L4,V2,M4} I { ! environment( X ), ! 
% 0.61/1.03    in_environment( X, Y ), ! constant( resources( X, Y ) ), constant( 
% 0.61/1.03    number_of_organizations( X, Y ) ) }.
% 0.61/1.03  parent1[0]: (29) {G1,W3,D2,L1,V0,M1} R(22,0);r(21) { in_environment( skol3
% 0.61/1.03    , skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03     X := skol3
% 0.61/1.03     Y := skol2
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (269) {G1,W8,D3,L2,V0,M2}  { ! constant( resources( skol3, 
% 0.61/1.03    skol2 ) ), constant( number_of_organizations( skol3, skol2 ) ) }.
% 0.61/1.03  parent0[0]: (268) {G1,W10,D3,L3,V0,M3}  { ! environment( skol3 ), ! 
% 0.61/1.03    constant( resources( skol3, skol2 ) ), constant( number_of_organizations
% 0.61/1.03    ( skol3, skol2 ) ) }.
% 0.61/1.03  parent1[0]: (21) {G0,W2,D2,L1,V0,M1} I { environment( skol3 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (91) {G2,W8,D3,L2,V0,M2} R(6,29);r(21) { ! constant( resources
% 0.61/1.03    ( skol3, skol2 ) ), constant( number_of_organizations( skol3, skol2 ) )
% 0.61/1.03     }.
% 0.61/1.03  parent0: (269) {G1,W8,D3,L2,V0,M2}  { ! constant( resources( skol3, skol2 )
% 0.61/1.03     ), constant( number_of_organizations( skol3, skol2 ) ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03     1 ==> 1
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (270) {G1,W7,D3,L2,V0,M2}  { ! greater( zero, growth_rate( 
% 0.61/1.03    first_movers, skol2 ) ), alpha2( skol2 ) }.
% 0.61/1.03  parent0[0]: (26) {G0,W10,D3,L2,V0,M2} I { ! greater( growth_rate( 
% 0.61/1.03    efficient_producers, skol2 ), zero ), ! greater( zero, growth_rate( 
% 0.61/1.03    first_movers, skol2 ) ) }.
% 0.61/1.03  parent1[1]: (7) {G0,W7,D3,L2,V1,M2} I { alpha2( X ), greater( growth_rate( 
% 0.61/1.03    efficient_producers, X ), zero ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03     X := skol2
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (271) {G1,W4,D2,L2,V0,M2}  { alpha2( skol2 ), alpha2( skol2 )
% 0.61/1.03     }.
% 0.61/1.03  parent0[0]: (270) {G1,W7,D3,L2,V0,M2}  { ! greater( zero, growth_rate( 
% 0.61/1.03    first_movers, skol2 ) ), alpha2( skol2 ) }.
% 0.61/1.03  parent1[1]: (8) {G0,W7,D3,L2,V1,M2} I { alpha2( X ), greater( zero, 
% 0.61/1.03    growth_rate( first_movers, X ) ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03     X := skol2
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  factor: (272) {G1,W2,D2,L1,V0,M1}  { alpha2( skol2 ) }.
% 0.61/1.03  parent0[0, 1]: (271) {G1,W4,D2,L2,V0,M2}  { alpha2( skol2 ), alpha2( skol2
% 0.61/1.03     ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (102) {G1,W2,D2,L1,V0,M1} R(26,7);r(8) { alpha2( skol2 ) }.
% 0.61/1.03  parent0: (272) {G1,W2,D2,L1,V0,M1}  { alpha2( skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (273) {G1,W7,D3,L2,V0,M2}  { alpha1( skol2 ), greater( zero, 
% 0.61/1.03    growth_rate( efficient_producers, skol2 ) ) }.
% 0.61/1.03  parent0[0]: (10) {G0,W9,D3,L3,V1,M3} I { ! alpha2( X ), alpha1( X ), 
% 0.61/1.03    greater( zero, growth_rate( efficient_producers, X ) ) }.
% 0.61/1.03  parent1[0]: (102) {G1,W2,D2,L1,V0,M1} R(26,7);r(8) { alpha2( skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03     X := skol2
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (104) {G2,W7,D3,L2,V0,M2} R(102,10) { alpha1( skol2 ), greater
% 0.61/1.03    ( zero, growth_rate( efficient_producers, skol2 ) ) }.
% 0.61/1.03  parent0: (273) {G1,W7,D3,L2,V0,M2}  { alpha1( skol2 ), greater( zero, 
% 0.61/1.03    growth_rate( efficient_producers, skol2 ) ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03     1 ==> 1
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (274) {G1,W7,D3,L2,V0,M2}  { alpha1( skol2 ), greater( 
% 0.61/1.03    growth_rate( first_movers, skol2 ), zero ) }.
% 0.61/1.03  parent0[0]: (9) {G0,W9,D3,L3,V1,M3} I { ! alpha2( X ), alpha1( X ), greater
% 0.61/1.03    ( growth_rate( first_movers, X ), zero ) }.
% 0.61/1.03  parent1[0]: (102) {G1,W2,D2,L1,V0,M1} R(26,7);r(8) { alpha2( skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03     X := skol2
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (105) {G2,W7,D3,L2,V0,M2} R(102,9) { alpha1( skol2 ), greater
% 0.61/1.03    ( growth_rate( first_movers, skol2 ), zero ) }.
% 0.61/1.03  parent0: (274) {G1,W7,D3,L2,V0,M2}  { alpha1( skol2 ), greater( growth_rate
% 0.61/1.03    ( first_movers, skol2 ), zero ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03     1 ==> 1
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (275) {G1,W7,D3,L2,V0,M2}  { ! greater( zero, growth_rate( 
% 0.61/1.03    efficient_producers, skol2 ) ), alpha1( skol2 ) }.
% 0.61/1.03  parent0[0]: (25) {G0,W10,D3,L2,V0,M2} I { ! greater( growth_rate( 
% 0.61/1.03    first_movers, skol2 ), zero ), ! greater( zero, growth_rate( 
% 0.61/1.03    efficient_producers, skol2 ) ) }.
% 0.61/1.03  parent1[1]: (105) {G2,W7,D3,L2,V0,M2} R(102,9) { alpha1( skol2 ), greater( 
% 0.61/1.03    growth_rate( first_movers, skol2 ), zero ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (276) {G2,W4,D2,L2,V0,M2}  { alpha1( skol2 ), alpha1( skol2 )
% 0.61/1.03     }.
% 0.61/1.03  parent0[0]: (275) {G1,W7,D3,L2,V0,M2}  { ! greater( zero, growth_rate( 
% 0.61/1.03    efficient_producers, skol2 ) ), alpha1( skol2 ) }.
% 0.61/1.03  parent1[1]: (104) {G2,W7,D3,L2,V0,M2} R(102,10) { alpha1( skol2 ), greater
% 0.61/1.03    ( zero, growth_rate( efficient_producers, skol2 ) ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  factor: (277) {G2,W2,D2,L1,V0,M1}  { alpha1( skol2 ) }.
% 0.61/1.03  parent0[0, 1]: (276) {G2,W4,D2,L2,V0,M2}  { alpha1( skol2 ), alpha1( skol2
% 0.61/1.03     ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (113) {G3,W2,D2,L1,V0,M1} R(25,105);r(104) { alpha1( skol2 )
% 0.61/1.03     }.
% 0.61/1.03  parent0: (277) {G2,W2,D2,L1,V0,M1}  { alpha1( skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (278) {G1,W8,D3,L3,V0,M3}  { ! alpha3( skol2 ), ! environment( 
% 0.61/1.03    skol3 ), ! constant( number_of_organizations( skol3, skol2 ) ) }.
% 0.61/1.03  parent0[2]: (17) {G0,W13,D3,L4,V2,M4} I { ! alpha3( X ), ! environment( Y )
% 0.61/1.03    , ! subpopulations( first_movers, efficient_producers, Y, X ), ! constant
% 0.61/1.03    ( number_of_organizations( Y, X ) ) }.
% 0.61/1.03  parent1[0]: (22) {G0,W5,D2,L1,V0,M1} I { subpopulations( first_movers, 
% 0.61/1.03    efficient_producers, skol3, skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03     X := skol2
% 0.61/1.03     Y := skol3
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (279) {G1,W6,D3,L2,V0,M2}  { ! alpha3( skol2 ), ! constant( 
% 0.61/1.03    number_of_organizations( skol3, skol2 ) ) }.
% 0.61/1.03  parent0[1]: (278) {G1,W8,D3,L3,V0,M3}  { ! alpha3( skol2 ), ! environment( 
% 0.61/1.03    skol3 ), ! constant( number_of_organizations( skol3, skol2 ) ) }.
% 0.61/1.03  parent1[0]: (21) {G0,W2,D2,L1,V0,M1} I { environment( skol3 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (129) {G1,W6,D3,L2,V0,M2} R(17,22);r(21) { ! alpha3( skol2 ), 
% 0.61/1.03    ! constant( number_of_organizations( skol3, skol2 ) ) }.
% 0.61/1.03  parent0: (279) {G1,W6,D3,L2,V0,M2}  { ! alpha3( skol2 ), ! constant( 
% 0.61/1.03    number_of_organizations( skol3, skol2 ) ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03     1 ==> 1
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (280) {G2,W6,D3,L2,V0,M2}  { ! alpha3( skol2 ), ! constant( 
% 0.61/1.03    resources( skol3, skol2 ) ) }.
% 0.61/1.03  parent0[1]: (129) {G1,W6,D3,L2,V0,M2} R(17,22);r(21) { ! alpha3( skol2 ), !
% 0.61/1.03     constant( number_of_organizations( skol3, skol2 ) ) }.
% 0.61/1.03  parent1[1]: (91) {G2,W8,D3,L2,V0,M2} R(6,29);r(21) { ! constant( resources
% 0.61/1.03    ( skol3, skol2 ) ), constant( number_of_organizations( skol3, skol2 ) )
% 0.61/1.03     }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (134) {G3,W6,D3,L2,V0,M2} R(129,91) { ! alpha3( skol2 ), ! 
% 0.61/1.03    constant( resources( skol3, skol2 ) ) }.
% 0.61/1.03  parent0: (280) {G2,W6,D3,L2,V0,M2}  { ! alpha3( skol2 ), ! constant( 
% 0.61/1.03    resources( skol3, skol2 ) ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03     1 ==> 1
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  eqswap: (281) {G0,W10,D3,L2,V0,M2}  { ! zero ==> growth_rate( first_movers
% 0.61/1.03    , skol2 ), ! growth_rate( efficient_producers, skol2 ) ==> zero }.
% 0.61/1.03  parent0[0]: (24) {G0,W10,D3,L2,V0,M2} I { ! growth_rate( first_movers, 
% 0.61/1.03    skol2 ) ==> zero, ! growth_rate( efficient_producers, skol2 ) ==> zero
% 0.61/1.03     }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  eqswap: (284) {G0,W9,D3,L3,V1,M3}  { zero ==> growth_rate( first_movers, X
% 0.61/1.03     ), ! alpha1( X ), alpha3( X ) }.
% 0.61/1.03  parent0[2]: (13) {G0,W9,D3,L3,V1,M3} I { ! alpha1( X ), alpha3( X ), 
% 0.61/1.03    growth_rate( first_movers, X ) ==> zero }.
% 0.61/1.03  substitution0:
% 0.61/1.03     X := X
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (286) {G1,W9,D3,L3,V0,M3}  { ! growth_rate( efficient_producers
% 0.61/1.03    , skol2 ) ==> zero, ! alpha1( skol2 ), alpha3( skol2 ) }.
% 0.61/1.03  parent0[0]: (281) {G0,W10,D3,L2,V0,M2}  { ! zero ==> growth_rate( 
% 0.61/1.03    first_movers, skol2 ), ! growth_rate( efficient_producers, skol2 ) ==> 
% 0.61/1.03    zero }.
% 0.61/1.03  parent1[0]: (284) {G0,W9,D3,L3,V1,M3}  { zero ==> growth_rate( first_movers
% 0.61/1.03    , X ), ! alpha1( X ), alpha3( X ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03     X := skol2
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  paramod: (287) {G1,W11,D2,L5,V0,M5}  { ! zero ==> zero, ! alpha1( skol2 ), 
% 0.61/1.03    alpha3( skol2 ), ! alpha1( skol2 ), alpha3( skol2 ) }.
% 0.61/1.03  parent0[2]: (14) {G0,W9,D3,L3,V1,M3} I { ! alpha1( X ), alpha3( X ), 
% 0.61/1.03    growth_rate( efficient_producers, X ) ==> zero }.
% 0.61/1.03  parent1[0; 2]: (286) {G1,W9,D3,L3,V0,M3}  { ! growth_rate( 
% 0.61/1.03    efficient_producers, skol2 ) ==> zero, ! alpha1( skol2 ), alpha3( skol2 )
% 0.61/1.03     }.
% 0.61/1.03  substitution0:
% 0.61/1.03     X := skol2
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  factor: (288) {G1,W9,D2,L4,V0,M4}  { ! zero ==> zero, ! alpha1( skol2 ), 
% 0.61/1.03    alpha3( skol2 ), alpha3( skol2 ) }.
% 0.61/1.03  parent0[1, 3]: (287) {G1,W11,D2,L5,V0,M5}  { ! zero ==> zero, ! alpha1( 
% 0.61/1.03    skol2 ), alpha3( skol2 ), ! alpha1( skol2 ), alpha3( skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  factor: (289) {G1,W7,D2,L3,V0,M3}  { ! zero ==> zero, ! alpha1( skol2 ), 
% 0.61/1.03    alpha3( skol2 ) }.
% 0.61/1.03  parent0[2, 3]: (288) {G1,W9,D2,L4,V0,M4}  { ! zero ==> zero, ! alpha1( 
% 0.61/1.03    skol2 ), alpha3( skol2 ), alpha3( skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  eqrefl: (290) {G0,W4,D2,L2,V0,M2}  { ! alpha1( skol2 ), alpha3( skol2 ) }.
% 0.61/1.03  parent0[0]: (289) {G1,W7,D2,L3,V0,M3}  { ! zero ==> zero, ! alpha1( skol2 )
% 0.61/1.03    , alpha3( skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (291) {G1,W2,D2,L1,V0,M1}  { alpha3( skol2 ) }.
% 0.61/1.03  parent0[0]: (290) {G0,W4,D2,L2,V0,M2}  { ! alpha1( skol2 ), alpha3( skol2 )
% 0.61/1.03     }.
% 0.61/1.03  parent1[0]: (113) {G3,W2,D2,L1,V0,M1} R(25,105);r(104) { alpha1( skol2 )
% 0.61/1.03     }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (150) {G4,W2,D2,L1,V0,M1} R(24,13);d(14);q;r(113) { alpha3( 
% 0.61/1.03    skol2 ) }.
% 0.61/1.03  parent0: (291) {G1,W2,D2,L1,V0,M1}  { alpha3( skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (292) {G4,W4,D3,L1,V0,M1}  { ! constant( resources( skol3, 
% 0.61/1.03    skol2 ) ) }.
% 0.61/1.03  parent0[0]: (134) {G3,W6,D3,L2,V0,M2} R(129,91) { ! alpha3( skol2 ), ! 
% 0.61/1.03    constant( resources( skol3, skol2 ) ) }.
% 0.61/1.03  parent1[0]: (150) {G4,W2,D2,L1,V0,M1} R(24,13);d(14);q;r(113) { alpha3( 
% 0.61/1.03    skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (151) {G5,W4,D3,L1,V0,M1} R(150,134) { ! constant( resources( 
% 0.61/1.03    skol3, skol2 ) ) }.
% 0.61/1.03  parent0: (292) {G4,W4,D3,L1,V0,M1}  { ! constant( resources( skol3, skol2 )
% 0.61/1.03     ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03     0 ==> 0
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (293) {G2,W8,D3,L2,V0,M2}  { greater( equilibrium( skol3 ), 
% 0.61/1.03    skol2 ), constant( resources( skol3, skol2 ) ) }.
% 0.61/1.03  parent0[0]: (59) {G2,W11,D3,L3,V0,M3} R(4,36);r(21) { ! in_environment( 
% 0.61/1.03    skol3, skol2 ), greater( equilibrium( skol3 ), skol2 ), constant( 
% 0.61/1.03    resources( skol3, skol2 ) ) }.
% 0.61/1.03  parent1[0]: (29) {G1,W3,D2,L1,V0,M1} R(22,0);r(21) { in_environment( skol3
% 0.61/1.03    , skol2 ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (294) {G2,W4,D3,L1,V0,M1}  { constant( resources( skol3, skol2
% 0.61/1.03     ) ) }.
% 0.61/1.03  parent0[0]: (43) {G1,W4,D3,L1,V0,M1} R(2,23);r(21) { ! greater( equilibrium
% 0.61/1.03    ( skol3 ), skol2 ) }.
% 0.61/1.03  parent1[0]: (293) {G2,W8,D3,L2,V0,M2}  { greater( equilibrium( skol3 ), 
% 0.61/1.03    skol2 ), constant( resources( skol3, skol2 ) ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  resolution: (295) {G3,W0,D0,L0,V0,M0}  {  }.
% 0.61/1.03  parent0[0]: (151) {G5,W4,D3,L1,V0,M1} R(150,134) { ! constant( resources( 
% 0.61/1.03    skol3, skol2 ) ) }.
% 0.61/1.03  parent1[0]: (294) {G2,W4,D3,L1,V0,M1}  { constant( resources( skol3, skol2
% 0.61/1.03     ) ) }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  substitution1:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  subsumption: (184) {G6,W0,D0,L0,V0,M0} S(59);r(29);r(43);r(151) {  }.
% 0.61/1.03  parent0: (295) {G3,W0,D0,L0,V0,M0}  {  }.
% 0.61/1.03  substitution0:
% 0.61/1.03  end
% 0.61/1.03  permutation0:
% 0.61/1.03  end
% 0.61/1.03  
% 0.61/1.03  Proof check complete!
% 0.61/1.03  
% 0.61/1.03  Memory use:
% 0.61/1.03  
% 0.61/1.03  space for terms:        2927
% 0.61/1.03  space for clauses:      8756
% 0.61/1.03  
% 0.61/1.03  
% 0.61/1.03  clauses generated:      457
% 0.61/1.03  clauses kept:           185
% 0.61/1.03  clauses selected:       76
% 0.61/1.03  clauses deleted:        29
% 0.61/1.03  clauses inuse deleted:  0
% 0.61/1.03  
% 0.61/1.03  subsentry:          741
% 0.61/1.03  literals s-matched: 403
% 0.61/1.03  literals matched:   403
% 0.61/1.03  full subsumption:   6
% 0.61/1.03  
% 0.61/1.03  checksum:           -1793093028
% 0.61/1.03  
% 0.61/1.03  
% 0.61/1.03  Bliksem ended
%------------------------------------------------------------------------------