TSTP Solution File: LCL398-1 by Bliksem---1.12

View Problem - Process Solution

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

% Computer : n009.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 07:53:18 EDT 2022

% Result   : Unsatisfiable 0.39s 1.05s
% Output   : Refutation 0.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem  : LCL398-1 : TPTP v8.1.0. Released v2.3.0.
% 0.02/0.12  % Command  : bliksem %s
% 0.12/0.32  % Computer : n009.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % DateTime : Sat Jul  2 23:05:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.39/1.05  *** allocated 10000 integers for termspace/termends
% 0.39/1.05  *** allocated 10000 integers for clauses
% 0.39/1.05  *** allocated 10000 integers for justifications
% 0.39/1.05  Bliksem 1.12
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  Automatic Strategy Selection
% 0.39/1.05  
% 0.39/1.05  Clauses:
% 0.39/1.05  [
% 0.39/1.05     [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ), 
% 0.39/1.05    'is_a_theorem'( Y ) ],
% 0.39/1.05     [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y, Z ), 
% 0.39/1.05    implies( X, Z ) ) ) ) ],
% 0.39/1.05     [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ],
% 0.39/1.05     [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ],
% 0.39/1.05     [ ~( 'is_a_theorem'( implies( not( implies( x, x ) ), y ) ) ) ]
% 0.39/1.05  ] .
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  percentage equality = 0.000000, percentage horn = 1.000000
% 0.39/1.05  This is a near-Horn, non-equality  problem
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  Options Used:
% 0.39/1.05  
% 0.39/1.05  useres =            1
% 0.39/1.05  useparamod =        0
% 0.39/1.05  useeqrefl =         0
% 0.39/1.05  useeqfact =         0
% 0.39/1.05  usefactor =         1
% 0.39/1.05  usesimpsplitting =  0
% 0.39/1.05  usesimpdemod =      0
% 0.39/1.05  usesimpres =        4
% 0.39/1.05  
% 0.39/1.05  resimpinuse      =  1000
% 0.39/1.05  resimpclauses =     20000
% 0.39/1.05  substype =          standard
% 0.39/1.05  backwardsubs =      1
% 0.39/1.05  selectoldest =      5
% 0.39/1.05  
% 0.39/1.05  litorderings [0] =  split
% 0.39/1.05  litorderings [1] =  liftord
% 0.39/1.05  
% 0.39/1.05  termordering =      none
% 0.39/1.05  
% 0.39/1.05  litapriori =        1
% 0.39/1.05  termapriori =       0
% 0.39/1.05  litaposteriori =    0
% 0.39/1.05  termaposteriori =   0
% 0.39/1.05  demodaposteriori =  0
% 0.39/1.05  ordereqreflfact =   0
% 0.39/1.05  
% 0.39/1.05  litselect =         negative
% 0.39/1.05  
% 0.39/1.05  maxweight =         30000
% 0.39/1.05  maxdepth =          30000
% 0.39/1.05  maxlength =         115
% 0.39/1.05  maxnrvars =         195
% 0.39/1.05  excuselevel =       0
% 0.39/1.05  increasemaxweight = 0
% 0.39/1.05  
% 0.39/1.05  maxselected =       10000000
% 0.39/1.05  maxnrclauses =      10000000
% 0.39/1.05  
% 0.39/1.05  showgenerated =    0
% 0.39/1.05  showkept =         0
% 0.39/1.05  showselected =     0
% 0.39/1.05  showdeleted =      0
% 0.39/1.05  showresimp =       1
% 0.39/1.05  showstatus =       2000
% 0.39/1.05  
% 0.39/1.05  prologoutput =     1
% 0.39/1.05  nrgoals =          5000000
% 0.39/1.05  totalproof =       1
% 0.39/1.05  
% 0.39/1.05  Symbols occurring in the translation:
% 0.39/1.05  
% 0.39/1.05  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.39/1.05  .  [1, 2]      (w:1, o:21, a:1, s:1, b:0), 
% 0.39/1.05  !  [4, 1]      (w:1, o:14, a:1, s:1, b:0), 
% 0.39/1.05  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.39/1.05  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.39/1.05  implies  [41, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.39/1.05  'is_a_theorem'  [42, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.39/1.05  not  [44, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.39/1.05  x  [45, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 0.39/1.05  y  [46, 0]      (w:1, o:13, a:1, s:1, b:0).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  Starting Search:
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  Bliksems!, er is een bewijs:
% 0.39/1.05  % SZS status Unsatisfiable
% 0.39/1.05  % SZS output start Refutation
% 0.39/1.05  
% 0.39/1.05  clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ), 
% 0.39/1.05    ~( 'is_a_theorem'( X ) ) ] )
% 0.39/1.05  .
% 0.39/1.05  clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.39/1.05    , Z ), implies( X, Z ) ) ) ) ] )
% 0.39/1.05  .
% 0.39/1.05  clause( 2, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ] )
% 0.39/1.05  .
% 0.39/1.05  clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.39/1.05  .
% 0.39/1.05  clause( 4, [ ~( 'is_a_theorem'( implies( not( implies( x, x ) ), y ) ) ) ]
% 0.39/1.05     )
% 0.39/1.05  .
% 0.39/1.05  clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( 
% 0.39/1.05    implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.39/1.05  .
% 0.39/1.05  clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X, 
% 0.39/1.05    implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.39/1.05  .
% 0.39/1.05  clause( 14, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z )
% 0.39/1.05    , implies( X, Z ) ) ) ] )
% 0.39/1.05  .
% 0.39/1.05  clause( 23, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.39/1.05  .
% 0.39/1.05  clause( 25, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X, 
% 0.39/1.05    X ), Y ) ) ) ] )
% 0.39/1.05  .
% 0.39/1.05  clause( 26, [ 'is_a_theorem'( implies( not( implies( X, X ) ), Y ) ) ] )
% 0.39/1.05  .
% 0.39/1.05  clause( 31, [] )
% 0.39/1.05  .
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  % SZS output end Refutation
% 0.39/1.05  found a proof!
% 0.39/1.05  
% 0.39/1.05  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.39/1.05  
% 0.39/1.05  initialclauses(
% 0.39/1.05  [ clause( 33, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( 
% 0.39/1.05    X ) ), 'is_a_theorem'( Y ) ] )
% 0.39/1.05  , clause( 34, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( 
% 0.39/1.05    Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.39/1.05  , clause( 35, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ] )
% 0.39/1.05  , clause( 36, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.39/1.05  , clause( 37, [ ~( 'is_a_theorem'( implies( not( implies( x, x ) ), y ) ) )
% 0.39/1.05     ] )
% 0.39/1.05  ] ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ), 
% 0.39/1.05    ~( 'is_a_theorem'( X ) ) ] )
% 0.39/1.05  , clause( 33, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( 
% 0.39/1.05    X ) ), 'is_a_theorem'( Y ) ] )
% 0.39/1.05  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.39/1.05     ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.39/1.05    , Z ), implies( X, Z ) ) ) ) ] )
% 0.39/1.05  , clause( 34, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( 
% 0.39/1.05    Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.39/1.05  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.39/1.05    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 2, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ] )
% 0.39/1.05  , clause( 35, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ] )
% 0.39/1.05  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.39/1.05  , clause( 36, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.39/1.05  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.39/1.05     )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 4, [ ~( 'is_a_theorem'( implies( not( implies( x, x ) ), y ) ) ) ]
% 0.39/1.05     )
% 0.39/1.05  , clause( 37, [ ~( 'is_a_theorem'( implies( not( implies( x, x ) ), y ) ) )
% 0.39/1.05     ] )
% 0.39/1.05  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  resolution(
% 0.39/1.05  clause( 39, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ), X ), 
% 0.39/1.05    X ), Y ) ) ), 'is_a_theorem'( Y ) ] )
% 0.39/1.05  , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.39/1.05    , ~( 'is_a_theorem'( X ) ) ] )
% 0.39/1.05  , 2, clause( 2, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ]
% 0.39/1.05     )
% 0.39/1.05  , 0, substitution( 0, [ :=( X, implies( implies( not( X ), X ), X ) ), :=( 
% 0.39/1.05    Y, Y )] ), substitution( 1, [ :=( X, X )] )).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( 
% 0.39/1.05    implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.39/1.05  , clause( 39, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ), X )
% 0.39/1.05    , X ), Y ) ) ), 'is_a_theorem'( Y ) ] )
% 0.39/1.05  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.39/1.05     ), ==>( 1, 0 )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  resolution(
% 0.39/1.05  clause( 41, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X ), Y
% 0.39/1.05     ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.39/1.05  , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.39/1.05    , ~( 'is_a_theorem'( X ) ) ] )
% 0.39/1.05  , 2, clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.39/1.05     )
% 0.39/1.05  , 0, substitution( 0, [ :=( X, implies( X, implies( not( X ), Y ) ) ), :=( 
% 0.39/1.05    Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X, 
% 0.39/1.05    implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.39/1.05  , clause( 41, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X ), 
% 0.39/1.05    Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.39/1.05  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.39/1.05    permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  resolution(
% 0.39/1.05  clause( 42, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z )
% 0.39/1.05    , implies( X, Z ) ) ) ] )
% 0.39/1.05  , clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.39/1.05    , implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.39/1.05  , 1, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( 
% 0.39/1.05    implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.39/1.05  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies( 
% 0.39/1.05    implies( not( X ), Y ), Z ), implies( X, Z ) ) )] ), substitution( 1, [ 
% 0.39/1.05    :=( X, X ), :=( Y, implies( not( X ), Y ) ), :=( Z, Z )] )).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 14, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z )
% 0.39/1.05    , implies( X, Z ) ) ) ] )
% 0.39/1.05  , clause( 42, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z
% 0.39/1.05     ), implies( X, Z ) ) ) ] )
% 0.39/1.05  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.39/1.05    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  resolution(
% 0.39/1.05  clause( 43, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.39/1.05  , clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( 
% 0.39/1.05    implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.39/1.05  , 1, clause( 14, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y )
% 0.39/1.05    , Z ), implies( X, Z ) ) ) ] )
% 0.39/1.05  , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( X, X ) )] ), 
% 0.39/1.05    substitution( 1, [ :=( X, X ), :=( Y, X ), :=( Z, X )] )).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 23, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.39/1.05  , clause( 43, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.39/1.05  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  resolution(
% 0.39/1.05  clause( 45, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ), 
% 0.39/1.05    'is_a_theorem'( Y ) ] )
% 0.39/1.05  , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.39/1.05    , ~( 'is_a_theorem'( X ) ) ] )
% 0.39/1.05  , 2, clause( 23, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.39/1.05  , 0, substitution( 0, [ :=( X, implies( X, X ) ), :=( Y, Y )] ), 
% 0.39/1.05    substitution( 1, [ :=( X, X )] )).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 25, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X, 
% 0.39/1.05    X ), Y ) ) ) ] )
% 0.39/1.05  , clause( 45, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ), 
% 0.39/1.05    'is_a_theorem'( Y ) ] )
% 0.39/1.05  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.39/1.05     ), ==>( 1, 0 )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  resolution(
% 0.39/1.05  clause( 46, [ 'is_a_theorem'( implies( not( implies( X, X ) ), Y ) ) ] )
% 0.39/1.05  , clause( 25, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X
% 0.39/1.05    , X ), Y ) ) ) ] )
% 0.39/1.05  , 1, clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.39/1.05     )
% 0.39/1.05  , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( not( implies( X, X ) )
% 0.39/1.05    , Y ) )] ), substitution( 1, [ :=( X, implies( X, X ) ), :=( Y, Y )] )
% 0.39/1.05    ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 26, [ 'is_a_theorem'( implies( not( implies( X, X ) ), Y ) ) ] )
% 0.39/1.05  , clause( 46, [ 'is_a_theorem'( implies( not( implies( X, X ) ), Y ) ) ] )
% 0.39/1.05  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.39/1.05     )] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  resolution(
% 0.39/1.05  clause( 47, [] )
% 0.39/1.05  , clause( 4, [ ~( 'is_a_theorem'( implies( not( implies( x, x ) ), y ) ) )
% 0.39/1.05     ] )
% 0.39/1.05  , 0, clause( 26, [ 'is_a_theorem'( implies( not( implies( X, X ) ), Y ) ) ]
% 0.39/1.05     )
% 0.39/1.05  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, x ), :=( Y, y )] )
% 0.39/1.05    ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  subsumption(
% 0.39/1.05  clause( 31, [] )
% 0.39/1.05  , clause( 47, [] )
% 0.39/1.05  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  end.
% 0.39/1.05  
% 0.39/1.05  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.39/1.05  
% 0.39/1.05  Memory use:
% 0.39/1.05  
% 0.39/1.05  space for terms:        493
% 0.39/1.05  space for clauses:      2915
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  clauses generated:      42
% 0.39/1.05  clauses kept:           32
% 0.39/1.05  clauses selected:       17
% 0.39/1.05  clauses deleted:        0
% 0.39/1.05  clauses inuse deleted:  0
% 0.39/1.05  
% 0.39/1.05  subsentry:          28
% 0.39/1.05  literals s-matched: 11
% 0.39/1.05  literals matched:   11
% 0.39/1.05  full subsumption:   0
% 0.39/1.05  
% 0.39/1.05  checksum:           -296335167
% 0.39/1.05  
% 0.39/1.05  
% 0.39/1.05  Bliksem ended
%------------------------------------------------------------------------------