TSTP Solution File: MGT036-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : MGT036-3 : TPTP v8.1.0. Released v2.4.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:48 EDT 2022
% Result : Unsatisfiable 0.44s 1.09s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT036-3 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Thu Jun 9 10:19:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.09 *** allocated 10000 integers for termspace/termends
% 0.44/1.09 *** allocated 10000 integers for clauses
% 0.44/1.09 *** allocated 10000 integers for justifications
% 0.44/1.09 Bliksem 1.12
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Automatic Strategy Selection
% 0.44/1.09
% 0.44/1.09 Clauses:
% 0.44/1.09 [
% 0.44/1.09 [ ~( environment( X ) ), ~( subpopulations( Y, Z, X, T ) ),
% 0.44/1.09 subpopulations( Z, Y, X, T ) ],
% 0.44/1.09 [ ~( environment( X ) ), ~( subpopulations( Y, Z, X, T ) ), ~(
% 0.44/1.09 'greater_or_equal'( 'growth_rate'( Z, T ), zero ) ), ~( greater( zero,
% 0.44/1.09 'growth_rate'( Y, T ) ) ), outcompetes( Z, Y, T ) ],
% 0.44/1.09 [ ~( environment( X ) ), ~( subpopulations( Y, Z, X, T ) ), ~(
% 0.44/1.09 outcompetes( Z, Y, T ) ), 'greater_or_equal'( 'growth_rate'( Z, T ), zero
% 0.44/1.09 ) ],
% 0.44/1.09 [ ~( environment( X ) ), ~( subpopulations( Y, Z, X, T ) ), ~(
% 0.44/1.09 outcompetes( Z, Y, T ) ), greater( zero, 'growth_rate'( Y, T ) ) ],
% 0.44/1.09 [ environment( sk1 ) ],
% 0.44/1.09 [ subpopulations( 'first_movers', 'efficient_producers', sk1, sk2 ) ]
% 0.44/1.09 ,
% 0.44/1.09 [ 'greater_or_equal'( 'growth_rate'( 'first_movers', sk2 ), zero ) ]
% 0.44/1.09 ,
% 0.44/1.09 [ greater( zero, 'growth_rate'( 'efficient_producers', sk2 ) ) ],
% 0.44/1.09 [ ~( environment( X ) ), ~( subpopulations( 'first_movers',
% 0.44/1.09 'efficient_producers', X, Y ) ), ~( outcompetes( 'first_movers',
% 0.44/1.09 'efficient_producers', Y ) ) ]
% 0.44/1.09 ] .
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.44/1.09 This is a near-Horn, non-equality problem
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Options Used:
% 0.44/1.09
% 0.44/1.09 useres = 1
% 0.44/1.09 useparamod = 0
% 0.44/1.09 useeqrefl = 0
% 0.44/1.09 useeqfact = 0
% 0.44/1.09 usefactor = 1
% 0.44/1.09 usesimpsplitting = 0
% 0.44/1.09 usesimpdemod = 0
% 0.44/1.09 usesimpres = 4
% 0.44/1.09
% 0.44/1.09 resimpinuse = 1000
% 0.44/1.09 resimpclauses = 20000
% 0.44/1.09 substype = standard
% 0.44/1.09 backwardsubs = 1
% 0.44/1.09 selectoldest = 5
% 0.44/1.09
% 0.44/1.09 litorderings [0] = split
% 0.44/1.09 litorderings [1] = liftord
% 0.44/1.09
% 0.44/1.09 termordering = none
% 0.44/1.09
% 0.44/1.09 litapriori = 1
% 0.44/1.09 termapriori = 0
% 0.44/1.09 litaposteriori = 0
% 0.44/1.09 termaposteriori = 0
% 0.44/1.09 demodaposteriori = 0
% 0.44/1.09 ordereqreflfact = 0
% 0.44/1.09
% 0.44/1.09 litselect = negative
% 0.44/1.09
% 0.44/1.09 maxweight = 30000
% 0.44/1.09 maxdepth = 30000
% 0.44/1.09 maxlength = 115
% 0.44/1.09 maxnrvars = 195
% 0.44/1.09 excuselevel = 0
% 0.44/1.09 increasemaxweight = 0
% 0.44/1.09
% 0.44/1.09 maxselected = 10000000
% 0.44/1.09 maxnrclauses = 10000000
% 0.44/1.09
% 0.44/1.09 showgenerated = 0
% 0.44/1.09 showkept = 0
% 0.44/1.09 showselected = 0
% 0.44/1.09 showdeleted = 0
% 0.44/1.09 showresimp = 1
% 0.44/1.09 showstatus = 2000
% 0.44/1.09
% 0.44/1.09 prologoutput = 1
% 0.44/1.09 nrgoals = 5000000
% 0.44/1.09 totalproof = 1
% 0.44/1.09
% 0.44/1.09 Symbols occurring in the translation:
% 0.44/1.09
% 0.44/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.09 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.44/1.09 ! [4, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.44/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.09 environment [40, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.44/1.09 subpopulations [44, 4] (w:1, o:53, a:1, s:1, b:0),
% 0.44/1.09 'growth_rate' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.44/1.09 zero [46, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.44/1.09 'greater_or_equal' [47, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.44/1.09 greater [48, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.44/1.09 outcompetes [49, 3] (w:1, o:52, a:1, s:1, b:0),
% 0.44/1.09 sk1 [50, 0] (w:1, o:5, a:1, s:1, b:0),
% 0.44/1.09 'first_movers' [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.44/1.09 'efficient_producers' [52, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.44/1.09 sk2 [53, 0] (w:1, o:6, a:1, s:1, b:0).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Starting Search:
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Bliksems!, er is een bewijs:
% 0.44/1.09 % SZS status Unsatisfiable
% 0.44/1.09 % SZS output start Refutation
% 0.44/1.09
% 0.44/1.09 clause( 0, [ ~( subpopulations( Y, Z, X, T ) ), subpopulations( Z, Y, X, T
% 0.44/1.09 ), ~( environment( X ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 1, [ ~( subpopulations( Y, Z, X, T ) ), ~( 'greater_or_equal'(
% 0.44/1.09 'growth_rate'( Z, T ), zero ) ), ~( greater( zero, 'growth_rate'( Y, T )
% 0.44/1.09 ) ), outcompetes( Z, Y, T ), ~( environment( X ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 4, [ environment( sk1 ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 5, [ subpopulations( 'first_movers', 'efficient_producers', sk1,
% 0.44/1.09 sk2 ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 6, [ 'greater_or_equal'( 'growth_rate'( 'first_movers', sk2 ), zero
% 0.44/1.09 ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 7, [ greater( zero, 'growth_rate'( 'efficient_producers', sk2 ) ) ]
% 0.44/1.09 )
% 0.44/1.09 .
% 0.44/1.09 clause( 8, [ ~( subpopulations( 'first_movers', 'efficient_producers', X, Y
% 0.44/1.09 ) ), ~( outcompetes( 'first_movers', 'efficient_producers', Y ) ), ~(
% 0.44/1.09 environment( X ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 9, [ subpopulations( Y, X, sk1, Z ), ~( subpopulations( X, Y, sk1,
% 0.44/1.09 Z ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 10, [ ~( 'greater_or_equal'( 'growth_rate'( Y, Z ), zero ) ), ~(
% 0.44/1.09 greater( zero, 'growth_rate'( X, Z ) ) ), outcompetes( Y, X, Z ), ~(
% 0.44/1.09 subpopulations( X, Y, sk1, Z ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 11, [ subpopulations( 'efficient_producers', 'first_movers', sk1,
% 0.44/1.09 sk2 ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 12, [ ~( outcompetes( 'first_movers', 'efficient_producers', X ) )
% 0.44/1.09 , ~( subpopulations( 'first_movers', 'efficient_producers', sk1, X ) ) ]
% 0.44/1.09 )
% 0.44/1.09 .
% 0.44/1.09 clause( 13, [ ~( outcompetes( 'first_movers', 'efficient_producers', sk2 )
% 0.44/1.09 ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 17, [ outcompetes( 'first_movers', 'efficient_producers', sk2 ),
% 0.44/1.09 ~( greater( zero, 'growth_rate'( 'efficient_producers', sk2 ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 19, [] )
% 0.44/1.09 .
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 % SZS output end Refutation
% 0.44/1.09 found a proof!
% 0.44/1.09
% 0.44/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.09
% 0.44/1.09 initialclauses(
% 0.44/1.09 [ clause( 21, [ ~( environment( X ) ), ~( subpopulations( Y, Z, X, T ) ),
% 0.44/1.09 subpopulations( Z, Y, X, T ) ] )
% 0.44/1.09 , clause( 22, [ ~( environment( X ) ), ~( subpopulations( Y, Z, X, T ) ),
% 0.44/1.09 ~( 'greater_or_equal'( 'growth_rate'( Z, T ), zero ) ), ~( greater( zero
% 0.44/1.09 , 'growth_rate'( Y, T ) ) ), outcompetes( Z, Y, T ) ] )
% 0.44/1.09 , clause( 23, [ ~( environment( X ) ), ~( subpopulations( Y, Z, X, T ) ),
% 0.44/1.09 ~( outcompetes( Z, Y, T ) ), 'greater_or_equal'( 'growth_rate'( Z, T ),
% 0.44/1.09 zero ) ] )
% 0.44/1.09 , clause( 24, [ ~( environment( X ) ), ~( subpopulations( Y, Z, X, T ) ),
% 0.44/1.09 ~( outcompetes( Z, Y, T ) ), greater( zero, 'growth_rate'( Y, T ) ) ] )
% 0.44/1.09 , clause( 25, [ environment( sk1 ) ] )
% 0.44/1.09 , clause( 26, [ subpopulations( 'first_movers', 'efficient_producers', sk1
% 0.44/1.09 , sk2 ) ] )
% 0.44/1.09 , clause( 27, [ 'greater_or_equal'( 'growth_rate'( 'first_movers', sk2 ),
% 0.44/1.09 zero ) ] )
% 0.44/1.09 , clause( 28, [ greater( zero, 'growth_rate'( 'efficient_producers', sk2 )
% 0.44/1.09 ) ] )
% 0.44/1.09 , clause( 29, [ ~( environment( X ) ), ~( subpopulations( 'first_movers',
% 0.44/1.09 'efficient_producers', X, Y ) ), ~( outcompetes( 'first_movers',
% 0.44/1.09 'efficient_producers', Y ) ) ] )
% 0.44/1.09 ] ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 0, [ ~( subpopulations( Y, Z, X, T ) ), subpopulations( Z, Y, X, T
% 0.44/1.09 ), ~( environment( X ) ) ] )
% 0.44/1.09 , clause( 21, [ ~( environment( X ) ), ~( subpopulations( Y, Z, X, T ) ),
% 0.44/1.09 subpopulations( Z, Y, X, T ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.44/1.09 permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 1, [ ~( subpopulations( Y, Z, X, T ) ), ~( 'greater_or_equal'(
% 0.44/1.09 'growth_rate'( Z, T ), zero ) ), ~( greater( zero, 'growth_rate'( Y, T )
% 0.44/1.09 ) ), outcompetes( Z, Y, T ), ~( environment( X ) ) ] )
% 0.44/1.09 , clause( 22, [ ~( environment( X ) ), ~( subpopulations( Y, Z, X, T ) ),
% 0.44/1.09 ~( 'greater_or_equal'( 'growth_rate'( Z, T ), zero ) ), ~( greater( zero
% 0.44/1.09 , 'growth_rate'( Y, T ) ) ), outcompetes( Z, Y, T ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.44/1.09 permutation( 0, [ ==>( 0, 4 ), ==>( 1, 0 ), ==>( 2, 1 ), ==>( 3, 2 ),
% 0.44/1.09 ==>( 4, 3 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 4, [ environment( sk1 ) ] )
% 0.44/1.09 , clause( 25, [ environment( sk1 ) ] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 5, [ subpopulations( 'first_movers', 'efficient_producers', sk1,
% 0.44/1.09 sk2 ) ] )
% 0.44/1.09 , clause( 26, [ subpopulations( 'first_movers', 'efficient_producers', sk1
% 0.44/1.09 , sk2 ) ] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 6, [ 'greater_or_equal'( 'growth_rate'( 'first_movers', sk2 ), zero
% 0.44/1.09 ) ] )
% 0.44/1.09 , clause( 27, [ 'greater_or_equal'( 'growth_rate'( 'first_movers', sk2 ),
% 0.44/1.09 zero ) ] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 7, [ greater( zero, 'growth_rate'( 'efficient_producers', sk2 ) ) ]
% 0.44/1.09 )
% 0.44/1.09 , clause( 28, [ greater( zero, 'growth_rate'( 'efficient_producers', sk2 )
% 0.44/1.09 ) ] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 8, [ ~( subpopulations( 'first_movers', 'efficient_producers', X, Y
% 0.44/1.09 ) ), ~( outcompetes( 'first_movers', 'efficient_producers', Y ) ), ~(
% 0.44/1.09 environment( X ) ) ] )
% 0.44/1.09 , clause( 29, [ ~( environment( X ) ), ~( subpopulations( 'first_movers',
% 0.44/1.09 'efficient_producers', X, Y ) ), ~( outcompetes( 'first_movers',
% 0.44/1.09 'efficient_producers', Y ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 2
% 0.44/1.09 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 30, [ ~( subpopulations( X, Y, sk1, Z ) ), subpopulations( Y, X,
% 0.44/1.09 sk1, Z ) ] )
% 0.44/1.09 , clause( 0, [ ~( subpopulations( Y, Z, X, T ) ), subpopulations( Z, Y, X,
% 0.44/1.09 T ), ~( environment( X ) ) ] )
% 0.44/1.09 , 2, clause( 4, [ environment( sk1 ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, sk1 ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )
% 0.44/1.09 , substitution( 1, [] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 9, [ subpopulations( Y, X, sk1, Z ), ~( subpopulations( X, Y, sk1,
% 0.44/1.09 Z ) ) ] )
% 0.44/1.09 , clause( 30, [ ~( subpopulations( X, Y, sk1, Z ) ), subpopulations( Y, X,
% 0.44/1.09 sk1, Z ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 31, [ ~( subpopulations( X, Y, sk1, Z ) ), ~( 'greater_or_equal'(
% 0.44/1.09 'growth_rate'( Y, Z ), zero ) ), ~( greater( zero, 'growth_rate'( X, Z )
% 0.44/1.09 ) ), outcompetes( Y, X, Z ) ] )
% 0.44/1.09 , clause( 1, [ ~( subpopulations( Y, Z, X, T ) ), ~( 'greater_or_equal'(
% 0.44/1.09 'growth_rate'( Z, T ), zero ) ), ~( greater( zero, 'growth_rate'( Y, T )
% 0.44/1.09 ) ), outcompetes( Z, Y, T ), ~( environment( X ) ) ] )
% 0.44/1.09 , 4, clause( 4, [ environment( sk1 ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, sk1 ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )
% 0.44/1.09 , substitution( 1, [] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 10, [ ~( 'greater_or_equal'( 'growth_rate'( Y, Z ), zero ) ), ~(
% 0.44/1.09 greater( zero, 'growth_rate'( X, Z ) ) ), outcompetes( Y, X, Z ), ~(
% 0.44/1.09 subpopulations( X, Y, sk1, Z ) ) ] )
% 0.44/1.09 , clause( 31, [ ~( subpopulations( X, Y, sk1, Z ) ), ~( 'greater_or_equal'(
% 0.44/1.09 'growth_rate'( Y, Z ), zero ) ), ~( greater( zero, 'growth_rate'( X, Z )
% 0.44/1.09 ) ), outcompetes( Y, X, Z ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.09 permutation( 0, [ ==>( 0, 3 ), ==>( 1, 0 ), ==>( 2, 1 ), ==>( 3, 2 )] )
% 0.44/1.09 ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 32, [ subpopulations( 'efficient_producers', 'first_movers', sk1,
% 0.44/1.09 sk2 ) ] )
% 0.44/1.09 , clause( 9, [ subpopulations( Y, X, sk1, Z ), ~( subpopulations( X, Y, sk1
% 0.44/1.09 , Z ) ) ] )
% 0.44/1.09 , 1, clause( 5, [ subpopulations( 'first_movers', 'efficient_producers',
% 0.44/1.09 sk1, sk2 ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, 'first_movers' ), :=( Y,
% 0.44/1.09 'efficient_producers' ), :=( Z, sk2 )] ), substitution( 1, [] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 11, [ subpopulations( 'efficient_producers', 'first_movers', sk1,
% 0.44/1.09 sk2 ) ] )
% 0.44/1.09 , clause( 32, [ subpopulations( 'efficient_producers', 'first_movers', sk1
% 0.44/1.09 , sk2 ) ] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 33, [ ~( subpopulations( 'first_movers', 'efficient_producers', sk1
% 0.44/1.09 , X ) ), ~( outcompetes( 'first_movers', 'efficient_producers', X ) ) ]
% 0.44/1.09 )
% 0.44/1.09 , clause( 8, [ ~( subpopulations( 'first_movers', 'efficient_producers', X
% 0.44/1.09 , Y ) ), ~( outcompetes( 'first_movers', 'efficient_producers', Y ) ),
% 0.44/1.09 ~( environment( X ) ) ] )
% 0.44/1.09 , 2, clause( 4, [ environment( sk1 ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, sk1 ), :=( Y, X )] ), substitution( 1, [] )
% 0.44/1.09 ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 12, [ ~( outcompetes( 'first_movers', 'efficient_producers', X ) )
% 0.44/1.09 , ~( subpopulations( 'first_movers', 'efficient_producers', sk1, X ) ) ]
% 0.44/1.09 )
% 0.44/1.09 , clause( 33, [ ~( subpopulations( 'first_movers', 'efficient_producers',
% 0.44/1.09 sk1, X ) ), ~( outcompetes( 'first_movers', 'efficient_producers', X ) )
% 0.44/1.09 ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.44/1.09 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 34, [ ~( outcompetes( 'first_movers', 'efficient_producers', sk2 )
% 0.44/1.09 ) ] )
% 0.44/1.09 , clause( 12, [ ~( outcompetes( 'first_movers', 'efficient_producers', X )
% 0.44/1.09 ), ~( subpopulations( 'first_movers', 'efficient_producers', sk1, X ) )
% 0.44/1.09 ] )
% 0.44/1.09 , 1, clause( 5, [ subpopulations( 'first_movers', 'efficient_producers',
% 0.44/1.09 sk1, sk2 ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, sk2 )] ), substitution( 1, [] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 13, [ ~( outcompetes( 'first_movers', 'efficient_producers', sk2 )
% 0.44/1.09 ) ] )
% 0.44/1.09 , clause( 34, [ ~( outcompetes( 'first_movers', 'efficient_producers', sk2
% 0.44/1.09 ) ) ] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 35, [ ~( 'greater_or_equal'( 'growth_rate'( 'first_movers', sk2 ),
% 0.44/1.09 zero ) ), ~( greater( zero, 'growth_rate'( 'efficient_producers', sk2 ) )
% 0.44/1.09 ), outcompetes( 'first_movers', 'efficient_producers', sk2 ) ] )
% 0.44/1.09 , clause( 10, [ ~( 'greater_or_equal'( 'growth_rate'( Y, Z ), zero ) ), ~(
% 0.44/1.09 greater( zero, 'growth_rate'( X, Z ) ) ), outcompetes( Y, X, Z ), ~(
% 0.44/1.09 subpopulations( X, Y, sk1, Z ) ) ] )
% 0.44/1.09 , 3, clause( 11, [ subpopulations( 'efficient_producers', 'first_movers',
% 0.44/1.09 sk1, sk2 ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, 'efficient_producers' ), :=( Y,
% 0.44/1.09 'first_movers' ), :=( Z, sk2 )] ), substitution( 1, [] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 36, [ ~( greater( zero, 'growth_rate'( 'efficient_producers', sk2 )
% 0.44/1.09 ) ), outcompetes( 'first_movers', 'efficient_producers', sk2 ) ] )
% 0.44/1.09 , clause( 35, [ ~( 'greater_or_equal'( 'growth_rate'( 'first_movers', sk2 )
% 0.44/1.09 , zero ) ), ~( greater( zero, 'growth_rate'( 'efficient_producers', sk2 )
% 0.44/1.09 ) ), outcompetes( 'first_movers', 'efficient_producers', sk2 ) ] )
% 0.44/1.09 , 0, clause( 6, [ 'greater_or_equal'( 'growth_rate'( 'first_movers', sk2 )
% 0.44/1.09 , zero ) ] )
% 0.44/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 17, [ outcompetes( 'first_movers', 'efficient_producers', sk2 ),
% 0.44/1.09 ~( greater( zero, 'growth_rate'( 'efficient_producers', sk2 ) ) ) ] )
% 0.44/1.09 , clause( 36, [ ~( greater( zero, 'growth_rate'( 'efficient_producers', sk2
% 0.44/1.09 ) ) ), outcompetes( 'first_movers', 'efficient_producers', sk2 ) ] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.44/1.09 ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 37, [ ~( greater( zero, 'growth_rate'( 'efficient_producers', sk2 )
% 0.44/1.09 ) ) ] )
% 0.44/1.09 , clause( 13, [ ~( outcompetes( 'first_movers', 'efficient_producers', sk2
% 0.44/1.09 ) ) ] )
% 0.44/1.09 , 0, clause( 17, [ outcompetes( 'first_movers', 'efficient_producers', sk2
% 0.44/1.09 ), ~( greater( zero, 'growth_rate'( 'efficient_producers', sk2 ) ) ) ]
% 0.44/1.09 )
% 0.44/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 38, [] )
% 0.44/1.09 , clause( 37, [ ~( greater( zero, 'growth_rate'( 'efficient_producers', sk2
% 0.44/1.09 ) ) ) ] )
% 0.44/1.09 , 0, clause( 7, [ greater( zero, 'growth_rate'( 'efficient_producers', sk2
% 0.44/1.09 ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 19, [] )
% 0.44/1.09 , clause( 38, [] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 end.
% 0.44/1.09
% 0.44/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.09
% 0.44/1.09 Memory use:
% 0.44/1.09
% 0.44/1.09 space for terms: 523
% 0.44/1.09 space for clauses: 1300
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 clauses generated: 22
% 0.44/1.09 clauses kept: 20
% 0.44/1.09 clauses selected: 16
% 0.44/1.09 clauses deleted: 1
% 0.44/1.09 clauses inuse deleted: 0
% 0.44/1.09
% 0.44/1.09 subsentry: 2
% 0.44/1.09 literals s-matched: 2
% 0.44/1.09 literals matched: 2
% 0.44/1.09 full subsumption: 0
% 0.44/1.09
% 0.44/1.09 checksum: 1383000960
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Bliksem ended
%------------------------------------------------------------------------------