TSTP Solution File: MGT032+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : MGT032+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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:45 EDT 2022
% Result : Theorem 0.77s 1.15s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT032+2 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Thu Jun 9 12:11:07 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.77/1.14 *** allocated 10000 integers for termspace/termends
% 0.77/1.14 *** allocated 10000 integers for clauses
% 0.77/1.14 *** allocated 10000 integers for justifications
% 0.77/1.14 Bliksem 1.12
% 0.77/1.14
% 0.77/1.14
% 0.77/1.14 Automatic Strategy Selection
% 0.77/1.14
% 0.77/1.14
% 0.77/1.14 Clauses:
% 0.77/1.14
% 0.77/1.14 { ! environment( T ), ! subpopulations( X, Y, T, Z ), ! greater(
% 0.77/1.14 growth_rate( Y, Z ), growth_rate( X, Z ) ), selection_favors( Y, X, Z ) }
% 0.77/1.14 .
% 0.77/1.14 { ! environment( X ), ! stable( X ), in_environment( X, skol1( X ) ) }.
% 0.77/1.14 { ! environment( X ), ! stable( X ), ! subpopulations( first_movers,
% 0.77/1.14 efficient_producers, X, Y ), ! greater_or_equal( Y, skol1( X ) ), greater
% 0.77/1.14 ( growth_rate( efficient_producers, Y ), growth_rate( first_movers, Y ) )
% 0.77/1.14 }.
% 0.77/1.14 { environment( skol2 ) }.
% 0.77/1.14 { stable( skol2 ) }.
% 0.77/1.14 { ! in_environment( skol2, X ), subpopulations( first_movers,
% 0.77/1.14 efficient_producers, skol2, skol3( Y ) ) }.
% 0.77/1.14 { ! in_environment( skol2, X ), ! selection_favors( efficient_producers,
% 0.77/1.14 first_movers, skol3( Y ) ) }.
% 0.77/1.14 { ! in_environment( skol2, X ), greater_or_equal( skol3( X ), X ) }.
% 0.77/1.14
% 0.77/1.14 percentage equality = 0.000000, percentage horn = 1.000000
% 0.77/1.15 This is a near-Horn, non-equality problem
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 Options Used:
% 0.77/1.15
% 0.77/1.15 useres = 1
% 0.77/1.15 useparamod = 0
% 0.77/1.15 useeqrefl = 0
% 0.77/1.15 useeqfact = 0
% 0.77/1.15 usefactor = 1
% 0.77/1.15 usesimpsplitting = 0
% 0.77/1.15 usesimpdemod = 0
% 0.77/1.15 usesimpres = 4
% 0.77/1.15
% 0.77/1.15 resimpinuse = 1000
% 0.77/1.15 resimpclauses = 20000
% 0.77/1.15 substype = standard
% 0.77/1.15 backwardsubs = 1
% 0.77/1.15 selectoldest = 5
% 0.77/1.15
% 0.77/1.15 litorderings [0] = split
% 0.77/1.15 litorderings [1] = liftord
% 0.77/1.15
% 0.77/1.15 termordering = none
% 0.77/1.15
% 0.77/1.15 litapriori = 1
% 0.77/1.15 termapriori = 0
% 0.77/1.15 litaposteriori = 0
% 0.77/1.15 termaposteriori = 0
% 0.77/1.15 demodaposteriori = 0
% 0.77/1.15 ordereqreflfact = 0
% 0.77/1.15
% 0.77/1.15 litselect = negative
% 0.77/1.15
% 0.77/1.15 maxweight = 30000
% 0.77/1.15 maxdepth = 30000
% 0.77/1.15 maxlength = 115
% 0.77/1.15 maxnrvars = 195
% 0.77/1.15 excuselevel = 0
% 0.77/1.15 increasemaxweight = 0
% 0.77/1.15
% 0.77/1.15 maxselected = 10000000
% 0.77/1.15 maxnrclauses = 10000000
% 0.77/1.15
% 0.77/1.15 showgenerated = 0
% 0.77/1.15 showkept = 0
% 0.77/1.15 showselected = 0
% 0.77/1.15 showdeleted = 0
% 0.77/1.15 showresimp = 1
% 0.77/1.15 showstatus = 2000
% 0.77/1.15
% 0.77/1.15 prologoutput = 0
% 0.77/1.15 nrgoals = 5000000
% 0.77/1.15 totalproof = 1
% 0.77/1.15
% 0.77/1.15 Symbols occurring in the translation:
% 0.77/1.15
% 0.77/1.15 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.77/1.15 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.77/1.15 ! [4, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.77/1.15 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.77/1.15 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.77/1.15 environment [39, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.77/1.15 subpopulations [40, 4] (w:1, o:52, a:1, s:1, b:0),
% 0.77/1.15 growth_rate [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.77/1.15 greater [42, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.77/1.15 selection_favors [43, 3] (w:1, o:51, a:1, s:1, b:0),
% 0.77/1.15 stable [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.77/1.15 in_environment [46, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.77/1.15 first_movers [47, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.77/1.15 efficient_producers [48, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.77/1.15 greater_or_equal [49, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.77/1.15 skol1 [50, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.77/1.15 skol2 [51, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.77/1.15 skol3 [52, 1] (w:1, o:22, a:1, s:1, b:0).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 Starting Search:
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 Bliksems!, er is een bewijs:
% 0.77/1.15 % SZS status Theorem
% 0.77/1.15 % SZS output start Refutation
% 0.77/1.15
% 0.77/1.15 (0) {G0,W21,D3,L4,V4,M1} I { ! subpopulations( X, Y, T, Z ), ! greater(
% 0.77/1.15 growth_rate( Y, Z ), growth_rate( X, Z ) ), selection_favors( Y, X, Z ),
% 0.77/1.15 ! environment( T ) }.
% 0.77/1.15 (1) {G0,W10,D3,L3,V1,M1} I { in_environment( X, skol1( X ) ), ! stable( X )
% 0.77/1.15 , ! environment( X ) }.
% 0.77/1.15 (2) {G0,W24,D3,L5,V2,M1} I { ! subpopulations( first_movers,
% 0.77/1.15 efficient_producers, X, Y ), ! stable( X ), ! greater_or_equal( Y, skol1
% 0.77/1.15 ( X ) ), greater( growth_rate( efficient_producers, Y ), growth_rate(
% 0.77/1.15 first_movers, Y ) ), ! environment( X ) }.
% 0.77/1.15 (3) {G0,W2,D2,L1,V0,M1} I { environment( skol2 ) }.
% 0.77/1.15 (4) {G0,W2,D2,L1,V0,M1} I { stable( skol2 ) }.
% 0.77/1.15 (5) {G0,W10,D3,L2,V2,M1} I { subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, skol3( Y ) ), ! in_environment( skol2, X )
% 0.77/1.15 }.
% 0.77/1.15 (6) {G0,W10,D3,L2,V2,M1} I { ! in_environment( skol2, X ), !
% 0.77/1.15 selection_favors( efficient_producers, first_movers, skol3( Y ) ) }.
% 0.77/1.15 (7) {G0,W8,D3,L2,V1,M1} I { greater_or_equal( skol3( X ), X ), !
% 0.77/1.15 in_environment( skol2, X ) }.
% 0.77/1.15 (8) {G1,W18,D3,L3,V3,M1} R(0,3) { ! greater( growth_rate( Y, Z ),
% 0.77/1.15 growth_rate( X, Z ) ), selection_favors( Y, X, Z ), ! subpopulations( X,
% 0.77/1.15 Y, skol2, Z ) }.
% 0.77/1.15 (9) {G1,W4,D3,L1,V0,M1} R(1,3);r(4) { in_environment( skol2, skol1( skol2 )
% 0.77/1.15 ) }.
% 0.77/1.15 (10) {G2,W6,D3,L1,V1,M1} R(9,5) { subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, skol3( X ) ) }.
% 0.77/1.15 (11) {G2,W6,D4,L1,V0,M1} R(9,7) { greater_or_equal( skol3( skol1( skol2 ) )
% 0.77/1.15 , skol1( skol2 ) ) }.
% 0.77/1.15 (12) {G1,W18,D3,L3,V1,M1} R(2,3);r(4) { ! greater_or_equal( X, skol1( skol2
% 0.77/1.15 ) ), greater( growth_rate( efficient_producers, X ), growth_rate(
% 0.77/1.15 first_movers, X ) ), ! subpopulations( first_movers, efficient_producers
% 0.77/1.15 , skol2, X ) }.
% 0.77/1.15 (13) {G3,W15,D4,L2,V1,M1} R(8,10) { selection_favors( efficient_producers,
% 0.77/1.15 first_movers, skol3( X ) ), ! greater( growth_rate( efficient_producers,
% 0.77/1.15 skol3( X ) ), growth_rate( first_movers, skol3( X ) ) ) }.
% 0.77/1.15 (14) {G3,W15,D4,L2,V1,M1} R(12,10) { greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( X ) ), growth_rate( first_movers, skol3( X )
% 0.77/1.15 ) ), ! greater_or_equal( skol3( X ), skol1( skol2 ) ) }.
% 0.77/1.15 (15) {G4,W11,D5,L1,V0,M1} R(14,11) { greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( skol1( skol2 ) ) ), growth_rate( first_movers
% 0.77/1.15 , skol3( skol1( skol2 ) ) ) ) }.
% 0.77/1.15 (16) {G5,W6,D4,L1,V0,M1} R(15,13) { selection_favors( efficient_producers,
% 0.77/1.15 first_movers, skol3( skol1( skol2 ) ) ) }.
% 0.77/1.15 (17) {G6,W4,D2,L1,V1,M1} R(16,6) { ! in_environment( skol2, X ) }.
% 0.77/1.15 (18) {G7,W0,D0,L0,V0,M0} R(17,9) { }.
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 % SZS output end Refutation
% 0.77/1.15 found a proof!
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 Unprocessed initial clauses:
% 0.77/1.15
% 0.77/1.15 (20) {G0,W21,D3,L4,V4,M4} { ! environment( T ), ! subpopulations( X, Y, T
% 0.77/1.15 , Z ), ! greater( growth_rate( Y, Z ), growth_rate( X, Z ) ),
% 0.77/1.15 selection_favors( Y, X, Z ) }.
% 0.77/1.15 (21) {G0,W10,D3,L3,V1,M3} { ! environment( X ), ! stable( X ),
% 0.77/1.15 in_environment( X, skol1( X ) ) }.
% 0.77/1.15 (22) {G0,W24,D3,L5,V2,M5} { ! environment( X ), ! stable( X ), !
% 0.77/1.15 subpopulations( first_movers, efficient_producers, X, Y ), !
% 0.77/1.15 greater_or_equal( Y, skol1( X ) ), greater( growth_rate(
% 0.77/1.15 efficient_producers, Y ), growth_rate( first_movers, Y ) ) }.
% 0.77/1.15 (23) {G0,W2,D2,L1,V0,M1} { environment( skol2 ) }.
% 0.77/1.15 (24) {G0,W2,D2,L1,V0,M1} { stable( skol2 ) }.
% 0.77/1.15 (25) {G0,W10,D3,L2,V2,M2} { ! in_environment( skol2, X ), subpopulations(
% 0.77/1.15 first_movers, efficient_producers, skol2, skol3( Y ) ) }.
% 0.77/1.15 (26) {G0,W10,D3,L2,V2,M2} { ! in_environment( skol2, X ), !
% 0.77/1.15 selection_favors( efficient_producers, first_movers, skol3( Y ) ) }.
% 0.77/1.15 (27) {G0,W8,D3,L2,V1,M2} { ! in_environment( skol2, X ), greater_or_equal
% 0.77/1.15 ( skol3( X ), X ) }.
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 Total Proof:
% 0.77/1.15
% 0.77/1.15 subsumption: (0) {G0,W21,D3,L4,V4,M1} I { ! subpopulations( X, Y, T, Z ), !
% 0.77/1.15 greater( growth_rate( Y, Z ), growth_rate( X, Z ) ), selection_favors( Y
% 0.77/1.15 , X, Z ), ! environment( T ) }.
% 0.77/1.15 parent0: (20) {G0,W21,D3,L4,V4,M4} { ! environment( T ), ! subpopulations
% 0.77/1.15 ( X, Y, T, Z ), ! greater( growth_rate( Y, Z ), growth_rate( X, Z ) ),
% 0.77/1.15 selection_favors( Y, X, Z ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 Y := Y
% 0.77/1.15 Z := Z
% 0.77/1.15 T := T
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 3
% 0.77/1.15 1 ==> 0
% 0.77/1.15 2 ==> 1
% 0.77/1.15 3 ==> 2
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (1) {G0,W10,D3,L3,V1,M1} I { in_environment( X, skol1( X ) ),
% 0.77/1.15 ! stable( X ), ! environment( X ) }.
% 0.77/1.15 parent0: (21) {G0,W10,D3,L3,V1,M3} { ! environment( X ), ! stable( X ),
% 0.77/1.15 in_environment( X, skol1( X ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 2
% 0.77/1.15 1 ==> 1
% 0.77/1.15 2 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (2) {G0,W24,D3,L5,V2,M1} I { ! subpopulations( first_movers,
% 0.77/1.15 efficient_producers, X, Y ), ! stable( X ), ! greater_or_equal( Y, skol1
% 0.77/1.15 ( X ) ), greater( growth_rate( efficient_producers, Y ), growth_rate(
% 0.77/1.15 first_movers, Y ) ), ! environment( X ) }.
% 0.77/1.15 parent0: (22) {G0,W24,D3,L5,V2,M5} { ! environment( X ), ! stable( X ), !
% 0.77/1.15 subpopulations( first_movers, efficient_producers, X, Y ), !
% 0.77/1.15 greater_or_equal( Y, skol1( X ) ), greater( growth_rate(
% 0.77/1.15 efficient_producers, Y ), growth_rate( first_movers, Y ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 Y := Y
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 4
% 0.77/1.15 1 ==> 1
% 0.77/1.15 2 ==> 0
% 0.77/1.15 3 ==> 2
% 0.77/1.15 4 ==> 3
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (3) {G0,W2,D2,L1,V0,M1} I { environment( skol2 ) }.
% 0.77/1.15 parent0: (23) {G0,W2,D2,L1,V0,M1} { environment( skol2 ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (4) {G0,W2,D2,L1,V0,M1} I { stable( skol2 ) }.
% 0.77/1.15 parent0: (24) {G0,W2,D2,L1,V0,M1} { stable( skol2 ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (5) {G0,W10,D3,L2,V2,M1} I { subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, skol3( Y ) ), ! in_environment( skol2, X )
% 0.77/1.15 }.
% 0.77/1.15 parent0: (25) {G0,W10,D3,L2,V2,M2} { ! in_environment( skol2, X ),
% 0.77/1.15 subpopulations( first_movers, efficient_producers, skol2, skol3( Y ) )
% 0.77/1.15 }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 Y := Y
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 1
% 0.77/1.15 1 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (6) {G0,W10,D3,L2,V2,M1} I { ! in_environment( skol2, X ), !
% 0.77/1.15 selection_favors( efficient_producers, first_movers, skol3( Y ) ) }.
% 0.77/1.15 parent0: (26) {G0,W10,D3,L2,V2,M2} { ! in_environment( skol2, X ), !
% 0.77/1.15 selection_favors( efficient_producers, first_movers, skol3( Y ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 Y := Y
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 0
% 0.77/1.15 1 ==> 1
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (7) {G0,W8,D3,L2,V1,M1} I { greater_or_equal( skol3( X ), X )
% 0.77/1.15 , ! in_environment( skol2, X ) }.
% 0.77/1.15 parent0: (27) {G0,W8,D3,L2,V1,M2} { ! in_environment( skol2, X ),
% 0.77/1.15 greater_or_equal( skol3( X ), X ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 1
% 0.77/1.15 1 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (28) {G1,W18,D3,L3,V3,M3} { ! subpopulations( X, Y, skol2, Z )
% 0.77/1.15 , ! greater( growth_rate( Y, Z ), growth_rate( X, Z ) ), selection_favors
% 0.77/1.15 ( Y, X, Z ) }.
% 0.77/1.15 parent0[3]: (0) {G0,W21,D3,L4,V4,M1} I { ! subpopulations( X, Y, T, Z ), !
% 0.77/1.15 greater( growth_rate( Y, Z ), growth_rate( X, Z ) ), selection_favors( Y
% 0.77/1.15 , X, Z ), ! environment( T ) }.
% 0.77/1.15 parent1[0]: (3) {G0,W2,D2,L1,V0,M1} I { environment( skol2 ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 Y := Y
% 0.77/1.15 Z := Z
% 0.77/1.15 T := skol2
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (8) {G1,W18,D3,L3,V3,M1} R(0,3) { ! greater( growth_rate( Y, Z
% 0.77/1.15 ), growth_rate( X, Z ) ), selection_favors( Y, X, Z ), ! subpopulations
% 0.77/1.15 ( X, Y, skol2, Z ) }.
% 0.77/1.15 parent0: (28) {G1,W18,D3,L3,V3,M3} { ! subpopulations( X, Y, skol2, Z ), !
% 0.77/1.15 greater( growth_rate( Y, Z ), growth_rate( X, Z ) ), selection_favors( Y
% 0.77/1.15 , X, Z ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 Y := Y
% 0.77/1.15 Z := Z
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 2
% 0.77/1.15 1 ==> 0
% 0.77/1.15 2 ==> 1
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (29) {G1,W7,D3,L2,V0,M2} { in_environment( skol2, skol1( skol2
% 0.77/1.15 ) ), ! stable( skol2 ) }.
% 0.77/1.15 parent0[2]: (1) {G0,W10,D3,L3,V1,M1} I { in_environment( X, skol1( X ) ), !
% 0.77/1.15 stable( X ), ! environment( X ) }.
% 0.77/1.15 parent1[0]: (3) {G0,W2,D2,L1,V0,M1} I { environment( skol2 ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := skol2
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (30) {G1,W4,D3,L1,V0,M1} { in_environment( skol2, skol1( skol2
% 0.77/1.15 ) ) }.
% 0.77/1.15 parent0[1]: (29) {G1,W7,D3,L2,V0,M2} { in_environment( skol2, skol1( skol2
% 0.77/1.15 ) ), ! stable( skol2 ) }.
% 0.77/1.15 parent1[0]: (4) {G0,W2,D2,L1,V0,M1} I { stable( skol2 ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (9) {G1,W4,D3,L1,V0,M1} R(1,3);r(4) { in_environment( skol2,
% 0.77/1.15 skol1( skol2 ) ) }.
% 0.77/1.15 parent0: (30) {G1,W4,D3,L1,V0,M1} { in_environment( skol2, skol1( skol2 )
% 0.77/1.15 ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (31) {G1,W6,D3,L1,V1,M1} { subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, skol3( X ) ) }.
% 0.77/1.15 parent0[1]: (5) {G0,W10,D3,L2,V2,M1} I { subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, skol3( Y ) ), ! in_environment( skol2, X )
% 0.77/1.15 }.
% 0.77/1.15 parent1[0]: (9) {G1,W4,D3,L1,V0,M1} R(1,3);r(4) { in_environment( skol2,
% 0.77/1.15 skol1( skol2 ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := skol1( skol2 )
% 0.77/1.15 Y := X
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (10) {G2,W6,D3,L1,V1,M1} R(9,5) { subpopulations( first_movers
% 0.77/1.15 , efficient_producers, skol2, skol3( X ) ) }.
% 0.77/1.15 parent0: (31) {G1,W6,D3,L1,V1,M1} { subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, skol3( X ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (32) {G1,W6,D4,L1,V0,M1} { greater_or_equal( skol3( skol1(
% 0.77/1.15 skol2 ) ), skol1( skol2 ) ) }.
% 0.77/1.15 parent0[1]: (7) {G0,W8,D3,L2,V1,M1} I { greater_or_equal( skol3( X ), X ),
% 0.77/1.15 ! in_environment( skol2, X ) }.
% 0.77/1.15 parent1[0]: (9) {G1,W4,D3,L1,V0,M1} R(1,3);r(4) { in_environment( skol2,
% 0.77/1.15 skol1( skol2 ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := skol1( skol2 )
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (11) {G2,W6,D4,L1,V0,M1} R(9,7) { greater_or_equal( skol3(
% 0.77/1.15 skol1( skol2 ) ), skol1( skol2 ) ) }.
% 0.77/1.15 parent0: (32) {G1,W6,D4,L1,V0,M1} { greater_or_equal( skol3( skol1( skol2
% 0.77/1.15 ) ), skol1( skol2 ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (33) {G1,W21,D3,L4,V1,M4} { ! subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, X ), ! stable( skol2 ), ! greater_or_equal( X
% 0.77/1.15 , skol1( skol2 ) ), greater( growth_rate( efficient_producers, X ),
% 0.77/1.15 growth_rate( first_movers, X ) ) }.
% 0.77/1.15 parent0[4]: (2) {G0,W24,D3,L5,V2,M1} I { ! subpopulations( first_movers,
% 0.77/1.15 efficient_producers, X, Y ), ! stable( X ), ! greater_or_equal( Y, skol1
% 0.77/1.15 ( X ) ), greater( growth_rate( efficient_producers, Y ), growth_rate(
% 0.77/1.15 first_movers, Y ) ), ! environment( X ) }.
% 0.77/1.15 parent1[0]: (3) {G0,W2,D2,L1,V0,M1} I { environment( skol2 ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := skol2
% 0.77/1.15 Y := X
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (34) {G1,W18,D3,L3,V1,M3} { ! subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, X ), ! greater_or_equal( X, skol1( skol2 ) )
% 0.77/1.15 , greater( growth_rate( efficient_producers, X ), growth_rate(
% 0.77/1.15 first_movers, X ) ) }.
% 0.77/1.15 parent0[1]: (33) {G1,W21,D3,L4,V1,M4} { ! subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, X ), ! stable( skol2 ), ! greater_or_equal( X
% 0.77/1.15 , skol1( skol2 ) ), greater( growth_rate( efficient_producers, X ),
% 0.77/1.15 growth_rate( first_movers, X ) ) }.
% 0.77/1.15 parent1[0]: (4) {G0,W2,D2,L1,V0,M1} I { stable( skol2 ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (12) {G1,W18,D3,L3,V1,M1} R(2,3);r(4) { ! greater_or_equal( X
% 0.77/1.15 , skol1( skol2 ) ), greater( growth_rate( efficient_producers, X ),
% 0.77/1.15 growth_rate( first_movers, X ) ), ! subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, X ) }.
% 0.77/1.15 parent0: (34) {G1,W18,D3,L3,V1,M3} { ! subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, X ), ! greater_or_equal( X, skol1( skol2 ) )
% 0.77/1.15 , greater( growth_rate( efficient_producers, X ), growth_rate(
% 0.77/1.15 first_movers, X ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 2
% 0.77/1.15 1 ==> 0
% 0.77/1.15 2 ==> 1
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (35) {G2,W15,D4,L2,V1,M2} { ! greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( X ) ), growth_rate( first_movers, skol3( X )
% 0.77/1.15 ) ), selection_favors( efficient_producers, first_movers, skol3( X ) )
% 0.77/1.15 }.
% 0.77/1.15 parent0[2]: (8) {G1,W18,D3,L3,V3,M1} R(0,3) { ! greater( growth_rate( Y, Z
% 0.77/1.15 ), growth_rate( X, Z ) ), selection_favors( Y, X, Z ), ! subpopulations
% 0.77/1.15 ( X, Y, skol2, Z ) }.
% 0.77/1.15 parent1[0]: (10) {G2,W6,D3,L1,V1,M1} R(9,5) { subpopulations( first_movers
% 0.77/1.15 , efficient_producers, skol2, skol3( X ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := first_movers
% 0.77/1.15 Y := efficient_producers
% 0.77/1.15 Z := skol3( X )
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 X := X
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (13) {G3,W15,D4,L2,V1,M1} R(8,10) { selection_favors(
% 0.77/1.15 efficient_producers, first_movers, skol3( X ) ), ! greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( X ) ), growth_rate( first_movers, skol3( X )
% 0.77/1.15 ) ) }.
% 0.77/1.15 parent0: (35) {G2,W15,D4,L2,V1,M2} { ! greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( X ) ), growth_rate( first_movers, skol3( X )
% 0.77/1.15 ) ), selection_favors( efficient_producers, first_movers, skol3( X ) )
% 0.77/1.15 }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 1
% 0.77/1.15 1 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (36) {G2,W15,D4,L2,V1,M2} { ! greater_or_equal( skol3( X ),
% 0.77/1.15 skol1( skol2 ) ), greater( growth_rate( efficient_producers, skol3( X ) )
% 0.77/1.15 , growth_rate( first_movers, skol3( X ) ) ) }.
% 0.77/1.15 parent0[2]: (12) {G1,W18,D3,L3,V1,M1} R(2,3);r(4) { ! greater_or_equal( X,
% 0.77/1.15 skol1( skol2 ) ), greater( growth_rate( efficient_producers, X ),
% 0.77/1.15 growth_rate( first_movers, X ) ), ! subpopulations( first_movers,
% 0.77/1.15 efficient_producers, skol2, X ) }.
% 0.77/1.15 parent1[0]: (10) {G2,W6,D3,L1,V1,M1} R(9,5) { subpopulations( first_movers
% 0.77/1.15 , efficient_producers, skol2, skol3( X ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := skol3( X )
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 X := X
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (14) {G3,W15,D4,L2,V1,M1} R(12,10) { greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( X ) ), growth_rate( first_movers, skol3( X )
% 0.77/1.15 ) ), ! greater_or_equal( skol3( X ), skol1( skol2 ) ) }.
% 0.77/1.15 parent0: (36) {G2,W15,D4,L2,V1,M2} { ! greater_or_equal( skol3( X ), skol1
% 0.77/1.15 ( skol2 ) ), greater( growth_rate( efficient_producers, skol3( X ) ),
% 0.77/1.15 growth_rate( first_movers, skol3( X ) ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 1
% 0.77/1.15 1 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (37) {G3,W11,D5,L1,V0,M1} { greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( skol1( skol2 ) ) ), growth_rate( first_movers
% 0.77/1.15 , skol3( skol1( skol2 ) ) ) ) }.
% 0.77/1.15 parent0[1]: (14) {G3,W15,D4,L2,V1,M1} R(12,10) { greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( X ) ), growth_rate( first_movers, skol3( X )
% 0.77/1.15 ) ), ! greater_or_equal( skol3( X ), skol1( skol2 ) ) }.
% 0.77/1.15 parent1[0]: (11) {G2,W6,D4,L1,V0,M1} R(9,7) { greater_or_equal( skol3(
% 0.77/1.15 skol1( skol2 ) ), skol1( skol2 ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := skol1( skol2 )
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (15) {G4,W11,D5,L1,V0,M1} R(14,11) { greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( skol1( skol2 ) ) ), growth_rate( first_movers
% 0.77/1.15 , skol3( skol1( skol2 ) ) ) ) }.
% 0.77/1.15 parent0: (37) {G3,W11,D5,L1,V0,M1} { greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( skol1( skol2 ) ) ), growth_rate( first_movers
% 0.77/1.15 , skol3( skol1( skol2 ) ) ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (38) {G4,W6,D4,L1,V0,M1} { selection_favors(
% 0.77/1.15 efficient_producers, first_movers, skol3( skol1( skol2 ) ) ) }.
% 0.77/1.15 parent0[1]: (13) {G3,W15,D4,L2,V1,M1} R(8,10) { selection_favors(
% 0.77/1.15 efficient_producers, first_movers, skol3( X ) ), ! greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( X ) ), growth_rate( first_movers, skol3( X )
% 0.77/1.15 ) ) }.
% 0.77/1.15 parent1[0]: (15) {G4,W11,D5,L1,V0,M1} R(14,11) { greater( growth_rate(
% 0.77/1.15 efficient_producers, skol3( skol1( skol2 ) ) ), growth_rate( first_movers
% 0.77/1.15 , skol3( skol1( skol2 ) ) ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := skol1( skol2 )
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (16) {G5,W6,D4,L1,V0,M1} R(15,13) { selection_favors(
% 0.77/1.15 efficient_producers, first_movers, skol3( skol1( skol2 ) ) ) }.
% 0.77/1.15 parent0: (38) {G4,W6,D4,L1,V0,M1} { selection_favors( efficient_producers
% 0.77/1.15 , first_movers, skol3( skol1( skol2 ) ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (39) {G1,W4,D2,L1,V1,M1} { ! in_environment( skol2, X ) }.
% 0.77/1.15 parent0[1]: (6) {G0,W10,D3,L2,V2,M1} I { ! in_environment( skol2, X ), !
% 0.77/1.15 selection_favors( efficient_producers, first_movers, skol3( Y ) ) }.
% 0.77/1.15 parent1[0]: (16) {G5,W6,D4,L1,V0,M1} R(15,13) { selection_favors(
% 0.77/1.15 efficient_producers, first_movers, skol3( skol1( skol2 ) ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 Y := skol1( skol2 )
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (17) {G6,W4,D2,L1,V1,M1} R(16,6) { ! in_environment( skol2, X
% 0.77/1.15 ) }.
% 0.77/1.15 parent0: (39) {G1,W4,D2,L1,V1,M1} { ! in_environment( skol2, X ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := X
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 0 ==> 0
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 resolution: (40) {G2,W0,D0,L0,V0,M0} { }.
% 0.77/1.15 parent0[0]: (17) {G6,W4,D2,L1,V1,M1} R(16,6) { ! in_environment( skol2, X )
% 0.77/1.15 }.
% 0.77/1.15 parent1[0]: (9) {G1,W4,D3,L1,V0,M1} R(1,3);r(4) { in_environment( skol2,
% 0.77/1.15 skol1( skol2 ) ) }.
% 0.77/1.15 substitution0:
% 0.77/1.15 X := skol1( skol2 )
% 0.77/1.15 end
% 0.77/1.15 substitution1:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 subsumption: (18) {G7,W0,D0,L0,V0,M0} R(17,9) { }.
% 0.77/1.15 parent0: (40) {G2,W0,D0,L0,V0,M0} { }.
% 0.77/1.15 substitution0:
% 0.77/1.15 end
% 0.77/1.15 permutation0:
% 0.77/1.15 end
% 0.77/1.15
% 0.77/1.15 Proof check complete!
% 0.77/1.15
% 0.77/1.15 Memory use:
% 0.77/1.15
% 0.77/1.15 space for terms: 399
% 0.77/1.15 space for clauses: 1371
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 clauses generated: 19
% 0.77/1.15 clauses kept: 19
% 0.77/1.15 clauses selected: 18
% 0.77/1.15 clauses deleted: 0
% 0.77/1.15 clauses inuse deleted: 0
% 0.77/1.15
% 0.77/1.15 subsentry: 0
% 0.77/1.15 literals s-matched: 0
% 0.77/1.15 literals matched: 0
% 0.77/1.15 full subsumption: 0
% 0.77/1.15
% 0.77/1.15 checksum: -606787622
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 Bliksem ended
%------------------------------------------------------------------------------