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.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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 : Theorem 0.65s 1.03s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Thu Jun 9 07:21:19 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.65/1.03 *** allocated 10000 integers for termspace/termends
% 0.65/1.03 *** allocated 10000 integers for clauses
% 0.65/1.03 *** allocated 10000 integers for justifications
% 0.65/1.03 Bliksem 1.12
% 0.65/1.03
% 0.65/1.03
% 0.65/1.03 Automatic Strategy Selection
% 0.65/1.03
% 0.65/1.03
% 0.65/1.03 Clauses:
% 0.65/1.03
% 0.65/1.03 { ! number_of_routines( X, Y, low ), ! number_of_routines( X, Y, high ) }.
% 0.65/1.03 { ! organisation_at_time( X, Y ), ! efficient_producer( X ), !
% 0.65/1.03 founding_time( X, Y ), has_elaborated_routines( X, Y ) }.
% 0.65/1.03 { ! organisation_at_time( X, Y ), ! first_mover( X ), ! founding_time( X, Y
% 0.65/1.03 ), number_of_routines( X, Y, low ) }.
% 0.65/1.03 { organisation_at_time( skol1, skol2 ) }.
% 0.65/1.03 { founding_time( skol1, skol2 ) }.
% 0.65/1.03 { number_of_routines( skol1, skol2, high ) }.
% 0.65/1.03 { ! has_elaborated_routines( skol1, skol2 ) }.
% 0.65/1.03 { ! organisation_at_time( X, Y ), first_mover( X ), efficient_producer( X )
% 0.65/1.03 }.
% 0.65/1.03
% 0.65/1.03 percentage equality = 0.000000, percentage horn = 0.875000
% 0.65/1.03 This a non-horn, non-equality problem
% 0.65/1.03
% 0.65/1.03
% 0.65/1.03 Options Used:
% 0.65/1.03
% 0.65/1.03 useres = 1
% 0.65/1.03 useparamod = 0
% 0.65/1.03 useeqrefl = 0
% 0.65/1.03 useeqfact = 0
% 0.65/1.03 usefactor = 1
% 0.65/1.03 usesimpsplitting = 0
% 0.65/1.03 usesimpdemod = 0
% 0.65/1.03 usesimpres = 3
% 0.65/1.03
% 0.65/1.03 resimpinuse = 1000
% 0.65/1.03 resimpclauses = 20000
% 0.65/1.03 substype = standard
% 0.65/1.03 backwardsubs = 1
% 0.65/1.03 selectoldest = 5
% 0.65/1.03
% 0.65/1.03 litorderings [0] = split
% 0.65/1.03 litorderings [1] = liftord
% 0.65/1.03
% 0.65/1.03 termordering = none
% 0.65/1.03
% 0.65/1.03 litapriori = 1
% 0.65/1.03 termapriori = 0
% 0.65/1.03 litaposteriori = 0
% 0.65/1.03 termaposteriori = 0
% 0.65/1.03 demodaposteriori = 0
% 0.65/1.03 ordereqreflfact = 0
% 0.65/1.03
% 0.65/1.03 litselect = none
% 0.65/1.03
% 0.65/1.03 maxweight = 15
% 0.65/1.03 maxdepth = 30000
% 0.65/1.03 maxlength = 115
% 0.65/1.03 maxnrvars = 195
% 0.65/1.03 excuselevel = 1
% 0.65/1.03 increasemaxweight = 1
% 0.65/1.03
% 0.65/1.03 maxselected = 10000000
% 0.65/1.03 maxnrclauses = 10000000
% 0.65/1.03
% 0.65/1.03 showgenerated = 0
% 0.65/1.03 showkept = 0
% 0.65/1.03 showselected = 0
% 0.65/1.03 showdeleted = 0
% 0.65/1.03 showresimp = 1
% 0.65/1.03 showstatus = 2000
% 0.65/1.03
% 0.65/1.03 prologoutput = 0
% 0.65/1.03 nrgoals = 5000000
% 0.65/1.03 totalproof = 1
% 0.65/1.03
% 0.65/1.03 Symbols occurring in the translation:
% 0.65/1.03
% 0.65/1.03 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.65/1.03 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.65/1.03 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.65/1.03 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.65/1.03 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.65/1.03 low [37, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.65/1.03 number_of_routines [38, 3] (w:1, o:46, a:1, s:1, b:0),
% 0.65/1.03 high [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.65/1.03 organisation_at_time [40, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.65/1.03 efficient_producer [41, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.65/1.03 founding_time [42, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.65/1.03 has_elaborated_routines [43, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.65/1.03 first_mover [44, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.65/1.03 skol1 [45, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.65/1.03 skol2 [46, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.65/1.03
% 0.65/1.03
% 0.65/1.03 Starting Search:
% 0.65/1.03
% 0.65/1.03
% 0.65/1.03 Bliksems!, er is een bewijs:
% 0.65/1.03 % SZS status Theorem
% 0.65/1.03 % SZS output start Refutation
% 0.65/1.03
% 0.65/1.03 (0) {G0,W8,D2,L2,V2,M1} I { ! number_of_routines( X, Y, low ), !
% 0.65/1.03 number_of_routines( X, Y, high ) }.
% 0.65/1.03 (1) {G0,W11,D2,L4,V2,M1} I { ! efficient_producer( X ), !
% 0.65/1.03 organisation_at_time( X, Y ), ! founding_time( X, Y ),
% 0.65/1.03 has_elaborated_routines( X, Y ) }.
% 0.65/1.03 (2) {G0,W12,D2,L4,V2,M1} I { ! first_mover( X ), ! organisation_at_time( X
% 0.65/1.03 , Y ), ! founding_time( X, Y ), number_of_routines( X, Y, low ) }.
% 0.65/1.03 (3) {G0,W3,D2,L1,V0,M1} I { organisation_at_time( skol1, skol2 ) }.
% 0.65/1.03 (4) {G0,W3,D2,L1,V0,M1} I { founding_time( skol1, skol2 ) }.
% 0.65/1.03 (5) {G0,W4,D2,L1,V0,M1} I { number_of_routines( skol1, skol2, high ) }.
% 0.65/1.03 (6) {G0,W3,D2,L1,V0,M1} I { ! has_elaborated_routines( skol1, skol2 ) }.
% 0.65/1.03 (7) {G0,W7,D2,L3,V2,M1} I { first_mover( X ), efficient_producer( X ), !
% 0.65/1.03 organisation_at_time( X, Y ) }.
% 0.65/1.03 (8) {G1,W4,D2,L2,V0,M1} R(7,3) { efficient_producer( skol1 ), first_mover(
% 0.65/1.03 skol1 ) }.
% 0.65/1.03 (9) {G1,W4,D2,L1,V0,M1} R(0,5) { ! number_of_routines( skol1, skol2, low )
% 0.65/1.03 }.
% 0.65/1.03 (10) {G1,W5,D2,L2,V0,M1} R(1,6);r(3) { ! efficient_producer( skol1 ), !
% 0.65/1.03 founding_time( skol1, skol2 ) }.
% 0.65/1.03 (11) {G2,W2,D2,L1,V0,M1} S(10);r(4) { ! efficient_producer( skol1 ) }.
% 0.65/1.03 (12) {G2,W5,D2,L2,V0,M1} R(2,9);r(3) { ! first_mover( skol1 ), !
% 0.65/1.03 founding_time( skol1, skol2 ) }.
% 0.65/1.03 (13) {G3,W2,D2,L1,V0,M1} S(12);r(4) { ! first_mover( skol1 ) }.
% 0.65/1.03 (14) {G4,W0,D0,L0,V0,M0} R(13,8);r(11) { }.
% 0.65/1.03
% 0.65/1.03
% 0.65/1.03 % SZS output end Refutation
% 0.65/1.03 found a proof!
% 0.65/1.03
% 0.65/1.03
% 0.65/1.03 Unprocessed initial clauses:
% 0.65/1.03
% 0.65/1.03 (16) {G0,W8,D2,L2,V2,M2} { ! number_of_routines( X, Y, low ), !
% 0.65/1.03 number_of_routines( X, Y, high ) }.
% 0.65/1.03 (17) {G0,W11,D2,L4,V2,M4} { ! organisation_at_time( X, Y ), !
% 0.65/1.03 efficient_producer( X ), ! founding_time( X, Y ), has_elaborated_routines
% 0.65/1.03 ( X, Y ) }.
% 0.65/1.03 (18) {G0,W12,D2,L4,V2,M4} { ! organisation_at_time( X, Y ), ! first_mover
% 0.65/1.03 ( X ), ! founding_time( X, Y ), number_of_routines( X, Y, low ) }.
% 0.65/1.03 (19) {G0,W3,D2,L1,V0,M1} { organisation_at_time( skol1, skol2 ) }.
% 0.65/1.03 (20) {G0,W3,D2,L1,V0,M1} { founding_time( skol1, skol2 ) }.
% 0.65/1.03 (21) {G0,W4,D2,L1,V0,M1} { number_of_routines( skol1, skol2, high ) }.
% 0.65/1.03 (22) {G0,W3,D2,L1,V0,M1} { ! has_elaborated_routines( skol1, skol2 ) }.
% 0.65/1.03 (23) {G0,W7,D2,L3,V2,M3} { ! organisation_at_time( X, Y ), first_mover( X
% 0.65/1.03 ), efficient_producer( X ) }.
% 0.65/1.03
% 0.65/1.03
% 0.65/1.03 Total Proof:
% 0.65/1.03
% 0.65/1.03 subsumption: (0) {G0,W8,D2,L2,V2,M1} I { ! number_of_routines( X, Y, low )
% 0.65/1.03 , ! number_of_routines( X, Y, high ) }.
% 0.65/1.03 parent0: (16) {G0,W8,D2,L2,V2,M2} { ! number_of_routines( X, Y, low ), !
% 0.65/1.03 number_of_routines( X, Y, high ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 X := X
% 0.65/1.03 Y := Y
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 0
% 0.65/1.03 1 ==> 1
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (1) {G0,W11,D2,L4,V2,M1} I { ! efficient_producer( X ), !
% 0.65/1.03 organisation_at_time( X, Y ), ! founding_time( X, Y ),
% 0.65/1.03 has_elaborated_routines( X, Y ) }.
% 0.65/1.03 parent0: (17) {G0,W11,D2,L4,V2,M4} { ! organisation_at_time( X, Y ), !
% 0.65/1.03 efficient_producer( X ), ! founding_time( X, Y ), has_elaborated_routines
% 0.65/1.03 ( X, Y ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 X := X
% 0.65/1.03 Y := Y
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 1
% 0.65/1.03 1 ==> 0
% 0.65/1.03 2 ==> 2
% 0.65/1.03 3 ==> 3
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (2) {G0,W12,D2,L4,V2,M1} I { ! first_mover( X ), !
% 0.65/1.03 organisation_at_time( X, Y ), ! founding_time( X, Y ), number_of_routines
% 0.65/1.03 ( X, Y, low ) }.
% 0.65/1.03 parent0: (18) {G0,W12,D2,L4,V2,M4} { ! organisation_at_time( X, Y ), !
% 0.65/1.03 first_mover( X ), ! founding_time( X, Y ), number_of_routines( X, Y, low
% 0.65/1.03 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 X := X
% 0.65/1.03 Y := Y
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 1
% 0.65/1.03 1 ==> 0
% 0.65/1.03 2 ==> 2
% 0.65/1.03 3 ==> 3
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (3) {G0,W3,D2,L1,V0,M1} I { organisation_at_time( skol1, skol2
% 0.65/1.03 ) }.
% 0.65/1.03 parent0: (19) {G0,W3,D2,L1,V0,M1} { organisation_at_time( skol1, skol2 )
% 0.65/1.03 }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 0
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (4) {G0,W3,D2,L1,V0,M1} I { founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent0: (20) {G0,W3,D2,L1,V0,M1} { founding_time( skol1, skol2 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 0
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (5) {G0,W4,D2,L1,V0,M1} I { number_of_routines( skol1, skol2,
% 0.65/1.03 high ) }.
% 0.65/1.03 parent0: (21) {G0,W4,D2,L1,V0,M1} { number_of_routines( skol1, skol2, high
% 0.65/1.03 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 0
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (6) {G0,W3,D2,L1,V0,M1} I { ! has_elaborated_routines( skol1,
% 0.65/1.03 skol2 ) }.
% 0.65/1.03 parent0: (22) {G0,W3,D2,L1,V0,M1} { ! has_elaborated_routines( skol1,
% 0.65/1.03 skol2 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 0
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (7) {G0,W7,D2,L3,V2,M1} I { first_mover( X ),
% 0.65/1.03 efficient_producer( X ), ! organisation_at_time( X, Y ) }.
% 0.65/1.03 parent0: (23) {G0,W7,D2,L3,V2,M3} { ! organisation_at_time( X, Y ),
% 0.65/1.03 first_mover( X ), efficient_producer( X ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 X := X
% 0.65/1.03 Y := Y
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 2
% 0.65/1.03 1 ==> 0
% 0.65/1.03 2 ==> 1
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 resolution: (24) {G1,W4,D2,L2,V0,M2} { first_mover( skol1 ),
% 0.65/1.03 efficient_producer( skol1 ) }.
% 0.65/1.03 parent0[2]: (7) {G0,W7,D2,L3,V2,M1} I { first_mover( X ),
% 0.65/1.03 efficient_producer( X ), ! organisation_at_time( X, Y ) }.
% 0.65/1.03 parent1[0]: (3) {G0,W3,D2,L1,V0,M1} I { organisation_at_time( skol1, skol2
% 0.65/1.03 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 X := skol1
% 0.65/1.03 Y := skol2
% 0.65/1.03 end
% 0.65/1.03 substitution1:
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (8) {G1,W4,D2,L2,V0,M1} R(7,3) { efficient_producer( skol1 ),
% 0.65/1.03 first_mover( skol1 ) }.
% 0.65/1.03 parent0: (24) {G1,W4,D2,L2,V0,M2} { first_mover( skol1 ),
% 0.65/1.03 efficient_producer( skol1 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 1
% 0.65/1.03 1 ==> 0
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 resolution: (25) {G1,W4,D2,L1,V0,M1} { ! number_of_routines( skol1, skol2
% 0.65/1.03 , low ) }.
% 0.65/1.03 parent0[1]: (0) {G0,W8,D2,L2,V2,M1} I { ! number_of_routines( X, Y, low ),
% 0.65/1.03 ! number_of_routines( X, Y, high ) }.
% 0.65/1.03 parent1[0]: (5) {G0,W4,D2,L1,V0,M1} I { number_of_routines( skol1, skol2,
% 0.65/1.03 high ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 X := skol1
% 0.65/1.03 Y := skol2
% 0.65/1.03 end
% 0.65/1.03 substitution1:
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (9) {G1,W4,D2,L1,V0,M1} R(0,5) { ! number_of_routines( skol1,
% 0.65/1.03 skol2, low ) }.
% 0.65/1.03 parent0: (25) {G1,W4,D2,L1,V0,M1} { ! number_of_routines( skol1, skol2,
% 0.65/1.03 low ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 0
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 resolution: (26) {G1,W8,D2,L3,V0,M3} { ! efficient_producer( skol1 ), !
% 0.65/1.03 organisation_at_time( skol1, skol2 ), ! founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent0[0]: (6) {G0,W3,D2,L1,V0,M1} I { ! has_elaborated_routines( skol1,
% 0.65/1.03 skol2 ) }.
% 0.65/1.03 parent1[3]: (1) {G0,W11,D2,L4,V2,M1} I { ! efficient_producer( X ), !
% 0.65/1.03 organisation_at_time( X, Y ), ! founding_time( X, Y ),
% 0.65/1.03 has_elaborated_routines( X, Y ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 substitution1:
% 0.65/1.03 X := skol1
% 0.65/1.03 Y := skol2
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 resolution: (27) {G1,W5,D2,L2,V0,M2} { ! efficient_producer( skol1 ), !
% 0.65/1.03 founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent0[1]: (26) {G1,W8,D2,L3,V0,M3} { ! efficient_producer( skol1 ), !
% 0.65/1.03 organisation_at_time( skol1, skol2 ), ! founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent1[0]: (3) {G0,W3,D2,L1,V0,M1} I { organisation_at_time( skol1, skol2
% 0.65/1.03 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 substitution1:
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (10) {G1,W5,D2,L2,V0,M1} R(1,6);r(3) { ! efficient_producer(
% 0.65/1.03 skol1 ), ! founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent0: (27) {G1,W5,D2,L2,V0,M2} { ! efficient_producer( skol1 ), !
% 0.65/1.03 founding_time( skol1, skol2 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 0
% 0.65/1.03 1 ==> 1
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 resolution: (28) {G1,W2,D2,L1,V0,M1} { ! efficient_producer( skol1 ) }.
% 0.65/1.03 parent0[1]: (10) {G1,W5,D2,L2,V0,M1} R(1,6);r(3) { ! efficient_producer(
% 0.65/1.03 skol1 ), ! founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { founding_time( skol1, skol2 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 substitution1:
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (11) {G2,W2,D2,L1,V0,M1} S(10);r(4) { ! efficient_producer(
% 0.65/1.03 skol1 ) }.
% 0.65/1.03 parent0: (28) {G1,W2,D2,L1,V0,M1} { ! efficient_producer( skol1 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 0
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 resolution: (29) {G1,W8,D2,L3,V0,M3} { ! first_mover( skol1 ), !
% 0.65/1.03 organisation_at_time( skol1, skol2 ), ! founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent0[0]: (9) {G1,W4,D2,L1,V0,M1} R(0,5) { ! number_of_routines( skol1,
% 0.65/1.03 skol2, low ) }.
% 0.65/1.03 parent1[3]: (2) {G0,W12,D2,L4,V2,M1} I { ! first_mover( X ), !
% 0.65/1.03 organisation_at_time( X, Y ), ! founding_time( X, Y ), number_of_routines
% 0.65/1.03 ( X, Y, low ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 substitution1:
% 0.65/1.03 X := skol1
% 0.65/1.03 Y := skol2
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 resolution: (30) {G1,W5,D2,L2,V0,M2} { ! first_mover( skol1 ), !
% 0.65/1.03 founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent0[1]: (29) {G1,W8,D2,L3,V0,M3} { ! first_mover( skol1 ), !
% 0.65/1.03 organisation_at_time( skol1, skol2 ), ! founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent1[0]: (3) {G0,W3,D2,L1,V0,M1} I { organisation_at_time( skol1, skol2
% 0.65/1.03 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 substitution1:
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (12) {G2,W5,D2,L2,V0,M1} R(2,9);r(3) { ! first_mover( skol1 )
% 0.65/1.03 , ! founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent0: (30) {G1,W5,D2,L2,V0,M2} { ! first_mover( skol1 ), !
% 0.65/1.03 founding_time( skol1, skol2 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 0
% 0.65/1.03 1 ==> 1
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 resolution: (31) {G1,W2,D2,L1,V0,M1} { ! first_mover( skol1 ) }.
% 0.65/1.03 parent0[1]: (12) {G2,W5,D2,L2,V0,M1} R(2,9);r(3) { ! first_mover( skol1 ),
% 0.65/1.03 ! founding_time( skol1, skol2 ) }.
% 0.65/1.03 parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { founding_time( skol1, skol2 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 substitution1:
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (13) {G3,W2,D2,L1,V0,M1} S(12);r(4) { ! first_mover( skol1 )
% 0.65/1.03 }.
% 0.65/1.03 parent0: (31) {G1,W2,D2,L1,V0,M1} { ! first_mover( skol1 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 0 ==> 0
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 resolution: (32) {G2,W2,D2,L1,V0,M1} { efficient_producer( skol1 ) }.
% 0.65/1.03 parent0[0]: (13) {G3,W2,D2,L1,V0,M1} S(12);r(4) { ! first_mover( skol1 )
% 0.65/1.03 }.
% 0.65/1.03 parent1[1]: (8) {G1,W4,D2,L2,V0,M1} R(7,3) { efficient_producer( skol1 ),
% 0.65/1.03 first_mover( skol1 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 substitution1:
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 resolution: (33) {G3,W0,D0,L0,V0,M0} { }.
% 0.65/1.03 parent0[0]: (11) {G2,W2,D2,L1,V0,M1} S(10);r(4) { ! efficient_producer(
% 0.65/1.03 skol1 ) }.
% 0.65/1.03 parent1[0]: (32) {G2,W2,D2,L1,V0,M1} { efficient_producer( skol1 ) }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 substitution1:
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 subsumption: (14) {G4,W0,D0,L0,V0,M0} R(13,8);r(11) { }.
% 0.65/1.03 parent0: (33) {G3,W0,D0,L0,V0,M0} { }.
% 0.65/1.03 substitution0:
% 0.65/1.03 end
% 0.65/1.03 permutation0:
% 0.65/1.03 end
% 0.65/1.03
% 0.65/1.03 Proof check complete!
% 0.65/1.03
% 0.65/1.03 Memory use:
% 0.65/1.03
% 0.65/1.03 space for terms: 265
% 0.65/1.03 space for clauses: 824
% 0.65/1.03
% 0.65/1.03
% 0.65/1.03 clauses generated: 15
% 0.65/1.03 clauses kept: 15
% 0.65/1.03 clauses selected: 12
% 0.65/1.03 clauses deleted: 2
% 0.65/1.03 clauses inuse deleted: 0
% 0.65/1.03
% 0.65/1.03 subsentry: 0
% 0.65/1.03 literals s-matched: 0
% 0.65/1.03 literals matched: 0
% 0.65/1.03 full subsumption: 0
% 0.65/1.03
% 0.65/1.03 checksum: -2013135752
% 0.65/1.03
% 0.65/1.03
% 0.65/1.03 Bliksem ended
%------------------------------------------------------------------------------