TSTP Solution File: MGT003+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:32 EDT 2022
% Result : Theorem 0.73s 1.12s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n023.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 09:50:22 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.73/1.12 *** allocated 10000 integers for termspace/termends
% 0.73/1.12 *** allocated 10000 integers for clauses
% 0.73/1.12 *** allocated 10000 integers for justifications
% 0.73/1.12 Bliksem 1.12
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Automatic Strategy Selection
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Clauses:
% 0.73/1.12
% 0.73/1.12 { ! reorganization_free( X, Y, Z ), reorganization_free( X, Y, Y ) }.
% 0.73/1.12 { ! reorganization_free( X, Y, Z ), reorganization_free( X, Z, Z ) }.
% 0.73/1.12 { ! organization( X, Y ), inertia( X, skol1( X, Y ), Y ) }.
% 0.73/1.12 { ! organization( Z, T ), ! organization( U, W ), ! reorganization_free( Z
% 0.73/1.12 , T, T ), ! reorganization_free( U, W, W ), ! inertia( Z, V0, T ), !
% 0.73/1.12 inertia( U, V1, W ), ! survival_chance( Z, X, T ), ! survival_chance( U,
% 0.73/1.12 Y, W ), ! greater( V1, V0 ), greater( Y, X ) }.
% 0.73/1.12 { ! organization( Z, T ), ! organization( Z, U ), ! reorganization_free( Z
% 0.73/1.12 , T, U ), ! inertia( Z, X, T ), ! inertia( Z, Y, U ), ! greater( U, T ),
% 0.73/1.12 greater( Y, X ) }.
% 0.73/1.12 { organization( skol4, skol5 ) }.
% 0.73/1.12 { organization( skol4, skol6 ) }.
% 0.73/1.12 { reorganization_free( skol4, skol5, skol6 ) }.
% 0.73/1.12 { survival_chance( skol4, skol2, skol5 ) }.
% 0.73/1.12 { survival_chance( skol4, skol3, skol6 ) }.
% 0.73/1.12 { greater( skol6, skol5 ) }.
% 0.73/1.12 { ! greater( skol3, skol2 ) }.
% 0.73/1.12
% 0.73/1.12 percentage equality = 0.000000, percentage horn = 1.000000
% 0.73/1.12 This is a near-Horn, non-equality problem
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Options Used:
% 0.73/1.12
% 0.73/1.12 useres = 1
% 0.73/1.12 useparamod = 0
% 0.73/1.12 useeqrefl = 0
% 0.73/1.12 useeqfact = 0
% 0.73/1.12 usefactor = 1
% 0.73/1.12 usesimpsplitting = 0
% 0.73/1.12 usesimpdemod = 0
% 0.73/1.12 usesimpres = 4
% 0.73/1.12
% 0.73/1.12 resimpinuse = 1000
% 0.73/1.12 resimpclauses = 20000
% 0.73/1.12 substype = standard
% 0.73/1.12 backwardsubs = 1
% 0.73/1.12 selectoldest = 5
% 0.73/1.12
% 0.73/1.12 litorderings [0] = split
% 0.73/1.12 litorderings [1] = liftord
% 0.73/1.12
% 0.73/1.12 termordering = none
% 0.73/1.12
% 0.73/1.12 litapriori = 1
% 0.73/1.12 termapriori = 0
% 0.73/1.12 litaposteriori = 0
% 0.73/1.12 termaposteriori = 0
% 0.73/1.12 demodaposteriori = 0
% 0.73/1.12 ordereqreflfact = 0
% 0.73/1.12
% 0.73/1.12 litselect = negative
% 0.73/1.12
% 0.73/1.12 maxweight = 30000
% 0.73/1.12 maxdepth = 30000
% 0.73/1.12 maxlength = 115
% 0.73/1.12 maxnrvars = 195
% 0.73/1.12 excuselevel = 0
% 0.73/1.12 increasemaxweight = 0
% 0.73/1.12
% 0.73/1.12 maxselected = 10000000
% 0.73/1.12 maxnrclauses = 10000000
% 0.73/1.12
% 0.73/1.12 showgenerated = 0
% 0.73/1.12 showkept = 0
% 0.73/1.12 showselected = 0
% 0.73/1.12 showdeleted = 0
% 0.73/1.12 showresimp = 1
% 0.73/1.12 showstatus = 2000
% 0.73/1.12
% 0.73/1.12 prologoutput = 0
% 0.73/1.12 nrgoals = 5000000
% 0.73/1.12 totalproof = 1
% 0.73/1.12
% 0.73/1.12 Symbols occurring in the translation:
% 0.73/1.12
% 0.73/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.12 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.73/1.12 ! [4, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.73/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.12 reorganization_free [38, 3] (w:1, o:53, a:1, s:1, b:0),
% 0.73/1.12 organization [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.73/1.12 inertia [42, 3] (w:1, o:54, a:1, s:1, b:0),
% 0.73/1.12 survival_chance [48, 3] (w:1, o:55, a:1, s:1, b:0),
% 0.73/1.12 greater [49, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.73/1.12 skol1 [50, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.73/1.12 skol2 [51, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.73/1.12 skol3 [52, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.73/1.12 skol4 [53, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.73/1.12 skol5 [54, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.73/1.12 skol6 [55, 0] (w:1, o:20, a:1, s:1, b:0).
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Starting Search:
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Bliksems!, er is een bewijs:
% 0.73/1.12 % SZS status Theorem
% 0.73/1.12 % SZS output start Refutation
% 0.73/1.12
% 0.73/1.12 (0) {G0,W9,D2,L2,V3,M1} I { reorganization_free( X, Y, Y ), !
% 0.73/1.12 reorganization_free( X, Y, Z ) }.
% 0.73/1.12 (1) {G0,W9,D2,L2,V3,M1} I { reorganization_free( X, Z, Z ), !
% 0.73/1.12 reorganization_free( X, Y, Z ) }.
% 0.73/1.12 (2) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), ! organization
% 0.73/1.12 ( X, Y ) }.
% 0.73/1.12 (3) {G0,W45,D2,L10,V8,M1} I { ! organization( Z, T ), ! organization( U, W
% 0.73/1.12 ), ! reorganization_free( Z, T, T ), ! survival_chance( Z, X, T ), !
% 0.73/1.12 inertia( Z, V0, T ), ! inertia( U, V1, W ), ! greater( V1, V0 ), greater
% 0.73/1.12 ( Y, X ), ! survival_chance( U, Y, W ), ! reorganization_free( U, W, W )
% 0.73/1.12 }.
% 0.73/1.12 (4) {G0,W30,D2,L7,V5,M1} I { ! organization( Z, T ), ! organization( Z, U )
% 0.73/1.12 , ! inertia( Z, X, T ), ! greater( U, T ), greater( Y, X ), ! inertia( Z
% 0.73/1.12 , Y, U ), ! reorganization_free( Z, T, U ) }.
% 0.73/1.12 (5) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.73/1.12 (6) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol6 ) }.
% 0.73/1.12 (7) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol4, skol5, skol6 ) }.
% 0.73/1.12 (8) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol4, skol2, skol5 ) }.
% 0.73/1.12 (9) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol4, skol3, skol6 ) }.
% 0.73/1.12 (10) {G0,W3,D2,L1,V0,M1} I { greater( skol6, skol5 ) }.
% 0.73/1.12 (11) {G0,W4,D2,L1,V0,M1} I { ! greater( skol3, skol2 ) }.
% 0.73/1.12 (18) {G1,W4,D2,L1,V0,M1} R(7,0) { reorganization_free( skol4, skol5, skol5
% 0.73/1.12 ) }.
% 0.73/1.12 (19) {G1,W4,D2,L1,V0,M1} R(1,7) { reorganization_free( skol4, skol6, skol6
% 0.73/1.12 ) }.
% 0.73/1.12 (20) {G1,W6,D3,L1,V0,M1} R(2,5) { inertia( skol4, skol1( skol4, skol5 ),
% 0.73/1.12 skol5 ) }.
% 0.73/1.12 (21) {G1,W6,D3,L1,V0,M1} R(2,6) { inertia( skol4, skol1( skol4, skol6 ),
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 (24) {G2,W36,D2,L8,V6,M1} R(3,19);r(6) { ! organization( X, Y ), !
% 0.73/1.12 survival_chance( X, Z, Y ), ! inertia( X, T, Y ), ! inertia( skol4, U,
% 0.73/1.12 skol6 ), ! greater( U, T ), greater( W, Z ), ! survival_chance( skol4, W
% 0.73/1.12 , skol6 ), ! reorganization_free( X, Y, Y ) }.
% 0.73/1.12 (36) {G1,W21,D2,L5,V2,M1} R(4,7);r(5) { ! inertia( skol4, Y, skol6 ), !
% 0.73/1.12 greater( skol6, skol5 ), greater( Y, X ), ! inertia( skol4, X, skol5 ), !
% 0.73/1.12 organization( skol4, skol6 ) }.
% 0.73/1.12 (49) {G2,W13,D2,L3,V2,M1} S(36);r(10);r(6) { greater( Y, X ), ! inertia(
% 0.73/1.12 skol4, X, skol5 ), ! inertia( skol4, Y, skol6 ) }.
% 0.73/1.12 (58) {G3,W27,D2,L6,V4,M1} R(24,18);r(5) { ! inertia( skol4, Y, skol5 ), !
% 0.73/1.12 survival_chance( skol4, T, skol6 ), ! greater( Z, Y ), greater( T, X ), !
% 0.73/1.12 survival_chance( skol4, X, skol5 ), ! inertia( skol4, Z, skol6 ) }.
% 0.73/1.12 (59) {G4,W23,D2,L5,V4,M1} S(58);r(49) { ! inertia( skol4, Y, skol5 ),
% 0.73/1.12 greater( T, X ), ! survival_chance( skol4, X, skol5 ), ! survival_chance
% 0.73/1.12 ( skol4, T, skol6 ), ! inertia( skol4, Z, skol6 ) }.
% 0.73/1.12 (60) {G5,W18,D2,L4,V3,M1} R(59,21) { greater( Y, Z ), ! survival_chance(
% 0.73/1.12 skol4, Y, skol6 ), ! survival_chance( skol4, Z, skol5 ), ! inertia( skol4
% 0.73/1.12 , X, skol5 ) }.
% 0.73/1.12 (61) {G6,W13,D2,L3,V2,M1} R(60,20) { greater( X, Y ), ! survival_chance(
% 0.73/1.12 skol4, X, skol6 ), ! survival_chance( skol4, Y, skol5 ) }.
% 0.73/1.12 (62) {G7,W8,D2,L2,V1,M1} R(61,8) { greater( X, skol2 ), ! survival_chance(
% 0.73/1.12 skol4, X, skol6 ) }.
% 0.73/1.12 (64) {G8,W0,D0,L0,V0,M0} R(62,9);r(11) { }.
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 % SZS output end Refutation
% 0.73/1.12 found a proof!
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Unprocessed initial clauses:
% 0.73/1.12
% 0.73/1.12 (66) {G0,W9,D2,L2,V3,M2} { ! reorganization_free( X, Y, Z ),
% 0.73/1.12 reorganization_free( X, Y, Y ) }.
% 0.73/1.12 (67) {G0,W9,D2,L2,V3,M2} { ! reorganization_free( X, Y, Z ),
% 0.73/1.12 reorganization_free( X, Z, Z ) }.
% 0.73/1.12 (68) {G0,W10,D3,L2,V2,M2} { ! organization( X, Y ), inertia( X, skol1( X,
% 0.73/1.12 Y ), Y ) }.
% 0.73/1.12 (69) {G0,W45,D2,L10,V8,M10} { ! organization( Z, T ), ! organization( U, W
% 0.73/1.12 ), ! reorganization_free( Z, T, T ), ! reorganization_free( U, W, W ), !
% 0.73/1.12 inertia( Z, V0, T ), ! inertia( U, V1, W ), ! survival_chance( Z, X, T )
% 0.73/1.12 , ! survival_chance( U, Y, W ), ! greater( V1, V0 ), greater( Y, X ) }.
% 0.73/1.12 (70) {G0,W30,D2,L7,V5,M7} { ! organization( Z, T ), ! organization( Z, U )
% 0.73/1.12 , ! reorganization_free( Z, T, U ), ! inertia( Z, X, T ), ! inertia( Z, Y
% 0.73/1.12 , U ), ! greater( U, T ), greater( Y, X ) }.
% 0.73/1.12 (71) {G0,W3,D2,L1,V0,M1} { organization( skol4, skol5 ) }.
% 0.73/1.12 (72) {G0,W3,D2,L1,V0,M1} { organization( skol4, skol6 ) }.
% 0.73/1.12 (73) {G0,W4,D2,L1,V0,M1} { reorganization_free( skol4, skol5, skol6 ) }.
% 0.73/1.12 (74) {G0,W4,D2,L1,V0,M1} { survival_chance( skol4, skol2, skol5 ) }.
% 0.73/1.12 (75) {G0,W4,D2,L1,V0,M1} { survival_chance( skol4, skol3, skol6 ) }.
% 0.73/1.12 (76) {G0,W3,D2,L1,V0,M1} { greater( skol6, skol5 ) }.
% 0.73/1.12 (77) {G0,W4,D2,L1,V0,M1} { ! greater( skol3, skol2 ) }.
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Total Proof:
% 0.73/1.12
% 0.73/1.12 subsumption: (0) {G0,W9,D2,L2,V3,M1} I { reorganization_free( X, Y, Y ), !
% 0.73/1.12 reorganization_free( X, Y, Z ) }.
% 0.73/1.12 parent0: (66) {G0,W9,D2,L2,V3,M2} { ! reorganization_free( X, Y, Z ),
% 0.73/1.12 reorganization_free( X, Y, Y ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 1
% 0.73/1.12 1 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (1) {G0,W9,D2,L2,V3,M1} I { reorganization_free( X, Z, Z ), !
% 0.73/1.12 reorganization_free( X, Y, Z ) }.
% 0.73/1.12 parent0: (67) {G0,W9,D2,L2,V3,M2} { ! reorganization_free( X, Y, Z ),
% 0.73/1.12 reorganization_free( X, Z, Z ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 1
% 0.73/1.12 1 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (2) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), !
% 0.73/1.12 organization( X, Y ) }.
% 0.73/1.12 parent0: (68) {G0,W10,D3,L2,V2,M2} { ! organization( X, Y ), inertia( X,
% 0.73/1.12 skol1( X, Y ), Y ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 1
% 0.73/1.12 1 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (3) {G0,W45,D2,L10,V8,M1} I { ! organization( Z, T ), !
% 0.73/1.12 organization( U, W ), ! reorganization_free( Z, T, T ), ! survival_chance
% 0.73/1.12 ( Z, X, T ), ! inertia( Z, V0, T ), ! inertia( U, V1, W ), ! greater( V1
% 0.73/1.12 , V0 ), greater( Y, X ), ! survival_chance( U, Y, W ), !
% 0.73/1.12 reorganization_free( U, W, W ) }.
% 0.73/1.12 parent0: (69) {G0,W45,D2,L10,V8,M10} { ! organization( Z, T ), !
% 0.73/1.12 organization( U, W ), ! reorganization_free( Z, T, T ), !
% 0.73/1.12 reorganization_free( U, W, W ), ! inertia( Z, V0, T ), ! inertia( U, V1,
% 0.73/1.12 W ), ! survival_chance( Z, X, T ), ! survival_chance( U, Y, W ), !
% 0.73/1.12 greater( V1, V0 ), greater( Y, X ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 T := T
% 0.73/1.12 U := U
% 0.73/1.12 W := W
% 0.73/1.12 V0 := V0
% 0.73/1.12 V1 := V1
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 1 ==> 1
% 0.73/1.12 2 ==> 2
% 0.73/1.12 3 ==> 9
% 0.73/1.12 4 ==> 4
% 0.73/1.12 5 ==> 5
% 0.73/1.12 6 ==> 3
% 0.73/1.12 7 ==> 8
% 0.73/1.12 8 ==> 6
% 0.73/1.12 9 ==> 7
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (4) {G0,W30,D2,L7,V5,M1} I { ! organization( Z, T ), !
% 0.73/1.12 organization( Z, U ), ! inertia( Z, X, T ), ! greater( U, T ), greater( Y
% 0.73/1.12 , X ), ! inertia( Z, Y, U ), ! reorganization_free( Z, T, U ) }.
% 0.73/1.12 parent0: (70) {G0,W30,D2,L7,V5,M7} { ! organization( Z, T ), !
% 0.73/1.12 organization( Z, U ), ! reorganization_free( Z, T, U ), ! inertia( Z, X,
% 0.73/1.12 T ), ! inertia( Z, Y, U ), ! greater( U, T ), greater( Y, X ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 T := T
% 0.73/1.12 U := U
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 1 ==> 1
% 0.73/1.12 2 ==> 6
% 0.73/1.12 3 ==> 2
% 0.73/1.12 4 ==> 5
% 0.73/1.12 5 ==> 3
% 0.73/1.12 6 ==> 4
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (5) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.73/1.12 parent0: (71) {G0,W3,D2,L1,V0,M1} { organization( skol4, skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (6) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol6 ) }.
% 0.73/1.12 parent0: (72) {G0,W3,D2,L1,V0,M1} { organization( skol4, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (7) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol4, skol5
% 0.73/1.12 , skol6 ) }.
% 0.73/1.12 parent0: (73) {G0,W4,D2,L1,V0,M1} { reorganization_free( skol4, skol5,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (8) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol4, skol2,
% 0.73/1.12 skol5 ) }.
% 0.73/1.12 parent0: (74) {G0,W4,D2,L1,V0,M1} { survival_chance( skol4, skol2, skol5 )
% 0.73/1.12 }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (9) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol4, skol3,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 parent0: (75) {G0,W4,D2,L1,V0,M1} { survival_chance( skol4, skol3, skol6 )
% 0.73/1.12 }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (10) {G0,W3,D2,L1,V0,M1} I { greater( skol6, skol5 ) }.
% 0.73/1.12 parent0: (76) {G0,W3,D2,L1,V0,M1} { greater( skol6, skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (11) {G0,W4,D2,L1,V0,M1} I { ! greater( skol3, skol2 ) }.
% 0.73/1.12 parent0: (77) {G0,W4,D2,L1,V0,M1} { ! greater( skol3, skol2 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (183) {G1,W4,D2,L1,V0,M1} { reorganization_free( skol4, skol5
% 0.73/1.12 , skol5 ) }.
% 0.73/1.12 parent0[1]: (0) {G0,W9,D2,L2,V3,M1} I { reorganization_free( X, Y, Y ), !
% 0.73/1.12 reorganization_free( X, Y, Z ) }.
% 0.73/1.12 parent1[0]: (7) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol4, skol5,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := skol4
% 0.73/1.12 Y := skol5
% 0.73/1.12 Z := skol6
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (18) {G1,W4,D2,L1,V0,M1} R(7,0) { reorganization_free( skol4,
% 0.73/1.12 skol5, skol5 ) }.
% 0.73/1.12 parent0: (183) {G1,W4,D2,L1,V0,M1} { reorganization_free( skol4, skol5,
% 0.73/1.12 skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (184) {G1,W4,D2,L1,V0,M1} { reorganization_free( skol4, skol6
% 0.73/1.12 , skol6 ) }.
% 0.73/1.12 parent0[1]: (1) {G0,W9,D2,L2,V3,M1} I { reorganization_free( X, Z, Z ), !
% 0.73/1.12 reorganization_free( X, Y, Z ) }.
% 0.73/1.12 parent1[0]: (7) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol4, skol5,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := skol4
% 0.73/1.12 Y := skol5
% 0.73/1.12 Z := skol6
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (19) {G1,W4,D2,L1,V0,M1} R(1,7) { reorganization_free( skol4,
% 0.73/1.12 skol6, skol6 ) }.
% 0.73/1.12 parent0: (184) {G1,W4,D2,L1,V0,M1} { reorganization_free( skol4, skol6,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (185) {G1,W6,D3,L1,V0,M1} { inertia( skol4, skol1( skol4,
% 0.73/1.12 skol5 ), skol5 ) }.
% 0.73/1.12 parent0[1]: (2) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), !
% 0.73/1.12 organization( X, Y ) }.
% 0.73/1.12 parent1[0]: (5) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := skol4
% 0.73/1.12 Y := skol5
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (20) {G1,W6,D3,L1,V0,M1} R(2,5) { inertia( skol4, skol1( skol4
% 0.73/1.12 , skol5 ), skol5 ) }.
% 0.73/1.12 parent0: (185) {G1,W6,D3,L1,V0,M1} { inertia( skol4, skol1( skol4, skol5 )
% 0.73/1.12 , skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (186) {G1,W6,D3,L1,V0,M1} { inertia( skol4, skol1( skol4,
% 0.73/1.12 skol6 ), skol6 ) }.
% 0.73/1.12 parent0[1]: (2) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), !
% 0.73/1.12 organization( X, Y ) }.
% 0.73/1.12 parent1[0]: (6) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := skol4
% 0.73/1.12 Y := skol6
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (21) {G1,W6,D3,L1,V0,M1} R(2,6) { inertia( skol4, skol1( skol4
% 0.73/1.12 , skol6 ), skol6 ) }.
% 0.73/1.12 parent0: (186) {G1,W6,D3,L1,V0,M1} { inertia( skol4, skol1( skol4, skol6 )
% 0.73/1.12 , skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (188) {G1,W40,D2,L9,V6,M9} { ! organization( X, Y ), !
% 0.73/1.12 organization( skol4, skol6 ), ! reorganization_free( X, Y, Y ), !
% 0.73/1.12 survival_chance( X, Z, Y ), ! inertia( X, T, Y ), ! inertia( skol4, U,
% 0.73/1.12 skol6 ), ! greater( U, T ), greater( W, Z ), ! survival_chance( skol4, W
% 0.73/1.12 , skol6 ) }.
% 0.73/1.12 parent0[9]: (3) {G0,W45,D2,L10,V8,M1} I { ! organization( Z, T ), !
% 0.73/1.12 organization( U, W ), ! reorganization_free( Z, T, T ), ! survival_chance
% 0.73/1.12 ( Z, X, T ), ! inertia( Z, V0, T ), ! inertia( U, V1, W ), ! greater( V1
% 0.73/1.12 , V0 ), greater( Y, X ), ! survival_chance( U, Y, W ), !
% 0.73/1.12 reorganization_free( U, W, W ) }.
% 0.73/1.12 parent1[0]: (19) {G1,W4,D2,L1,V0,M1} R(1,7) { reorganization_free( skol4,
% 0.73/1.12 skol6, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := Z
% 0.73/1.12 Y := W
% 0.73/1.12 Z := X
% 0.73/1.12 T := Y
% 0.73/1.12 U := skol4
% 0.73/1.12 W := skol6
% 0.73/1.12 V0 := T
% 0.73/1.12 V1 := U
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (214) {G1,W36,D2,L8,V6,M8} { ! organization( X, Y ), !
% 0.73/1.12 reorganization_free( X, Y, Y ), ! survival_chance( X, Z, Y ), ! inertia(
% 0.73/1.12 X, T, Y ), ! inertia( skol4, U, skol6 ), ! greater( U, T ), greater( W, Z
% 0.73/1.12 ), ! survival_chance( skol4, W, skol6 ) }.
% 0.73/1.12 parent0[1]: (188) {G1,W40,D2,L9,V6,M9} { ! organization( X, Y ), !
% 0.73/1.12 organization( skol4, skol6 ), ! reorganization_free( X, Y, Y ), !
% 0.73/1.12 survival_chance( X, Z, Y ), ! inertia( X, T, Y ), ! inertia( skol4, U,
% 0.73/1.12 skol6 ), ! greater( U, T ), greater( W, Z ), ! survival_chance( skol4, W
% 0.73/1.12 , skol6 ) }.
% 0.73/1.12 parent1[0]: (6) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 T := T
% 0.73/1.12 U := U
% 0.73/1.12 W := W
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (24) {G2,W36,D2,L8,V6,M1} R(3,19);r(6) { ! organization( X, Y
% 0.73/1.12 ), ! survival_chance( X, Z, Y ), ! inertia( X, T, Y ), ! inertia( skol4
% 0.73/1.12 , U, skol6 ), ! greater( U, T ), greater( W, Z ), ! survival_chance(
% 0.73/1.12 skol4, W, skol6 ), ! reorganization_free( X, Y, Y ) }.
% 0.73/1.12 parent0: (214) {G1,W36,D2,L8,V6,M8} { ! organization( X, Y ), !
% 0.73/1.12 reorganization_free( X, Y, Y ), ! survival_chance( X, Z, Y ), ! inertia(
% 0.73/1.12 X, T, Y ), ! inertia( skol4, U, skol6 ), ! greater( U, T ), greater( W, Z
% 0.73/1.12 ), ! survival_chance( skol4, W, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 T := T
% 0.73/1.12 U := U
% 0.73/1.12 W := W
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 1 ==> 7
% 0.73/1.12 2 ==> 1
% 0.73/1.12 3 ==> 2
% 0.73/1.12 4 ==> 3
% 0.73/1.12 5 ==> 4
% 0.73/1.12 6 ==> 5
% 0.73/1.12 7 ==> 6
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (218) {G1,W25,D2,L6,V2,M6} { ! organization( skol4, skol5 ), !
% 0.73/1.12 organization( skol4, skol6 ), ! inertia( skol4, X, skol5 ), ! greater(
% 0.73/1.12 skol6, skol5 ), greater( Y, X ), ! inertia( skol4, Y, skol6 ) }.
% 0.73/1.12 parent0[6]: (4) {G0,W30,D2,L7,V5,M1} I { ! organization( Z, T ), !
% 0.73/1.12 organization( Z, U ), ! inertia( Z, X, T ), ! greater( U, T ), greater( Y
% 0.73/1.12 , X ), ! inertia( Z, Y, U ), ! reorganization_free( Z, T, U ) }.
% 0.73/1.12 parent1[0]: (7) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol4, skol5,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := skol4
% 0.73/1.12 T := skol5
% 0.73/1.12 U := skol6
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (219) {G1,W21,D2,L5,V2,M5} { ! organization( skol4, skol6 ), !
% 0.73/1.12 inertia( skol4, X, skol5 ), ! greater( skol6, skol5 ), greater( Y, X ),
% 0.73/1.12 ! inertia( skol4, Y, skol6 ) }.
% 0.73/1.12 parent0[0]: (218) {G1,W25,D2,L6,V2,M6} { ! organization( skol4, skol5 ), !
% 0.73/1.12 organization( skol4, skol6 ), ! inertia( skol4, X, skol5 ), ! greater(
% 0.73/1.12 skol6, skol5 ), greater( Y, X ), ! inertia( skol4, Y, skol6 ) }.
% 0.73/1.12 parent1[0]: (5) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (36) {G1,W21,D2,L5,V2,M1} R(4,7);r(5) { ! inertia( skol4, Y,
% 0.73/1.12 skol6 ), ! greater( skol6, skol5 ), greater( Y, X ), ! inertia( skol4, X
% 0.73/1.12 , skol5 ), ! organization( skol4, skol6 ) }.
% 0.73/1.12 parent0: (219) {G1,W21,D2,L5,V2,M5} { ! organization( skol4, skol6 ), !
% 0.73/1.12 inertia( skol4, X, skol5 ), ! greater( skol6, skol5 ), greater( Y, X ), !
% 0.73/1.12 inertia( skol4, Y, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 4
% 0.73/1.12 1 ==> 3
% 0.73/1.12 2 ==> 1
% 0.73/1.12 3 ==> 2
% 0.73/1.12 4 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (220) {G1,W17,D2,L4,V2,M4} { ! inertia( skol4, X, skol6 ),
% 0.73/1.12 greater( X, Y ), ! inertia( skol4, Y, skol5 ), ! organization( skol4,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 parent0[1]: (36) {G1,W21,D2,L5,V2,M1} R(4,7);r(5) { ! inertia( skol4, Y,
% 0.73/1.12 skol6 ), ! greater( skol6, skol5 ), greater( Y, X ), ! inertia( skol4, X
% 0.73/1.12 , skol5 ), ! organization( skol4, skol6 ) }.
% 0.73/1.12 parent1[0]: (10) {G0,W3,D2,L1,V0,M1} I { greater( skol6, skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := Y
% 0.73/1.12 Y := X
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (221) {G1,W13,D2,L3,V2,M3} { ! inertia( skol4, X, skol6 ),
% 0.73/1.12 greater( X, Y ), ! inertia( skol4, Y, skol5 ) }.
% 0.73/1.12 parent0[3]: (220) {G1,W17,D2,L4,V2,M4} { ! inertia( skol4, X, skol6 ),
% 0.73/1.12 greater( X, Y ), ! inertia( skol4, Y, skol5 ), ! organization( skol4,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 parent1[0]: (6) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (49) {G2,W13,D2,L3,V2,M1} S(36);r(10);r(6) { greater( Y, X ),
% 0.73/1.12 ! inertia( skol4, X, skol5 ), ! inertia( skol4, Y, skol6 ) }.
% 0.73/1.12 parent0: (221) {G1,W13,D2,L3,V2,M3} { ! inertia( skol4, X, skol6 ),
% 0.73/1.12 greater( X, Y ), ! inertia( skol4, Y, skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := Y
% 0.73/1.12 Y := X
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 2
% 0.73/1.12 1 ==> 0
% 0.73/1.12 2 ==> 1
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (222) {G2,W31,D2,L7,V4,M7} { ! organization( skol4, skol5 ), !
% 0.73/1.12 survival_chance( skol4, X, skol5 ), ! inertia( skol4, Y, skol5 ), !
% 0.73/1.12 inertia( skol4, Z, skol6 ), ! greater( Z, Y ), greater( T, X ), !
% 0.73/1.12 survival_chance( skol4, T, skol6 ) }.
% 0.73/1.12 parent0[7]: (24) {G2,W36,D2,L8,V6,M1} R(3,19);r(6) { ! organization( X, Y )
% 0.73/1.12 , ! survival_chance( X, Z, Y ), ! inertia( X, T, Y ), ! inertia( skol4, U
% 0.73/1.12 , skol6 ), ! greater( U, T ), greater( W, Z ), ! survival_chance( skol4,
% 0.73/1.12 W, skol6 ), ! reorganization_free( X, Y, Y ) }.
% 0.73/1.12 parent1[0]: (18) {G1,W4,D2,L1,V0,M1} R(7,0) { reorganization_free( skol4,
% 0.73/1.12 skol5, skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := skol4
% 0.73/1.12 Y := skol5
% 0.73/1.12 Z := X
% 0.73/1.12 T := Y
% 0.73/1.12 U := Z
% 0.73/1.12 W := T
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (223) {G1,W27,D2,L6,V4,M6} { ! survival_chance( skol4, X,
% 0.73/1.12 skol5 ), ! inertia( skol4, Y, skol5 ), ! inertia( skol4, Z, skol6 ), !
% 0.73/1.12 greater( Z, Y ), greater( T, X ), ! survival_chance( skol4, T, skol6 )
% 0.73/1.12 }.
% 0.73/1.12 parent0[0]: (222) {G2,W31,D2,L7,V4,M7} { ! organization( skol4, skol5 ), !
% 0.73/1.12 survival_chance( skol4, X, skol5 ), ! inertia( skol4, Y, skol5 ), !
% 0.73/1.12 inertia( skol4, Z, skol6 ), ! greater( Z, Y ), greater( T, X ), !
% 0.73/1.12 survival_chance( skol4, T, skol6 ) }.
% 0.73/1.12 parent1[0]: (5) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 T := T
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (58) {G3,W27,D2,L6,V4,M1} R(24,18);r(5) { ! inertia( skol4, Y
% 0.73/1.12 , skol5 ), ! survival_chance( skol4, T, skol6 ), ! greater( Z, Y ),
% 0.73/1.12 greater( T, X ), ! survival_chance( skol4, X, skol5 ), ! inertia( skol4,
% 0.73/1.12 Z, skol6 ) }.
% 0.73/1.12 parent0: (223) {G1,W27,D2,L6,V4,M6} { ! survival_chance( skol4, X, skol5 )
% 0.73/1.12 , ! inertia( skol4, Y, skol5 ), ! inertia( skol4, Z, skol6 ), ! greater(
% 0.73/1.12 Z, Y ), greater( T, X ), ! survival_chance( skol4, T, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 T := T
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 4
% 0.73/1.12 1 ==> 0
% 0.73/1.12 2 ==> 5
% 0.73/1.12 3 ==> 2
% 0.73/1.12 4 ==> 3
% 0.73/1.12 5 ==> 1
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (224) {G3,W33,D2,L7,V4,M7} { ! inertia( skol4, X, skol5 ), !
% 0.73/1.12 survival_chance( skol4, Y, skol6 ), greater( Y, T ), ! survival_chance(
% 0.73/1.12 skol4, T, skol5 ), ! inertia( skol4, Z, skol6 ), ! inertia( skol4, X,
% 0.73/1.12 skol5 ), ! inertia( skol4, Z, skol6 ) }.
% 0.73/1.12 parent0[2]: (58) {G3,W27,D2,L6,V4,M1} R(24,18);r(5) { ! inertia( skol4, Y,
% 0.73/1.12 skol5 ), ! survival_chance( skol4, T, skol6 ), ! greater( Z, Y ), greater
% 0.73/1.12 ( T, X ), ! survival_chance( skol4, X, skol5 ), ! inertia( skol4, Z,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 parent1[0]: (49) {G2,W13,D2,L3,V2,M1} S(36);r(10);r(6) { greater( Y, X ), !
% 0.73/1.12 inertia( skol4, X, skol5 ), ! inertia( skol4, Y, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := T
% 0.73/1.12 Y := X
% 0.73/1.12 Z := Z
% 0.73/1.12 T := Y
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Z
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 factor: (225) {G3,W28,D2,L6,V4,M6} { ! inertia( skol4, X, skol5 ), !
% 0.73/1.12 survival_chance( skol4, Y, skol6 ), greater( Y, Z ), ! survival_chance(
% 0.73/1.12 skol4, Z, skol5 ), ! inertia( skol4, T, skol6 ), ! inertia( skol4, T,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 parent0[0, 5]: (224) {G3,W33,D2,L7,V4,M7} { ! inertia( skol4, X, skol5 ),
% 0.73/1.12 ! survival_chance( skol4, Y, skol6 ), greater( Y, T ), ! survival_chance
% 0.73/1.12 ( skol4, T, skol5 ), ! inertia( skol4, Z, skol6 ), ! inertia( skol4, X,
% 0.73/1.12 skol5 ), ! inertia( skol4, Z, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := T
% 0.73/1.12 T := Z
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 factor: (226) {G3,W23,D2,L5,V4,M5} { ! inertia( skol4, X, skol5 ), !
% 0.73/1.12 survival_chance( skol4, Y, skol6 ), greater( Y, Z ), ! survival_chance(
% 0.73/1.12 skol4, Z, skol5 ), ! inertia( skol4, T, skol6 ) }.
% 0.73/1.12 parent0[4, 5]: (225) {G3,W28,D2,L6,V4,M6} { ! inertia( skol4, X, skol5 ),
% 0.73/1.12 ! survival_chance( skol4, Y, skol6 ), greater( Y, Z ), ! survival_chance
% 0.73/1.12 ( skol4, Z, skol5 ), ! inertia( skol4, T, skol6 ), ! inertia( skol4, T,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 T := T
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (59) {G4,W23,D2,L5,V4,M1} S(58);r(49) { ! inertia( skol4, Y,
% 0.73/1.12 skol5 ), greater( T, X ), ! survival_chance( skol4, X, skol5 ), !
% 0.73/1.12 survival_chance( skol4, T, skol6 ), ! inertia( skol4, Z, skol6 ) }.
% 0.73/1.12 parent0: (226) {G3,W23,D2,L5,V4,M5} { ! inertia( skol4, X, skol5 ), !
% 0.73/1.12 survival_chance( skol4, Y, skol6 ), greater( Y, Z ), ! survival_chance(
% 0.73/1.12 skol4, Z, skol5 ), ! inertia( skol4, T, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := Y
% 0.73/1.12 Y := T
% 0.73/1.12 Z := X
% 0.73/1.12 T := Z
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 1 ==> 3
% 0.73/1.12 2 ==> 1
% 0.73/1.12 3 ==> 2
% 0.73/1.12 4 ==> 4
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (227) {G2,W18,D2,L4,V3,M4} { ! inertia( skol4, X, skol5 ),
% 0.73/1.12 greater( Y, Z ), ! survival_chance( skol4, Z, skol5 ), ! survival_chance
% 0.73/1.12 ( skol4, Y, skol6 ) }.
% 0.73/1.12 parent0[4]: (59) {G4,W23,D2,L5,V4,M1} S(58);r(49) { ! inertia( skol4, Y,
% 0.73/1.12 skol5 ), greater( T, X ), ! survival_chance( skol4, X, skol5 ), !
% 0.73/1.12 survival_chance( skol4, T, skol6 ), ! inertia( skol4, Z, skol6 ) }.
% 0.73/1.12 parent1[0]: (21) {G1,W6,D3,L1,V0,M1} R(2,6) { inertia( skol4, skol1( skol4
% 0.73/1.12 , skol6 ), skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := Z
% 0.73/1.12 Y := X
% 0.73/1.12 Z := skol1( skol4, skol6 )
% 0.73/1.12 T := Y
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (60) {G5,W18,D2,L4,V3,M1} R(59,21) { greater( Y, Z ), !
% 0.73/1.12 survival_chance( skol4, Y, skol6 ), ! survival_chance( skol4, Z, skol5 )
% 0.73/1.12 , ! inertia( skol4, X, skol5 ) }.
% 0.73/1.12 parent0: (227) {G2,W18,D2,L4,V3,M4} { ! inertia( skol4, X, skol5 ),
% 0.73/1.12 greater( Y, Z ), ! survival_chance( skol4, Z, skol5 ), ! survival_chance
% 0.73/1.12 ( skol4, Y, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 3
% 0.73/1.12 1 ==> 0
% 0.73/1.12 2 ==> 2
% 0.73/1.12 3 ==> 1
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (228) {G2,W13,D2,L3,V2,M3} { greater( X, Y ), !
% 0.73/1.12 survival_chance( skol4, X, skol6 ), ! survival_chance( skol4, Y, skol5 )
% 0.73/1.12 }.
% 0.73/1.12 parent0[3]: (60) {G5,W18,D2,L4,V3,M1} R(59,21) { greater( Y, Z ), !
% 0.73/1.12 survival_chance( skol4, Y, skol6 ), ! survival_chance( skol4, Z, skol5 )
% 0.73/1.12 , ! inertia( skol4, X, skol5 ) }.
% 0.73/1.12 parent1[0]: (20) {G1,W6,D3,L1,V0,M1} R(2,5) { inertia( skol4, skol1( skol4
% 0.73/1.12 , skol5 ), skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := skol1( skol4, skol5 )
% 0.73/1.12 Y := X
% 0.73/1.12 Z := Y
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (61) {G6,W13,D2,L3,V2,M1} R(60,20) { greater( X, Y ), !
% 0.73/1.12 survival_chance( skol4, X, skol6 ), ! survival_chance( skol4, Y, skol5 )
% 0.73/1.12 }.
% 0.73/1.12 parent0: (228) {G2,W13,D2,L3,V2,M3} { greater( X, Y ), ! survival_chance(
% 0.73/1.12 skol4, X, skol6 ), ! survival_chance( skol4, Y, skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 1 ==> 1
% 0.73/1.12 2 ==> 2
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (229) {G1,W8,D2,L2,V1,M2} { greater( X, skol2 ), !
% 0.73/1.12 survival_chance( skol4, X, skol6 ) }.
% 0.73/1.12 parent0[2]: (61) {G6,W13,D2,L3,V2,M1} R(60,20) { greater( X, Y ), !
% 0.73/1.12 survival_chance( skol4, X, skol6 ), ! survival_chance( skol4, Y, skol5 )
% 0.73/1.12 }.
% 0.73/1.12 parent1[0]: (8) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol4, skol2,
% 0.73/1.12 skol5 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := skol2
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (62) {G7,W8,D2,L2,V1,M1} R(61,8) { greater( X, skol2 ), !
% 0.73/1.12 survival_chance( skol4, X, skol6 ) }.
% 0.73/1.12 parent0: (229) {G1,W8,D2,L2,V1,M2} { greater( X, skol2 ), !
% 0.73/1.12 survival_chance( skol4, X, skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 1 ==> 1
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (230) {G1,W3,D2,L1,V0,M1} { greater( skol3, skol2 ) }.
% 0.73/1.12 parent0[1]: (62) {G7,W8,D2,L2,V1,M1} R(61,8) { greater( X, skol2 ), !
% 0.73/1.12 survival_chance( skol4, X, skol6 ) }.
% 0.73/1.12 parent1[0]: (9) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol4, skol3,
% 0.73/1.12 skol6 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := skol3
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (231) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.12 parent0[0]: (11) {G0,W4,D2,L1,V0,M1} I { ! greater( skol3, skol2 ) }.
% 0.73/1.12 parent1[0]: (230) {G1,W3,D2,L1,V0,M1} { greater( skol3, skol2 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (64) {G8,W0,D0,L0,V0,M0} R(62,9);r(11) { }.
% 0.73/1.12 parent0: (231) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 Proof check complete!
% 0.73/1.12
% 0.73/1.12 Memory use:
% 0.73/1.12
% 0.73/1.12 space for terms: 1480
% 0.73/1.12 space for clauses: 3048
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 clauses generated: 100
% 0.73/1.12 clauses kept: 65
% 0.73/1.12 clauses selected: 55
% 0.73/1.12 clauses deleted: 2
% 0.73/1.12 clauses inuse deleted: 0
% 0.73/1.12
% 0.73/1.12 subsentry: 536
% 0.73/1.12 literals s-matched: 373
% 0.73/1.12 literals matched: 200
% 0.73/1.12 full subsumption: 108
% 0.73/1.12
% 0.73/1.12 checksum: -337285612
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Bliksem ended
%------------------------------------------------------------------------------