TSTP Solution File: MGT026+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : MGT026+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:43 EDT 2022
% Result : Theorem 2.50s 2.93s
% Output : Refutation 2.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : MGT026+1 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.09 % Command : bliksem %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % DateTime : Thu Jun 9 12:35:07 EDT 2022
% 0.08/0.28 % CPUTime :
% 2.50/2.93 *** allocated 10000 integers for termspace/termends
% 2.50/2.93 *** allocated 10000 integers for clauses
% 2.50/2.93 *** allocated 10000 integers for justifications
% 2.50/2.93 Bliksem 1.12
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93 Automatic Strategy Selection
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93 Clauses:
% 2.50/2.93
% 2.50/2.93 { ! environment( T ), ! subpopulations( X, Y, T, Z ), ! greater(
% 2.50/2.93 growth_rate( Y, Z ), growth_rate( X, Z ) ), selection_favors( Y, X, Z ) }
% 2.50/2.93 .
% 2.50/2.93 { ! environment( T ), ! subpopulation( X, T, Z ), ! subpopulation( Y, T, Z
% 2.50/2.93 ), ! greater( cardinality_at_time( X, Z ), zero ), ! cardinality_at_time
% 2.50/2.93 ( Y, Z ) = zero, selection_favors( X, Y, Z ) }.
% 2.50/2.93 { ! environment( X ), ! in_environment( X, Y ), ! greater(
% 2.50/2.93 cardinality_at_time( first_movers, Y ), zero ), ! greater(
% 2.50/2.93 cardinality_at_time( efficient_producers, Y ), zero ), subpopulations(
% 2.50/2.93 first_movers, efficient_producers, X, Y ) }.
% 2.50/2.93 { ! environment( Y ), ! in_environment( Y, X ), greater_or_equal(
% 2.50/2.93 cardinality_at_time( first_movers, X ), zero ) }.
% 2.50/2.93 { ! environment( X ), ! in_environment( X, Y ), subpopulation( first_movers
% 2.50/2.93 , X, Y ) }.
% 2.50/2.93 { ! environment( X ), ! in_environment( X, Y ), subpopulation(
% 2.50/2.93 efficient_producers, X, Y ) }.
% 2.50/2.93 { ! environment( X ), greater_or_equal( critical_point( X ), appear(
% 2.50/2.93 efficient_producers, X ) ) }.
% 2.50/2.93 { ! greater( X, Z ), ! greater( Z, Y ), greater( X, Y ) }.
% 2.50/2.93 { ! greater_or_equal( X, Y ), greater( X, Y ), X = Y }.
% 2.50/2.93 { ! greater( X, Y ), greater_or_equal( X, Y ) }.
% 2.50/2.93 { ! X = Y, greater_or_equal( X, Y ) }.
% 2.50/2.93 { ! environment( X ), ! Y = critical_point( X ), ! greater( growth_rate(
% 2.50/2.93 efficient_producers, Y ), growth_rate( first_movers, Y ) ) }.
% 2.50/2.93 { ! environment( X ), ! Y = critical_point( X ), ! subpopulations(
% 2.50/2.93 first_movers, efficient_producers, X, Z ), ! greater( Z, Y ), greater(
% 2.50/2.93 growth_rate( efficient_producers, Z ), growth_rate( first_movers, Z ) ) }
% 2.50/2.93 .
% 2.50/2.93 { ! environment( Y ), ! in_environment( Y, X ), ! greater_or_equal( X,
% 2.50/2.93 appear( efficient_producers, Y ) ), greater( cardinality_at_time(
% 2.50/2.93 efficient_producers, X ), zero ) }.
% 2.50/2.93 { environment( skol2 ) }.
% 2.50/2.93 { in_environment( skol2, skol1 ) }.
% 2.50/2.93 { greater( skol1, critical_point( skol2 ) ) }.
% 2.50/2.93 { ! selection_favors( efficient_producers, first_movers, skol1 ) }.
% 2.50/2.93
% 2.50/2.93 percentage equality = 0.096154, percentage horn = 0.944444
% 2.50/2.93 This is a problem with some equality
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93 Options Used:
% 2.50/2.93
% 2.50/2.93 useres = 1
% 2.50/2.93 useparamod = 1
% 2.50/2.93 useeqrefl = 1
% 2.50/2.93 useeqfact = 1
% 2.50/2.93 usefactor = 1
% 2.50/2.93 usesimpsplitting = 0
% 2.50/2.93 usesimpdemod = 5
% 2.50/2.93 usesimpres = 3
% 2.50/2.93
% 2.50/2.93 resimpinuse = 1000
% 2.50/2.93 resimpclauses = 20000
% 2.50/2.93 substype = eqrewr
% 2.50/2.93 backwardsubs = 1
% 2.50/2.93 selectoldest = 5
% 2.50/2.93
% 2.50/2.93 litorderings [0] = split
% 2.50/2.93 litorderings [1] = extend the termordering, first sorting on arguments
% 2.50/2.93
% 2.50/2.93 termordering = kbo
% 2.50/2.93
% 2.50/2.93 litapriori = 0
% 2.50/2.93 termapriori = 1
% 2.50/2.93 litaposteriori = 0
% 2.50/2.93 termaposteriori = 0
% 2.50/2.93 demodaposteriori = 0
% 2.50/2.93 ordereqreflfact = 0
% 2.50/2.93
% 2.50/2.93 litselect = negord
% 2.50/2.93
% 2.50/2.93 maxweight = 15
% 2.50/2.93 maxdepth = 30000
% 2.50/2.93 maxlength = 115
% 2.50/2.93 maxnrvars = 195
% 2.50/2.93 excuselevel = 1
% 2.50/2.93 increasemaxweight = 1
% 2.50/2.93
% 2.50/2.93 maxselected = 10000000
% 2.50/2.93 maxnrclauses = 10000000
% 2.50/2.93
% 2.50/2.93 showgenerated = 0
% 2.50/2.93 showkept = 0
% 2.50/2.93 showselected = 0
% 2.50/2.93 showdeleted = 0
% 2.50/2.93 showresimp = 1
% 2.50/2.93 showstatus = 2000
% 2.50/2.93
% 2.50/2.93 prologoutput = 0
% 2.50/2.93 nrgoals = 5000000
% 2.50/2.93 totalproof = 1
% 2.50/2.93
% 2.50/2.93 Symbols occurring in the translation:
% 2.50/2.93
% 2.50/2.93 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 2.50/2.93 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 2.50/2.93 ! [4, 1] (w:0, o:19, a:1, s:1, b:0),
% 2.50/2.93 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.50/2.93 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.50/2.93 environment [39, 1] (w:1, o:24, a:1, s:1, b:0),
% 2.50/2.93 subpopulations [40, 4] (w:1, o:58, a:1, s:1, b:0),
% 2.50/2.93 growth_rate [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 2.50/2.93 greater [42, 2] (w:1, o:51, a:1, s:1, b:0),
% 2.50/2.93 selection_favors [43, 3] (w:1, o:56, a:1, s:1, b:0),
% 2.50/2.93 subpopulation [44, 3] (w:1, o:57, a:1, s:1, b:0),
% 2.50/2.93 cardinality_at_time [45, 2] (w:1, o:52, a:1, s:1, b:0),
% 2.50/2.93 zero [46, 0] (w:1, o:10, a:1, s:1, b:0),
% 2.50/2.93 in_environment [47, 2] (w:1, o:53, a:1, s:1, b:0),
% 2.50/2.93 first_movers [48, 0] (w:1, o:12, a:1, s:1, b:0),
% 2.50/2.93 efficient_producers [49, 0] (w:1, o:11, a:1, s:1, b:0),
% 2.50/2.93 greater_or_equal [50, 2] (w:1, o:54, a:1, s:1, b:0),
% 2.50/2.93 critical_point [51, 1] (w:1, o:25, a:1, s:1, b:0),
% 2.50/2.93 appear [52, 2] (w:1, o:55, a:1, s:1, b:0),
% 2.50/2.93 skol1 [57, 0] (w:1, o:17, a:1, s:1, b:1),
% 2.50/2.93 skol2 [58, 0] (w:1, o:18, a:1, s:1, b:1).
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93 Starting Search:
% 2.50/2.93
% 2.50/2.93 *** allocated 15000 integers for clauses
% 2.50/2.93 *** allocated 22500 integers for clauses
% 2.50/2.93 *** allocated 33750 integers for clauses
% 2.50/2.93 *** allocated 15000 integers for termspace/termends
% 2.50/2.93 *** allocated 50625 integers for clauses
% 2.50/2.93 *** allocated 22500 integers for termspace/termends
% 2.50/2.93 Resimplifying inuse:
% 2.50/2.93 Done
% 2.50/2.93
% 2.50/2.93 *** allocated 75937 integers for clauses
% 2.50/2.93 *** allocated 33750 integers for termspace/termends
% 2.50/2.93 *** allocated 113905 integers for clauses
% 2.50/2.93
% 2.50/2.93 Intermediate Status:
% 2.50/2.93 Generated: 8016
% 2.50/2.93 Kept: 2071
% 2.50/2.93 Inuse: 158
% 2.50/2.93 Deleted: 3
% 2.50/2.93 Deletedinuse: 0
% 2.50/2.93
% 2.50/2.93 Resimplifying inuse:
% 2.50/2.93 Done
% 2.50/2.93
% 2.50/2.93 *** allocated 50625 integers for termspace/termends
% 2.50/2.93 *** allocated 170857 integers for clauses
% 2.50/2.93 Resimplifying inuse:
% 2.50/2.93 Done
% 2.50/2.93
% 2.50/2.93 *** allocated 75937 integers for termspace/termends
% 2.50/2.93
% 2.50/2.93 Intermediate Status:
% 2.50/2.93 Generated: 22941
% 2.50/2.93 Kept: 4134
% 2.50/2.93 Inuse: 242
% 2.50/2.93 Deleted: 15
% 2.50/2.93 Deletedinuse: 3
% 2.50/2.93
% 2.50/2.93 Resimplifying inuse:
% 2.50/2.93 Done
% 2.50/2.93
% 2.50/2.93 *** allocated 256285 integers for clauses
% 2.50/2.93 *** allocated 113905 integers for termspace/termends
% 2.50/2.93 Resimplifying inuse:
% 2.50/2.93 Done
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93 Intermediate Status:
% 2.50/2.93 Generated: 40910
% 2.50/2.93 Kept: 6145
% 2.50/2.93 Inuse: 352
% 2.50/2.93 Deleted: 19
% 2.50/2.93 Deletedinuse: 3
% 2.50/2.93
% 2.50/2.93 Resimplifying inuse:
% 2.50/2.93 Done
% 2.50/2.93
% 2.50/2.93 *** allocated 170857 integers for termspace/termends
% 2.50/2.93 *** allocated 384427 integers for clauses
% 2.50/2.93 Resimplifying inuse:
% 2.50/2.93 Done
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93 Intermediate Status:
% 2.50/2.93 Generated: 64563
% 2.50/2.93 Kept: 8181
% 2.50/2.93 Inuse: 481
% 2.50/2.93 Deleted: 95
% 2.50/2.93 Deletedinuse: 71
% 2.50/2.93
% 2.50/2.93 Resimplifying inuse:
% 2.50/2.93 Done
% 2.50/2.93
% 2.50/2.93 Resimplifying inuse:
% 2.50/2.93 Done
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93 Intermediate Status:
% 2.50/2.93 Generated: 97684
% 2.50/2.93 Kept: 10206
% 2.50/2.93 Inuse: 612
% 2.50/2.93 Deleted: 241
% 2.50/2.93 Deletedinuse: 134
% 2.50/2.93
% 2.50/2.93 Resimplifying inuse:
% 2.50/2.93 Done
% 2.50/2.93
% 2.50/2.93 *** allocated 256285 integers for termspace/termends
% 2.50/2.93 *** allocated 576640 integers for clauses
% 2.50/2.93
% 2.50/2.93 Bliksems!, er is een bewijs:
% 2.50/2.93 % SZS status Theorem
% 2.50/2.93 % SZS output start Refutation
% 2.50/2.93
% 2.50/2.93 (0) {G0,W18,D3,L4,V4,M4} I { ! environment( T ), ! subpopulations( X, Y, T
% 2.50/2.93 , Z ), ! greater( growth_rate( Y, Z ), growth_rate( X, Z ) ),
% 2.50/2.93 selection_favors( Y, X, Z ) }.
% 2.50/2.93 (1) {G0,W24,D3,L6,V4,M6} I { ! environment( T ), ! subpopulation( X, T, Z )
% 2.50/2.93 , ! subpopulation( Y, T, Z ), ! greater( cardinality_at_time( X, Z ),
% 2.50/2.93 zero ), ! cardinality_at_time( Y, Z ) ==> zero, selection_favors( X, Y, Z
% 2.50/2.93 ) }.
% 2.50/2.93 (2) {G0,W20,D3,L5,V2,M5} I { ! environment( X ), ! in_environment( X, Y ),
% 2.50/2.93 ! greater( cardinality_at_time( first_movers, Y ), zero ), ! greater(
% 2.50/2.93 cardinality_at_time( efficient_producers, Y ), zero ), subpopulations(
% 2.50/2.93 first_movers, efficient_producers, X, Y ) }.
% 2.50/2.93 (3) {G0,W10,D3,L3,V2,M3} I { ! environment( Y ), ! in_environment( Y, X ),
% 2.50/2.93 greater_or_equal( cardinality_at_time( first_movers, X ), zero ) }.
% 2.50/2.93 (4) {G0,W9,D2,L3,V2,M3} I { ! environment( X ), ! in_environment( X, Y ),
% 2.50/2.93 subpopulation( first_movers, X, Y ) }.
% 2.50/2.93 (5) {G0,W9,D2,L3,V2,M3} I { ! environment( X ), ! in_environment( X, Y ),
% 2.50/2.93 subpopulation( efficient_producers, X, Y ) }.
% 2.50/2.93 (6) {G0,W8,D3,L2,V1,M2} I { ! environment( X ), greater_or_equal(
% 2.50/2.93 critical_point( X ), appear( efficient_producers, X ) ) }.
% 2.50/2.93 (7) {G0,W9,D2,L3,V3,M3} I { ! greater( X, Z ), ! greater( Z, Y ), greater(
% 2.50/2.93 X, Y ) }.
% 2.50/2.93 (8) {G0,W9,D2,L3,V2,M3} I { ! greater_or_equal( X, Y ), greater( X, Y ), X
% 2.50/2.93 = Y }.
% 2.50/2.93 (9) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), greater_or_equal( X, Y ) }.
% 2.50/2.93 (10) {G0,W6,D2,L2,V2,M2} I { ! X = Y, greater_or_equal( X, Y ) }.
% 2.50/2.93 (12) {G0,W21,D3,L5,V3,M5} I { ! environment( X ), ! Y = critical_point( X )
% 2.50/2.93 , ! subpopulations( first_movers, efficient_producers, X, Z ), ! greater
% 2.50/2.93 ( Z, Y ), greater( growth_rate( efficient_producers, Z ), growth_rate(
% 2.50/2.93 first_movers, Z ) ) }.
% 2.50/2.93 (13) {G0,W15,D3,L4,V2,M4} I { ! environment( Y ), ! in_environment( Y, X )
% 2.50/2.93 , ! greater_or_equal( X, appear( efficient_producers, Y ) ), greater(
% 2.50/2.93 cardinality_at_time( efficient_producers, X ), zero ) }.
% 2.50/2.93 (14) {G0,W2,D2,L1,V0,M1} I { environment( skol2 ) }.
% 2.50/2.93 (15) {G0,W3,D2,L1,V0,M1} I { in_environment( skol2, skol1 ) }.
% 2.50/2.93 (16) {G0,W4,D3,L1,V0,M1} I { greater( skol1, critical_point( skol2 ) ) }.
% 2.50/2.93 (17) {G0,W4,D2,L1,V0,M1} I { ! selection_favors( efficient_producers,
% 2.50/2.93 first_movers, skol1 ) }.
% 2.50/2.93 (22) {G1,W14,D3,L3,V1,M3} R(0,17) { ! environment( X ), ! subpopulations(
% 2.50/2.93 first_movers, efficient_producers, X, skol1 ), ! greater( growth_rate(
% 2.50/2.93 efficient_producers, skol1 ), growth_rate( first_movers, skol1 ) ) }.
% 2.50/2.93 (25) {G1,W6,D3,L1,V0,M1} R(6,14) { greater_or_equal( critical_point( skol2
% 2.50/2.93 ), appear( efficient_producers, skol2 ) ) }.
% 2.50/2.93 (32) {G1,W7,D3,L2,V1,M2} R(7,16) { ! greater( critical_point( skol2 ), X )
% 2.50/2.93 , greater( skol1, X ) }.
% 2.50/2.93 (41) {G1,W15,D3,L3,V0,M3} R(2,15);r(14) { ! greater( cardinality_at_time(
% 2.50/2.93 first_movers, skol1 ), zero ), ! greater( cardinality_at_time(
% 2.50/2.93 efficient_producers, skol1 ), zero ), subpopulations( first_movers,
% 2.50/2.93 efficient_producers, skol2, skol1 ) }.
% 2.50/2.93 (128) {G2,W7,D3,L2,V1,M2} P(8,16);r(32) { greater( skol1, X ), !
% 2.50/2.93 greater_or_equal( critical_point( skol2 ), X ) }.
% 2.50/2.93 (148) {G1,W5,D3,L1,V0,M1} R(3,15);r(14) { greater_or_equal(
% 2.50/2.93 cardinality_at_time( first_movers, skol1 ), zero ) }.
% 2.50/2.93 (189) {G1,W23,D3,L6,V3,M6} R(4,1);f { ! environment( X ), ! in_environment
% 2.50/2.93 ( X, Y ), ! subpopulation( Z, X, Y ), ! greater( cardinality_at_time( Z,
% 2.50/2.93 Y ), zero ), ! cardinality_at_time( first_movers, Y ) ==> zero,
% 2.50/2.93 selection_favors( Z, first_movers, Y ) }.
% 2.50/2.93 (281) {G3,W5,D3,L1,V0,M1} R(128,25) { greater( skol1, appear(
% 2.50/2.93 efficient_producers, skol2 ) ) }.
% 2.50/2.93 (294) {G4,W8,D3,L2,V1,M2} R(281,7) { ! greater( X, skol1 ), greater( X,
% 2.50/2.93 appear( efficient_producers, skol2 ) ) }.
% 2.50/2.93 (296) {G5,W8,D3,L2,V1,M2} P(8,281);r(294) { greater( X, appear(
% 2.50/2.93 efficient_producers, skol2 ) ), ! greater_or_equal( X, skol1 ) }.
% 2.50/2.93 (333) {G1,W19,D3,L4,V1,M4} R(12,16) { ! environment( X ), ! critical_point
% 2.50/2.93 ( skol2 ) = critical_point( X ), ! subpopulations( first_movers,
% 2.50/2.93 efficient_producers, X, skol1 ), greater( growth_rate(
% 2.50/2.93 efficient_producers, skol1 ), growth_rate( first_movers, skol1 ) ) }.
% 2.50/2.93 (345) {G2,W12,D3,L2,V0,M2} Q(333);r(14) { ! subpopulations( first_movers,
% 2.50/2.93 efficient_producers, skol2, skol1 ), greater( growth_rate(
% 2.50/2.93 efficient_producers, skol1 ), growth_rate( first_movers, skol1 ) ) }.
% 2.50/2.93 (444) {G6,W8,D3,L2,V1,M2} R(296,9) { ! greater_or_equal( X, skol1 ),
% 2.50/2.93 greater_or_equal( X, appear( efficient_producers, skol2 ) ) }.
% 2.50/2.93 (457) {G7,W8,D3,L2,V1,M2} R(444,10) { greater_or_equal( X, appear(
% 2.50/2.93 efficient_producers, skol2 ) ), ! X = skol1 }.
% 2.50/2.93 (466) {G8,W11,D3,L3,V1,M3} R(457,13);r(14) { ! X = skol1, ! in_environment
% 2.50/2.93 ( skol2, X ), greater( cardinality_at_time( efficient_producers, X ),
% 2.50/2.93 zero ) }.
% 2.50/2.93 (473) {G9,W5,D3,L1,V0,M1} Q(466);r(15) { greater( cardinality_at_time(
% 2.50/2.93 efficient_producers, skol1 ), zero ) }.
% 2.50/2.93 (478) {G10,W8,D3,L2,V1,M2} R(473,7) { ! greater( zero, X ), greater(
% 2.50/2.93 cardinality_at_time( efficient_producers, skol1 ), X ) }.
% 2.50/2.93 (487) {G11,W8,D3,L2,V1,M2} P(8,473);r(478) { greater( cardinality_at_time(
% 2.50/2.93 efficient_producers, skol1 ), X ), ! greater_or_equal( zero, X ) }.
% 2.50/2.93 (594) {G3,W5,D2,L1,V0,M1} R(22,14);r(345) { ! subpopulations( first_movers
% 2.50/2.93 , efficient_producers, skol2, skol1 ) }.
% 2.50/2.93 (640) {G12,W8,D3,L2,V1,M2} R(487,10) { greater( cardinality_at_time(
% 2.50/2.93 efficient_producers, skol1 ), X ), ! zero = X }.
% 2.50/2.93 (1241) {G10,W5,D3,L1,V0,M1} S(41);r(473);r(594) { ! greater(
% 2.50/2.93 cardinality_at_time( first_movers, skol1 ), zero ) }.
% 2.50/2.93 (1247) {G11,W5,D3,L1,V0,M1} R(1241,8);r(148) { cardinality_at_time(
% 2.50/2.93 first_movers, skol1 ) ==> zero }.
% 2.50/2.93 (11087) {G13,W9,D2,L3,V1,M3} R(189,640);q;d(1247);q;r(5) { ! environment( X
% 2.50/2.93 ), ! in_environment( X, skol1 ), selection_favors( efficient_producers,
% 2.50/2.93 first_movers, skol1 ) }.
% 2.50/2.93 (11091) {G14,W5,D2,L2,V1,M2} S(11087);r(17) { ! environment( X ), !
% 2.50/2.93 in_environment( X, skol1 ) }.
% 2.50/2.93 (11101) {G15,W0,D0,L0,V0,M0} R(11091,15);r(14) { }.
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93 % SZS output end Refutation
% 2.50/2.93 found a proof!
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93 Unprocessed initial clauses:
% 2.50/2.93
% 2.50/2.93 (11103) {G0,W18,D3,L4,V4,M4} { ! environment( T ), ! subpopulations( X, Y
% 2.50/2.93 , T, Z ), ! greater( growth_rate( Y, Z ), growth_rate( X, Z ) ),
% 2.50/2.93 selection_favors( Y, X, Z ) }.
% 2.50/2.93 (11104) {G0,W24,D3,L6,V4,M6} { ! environment( T ), ! subpopulation( X, T,
% 2.50/2.93 Z ), ! subpopulation( Y, T, Z ), ! greater( cardinality_at_time( X, Z ),
% 2.50/2.93 zero ), ! cardinality_at_time( Y, Z ) = zero, selection_favors( X, Y, Z )
% 2.50/2.93 }.
% 2.50/2.93 (11105) {G0,W20,D3,L5,V2,M5} { ! environment( X ), ! in_environment( X, Y
% 2.50/2.93 ), ! greater( cardinality_at_time( first_movers, Y ), zero ), ! greater
% 2.50/2.93 ( cardinality_at_time( efficient_producers, Y ), zero ), subpopulations(
% 2.50/2.93 first_movers, efficient_producers, X, Y ) }.
% 2.50/2.93 (11106) {G0,W10,D3,L3,V2,M3} { ! environment( Y ), ! in_environment( Y, X
% 2.50/2.93 ), greater_or_equal( cardinality_at_time( first_movers, X ), zero ) }.
% 2.50/2.93 (11107) {G0,W9,D2,L3,V2,M3} { ! environment( X ), ! in_environment( X, Y )
% 2.50/2.93 , subpopulation( first_movers, X, Y ) }.
% 2.50/2.93 (11108) {G0,W9,D2,L3,V2,M3} { ! environment( X ), ! in_environment( X, Y )
% 2.50/2.93 , subpopulation( efficient_producers, X, Y ) }.
% 2.50/2.93 (11109) {G0,W8,D3,L2,V1,M2} { ! environment( X ), greater_or_equal(
% 2.50/2.93 critical_point( X ), appear( efficient_producers, X ) ) }.
% 2.50/2.93 (11110) {G0,W9,D2,L3,V3,M3} { ! greater( X, Z ), ! greater( Z, Y ),
% 2.50/2.93 greater( X, Y ) }.
% 2.50/2.93 (11111) {G0,W9,D2,L3,V2,M3} { ! greater_or_equal( X, Y ), greater( X, Y )
% 2.50/2.93 , X = Y }.
% 2.50/2.93 (11112) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), greater_or_equal( X, Y )
% 2.50/2.93 }.
% 2.50/2.93 (11113) {G0,W6,D2,L2,V2,M2} { ! X = Y, greater_or_equal( X, Y ) }.
% 2.50/2.93 (11114) {G0,W13,D3,L3,V2,M3} { ! environment( X ), ! Y = critical_point( X
% 2.50/2.93 ), ! greater( growth_rate( efficient_producers, Y ), growth_rate(
% 2.50/2.93 first_movers, Y ) ) }.
% 2.50/2.93 (11115) {G0,W21,D3,L5,V3,M5} { ! environment( X ), ! Y = critical_point( X
% 2.50/2.93 ), ! subpopulations( first_movers, efficient_producers, X, Z ), !
% 2.50/2.93 greater( Z, Y ), greater( growth_rate( efficient_producers, Z ),
% 2.50/2.93 growth_rate( first_movers, Z ) ) }.
% 2.50/2.93 (11116) {G0,W15,D3,L4,V2,M4} { ! environment( Y ), ! in_environment( Y, X
% 2.50/2.93 ), ! greater_or_equal( X, appear( efficient_producers, Y ) ), greater(
% 2.50/2.93 cardinality_at_time( efficient_producers, X ), zero ) }.
% 2.50/2.93 (11117) {G0,W2,D2,L1,V0,M1} { environment( skol2 ) }.
% 2.50/2.93 (11118) {G0,W3,D2,L1,V0,M1} { in_environment( skol2, skol1 ) }.
% 2.50/2.93 (11119) {G0,W4,D3,L1,V0,M1} { greater( skol1, critical_point( skol2 ) )
% 2.50/2.93 }.
% 2.50/2.93 (11120) {G0,W4,D2,L1,V0,M1} { ! selection_favors( efficient_producers,
% 2.50/2.93 first_movers, skol1 ) }.
% 2.50/2.93
% 2.50/2.93
% 2.50/2.93 Total Proof:
% 2.50/2.93
% 2.50/2.93 subsumption: (0) {G0,W18,D3,L4,V4,M4} I { ! environment( T ), !
% 2.50/2.93 subpopulations( X, Y, T, Z ), ! greater( growth_rate( Y, Z ), growth_rate
% 2.50/2.93 ( X, Z ) ), selection_favors( Y, X, Z ) }.
% 2.50/2.93 parent0: (11103) {G0,W18,D3,L4,V4,M4} { ! environment( T ), !
% 2.50/2.93 subpopulations( X, Y, T, Z ), ! greater( growth_rate( Y, Z ), growth_rate
% 2.50/2.93 ( X, Z ) ), selection_favors( Y, X, Z ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 Z := Z
% 2.50/2.93 T := T
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 3 ==> 3
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (1) {G0,W24,D3,L6,V4,M6} I { ! environment( T ), !
% 2.50/2.93 subpopulation( X, T, Z ), ! subpopulation( Y, T, Z ), ! greater(
% 2.50/2.93 cardinality_at_time( X, Z ), zero ), ! cardinality_at_time( Y, Z ) ==>
% 2.50/2.93 zero, selection_favors( X, Y, Z ) }.
% 2.50/2.93 parent0: (11104) {G0,W24,D3,L6,V4,M6} { ! environment( T ), !
% 2.50/2.93 subpopulation( X, T, Z ), ! subpopulation( Y, T, Z ), ! greater(
% 2.50/2.93 cardinality_at_time( X, Z ), zero ), ! cardinality_at_time( Y, Z ) = zero
% 2.50/2.93 , selection_favors( X, Y, Z ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 Z := Z
% 2.50/2.93 T := T
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 3 ==> 3
% 2.50/2.93 4 ==> 4
% 2.50/2.93 5 ==> 5
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (2) {G0,W20,D3,L5,V2,M5} I { ! environment( X ), !
% 2.50/2.93 in_environment( X, Y ), ! greater( cardinality_at_time( first_movers, Y )
% 2.50/2.93 , zero ), ! greater( cardinality_at_time( efficient_producers, Y ), zero
% 2.50/2.93 ), subpopulations( first_movers, efficient_producers, X, Y ) }.
% 2.50/2.93 parent0: (11105) {G0,W20,D3,L5,V2,M5} { ! environment( X ), !
% 2.50/2.93 in_environment( X, Y ), ! greater( cardinality_at_time( first_movers, Y )
% 2.50/2.93 , zero ), ! greater( cardinality_at_time( efficient_producers, Y ), zero
% 2.50/2.93 ), subpopulations( first_movers, efficient_producers, X, Y ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 3 ==> 3
% 2.50/2.93 4 ==> 4
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (3) {G0,W10,D3,L3,V2,M3} I { ! environment( Y ), !
% 2.50/2.93 in_environment( Y, X ), greater_or_equal( cardinality_at_time(
% 2.50/2.93 first_movers, X ), zero ) }.
% 2.50/2.93 parent0: (11106) {G0,W10,D3,L3,V2,M3} { ! environment( Y ), !
% 2.50/2.93 in_environment( Y, X ), greater_or_equal( cardinality_at_time(
% 2.50/2.93 first_movers, X ), zero ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (4) {G0,W9,D2,L3,V2,M3} I { ! environment( X ), !
% 2.50/2.93 in_environment( X, Y ), subpopulation( first_movers, X, Y ) }.
% 2.50/2.93 parent0: (11107) {G0,W9,D2,L3,V2,M3} { ! environment( X ), !
% 2.50/2.93 in_environment( X, Y ), subpopulation( first_movers, X, Y ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (5) {G0,W9,D2,L3,V2,M3} I { ! environment( X ), !
% 2.50/2.93 in_environment( X, Y ), subpopulation( efficient_producers, X, Y ) }.
% 2.50/2.93 parent0: (11108) {G0,W9,D2,L3,V2,M3} { ! environment( X ), !
% 2.50/2.93 in_environment( X, Y ), subpopulation( efficient_producers, X, Y ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (6) {G0,W8,D3,L2,V1,M2} I { ! environment( X ),
% 2.50/2.93 greater_or_equal( critical_point( X ), appear( efficient_producers, X ) )
% 2.50/2.93 }.
% 2.50/2.93 parent0: (11109) {G0,W8,D3,L2,V1,M2} { ! environment( X ),
% 2.50/2.93 greater_or_equal( critical_point( X ), appear( efficient_producers, X ) )
% 2.50/2.93 }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (7) {G0,W9,D2,L3,V3,M3} I { ! greater( X, Z ), ! greater( Z, Y
% 2.50/2.93 ), greater( X, Y ) }.
% 2.50/2.93 parent0: (11110) {G0,W9,D2,L3,V3,M3} { ! greater( X, Z ), ! greater( Z, Y
% 2.50/2.93 ), greater( X, Y ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 Z := Z
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (8) {G0,W9,D2,L3,V2,M3} I { ! greater_or_equal( X, Y ),
% 2.50/2.93 greater( X, Y ), X = Y }.
% 2.50/2.93 parent0: (11111) {G0,W9,D2,L3,V2,M3} { ! greater_or_equal( X, Y ), greater
% 2.50/2.93 ( X, Y ), X = Y }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (9) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ),
% 2.50/2.93 greater_or_equal( X, Y ) }.
% 2.50/2.93 parent0: (11112) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), greater_or_equal
% 2.50/2.93 ( X, Y ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (10) {G0,W6,D2,L2,V2,M2} I { ! X = Y, greater_or_equal( X, Y )
% 2.50/2.93 }.
% 2.50/2.93 parent0: (11113) {G0,W6,D2,L2,V2,M2} { ! X = Y, greater_or_equal( X, Y )
% 2.50/2.93 }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (12) {G0,W21,D3,L5,V3,M5} I { ! environment( X ), ! Y =
% 2.50/2.93 critical_point( X ), ! subpopulations( first_movers, efficient_producers
% 2.50/2.93 , X, Z ), ! greater( Z, Y ), greater( growth_rate( efficient_producers, Z
% 2.50/2.93 ), growth_rate( first_movers, Z ) ) }.
% 2.50/2.93 parent0: (11115) {G0,W21,D3,L5,V3,M5} { ! environment( X ), ! Y =
% 2.50/2.93 critical_point( X ), ! subpopulations( first_movers, efficient_producers
% 2.50/2.93 , X, Z ), ! greater( Z, Y ), greater( growth_rate( efficient_producers, Z
% 2.50/2.93 ), growth_rate( first_movers, Z ) ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 Z := Z
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 3 ==> 3
% 2.50/2.93 4 ==> 4
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (13) {G0,W15,D3,L4,V2,M4} I { ! environment( Y ), !
% 2.50/2.93 in_environment( Y, X ), ! greater_or_equal( X, appear(
% 2.50/2.93 efficient_producers, Y ) ), greater( cardinality_at_time(
% 2.50/2.93 efficient_producers, X ), zero ) }.
% 2.50/2.93 parent0: (11116) {G0,W15,D3,L4,V2,M4} { ! environment( Y ), !
% 2.50/2.93 in_environment( Y, X ), ! greater_or_equal( X, appear(
% 2.50/2.93 efficient_producers, Y ) ), greater( cardinality_at_time(
% 2.50/2.93 efficient_producers, X ), zero ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 Y := Y
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 3 ==> 3
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (14) {G0,W2,D2,L1,V0,M1} I { environment( skol2 ) }.
% 2.50/2.93 parent0: (11117) {G0,W2,D2,L1,V0,M1} { environment( skol2 ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (15) {G0,W3,D2,L1,V0,M1} I { in_environment( skol2, skol1 )
% 2.50/2.93 }.
% 2.50/2.93 parent0: (11118) {G0,W3,D2,L1,V0,M1} { in_environment( skol2, skol1 ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (16) {G0,W4,D3,L1,V0,M1} I { greater( skol1, critical_point(
% 2.50/2.93 skol2 ) ) }.
% 2.50/2.93 parent0: (11119) {G0,W4,D3,L1,V0,M1} { greater( skol1, critical_point(
% 2.50/2.93 skol2 ) ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (17) {G0,W4,D2,L1,V0,M1} I { ! selection_favors(
% 2.50/2.93 efficient_producers, first_movers, skol1 ) }.
% 2.50/2.93 parent0: (11120) {G0,W4,D2,L1,V0,M1} { ! selection_favors(
% 2.50/2.93 efficient_producers, first_movers, skol1 ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 resolution: (11207) {G1,W14,D3,L3,V1,M3} { ! environment( X ), !
% 2.50/2.93 subpopulations( first_movers, efficient_producers, X, skol1 ), ! greater
% 2.50/2.93 ( growth_rate( efficient_producers, skol1 ), growth_rate( first_movers,
% 2.50/2.93 skol1 ) ) }.
% 2.50/2.93 parent0[0]: (17) {G0,W4,D2,L1,V0,M1} I { ! selection_favors(
% 2.50/2.93 efficient_producers, first_movers, skol1 ) }.
% 2.50/2.93 parent1[3]: (0) {G0,W18,D3,L4,V4,M4} I { ! environment( T ), !
% 2.50/2.93 subpopulations( X, Y, T, Z ), ! greater( growth_rate( Y, Z ), growth_rate
% 2.50/2.93 ( X, Z ) ), selection_favors( Y, X, Z ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 end
% 2.50/2.93 substitution1:
% 2.50/2.93 X := first_movers
% 2.50/2.93 Y := efficient_producers
% 2.50/2.93 Z := skol1
% 2.50/2.93 T := X
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (22) {G1,W14,D3,L3,V1,M3} R(0,17) { ! environment( X ), !
% 2.50/2.93 subpopulations( first_movers, efficient_producers, X, skol1 ), ! greater
% 2.50/2.93 ( growth_rate( efficient_producers, skol1 ), growth_rate( first_movers,
% 2.50/2.93 skol1 ) ) }.
% 2.50/2.93 parent0: (11207) {G1,W14,D3,L3,V1,M3} { ! environment( X ), !
% 2.50/2.93 subpopulations( first_movers, efficient_producers, X, skol1 ), ! greater
% 2.50/2.93 ( growth_rate( efficient_producers, skol1 ), growth_rate( first_movers,
% 2.50/2.93 skol1 ) ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 2 ==> 2
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 resolution: (11208) {G1,W6,D3,L1,V0,M1} { greater_or_equal( critical_point
% 2.50/2.93 ( skol2 ), appear( efficient_producers, skol2 ) ) }.
% 2.50/2.93 parent0[0]: (6) {G0,W8,D3,L2,V1,M2} I { ! environment( X ),
% 2.50/2.93 greater_or_equal( critical_point( X ), appear( efficient_producers, X ) )
% 2.50/2.93 }.
% 2.50/2.93 parent1[0]: (14) {G0,W2,D2,L1,V0,M1} I { environment( skol2 ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := skol2
% 2.50/2.93 end
% 2.50/2.93 substitution1:
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (25) {G1,W6,D3,L1,V0,M1} R(6,14) { greater_or_equal(
% 2.50/2.93 critical_point( skol2 ), appear( efficient_producers, skol2 ) ) }.
% 2.50/2.93 parent0: (11208) {G1,W6,D3,L1,V0,M1} { greater_or_equal( critical_point(
% 2.50/2.93 skol2 ), appear( efficient_producers, skol2 ) ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 resolution: (11209) {G1,W7,D3,L2,V1,M2} { ! greater( critical_point( skol2
% 2.50/2.93 ), X ), greater( skol1, X ) }.
% 2.50/2.93 parent0[0]: (7) {G0,W9,D2,L3,V3,M3} I { ! greater( X, Z ), ! greater( Z, Y
% 2.50/2.93 ), greater( X, Y ) }.
% 2.50/2.93 parent1[0]: (16) {G0,W4,D3,L1,V0,M1} I { greater( skol1, critical_point(
% 2.50/2.93 skol2 ) ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := skol1
% 2.50/2.93 Y := X
% 2.50/2.93 Z := critical_point( skol2 )
% 2.50/2.93 end
% 2.50/2.93 substitution1:
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 subsumption: (32) {G1,W7,D3,L2,V1,M2} R(7,16) { ! greater( critical_point(
% 2.50/2.93 skol2 ), X ), greater( skol1, X ) }.
% 2.50/2.93 parent0: (11209) {G1,W7,D3,L2,V1,M2} { ! greater( critical_point( skol2 )
% 2.50/2.93 , X ), greater( skol1, X ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := X
% 2.50/2.93 end
% 2.50/2.93 permutation0:
% 2.50/2.93 0 ==> 0
% 2.50/2.93 1 ==> 1
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 resolution: (11211) {G1,W17,D3,L4,V0,M4} { ! environment( skol2 ), !
% 2.50/2.93 greater( cardinality_at_time( first_movers, skol1 ), zero ), ! greater(
% 2.50/2.93 cardinality_at_time( efficient_producers, skol1 ), zero ), subpopulations
% 2.50/2.93 ( first_movers, efficient_producers, skol2, skol1 ) }.
% 2.50/2.93 parent0[1]: (2) {G0,W20,D3,L5,V2,M5} I { ! environment( X ), !
% 2.50/2.93 in_environment( X, Y ), ! greater( cardinality_at_time( first_movers, Y )
% 2.50/2.93 , zero ), ! greater( cardinality_at_time( efficient_producers, Y ), zero
% 2.50/2.93 ), subpopulations( first_movers, efficient_producers, X, Y ) }.
% 2.50/2.93 parent1[0]: (15) {G0,W3,D2,L1,V0,M1} I { in_environment( skol2, skol1 ) }.
% 2.50/2.93 substitution0:
% 2.50/2.93 X := skol2
% 2.50/2.93 Y := skol1
% 2.50/2.93 end
% 2.50/2.93 substitution1:
% 2.50/2.93 end
% 2.50/2.93
% 2.50/2.93 resolution: (11212) {G1,W15,D3,L3,V0,M3} { ! greater( cardinality_at_time
% 2.50/2.93 ( first_movers, skol1 ), zero ), ! greater( cardinality_at_time(
% 2.50/2.93 efficient_producers, skol1 ), zero ), subpopulations( first_movers,
% 2.50/2.93 efficient_producers, skol2, skol1 ) }.
% 2.50/2.93 parent0[0]: (11211) {G1,Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------