TSTP Solution File: MGT008+1 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : MGT008+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n019.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:34 EDT 2022

% Result   : Theorem 0.43s 1.07s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : MGT008+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12  % Command  : bliksem %s
% 0.13/0.33  % Computer : n019.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:24:55 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.43/1.07  *** allocated 10000 integers for termspace/termends
% 0.43/1.07  *** allocated 10000 integers for clauses
% 0.43/1.07  *** allocated 10000 integers for justifications
% 0.43/1.07  Bliksem 1.12
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  Automatic Strategy Selection
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  Clauses:
% 0.43/1.07  
% 0.43/1.07  { ! organization( X, Y ), inertia( X, skol1( X, Y ), Y ) }.
% 0.43/1.07  { ! organization( Z, T ), ! organization( U, W ), ! class( Z, V0, T ), ! 
% 0.43/1.07    class( U, V0, W ), ! size( Z, V1, T ), ! size( U, V2, W ), ! inertia( Z, 
% 0.43/1.07    X, T ), ! inertia( U, Y, W ), ! greater( V2, V1 ), greater( Y, X ) }.
% 0.43/1.07  { ! organization( Z, T ), ! organization( U, W ), ! reorganization_free( Z
% 0.43/1.07    , T, T ), ! reorganization_free( U, W, W ), ! inertia( Z, V0, T ), ! 
% 0.43/1.07    inertia( U, V1, W ), ! survival_chance( Z, X, T ), ! survival_chance( U, 
% 0.43/1.07    Y, W ), ! greater( V1, V0 ), greater( Y, X ) }.
% 0.43/1.07  { organization( skol4, skol5 ) }.
% 0.43/1.07  { organization( skol6, skol7 ) }.
% 0.43/1.07  { reorganization_free( skol4, skol5, skol5 ) }.
% 0.43/1.07  { reorganization_free( skol6, skol7, skol7 ) }.
% 0.43/1.07  { class( skol4, skol8, skol5 ) }.
% 0.43/1.07  { class( skol6, skol8, skol7 ) }.
% 0.43/1.07  { survival_chance( skol4, skol2, skol5 ) }.
% 0.43/1.07  { survival_chance( skol6, skol3, skol7 ) }.
% 0.43/1.07  { size( skol4, skol9, skol5 ) }.
% 0.43/1.07  { size( skol6, skol10, skol7 ) }.
% 0.43/1.07  { greater( skol10, skol9 ) }.
% 0.43/1.07  { ! greater( skol3, skol2 ) }.
% 0.43/1.07  
% 0.43/1.07  percentage equality = 0.000000, percentage horn = 1.000000
% 0.43/1.07  This is a near-Horn, non-equality  problem
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  Options Used:
% 0.43/1.07  
% 0.43/1.07  useres =            1
% 0.43/1.07  useparamod =        0
% 0.43/1.07  useeqrefl =         0
% 0.43/1.07  useeqfact =         0
% 0.43/1.07  usefactor =         1
% 0.43/1.07  usesimpsplitting =  0
% 0.43/1.07  usesimpdemod =      0
% 0.43/1.07  usesimpres =        4
% 0.43/1.07  
% 0.43/1.07  resimpinuse      =  1000
% 0.43/1.07  resimpclauses =     20000
% 0.43/1.07  substype =          standard
% 0.43/1.07  backwardsubs =      1
% 0.43/1.07  selectoldest =      5
% 0.43/1.07  
% 0.43/1.07  litorderings [0] =  split
% 0.43/1.07  litorderings [1] =  liftord
% 0.43/1.07  
% 0.43/1.07  termordering =      none
% 0.43/1.07  
% 0.43/1.07  litapriori =        1
% 0.43/1.07  termapriori =       0
% 0.43/1.07  litaposteriori =    0
% 0.43/1.07  termaposteriori =   0
% 0.43/1.07  demodaposteriori =  0
% 0.43/1.07  ordereqreflfact =   0
% 0.43/1.07  
% 0.43/1.07  litselect =         negative
% 0.43/1.07  
% 0.43/1.07  maxweight =         30000
% 0.43/1.07  maxdepth =          30000
% 0.43/1.07  maxlength =         115
% 0.43/1.07  maxnrvars =         195
% 0.43/1.07  excuselevel =       0
% 0.43/1.07  increasemaxweight = 0
% 0.43/1.07  
% 0.43/1.07  maxselected =       10000000
% 0.43/1.07  maxnrclauses =      10000000
% 0.43/1.07  
% 0.43/1.07  showgenerated =    0
% 0.43/1.07  showkept =         0
% 0.43/1.07  showselected =     0
% 0.43/1.07  showdeleted =      0
% 0.43/1.07  showresimp =       1
% 0.43/1.07  showstatus =       2000
% 0.43/1.07  
% 0.43/1.07  prologoutput =     0
% 0.43/1.07  nrgoals =          5000000
% 0.43/1.07  totalproof =       1
% 0.43/1.07  
% 0.43/1.07  Symbols occurring in the translation:
% 0.43/1.07  
% 0.43/1.07  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.43/1.07  .  [1, 2]      (w:1, o:33, a:1, s:1, b:0), 
% 0.43/1.07  !  [4, 1]      (w:1, o:28, a:1, s:1, b:0), 
% 0.43/1.07  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.43/1.07  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.43/1.07  organization  [37, 2]      (w:1, o:57, a:1, s:1, b:0), 
% 0.43/1.07  inertia  [39, 3]      (w:1, o:60, a:1, s:1, b:0), 
% 0.43/1.07  class  [48, 3]      (w:1, o:61, a:1, s:1, b:0), 
% 0.43/1.07  size  [49, 3]      (w:1, o:63, a:1, s:1, b:0), 
% 0.43/1.07  greater  [50, 2]      (w:1, o:58, a:1, s:1, b:0), 
% 0.43/1.07  reorganization_free  [53, 3]      (w:1, o:62, a:1, s:1, b:0), 
% 0.43/1.07  survival_chance  [54, 3]      (w:1, o:64, a:1, s:1, b:0), 
% 0.43/1.07  skol1  [55, 2]      (w:1, o:59, a:1, s:1, b:0), 
% 0.43/1.07  skol2  [56, 0]      (w:1, o:20, a:1, s:1, b:0), 
% 0.43/1.07  skol3  [57, 0]      (w:1, o:21, a:1, s:1, b:0), 
% 0.43/1.07  skol4  [58, 0]      (w:1, o:22, a:1, s:1, b:0), 
% 0.43/1.07  skol5  [59, 0]      (w:1, o:23, a:1, s:1, b:0), 
% 0.43/1.07  skol6  [60, 0]      (w:1, o:24, a:1, s:1, b:0), 
% 0.43/1.07  skol7  [61, 0]      (w:1, o:25, a:1, s:1, b:0), 
% 0.43/1.07  skol8  [62, 0]      (w:1, o:26, a:1, s:1, b:0), 
% 0.43/1.07  skol9  [63, 0]      (w:1, o:27, a:1, s:1, b:0), 
% 0.43/1.07  skol10  [64, 0]      (w:1, o:19, a:1, s:1, b:0).
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  Starting Search:
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  Bliksems!, er is een bewijs:
% 0.43/1.07  % SZS status Theorem
% 0.43/1.07  % SZS output start Refutation
% 0.43/1.07  
% 0.43/1.07  (0) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), ! organization
% 0.43/1.07    ( X, Y ) }.
% 0.43/1.07  (1) {G0,W45,D2,L10,V9,M1} I { ! organization( Z, T ), ! size( Z, V1, T ), !
% 0.43/1.07     class( Z, V0, T ), ! class( U, V0, W ), ! inertia( Z, X, T ), ! inertia
% 0.43/1.07    ( U, Y, W ), ! greater( V2, V1 ), greater( Y, X ), ! size( U, V2, W ), ! 
% 0.43/1.07    organization( U, W ) }.
% 0.43/1.07  (2) {G0,W45,D2,L10,V8,M1} I { ! organization( Z, T ), ! survival_chance( Z
% 0.43/1.07    , X, T ), ! inertia( Z, V0, T ), ! inertia( U, V1, W ), ! 
% 0.43/1.07    reorganization_free( Z, T, T ), ! reorganization_free( U, W, W ), ! 
% 0.43/1.07    greater( V1, V0 ), greater( Y, X ), ! survival_chance( U, Y, W ), ! 
% 0.43/1.07    organization( U, W ) }.
% 0.43/1.07  (3) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.43/1.07  (4) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol7 ) }.
% 0.43/1.07  (5) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol4, skol5, skol5 ) }.
% 0.43/1.07  (6) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol6, skol7, skol7 ) }.
% 0.43/1.07  (7) {G0,W4,D2,L1,V0,M1} I { class( skol4, skol8, skol5 ) }.
% 0.43/1.07  (8) {G0,W4,D2,L1,V0,M1} I { class( skol6, skol8, skol7 ) }.
% 0.43/1.07  (9) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol4, skol2, skol5 ) }.
% 0.43/1.07  (10) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol6, skol3, skol7 ) }.
% 0.43/1.07  (11) {G0,W4,D2,L1,V0,M1} I { size( skol4, skol9, skol5 ) }.
% 0.43/1.07  (12) {G0,W4,D2,L1,V0,M1} I { size( skol6, skol10, skol7 ) }.
% 0.43/1.07  (13) {G0,W3,D2,L1,V0,M1} I { greater( skol10, skol9 ) }.
% 0.43/1.07  (14) {G0,W4,D2,L1,V0,M1} I { ! greater( skol3, skol2 ) }.
% 0.43/1.07  (23) {G1,W6,D3,L1,V0,M1} R(0,3) { inertia( skol4, skol1( skol4, skol5 ), 
% 0.43/1.07    skol5 ) }.
% 0.43/1.07  (24) {G1,W6,D3,L1,V0,M1} R(0,4) { inertia( skol6, skol1( skol6, skol7 ), 
% 0.43/1.07    skol7 ) }.
% 0.43/1.07  (26) {G1,W41,D2,L9,V7,M1} R(1,4) { ! size( X, Z, Y ), ! class( X, T, Y ), !
% 0.43/1.07     class( skol6, T, skol7 ), ! inertia( X, U, Y ), ! inertia( skol6, W, 
% 0.43/1.07    skol7 ), ! greater( V0, Z ), greater( W, U ), ! size( skol6, V0, skol7 )
% 0.43/1.07    , ! organization( X, Y ) }.
% 0.43/1.07  (36) {G1,W36,D2,L8,V6,M1} R(2,4);r(6) { ! survival_chance( X, Z, Y ), ! 
% 0.43/1.07    inertia( X, T, Y ), ! inertia( skol6, U, skol7 ), ! reorganization_free( 
% 0.43/1.07    X, Y, Y ), ! greater( U, T ), greater( W, Z ), ! survival_chance( skol6, 
% 0.43/1.07    W, skol7 ), ! organization( X, Y ) }.
% 0.43/1.07  (65) {G2,W37,D2,L8,V5,M1} R(26,3) { ! class( skol4, Y, skol5 ), ! class( 
% 0.43/1.07    skol6, Y, skol7 ), ! size( skol6, U, skol7 ), ! inertia( skol6, T, skol7
% 0.43/1.07     ), ! greater( U, X ), greater( T, Z ), ! size( skol4, X, skol5 ), ! 
% 0.43/1.07    inertia( skol4, Z, skol5 ) }.
% 0.43/1.07  (78) {G2,W27,D2,L6,V4,M1} R(36,3);r(5) { ! survival_chance( skol6, T, skol7
% 0.43/1.07     ), ! inertia( skol6, Z, skol7 ), ! greater( Z, Y ), greater( T, X ), ! 
% 0.43/1.07    survival_chance( skol4, X, skol5 ), ! inertia( skol4, Y, skol5 ) }.
% 0.43/1.07  (79) {G3,W24,D3,L5,V3,M1} R(78,23) { ! survival_chance( skol6, X, skol7 ), 
% 0.43/1.07    ! greater( Y, skol1( skol4, skol5 ) ), greater( X, Z ), ! survival_chance
% 0.43/1.07    ( skol4, Z, skol5 ), ! inertia( skol6, Y, skol7 ) }.
% 0.43/1.07  (80) {G4,W21,D3,L4,V2,M1} R(79,24) { ! survival_chance( skol6, X, skol7 ), 
% 0.43/1.07    greater( X, Y ), ! survival_chance( skol4, Y, skol5 ), ! greater( skol1( 
% 0.43/1.07    skol6, skol7 ), skol1( skol4, skol5 ) ) }.
% 0.43/1.07  (81) {G3,W34,D3,L7,V4,M1} R(65,23) { ! class( skol4, X, skol5 ), ! class( 
% 0.43/1.07    skol6, X, skol7 ), ! size( skol6, Y, skol7 ), ! greater( Y, T ), greater
% 0.43/1.07    ( Z, skol1( skol4, skol5 ) ), ! size( skol4, T, skol5 ), ! inertia( skol6
% 0.43/1.07    , Z, skol7 ) }.
% 0.43/1.07  (87) {G4,W31,D3,L6,V3,M1} R(81,24) { ! size( skol6, Y, skol7 ), ! class( 
% 0.43/1.07    skol6, X, skol7 ), ! greater( Y, Z ), greater( skol1( skol6, skol7 ), 
% 0.43/1.07    skol1( skol4, skol5 ) ), ! size( skol4, Z, skol5 ), ! class( skol4, X, 
% 0.43/1.07    skol5 ) }.
% 0.43/1.07  (88) {G5,W21,D3,L4,V2,M1} R(87,7);r(8) { ! greater( X, Y ), greater( skol1
% 0.43/1.07    ( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size( skol6, X, skol7 ), ! 
% 0.43/1.07    size( skol4, Y, skol5 ) }.
% 0.43/1.07  (89) {G6,W16,D3,L3,V1,M1} R(88,11) { ! greater( X, skol9 ), greater( skol1
% 0.43/1.07    ( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size( skol6, X, skol7 ) }.
% 0.43/1.07  (90) {G7,W7,D3,L1,V0,M1} R(89,12);r(13) { greater( skol1( skol6, skol7 ), 
% 0.43/1.07    skol1( skol4, skol5 ) ) }.
% 0.43/1.07  (91) {G8,W13,D2,L3,V2,M1} R(90,80) { greater( X, Y ), ! survival_chance( 
% 0.43/1.07    skol6, X, skol7 ), ! survival_chance( skol4, Y, skol5 ) }.
% 0.43/1.07  (92) {G9,W8,D2,L2,V1,M1} R(91,9) { greater( X, skol2 ), ! survival_chance( 
% 0.43/1.07    skol6, X, skol7 ) }.
% 0.43/1.07  (93) {G10,W0,D0,L0,V0,M0} R(92,10);r(14) {  }.
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  % SZS output end Refutation
% 0.43/1.07  found a proof!
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  Unprocessed initial clauses:
% 0.43/1.07  
% 0.43/1.07  (95) {G0,W10,D3,L2,V2,M2}  { ! organization( X, Y ), inertia( X, skol1( X, 
% 0.43/1.07    Y ), Y ) }.
% 0.43/1.07  (96) {G0,W45,D2,L10,V9,M10}  { ! organization( Z, T ), ! organization( U, W
% 0.43/1.07     ), ! class( Z, V0, T ), ! class( U, V0, W ), ! size( Z, V1, T ), ! size
% 0.43/1.07    ( U, V2, W ), ! inertia( Z, X, T ), ! inertia( U, Y, W ), ! greater( V2, 
% 0.43/1.07    V1 ), greater( Y, X ) }.
% 0.43/1.07  (97) {G0,W45,D2,L10,V8,M10}  { ! organization( Z, T ), ! organization( U, W
% 0.43/1.07     ), ! reorganization_free( Z, T, T ), ! reorganization_free( U, W, W ), !
% 0.43/1.07     inertia( Z, V0, T ), ! inertia( U, V1, W ), ! survival_chance( Z, X, T )
% 0.43/1.07    , ! survival_chance( U, Y, W ), ! greater( V1, V0 ), greater( Y, X ) }.
% 0.43/1.07  (98) {G0,W3,D2,L1,V0,M1}  { organization( skol4, skol5 ) }.
% 0.43/1.07  (99) {G0,W3,D2,L1,V0,M1}  { organization( skol6, skol7 ) }.
% 0.43/1.07  (100) {G0,W4,D2,L1,V0,M1}  { reorganization_free( skol4, skol5, skol5 ) }.
% 0.43/1.07  (101) {G0,W4,D2,L1,V0,M1}  { reorganization_free( skol6, skol7, skol7 ) }.
% 0.43/1.07  (102) {G0,W4,D2,L1,V0,M1}  { class( skol4, skol8, skol5 ) }.
% 0.43/1.07  (103) {G0,W4,D2,L1,V0,M1}  { class( skol6, skol8, skol7 ) }.
% 0.43/1.07  (104) {G0,W4,D2,L1,V0,M1}  { survival_chance( skol4, skol2, skol5 ) }.
% 0.43/1.07  (105) {G0,W4,D2,L1,V0,M1}  { survival_chance( skol6, skol3, skol7 ) }.
% 0.43/1.07  (106) {G0,W4,D2,L1,V0,M1}  { size( skol4, skol9, skol5 ) }.
% 0.43/1.07  (107) {G0,W4,D2,L1,V0,M1}  { size( skol6, skol10, skol7 ) }.
% 0.43/1.07  (108) {G0,W3,D2,L1,V0,M1}  { greater( skol10, skol9 ) }.
% 0.43/1.07  (109) {G0,W4,D2,L1,V0,M1}  { ! greater( skol3, skol2 ) }.
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  Total Proof:
% 0.43/1.07  
% 0.43/1.07  subsumption: (0) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), !
% 0.43/1.07     organization( X, Y ) }.
% 0.43/1.07  parent0: (95) {G0,W10,D3,L2,V2,M2}  { ! organization( X, Y ), inertia( X, 
% 0.43/1.07    skol1( X, Y ), Y ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 1
% 0.43/1.07     1 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (1) {G0,W45,D2,L10,V9,M1} I { ! organization( Z, T ), ! size( 
% 0.43/1.07    Z, V1, T ), ! class( Z, V0, T ), ! class( U, V0, W ), ! inertia( Z, X, T
% 0.43/1.07     ), ! inertia( U, Y, W ), ! greater( V2, V1 ), greater( Y, X ), ! size( U
% 0.43/1.07    , V2, W ), ! organization( U, W ) }.
% 0.43/1.07  parent0: (96) {G0,W45,D2,L10,V9,M10}  { ! organization( Z, T ), ! 
% 0.43/1.07    organization( U, W ), ! class( Z, V0, T ), ! class( U, V0, W ), ! size( Z
% 0.43/1.07    , V1, T ), ! size( U, V2, W ), ! inertia( Z, X, T ), ! inertia( U, Y, W )
% 0.43/1.07    , ! greater( V2, V1 ), greater( Y, X ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07     T := T
% 0.43/1.07     U := U
% 0.43/1.07     W := W
% 0.43/1.07     V0 := V0
% 0.43/1.07     V1 := V1
% 0.43/1.07     V2 := V2
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07     1 ==> 9
% 0.43/1.07     2 ==> 2
% 0.43/1.07     3 ==> 3
% 0.43/1.07     4 ==> 1
% 0.43/1.07     5 ==> 8
% 0.43/1.07     6 ==> 4
% 0.43/1.07     7 ==> 5
% 0.43/1.07     8 ==> 6
% 0.43/1.07     9 ==> 7
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (2) {G0,W45,D2,L10,V8,M1} I { ! organization( Z, T ), ! 
% 0.43/1.07    survival_chance( Z, X, T ), ! inertia( Z, V0, T ), ! inertia( U, V1, W )
% 0.43/1.07    , ! reorganization_free( Z, T, T ), ! reorganization_free( U, W, W ), ! 
% 0.43/1.07    greater( V1, V0 ), greater( Y, X ), ! survival_chance( U, Y, W ), ! 
% 0.43/1.07    organization( U, W ) }.
% 0.43/1.07  parent0: (97) {G0,W45,D2,L10,V8,M10}  { ! organization( Z, T ), ! 
% 0.43/1.07    organization( U, W ), ! reorganization_free( Z, T, T ), ! 
% 0.43/1.07    reorganization_free( U, W, W ), ! inertia( Z, V0, T ), ! inertia( U, V1, 
% 0.43/1.07    W ), ! survival_chance( Z, X, T ), ! survival_chance( U, Y, W ), ! 
% 0.43/1.07    greater( V1, V0 ), greater( Y, X ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07     T := T
% 0.43/1.07     U := U
% 0.43/1.07     W := W
% 0.43/1.07     V0 := V0
% 0.43/1.07     V1 := V1
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07     1 ==> 9
% 0.43/1.07     2 ==> 4
% 0.43/1.07     3 ==> 5
% 0.43/1.07     4 ==> 2
% 0.43/1.07     5 ==> 3
% 0.43/1.07     6 ==> 1
% 0.43/1.07     7 ==> 8
% 0.43/1.07     8 ==> 6
% 0.43/1.07     9 ==> 7
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (3) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.43/1.07  parent0: (98) {G0,W3,D2,L1,V0,M1}  { organization( skol4, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (4) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol7 ) }.
% 0.43/1.07  parent0: (99) {G0,W3,D2,L1,V0,M1}  { organization( skol6, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (5) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol4, skol5
% 0.43/1.07    , skol5 ) }.
% 0.43/1.07  parent0: (100) {G0,W4,D2,L1,V0,M1}  { reorganization_free( skol4, skol5, 
% 0.43/1.07    skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (6) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol6, skol7
% 0.43/1.07    , skol7 ) }.
% 0.43/1.07  parent0: (101) {G0,W4,D2,L1,V0,M1}  { reorganization_free( skol6, skol7, 
% 0.43/1.07    skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (7) {G0,W4,D2,L1,V0,M1} I { class( skol4, skol8, skol5 ) }.
% 0.43/1.07  parent0: (102) {G0,W4,D2,L1,V0,M1}  { class( skol4, skol8, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (8) {G0,W4,D2,L1,V0,M1} I { class( skol6, skol8, skol7 ) }.
% 0.43/1.07  parent0: (103) {G0,W4,D2,L1,V0,M1}  { class( skol6, skol8, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (9) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol4, skol2, 
% 0.43/1.07    skol5 ) }.
% 0.43/1.07  parent0: (104) {G0,W4,D2,L1,V0,M1}  { survival_chance( skol4, skol2, skol5
% 0.43/1.07     ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (10) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol6, skol3, 
% 0.43/1.07    skol7 ) }.
% 0.43/1.07  parent0: (105) {G0,W4,D2,L1,V0,M1}  { survival_chance( skol6, skol3, skol7
% 0.43/1.07     ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (11) {G0,W4,D2,L1,V0,M1} I { size( skol4, skol9, skol5 ) }.
% 0.43/1.07  parent0: (106) {G0,W4,D2,L1,V0,M1}  { size( skol4, skol9, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  *** allocated 15000 integers for clauses
% 0.43/1.07  subsumption: (12) {G0,W4,D2,L1,V0,M1} I { size( skol6, skol10, skol7 ) }.
% 0.43/1.07  parent0: (107) {G0,W4,D2,L1,V0,M1}  { size( skol6, skol10, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  *** allocated 15000 integers for termspace/termends
% 0.43/1.07  subsumption: (13) {G0,W3,D2,L1,V0,M1} I { greater( skol10, skol9 ) }.
% 0.43/1.07  parent0: (108) {G0,W3,D2,L1,V0,M1}  { greater( skol10, skol9 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (14) {G0,W4,D2,L1,V0,M1} I { ! greater( skol3, skol2 ) }.
% 0.43/1.07  parent0: (109) {G0,W4,D2,L1,V0,M1}  { ! greater( skol3, skol2 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (353) {G1,W6,D3,L1,V0,M1}  { inertia( skol4, skol1( skol4, 
% 0.43/1.07    skol5 ), skol5 ) }.
% 0.43/1.07  parent0[1]: (0) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), ! 
% 0.43/1.07    organization( X, Y ) }.
% 0.43/1.07  parent1[0]: (3) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := skol4
% 0.43/1.07     Y := skol5
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (23) {G1,W6,D3,L1,V0,M1} R(0,3) { inertia( skol4, skol1( skol4
% 0.43/1.07    , skol5 ), skol5 ) }.
% 0.43/1.07  parent0: (353) {G1,W6,D3,L1,V0,M1}  { inertia( skol4, skol1( skol4, skol5 )
% 0.43/1.07    , skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (354) {G1,W6,D3,L1,V0,M1}  { inertia( skol6, skol1( skol6, 
% 0.43/1.07    skol7 ), skol7 ) }.
% 0.43/1.07  parent0[1]: (0) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), ! 
% 0.43/1.07    organization( X, Y ) }.
% 0.43/1.07  parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := skol6
% 0.43/1.07     Y := skol7
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (24) {G1,W6,D3,L1,V0,M1} R(0,4) { inertia( skol6, skol1( skol6
% 0.43/1.07    , skol7 ), skol7 ) }.
% 0.43/1.07  parent0: (354) {G1,W6,D3,L1,V0,M1}  { inertia( skol6, skol1( skol6, skol7 )
% 0.43/1.07    , skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (356) {G1,W41,D2,L9,V7,M9}  { ! organization( X, Y ), ! size( X
% 0.43/1.07    , Z, Y ), ! class( X, T, Y ), ! class( skol6, T, skol7 ), ! inertia( X, U
% 0.43/1.07    , Y ), ! inertia( skol6, W, skol7 ), ! greater( V0, Z ), greater( W, U )
% 0.43/1.07    , ! size( skol6, V0, skol7 ) }.
% 0.43/1.07  parent0[9]: (1) {G0,W45,D2,L10,V9,M1} I { ! organization( Z, T ), ! size( Z
% 0.43/1.07    , V1, T ), ! class( Z, V0, T ), ! class( U, V0, W ), ! inertia( Z, X, T )
% 0.43/1.07    , ! inertia( U, Y, W ), ! greater( V2, V1 ), greater( Y, X ), ! size( U, 
% 0.43/1.07    V2, W ), ! organization( U, W ) }.
% 0.43/1.07  parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := U
% 0.43/1.07     Y := W
% 0.43/1.07     Z := X
% 0.43/1.07     T := Y
% 0.43/1.07     U := skol6
% 0.43/1.07     W := skol7
% 0.43/1.07     V0 := T
% 0.43/1.07     V1 := Z
% 0.43/1.07     V2 := V0
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (26) {G1,W41,D2,L9,V7,M1} R(1,4) { ! size( X, Z, Y ), ! class
% 0.43/1.07    ( X, T, Y ), ! class( skol6, T, skol7 ), ! inertia( X, U, Y ), ! inertia
% 0.43/1.07    ( skol6, W, skol7 ), ! greater( V0, Z ), greater( W, U ), ! size( skol6, 
% 0.43/1.07    V0, skol7 ), ! organization( X, Y ) }.
% 0.43/1.07  parent0: (356) {G1,W41,D2,L9,V7,M9}  { ! organization( X, Y ), ! size( X, Z
% 0.43/1.07    , Y ), ! class( X, T, Y ), ! class( skol6, T, skol7 ), ! inertia( X, U, Y
% 0.43/1.07     ), ! inertia( skol6, W, skol7 ), ! greater( V0, Z ), greater( W, U ), ! 
% 0.43/1.07    size( skol6, V0, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07     T := T
% 0.43/1.07     U := U
% 0.43/1.07     W := W
% 0.43/1.07     V0 := V0
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 8
% 0.43/1.07     1 ==> 0
% 0.43/1.07     2 ==> 1
% 0.43/1.07     3 ==> 2
% 0.43/1.07     4 ==> 3
% 0.43/1.07     5 ==> 4
% 0.43/1.07     6 ==> 5
% 0.43/1.07     7 ==> 6
% 0.43/1.07     8 ==> 7
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (363) {G1,W41,D2,L9,V6,M9}  { ! organization( X, Y ), ! 
% 0.43/1.07    survival_chance( X, Z, Y ), ! inertia( X, T, Y ), ! inertia( skol6, U, 
% 0.43/1.07    skol7 ), ! reorganization_free( X, Y, Y ), ! reorganization_free( skol6, 
% 0.43/1.07    skol7, skol7 ), ! greater( U, T ), greater( W, Z ), ! survival_chance( 
% 0.43/1.07    skol6, W, skol7 ) }.
% 0.43/1.07  parent0[9]: (2) {G0,W45,D2,L10,V8,M1} I { ! organization( Z, T ), ! 
% 0.43/1.07    survival_chance( Z, X, T ), ! inertia( Z, V0, T ), ! inertia( U, V1, W )
% 0.43/1.07    , ! reorganization_free( Z, T, T ), ! reorganization_free( U, W, W ), ! 
% 0.43/1.07    greater( V1, V0 ), greater( Y, X ), ! survival_chance( U, Y, W ), ! 
% 0.43/1.07    organization( U, W ) }.
% 0.43/1.07  parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := Z
% 0.43/1.07     Y := W
% 0.43/1.07     Z := X
% 0.43/1.07     T := Y
% 0.43/1.07     U := skol6
% 0.43/1.07     W := skol7
% 0.43/1.07     V0 := T
% 0.43/1.07     V1 := U
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (387) {G1,W36,D2,L8,V6,M8}  { ! organization( X, Y ), ! 
% 0.43/1.07    survival_chance( X, Z, Y ), ! inertia( X, T, Y ), ! inertia( skol6, U, 
% 0.43/1.07    skol7 ), ! reorganization_free( X, Y, Y ), ! greater( U, T ), greater( W
% 0.43/1.07    , Z ), ! survival_chance( skol6, W, skol7 ) }.
% 0.43/1.07  parent0[5]: (363) {G1,W41,D2,L9,V6,M9}  { ! organization( X, Y ), ! 
% 0.43/1.07    survival_chance( X, Z, Y ), ! inertia( X, T, Y ), ! inertia( skol6, U, 
% 0.43/1.07    skol7 ), ! reorganization_free( X, Y, Y ), ! reorganization_free( skol6, 
% 0.43/1.07    skol7, skol7 ), ! greater( U, T ), greater( W, Z ), ! survival_chance( 
% 0.43/1.07    skol6, W, skol7 ) }.
% 0.43/1.07  parent1[0]: (6) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol6, skol7, 
% 0.43/1.07    skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07     T := T
% 0.43/1.07     U := U
% 0.43/1.07     W := W
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (36) {G1,W36,D2,L8,V6,M1} R(2,4);r(6) { ! survival_chance( X, 
% 0.43/1.07    Z, Y ), ! inertia( X, T, Y ), ! inertia( skol6, U, skol7 ), ! 
% 0.43/1.07    reorganization_free( X, Y, Y ), ! greater( U, T ), greater( W, Z ), ! 
% 0.43/1.07    survival_chance( skol6, W, skol7 ), ! organization( X, Y ) }.
% 0.43/1.07  parent0: (387) {G1,W36,D2,L8,V6,M8}  { ! organization( X, Y ), ! 
% 0.43/1.07    survival_chance( X, Z, Y ), ! inertia( X, T, Y ), ! inertia( skol6, U, 
% 0.43/1.07    skol7 ), ! reorganization_free( X, Y, Y ), ! greater( U, T ), greater( W
% 0.43/1.07    , Z ), ! survival_chance( skol6, W, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07     T := T
% 0.43/1.07     U := U
% 0.43/1.07     W := W
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 7
% 0.43/1.07     1 ==> 0
% 0.43/1.07     2 ==> 1
% 0.43/1.07     3 ==> 2
% 0.43/1.07     4 ==> 3
% 0.43/1.07     5 ==> 4
% 0.43/1.07     6 ==> 5
% 0.43/1.07     7 ==> 6
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (391) {G1,W37,D2,L8,V5,M8}  { ! size( skol4, X, skol5 ), ! 
% 0.43/1.07    class( skol4, Y, skol5 ), ! class( skol6, Y, skol7 ), ! inertia( skol4, Z
% 0.43/1.07    , skol5 ), ! inertia( skol6, T, skol7 ), ! greater( U, X ), greater( T, Z
% 0.43/1.07     ), ! size( skol6, U, skol7 ) }.
% 0.43/1.07  parent0[8]: (26) {G1,W41,D2,L9,V7,M1} R(1,4) { ! size( X, Z, Y ), ! class( 
% 0.43/1.07    X, T, Y ), ! class( skol6, T, skol7 ), ! inertia( X, U, Y ), ! inertia( 
% 0.43/1.07    skol6, W, skol7 ), ! greater( V0, Z ), greater( W, U ), ! size( skol6, V0
% 0.43/1.07    , skol7 ), ! organization( X, Y ) }.
% 0.43/1.07  parent1[0]: (3) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := skol4
% 0.43/1.07     Y := skol5
% 0.43/1.07     Z := X
% 0.43/1.07     T := Y
% 0.43/1.07     U := Z
% 0.43/1.07     W := T
% 0.43/1.07     V0 := U
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (65) {G2,W37,D2,L8,V5,M1} R(26,3) { ! class( skol4, Y, skol5 )
% 0.43/1.07    , ! class( skol6, Y, skol7 ), ! size( skol6, U, skol7 ), ! inertia( skol6
% 0.43/1.07    , T, skol7 ), ! greater( U, X ), greater( T, Z ), ! size( skol4, X, skol5
% 0.43/1.07     ), ! inertia( skol4, Z, skol5 ) }.
% 0.43/1.07  parent0: (391) {G1,W37,D2,L8,V5,M8}  { ! size( skol4, X, skol5 ), ! class( 
% 0.43/1.07    skol4, Y, skol5 ), ! class( skol6, Y, skol7 ), ! inertia( skol4, Z, skol5
% 0.43/1.07     ), ! inertia( skol6, T, skol7 ), ! greater( U, X ), greater( T, Z ), ! 
% 0.43/1.07    size( skol6, U, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07     T := T
% 0.43/1.07     U := U
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 6
% 0.43/1.07     1 ==> 0
% 0.43/1.07     2 ==> 1
% 0.43/1.07     3 ==> 7
% 0.43/1.07     4 ==> 3
% 0.43/1.07     5 ==> 4
% 0.43/1.07     6 ==> 5
% 0.43/1.07     7 ==> 2
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (392) {G1,W32,D2,L7,V4,M7}  { ! survival_chance( skol4, X, 
% 0.43/1.07    skol5 ), ! inertia( skol4, Y, skol5 ), ! inertia( skol6, Z, skol7 ), ! 
% 0.43/1.07    reorganization_free( skol4, skol5, skol5 ), ! greater( Z, Y ), greater( T
% 0.43/1.07    , X ), ! survival_chance( skol6, T, skol7 ) }.
% 0.43/1.07  parent0[7]: (36) {G1,W36,D2,L8,V6,M1} R(2,4);r(6) { ! survival_chance( X, Z
% 0.43/1.07    , Y ), ! inertia( X, T, Y ), ! inertia( skol6, U, skol7 ), ! 
% 0.43/1.07    reorganization_free( X, Y, Y ), ! greater( U, T ), greater( W, Z ), ! 
% 0.43/1.07    survival_chance( skol6, W, skol7 ), ! organization( X, Y ) }.
% 0.43/1.07  parent1[0]: (3) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := skol4
% 0.43/1.07     Y := skol5
% 0.43/1.07     Z := X
% 0.43/1.07     T := Y
% 0.43/1.07     U := Z
% 0.43/1.07     W := T
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (393) {G1,W27,D2,L6,V4,M6}  { ! survival_chance( skol4, X, 
% 0.43/1.07    skol5 ), ! inertia( skol4, Y, skol5 ), ! inertia( skol6, Z, skol7 ), ! 
% 0.43/1.07    greater( Z, Y ), greater( T, X ), ! survival_chance( skol6, T, skol7 )
% 0.43/1.07     }.
% 0.43/1.07  parent0[3]: (392) {G1,W32,D2,L7,V4,M7}  { ! survival_chance( skol4, X, 
% 0.43/1.07    skol5 ), ! inertia( skol4, Y, skol5 ), ! inertia( skol6, Z, skol7 ), ! 
% 0.43/1.07    reorganization_free( skol4, skol5, skol5 ), ! greater( Z, Y ), greater( T
% 0.43/1.07    , X ), ! survival_chance( skol6, T, skol7 ) }.
% 0.43/1.07  parent1[0]: (5) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol4, skol5, 
% 0.43/1.07    skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07     T := T
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (78) {G2,W27,D2,L6,V4,M1} R(36,3);r(5) { ! survival_chance( 
% 0.43/1.07    skol6, T, skol7 ), ! inertia( skol6, Z, skol7 ), ! greater( Z, Y ), 
% 0.43/1.07    greater( T, X ), ! survival_chance( skol4, X, skol5 ), ! inertia( skol4, 
% 0.43/1.07    Y, skol5 ) }.
% 0.43/1.07  parent0: (393) {G1,W27,D2,L6,V4,M6}  { ! survival_chance( skol4, X, skol5 )
% 0.43/1.07    , ! inertia( skol4, Y, skol5 ), ! inertia( skol6, Z, skol7 ), ! greater( 
% 0.43/1.07    Z, Y ), greater( T, X ), ! survival_chance( skol6, T, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07     T := T
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 4
% 0.43/1.07     1 ==> 5
% 0.43/1.07     2 ==> 1
% 0.43/1.07     3 ==> 2
% 0.43/1.07     4 ==> 3
% 0.43/1.07     5 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (394) {G2,W24,D3,L5,V3,M5}  { ! survival_chance( skol6, X, 
% 0.43/1.07    skol7 ), ! inertia( skol6, Y, skol7 ), ! greater( Y, skol1( skol4, skol5
% 0.43/1.07     ) ), greater( X, Z ), ! survival_chance( skol4, Z, skol5 ) }.
% 0.43/1.07  parent0[5]: (78) {G2,W27,D2,L6,V4,M1} R(36,3);r(5) { ! survival_chance( 
% 0.43/1.07    skol6, T, skol7 ), ! inertia( skol6, Z, skol7 ), ! greater( Z, Y ), 
% 0.43/1.07    greater( T, X ), ! survival_chance( skol4, X, skol5 ), ! inertia( skol4, 
% 0.43/1.07    Y, skol5 ) }.
% 0.43/1.07  parent1[0]: (23) {G1,W6,D3,L1,V0,M1} R(0,3) { inertia( skol4, skol1( skol4
% 0.43/1.07    , skol5 ), skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := Z
% 0.43/1.07     Y := skol1( skol4, skol5 )
% 0.43/1.07     Z := Y
% 0.43/1.07     T := X
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (79) {G3,W24,D3,L5,V3,M1} R(78,23) { ! survival_chance( skol6
% 0.43/1.07    , X, skol7 ), ! greater( Y, skol1( skol4, skol5 ) ), greater( X, Z ), ! 
% 0.43/1.07    survival_chance( skol4, Z, skol5 ), ! inertia( skol6, Y, skol7 ) }.
% 0.43/1.07  parent0: (394) {G2,W24,D3,L5,V3,M5}  { ! survival_chance( skol6, X, skol7 )
% 0.43/1.07    , ! inertia( skol6, Y, skol7 ), ! greater( Y, skol1( skol4, skol5 ) ), 
% 0.43/1.07    greater( X, Z ), ! survival_chance( skol4, Z, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07     1 ==> 4
% 0.43/1.07     2 ==> 1
% 0.43/1.07     3 ==> 2
% 0.43/1.07     4 ==> 3
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (395) {G2,W21,D3,L4,V2,M4}  { ! survival_chance( skol6, X, 
% 0.43/1.07    skol7 ), ! greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), 
% 0.43/1.07    greater( X, Y ), ! survival_chance( skol4, Y, skol5 ) }.
% 0.43/1.07  parent0[4]: (79) {G3,W24,D3,L5,V3,M1} R(78,23) { ! survival_chance( skol6, 
% 0.43/1.07    X, skol7 ), ! greater( Y, skol1( skol4, skol5 ) ), greater( X, Z ), ! 
% 0.43/1.07    survival_chance( skol4, Z, skol5 ), ! inertia( skol6, Y, skol7 ) }.
% 0.43/1.07  parent1[0]: (24) {G1,W6,D3,L1,V0,M1} R(0,4) { inertia( skol6, skol1( skol6
% 0.43/1.07    , skol7 ), skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := skol1( skol6, skol7 )
% 0.43/1.07     Z := Y
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (80) {G4,W21,D3,L4,V2,M1} R(79,24) { ! survival_chance( skol6
% 0.43/1.07    , X, skol7 ), greater( X, Y ), ! survival_chance( skol4, Y, skol5 ), ! 
% 0.43/1.07    greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ) }.
% 0.43/1.07  parent0: (395) {G2,W21,D3,L4,V2,M4}  { ! survival_chance( skol6, X, skol7 )
% 0.43/1.07    , ! greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), greater( X, 
% 0.43/1.07    Y ), ! survival_chance( skol4, Y, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07     1 ==> 3
% 0.43/1.07     2 ==> 1
% 0.43/1.07     3 ==> 2
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (396) {G2,W34,D3,L7,V4,M7}  { ! class( skol4, X, skol5 ), ! 
% 0.43/1.07    class( skol6, X, skol7 ), ! size( skol6, Y, skol7 ), ! inertia( skol6, Z
% 0.43/1.07    , skol7 ), ! greater( Y, T ), greater( Z, skol1( skol4, skol5 ) ), ! size
% 0.43/1.07    ( skol4, T, skol5 ) }.
% 0.43/1.07  parent0[7]: (65) {G2,W37,D2,L8,V5,M1} R(26,3) { ! class( skol4, Y, skol5 )
% 0.43/1.07    , ! class( skol6, Y, skol7 ), ! size( skol6, U, skol7 ), ! inertia( skol6
% 0.43/1.07    , T, skol7 ), ! greater( U, X ), greater( T, Z ), ! size( skol4, X, skol5
% 0.43/1.07     ), ! inertia( skol4, Z, skol5 ) }.
% 0.43/1.07  parent1[0]: (23) {G1,W6,D3,L1,V0,M1} R(0,3) { inertia( skol4, skol1( skol4
% 0.43/1.07    , skol5 ), skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := T
% 0.43/1.07     Y := X
% 0.43/1.07     Z := skol1( skol4, skol5 )
% 0.43/1.07     T := Z
% 0.43/1.07     U := Y
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (81) {G3,W34,D3,L7,V4,M1} R(65,23) { ! class( skol4, X, skol5
% 0.43/1.07     ), ! class( skol6, X, skol7 ), ! size( skol6, Y, skol7 ), ! greater( Y, 
% 0.43/1.07    T ), greater( Z, skol1( skol4, skol5 ) ), ! size( skol4, T, skol5 ), ! 
% 0.43/1.07    inertia( skol6, Z, skol7 ) }.
% 0.43/1.07  parent0: (396) {G2,W34,D3,L7,V4,M7}  { ! class( skol4, X, skol5 ), ! class
% 0.43/1.07    ( skol6, X, skol7 ), ! size( skol6, Y, skol7 ), ! inertia( skol6, Z, 
% 0.43/1.07    skol7 ), ! greater( Y, T ), greater( Z, skol1( skol4, skol5 ) ), ! size( 
% 0.43/1.07    skol4, T, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07     T := T
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07     1 ==> 1
% 0.43/1.07     2 ==> 2
% 0.43/1.07     3 ==> 6
% 0.43/1.07     4 ==> 3
% 0.43/1.07     5 ==> 4
% 0.43/1.07     6 ==> 5
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (397) {G2,W31,D3,L6,V3,M6}  { ! class( skol4, X, skol5 ), ! 
% 0.43/1.07    class( skol6, X, skol7 ), ! size( skol6, Y, skol7 ), ! greater( Y, Z ), 
% 0.43/1.07    greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size( skol4, Z
% 0.43/1.07    , skol5 ) }.
% 0.43/1.07  parent0[6]: (81) {G3,W34,D3,L7,V4,M1} R(65,23) { ! class( skol4, X, skol5 )
% 0.43/1.07    , ! class( skol6, X, skol7 ), ! size( skol6, Y, skol7 ), ! greater( Y, T
% 0.43/1.07     ), greater( Z, skol1( skol4, skol5 ) ), ! size( skol4, T, skol5 ), ! 
% 0.43/1.07    inertia( skol6, Z, skol7 ) }.
% 0.43/1.07  parent1[0]: (24) {G1,W6,D3,L1,V0,M1} R(0,4) { inertia( skol6, skol1( skol6
% 0.43/1.07    , skol7 ), skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := skol1( skol6, skol7 )
% 0.43/1.07     T := Z
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (87) {G4,W31,D3,L6,V3,M1} R(81,24) { ! size( skol6, Y, skol7 )
% 0.43/1.07    , ! class( skol6, X, skol7 ), ! greater( Y, Z ), greater( skol1( skol6, 
% 0.43/1.07    skol7 ), skol1( skol4, skol5 ) ), ! size( skol4, Z, skol5 ), ! class( 
% 0.43/1.07    skol4, X, skol5 ) }.
% 0.43/1.07  parent0: (397) {G2,W31,D3,L6,V3,M6}  { ! class( skol4, X, skol5 ), ! class
% 0.43/1.07    ( skol6, X, skol7 ), ! size( skol6, Y, skol7 ), ! greater( Y, Z ), 
% 0.43/1.07    greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size( skol4, Z
% 0.43/1.07    , skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07     Z := Z
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 5
% 0.43/1.07     1 ==> 1
% 0.43/1.07     2 ==> 0
% 0.43/1.07     3 ==> 2
% 0.43/1.07     4 ==> 3
% 0.43/1.07     5 ==> 4
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (398) {G1,W26,D3,L5,V2,M5}  { ! size( skol6, X, skol7 ), ! 
% 0.43/1.07    class( skol6, skol8, skol7 ), ! greater( X, Y ), greater( skol1( skol6, 
% 0.43/1.07    skol7 ), skol1( skol4, skol5 ) ), ! size( skol4, Y, skol5 ) }.
% 0.43/1.07  parent0[5]: (87) {G4,W31,D3,L6,V3,M1} R(81,24) { ! size( skol6, Y, skol7 )
% 0.43/1.07    , ! class( skol6, X, skol7 ), ! greater( Y, Z ), greater( skol1( skol6, 
% 0.43/1.07    skol7 ), skol1( skol4, skol5 ) ), ! size( skol4, Z, skol5 ), ! class( 
% 0.43/1.07    skol4, X, skol5 ) }.
% 0.43/1.07  parent1[0]: (7) {G0,W4,D2,L1,V0,M1} I { class( skol4, skol8, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := skol8
% 0.43/1.07     Y := X
% 0.43/1.07     Z := Y
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (399) {G1,W21,D3,L4,V2,M4}  { ! size( skol6, X, skol7 ), ! 
% 0.43/1.07    greater( X, Y ), greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) )
% 0.43/1.07    , ! size( skol4, Y, skol5 ) }.
% 0.43/1.07  parent0[1]: (398) {G1,W26,D3,L5,V2,M5}  { ! size( skol6, X, skol7 ), ! 
% 0.43/1.07    class( skol6, skol8, skol7 ), ! greater( X, Y ), greater( skol1( skol6, 
% 0.43/1.07    skol7 ), skol1( skol4, skol5 ) ), ! size( skol4, Y, skol5 ) }.
% 0.43/1.07  parent1[0]: (8) {G0,W4,D2,L1,V0,M1} I { class( skol6, skol8, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (88) {G5,W21,D3,L4,V2,M1} R(87,7);r(8) { ! greater( X, Y ), 
% 0.43/1.07    greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size( skol6, X
% 0.43/1.07    , skol7 ), ! size( skol4, Y, skol5 ) }.
% 0.43/1.07  parent0: (399) {G1,W21,D3,L4,V2,M4}  { ! size( skol6, X, skol7 ), ! greater
% 0.43/1.07    ( X, Y ), greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size
% 0.43/1.07    ( skol4, Y, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 2
% 0.43/1.07     1 ==> 0
% 0.43/1.07     2 ==> 1
% 0.43/1.07     3 ==> 3
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (400) {G1,W16,D3,L3,V1,M3}  { ! greater( X, skol9 ), greater( 
% 0.43/1.07    skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size( skol6, X, skol7 )
% 0.43/1.07     }.
% 0.43/1.07  parent0[3]: (88) {G5,W21,D3,L4,V2,M1} R(87,7);r(8) { ! greater( X, Y ), 
% 0.43/1.07    greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size( skol6, X
% 0.43/1.07    , skol7 ), ! size( skol4, Y, skol5 ) }.
% 0.43/1.07  parent1[0]: (11) {G0,W4,D2,L1,V0,M1} I { size( skol4, skol9, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := skol9
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (89) {G6,W16,D3,L3,V1,M1} R(88,11) { ! greater( X, skol9 ), 
% 0.43/1.07    greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size( skol6, X
% 0.43/1.07    , skol7 ) }.
% 0.43/1.07  parent0: (400) {G1,W16,D3,L3,V1,M3}  { ! greater( X, skol9 ), greater( 
% 0.43/1.07    skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size( skol6, X, skol7 )
% 0.43/1.07     }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07     1 ==> 1
% 0.43/1.07     2 ==> 2
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (401) {G1,W11,D3,L2,V0,M2}  { ! greater( skol10, skol9 ), 
% 0.43/1.07    greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ) }.
% 0.43/1.07  parent0[2]: (89) {G6,W16,D3,L3,V1,M1} R(88,11) { ! greater( X, skol9 ), 
% 0.43/1.07    greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ), ! size( skol6, X
% 0.43/1.07    , skol7 ) }.
% 0.43/1.07  parent1[0]: (12) {G0,W4,D2,L1,V0,M1} I { size( skol6, skol10, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := skol10
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (402) {G1,W7,D3,L1,V0,M1}  { greater( skol1( skol6, skol7 ), 
% 0.43/1.07    skol1( skol4, skol5 ) ) }.
% 0.43/1.07  parent0[0]: (401) {G1,W11,D3,L2,V0,M2}  { ! greater( skol10, skol9 ), 
% 0.43/1.07    greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ) }.
% 0.43/1.07  parent1[0]: (13) {G0,W3,D2,L1,V0,M1} I { greater( skol10, skol9 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (90) {G7,W7,D3,L1,V0,M1} R(89,12);r(13) { greater( skol1( 
% 0.43/1.07    skol6, skol7 ), skol1( skol4, skol5 ) ) }.
% 0.43/1.07  parent0: (402) {G1,W7,D3,L1,V0,M1}  { greater( skol1( skol6, skol7 ), skol1
% 0.43/1.07    ( skol4, skol5 ) ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (403) {G5,W13,D2,L3,V2,M3}  { ! survival_chance( skol6, X, 
% 0.43/1.07    skol7 ), greater( X, Y ), ! survival_chance( skol4, Y, skol5 ) }.
% 0.43/1.07  parent0[3]: (80) {G4,W21,D3,L4,V2,M1} R(79,24) { ! survival_chance( skol6, 
% 0.43/1.07    X, skol7 ), greater( X, Y ), ! survival_chance( skol4, Y, skol5 ), ! 
% 0.43/1.07    greater( skol1( skol6, skol7 ), skol1( skol4, skol5 ) ) }.
% 0.43/1.07  parent1[0]: (90) {G7,W7,D3,L1,V0,M1} R(89,12);r(13) { greater( skol1( skol6
% 0.43/1.07    , skol7 ), skol1( skol4, skol5 ) ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (91) {G8,W13,D2,L3,V2,M1} R(90,80) { greater( X, Y ), ! 
% 0.43/1.07    survival_chance( skol6, X, skol7 ), ! survival_chance( skol4, Y, skol5 )
% 0.43/1.07     }.
% 0.43/1.07  parent0: (403) {G5,W13,D2,L3,V2,M3}  { ! survival_chance( skol6, X, skol7 )
% 0.43/1.07    , greater( X, Y ), ! survival_chance( skol4, Y, skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := Y
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 1
% 0.43/1.07     1 ==> 0
% 0.43/1.07     2 ==> 2
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (404) {G1,W8,D2,L2,V1,M2}  { greater( X, skol2 ), ! 
% 0.43/1.07    survival_chance( skol6, X, skol7 ) }.
% 0.43/1.07  parent0[2]: (91) {G8,W13,D2,L3,V2,M1} R(90,80) { greater( X, Y ), ! 
% 0.43/1.07    survival_chance( skol6, X, skol7 ), ! survival_chance( skol4, Y, skol5 )
% 0.43/1.07     }.
% 0.43/1.07  parent1[0]: (9) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol4, skol2, 
% 0.43/1.07    skol5 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07     Y := skol2
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (92) {G9,W8,D2,L2,V1,M1} R(91,9) { greater( X, skol2 ), ! 
% 0.43/1.07    survival_chance( skol6, X, skol7 ) }.
% 0.43/1.07  parent0: (404) {G1,W8,D2,L2,V1,M2}  { greater( X, skol2 ), ! 
% 0.43/1.07    survival_chance( skol6, X, skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := X
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07     0 ==> 0
% 0.43/1.07     1 ==> 1
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (405) {G1,W3,D2,L1,V0,M1}  { greater( skol3, skol2 ) }.
% 0.43/1.07  parent0[1]: (92) {G9,W8,D2,L2,V1,M1} R(91,9) { greater( X, skol2 ), ! 
% 0.43/1.07    survival_chance( skol6, X, skol7 ) }.
% 0.43/1.07  parent1[0]: (10) {G0,W4,D2,L1,V0,M1} I { survival_chance( skol6, skol3, 
% 0.43/1.07    skol7 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07     X := skol3
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  resolution: (406) {G1,W0,D0,L0,V0,M0}  {  }.
% 0.43/1.07  parent0[0]: (14) {G0,W4,D2,L1,V0,M1} I { ! greater( skol3, skol2 ) }.
% 0.43/1.07  parent1[0]: (405) {G1,W3,D2,L1,V0,M1}  { greater( skol3, skol2 ) }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  substitution1:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  subsumption: (93) {G10,W0,D0,L0,V0,M0} R(92,10);r(14) {  }.
% 0.43/1.07  parent0: (406) {G1,W0,D0,L0,V0,M0}  {  }.
% 0.43/1.07  substitution0:
% 0.43/1.07  end
% 0.43/1.07  permutation0:
% 0.43/1.07  end
% 0.43/1.07  
% 0.43/1.07  Proof check complete!
% 0.43/1.07  
% 0.43/1.07  Memory use:
% 0.43/1.07  
% 0.43/1.07  space for terms:        2411
% 0.43/1.07  space for clauses:      4254
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  clauses generated:      153
% 0.43/1.07  clauses kept:           94
% 0.43/1.07  clauses selected:       89
% 0.43/1.07  clauses deleted:        4
% 0.43/1.07  clauses inuse deleted:  0
% 0.43/1.07  
% 0.43/1.07  subsentry:          1418
% 0.43/1.07  literals s-matched: 850
% 0.43/1.07  literals matched:   399
% 0.43/1.07  full subsumption:   251
% 0.43/1.07  
% 0.43/1.07  checksum:           -1999722025
% 0.43/1.07  
% 0.43/1.07  
% 0.43/1.07  Bliksem ended
%------------------------------------------------------------------------------