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