↑ Up

Bliksem---1.12.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : LDA007-3 : TPTP v8.1.0. Released v1.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 16:41:34 EDT 2022

% Result   : Unsatisfiable 0.71s 1.11s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LDA007-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/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 : Mon May 30 03:54:12 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.71/1.11  *** allocated 10000 integers for termspace/termends
% 0.71/1.11  *** allocated 10000 integers for clauses
% 0.71/1.11  *** allocated 10000 integers for justifications
% 0.71/1.11  Bliksem 1.12
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  Automatic Strategy Selection
% 0.71/1.11  
% 0.71/1.11  Clauses:
% 0.71/1.11  [
% 0.71/1.11     [ =( f( X, f( Y, Z ) ), f( f( X, Y ), f( X, Z ) ) ) ],
% 0.71/1.11     [ =( tt, f( t, t ) ) ],
% 0.71/1.11     [ =( ts, f( t, s ) ) ],
% 0.71/1.11     [ =( 'tt_ts', f( tt, ts ) ) ],
% 0.71/1.11     [ =( tk, f( t, k ) ) ],
% 0.71/1.11     [ =( tsk, f( ts, k ) ) ],
% 0.71/1.11     [ ~( =( f( t, tsk ), f( 'tt_ts', tk ) ) ) ]
% 0.71/1.11  ] .
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  percentage equality = 1.000000, percentage horn = 1.000000
% 0.71/1.11  This is a pure equality problem
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  Options Used:
% 0.71/1.11  
% 0.71/1.11  useres =            1
% 0.71/1.11  useparamod =        1
% 0.71/1.11  useeqrefl =         1
% 0.71/1.11  useeqfact =         1
% 0.71/1.11  usefactor =         1
% 0.71/1.11  usesimpsplitting =  0
% 0.71/1.11  usesimpdemod =      5
% 0.71/1.11  usesimpres =        3
% 0.71/1.11  
% 0.71/1.11  resimpinuse      =  1000
% 0.71/1.11  resimpclauses =     20000
% 0.71/1.11  substype =          eqrewr
% 0.71/1.11  backwardsubs =      1
% 0.71/1.11  selectoldest =      5
% 0.71/1.11  
% 0.71/1.11  litorderings [0] =  split
% 0.71/1.11  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.71/1.11  
% 0.71/1.11  termordering =      kbo
% 0.71/1.11  
% 0.71/1.11  litapriori =        0
% 0.71/1.11  termapriori =       1
% 0.71/1.11  litaposteriori =    0
% 0.71/1.11  termaposteriori =   0
% 0.71/1.11  demodaposteriori =  0
% 0.71/1.11  ordereqreflfact =   0
% 0.71/1.11  
% 0.71/1.11  litselect =         negord
% 0.71/1.11  
% 0.71/1.11  maxweight =         15
% 0.71/1.11  maxdepth =          30000
% 0.71/1.11  maxlength =         115
% 0.71/1.11  maxnrvars =         195
% 0.71/1.11  excuselevel =       1
% 0.71/1.11  increasemaxweight = 1
% 0.71/1.11  
% 0.71/1.11  maxselected =       10000000
% 0.71/1.11  maxnrclauses =      10000000
% 0.71/1.11  
% 0.71/1.11  showgenerated =    0
% 0.71/1.11  showkept =         0
% 0.71/1.11  showselected =     0
% 0.71/1.11  showdeleted =      0
% 0.71/1.11  showresimp =       1
% 0.71/1.11  showstatus =       2000
% 0.71/1.11  
% 0.71/1.11  prologoutput =     1
% 0.71/1.11  nrgoals =          5000000
% 0.71/1.11  totalproof =       1
% 0.71/1.11  
% 0.71/1.11  Symbols occurring in the translation:
% 0.71/1.11  
% 0.71/1.11  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.71/1.11  .  [1, 2]      (w:1, o:25, a:1, s:1, b:0), 
% 0.71/1.11  !  [4, 1]      (w:0, o:20, a:1, s:1, b:0), 
% 0.71/1.11  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.71/1.11  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.71/1.11  f  [42, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 0.71/1.11  tt  [43, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 0.71/1.11  t  [44, 0]      (w:1, o:16, a:1, s:1, b:0), 
% 0.71/1.11  ts  [45, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.71/1.11  s  [46, 0]      (w:1, o:5, a:1, s:1, b:0), 
% 0.71/1.11  'tt_ts'  [47, 0]      (w:1, o:17, a:1, s:1, b:0), 
% 0.71/1.11  tk  [48, 0]      (w:1, o:18, a:1, s:1, b:0), 
% 0.71/1.11  k  [49, 0]      (w:1, o:19, a:1, s:1, b:0), 
% 0.71/1.11  tsk  [50, 0]      (w:1, o:14, a:1, s:1, b:0).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  Starting Search:
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  Bliksems!, er is een bewijs:
% 0.71/1.11  % SZS status Unsatisfiable
% 0.71/1.11  % SZS output start Refutation
% 0.71/1.11  
% 0.71/1.11  clause( 0, [ =( f( f( X, Y ), f( X, Z ) ), f( X, f( Y, Z ) ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 1, [ =( f( t, t ), tt ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 2, [ =( f( t, s ), ts ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 3, [ =( f( tt, ts ), 'tt_ts' ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 4, [ =( f( t, k ), tk ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 5, [ =( f( ts, k ), tsk ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 6, [ ~( =( f( 'tt_ts', tk ), f( t, tsk ) ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 9, [ =( f( t, f( t, X ) ), f( tt, f( t, X ) ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 16, [ =( f( t, f( X, k ) ), f( f( t, X ), tk ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 21, [ =( f( t, ts ), 'tt_ts' ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 59, [ =( f( 'tt_ts', tk ), f( t, tsk ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 60, [] )
% 0.71/1.11  .
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  % SZS output end Refutation
% 0.71/1.11  found a proof!
% 0.71/1.11  
% 0.71/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.11  
% 0.71/1.11  initialclauses(
% 0.71/1.11  [ clause( 62, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), f( X, Z ) ) ) ] )
% 0.71/1.11  , clause( 63, [ =( tt, f( t, t ) ) ] )
% 0.71/1.11  , clause( 64, [ =( ts, f( t, s ) ) ] )
% 0.71/1.11  , clause( 65, [ =( 'tt_ts', f( tt, ts ) ) ] )
% 0.71/1.11  , clause( 66, [ =( tk, f( t, k ) ) ] )
% 0.71/1.11  , clause( 67, [ =( tsk, f( ts, k ) ) ] )
% 0.71/1.11  , clause( 68, [ ~( =( f( t, tsk ), f( 'tt_ts', tk ) ) ) ] )
% 0.71/1.11  ] ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 69, [ =( f( f( X, Y ), f( X, Z ) ), f( X, f( Y, Z ) ) ) ] )
% 0.71/1.11  , clause( 62, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), f( X, Z ) ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 0, [ =( f( f( X, Y ), f( X, Z ) ), f( X, f( Y, Z ) ) ) ] )
% 0.71/1.11  , clause( 69, [ =( f( f( X, Y ), f( X, Z ) ), f( X, f( Y, Z ) ) ) ] )
% 0.71/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.71/1.11    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 71, [ =( f( t, t ), tt ) ] )
% 0.71/1.11  , clause( 63, [ =( tt, f( t, t ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 1, [ =( f( t, t ), tt ) ] )
% 0.71/1.11  , clause( 71, [ =( f( t, t ), tt ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 74, [ =( f( t, s ), ts ) ] )
% 0.71/1.11  , clause( 64, [ =( ts, f( t, s ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 2, [ =( f( t, s ), ts ) ] )
% 0.71/1.11  , clause( 74, [ =( f( t, s ), ts ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 78, [ =( f( tt, ts ), 'tt_ts' ) ] )
% 0.71/1.11  , clause( 65, [ =( 'tt_ts', f( tt, ts ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 3, [ =( f( tt, ts ), 'tt_ts' ) ] )
% 0.71/1.11  , clause( 78, [ =( f( tt, ts ), 'tt_ts' ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 83, [ =( f( t, k ), tk ) ] )
% 0.71/1.11  , clause( 66, [ =( tk, f( t, k ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 4, [ =( f( t, k ), tk ) ] )
% 0.71/1.11  , clause( 83, [ =( f( t, k ), tk ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 89, [ =( f( ts, k ), tsk ) ] )
% 0.71/1.11  , clause( 67, [ =( tsk, f( ts, k ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 5, [ =( f( ts, k ), tsk ) ] )
% 0.71/1.11  , clause( 89, [ =( f( ts, k ), tsk ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 96, [ ~( =( f( 'tt_ts', tk ), f( t, tsk ) ) ) ] )
% 0.71/1.11  , clause( 68, [ ~( =( f( t, tsk ), f( 'tt_ts', tk ) ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 6, [ ~( =( f( 'tt_ts', tk ), f( t, tsk ) ) ) ] )
% 0.71/1.11  , clause( 96, [ ~( =( f( 'tt_ts', tk ), f( t, tsk ) ) ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 98, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), f( X, Z ) ) ) ] )
% 0.71/1.11  , clause( 0, [ =( f( f( X, Y ), f( X, Z ) ), f( X, f( Y, Z ) ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  paramod(
% 0.71/1.11  clause( 100, [ =( f( t, f( t, X ) ), f( tt, f( t, X ) ) ) ] )
% 0.71/1.11  , clause( 1, [ =( f( t, t ), tt ) ] )
% 0.71/1.11  , 0, clause( 98, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), f( X, Z ) ) ) ] )
% 0.71/1.11  , 0, 7, substitution( 0, [] ), substitution( 1, [ :=( X, t ), :=( Y, t ), 
% 0.71/1.11    :=( Z, X )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 9, [ =( f( t, f( t, X ) ), f( tt, f( t, X ) ) ) ] )
% 0.71/1.11  , clause( 100, [ =( f( t, f( t, X ) ), f( tt, f( t, X ) ) ) ] )
% 0.71/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 106, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), f( X, Z ) ) ) ] )
% 0.71/1.11  , clause( 0, [ =( f( f( X, Y ), f( X, Z ) ), f( X, f( Y, Z ) ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  paramod(
% 0.71/1.11  clause( 109, [ =( f( t, f( X, k ) ), f( f( t, X ), tk ) ) ] )
% 0.71/1.11  , clause( 4, [ =( f( t, k ), tk ) ] )
% 0.71/1.11  , 0, clause( 106, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), f( X, Z ) ) ) ] )
% 0.71/1.11  , 0, 10, substitution( 0, [] ), substitution( 1, [ :=( X, t ), :=( Y, X ), 
% 0.71/1.11    :=( Z, k )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 16, [ =( f( t, f( X, k ) ), f( f( t, X ), tk ) ) ] )
% 0.71/1.11  , clause( 109, [ =( f( t, f( X, k ) ), f( f( t, X ), tk ) ) ] )
% 0.71/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 114, [ =( f( tt, f( t, X ) ), f( t, f( t, X ) ) ) ] )
% 0.71/1.11  , clause( 9, [ =( f( t, f( t, X ) ), f( tt, f( t, X ) ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [ :=( X, X )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  paramod(
% 0.71/1.11  clause( 117, [ =( f( tt, f( t, s ) ), f( t, ts ) ) ] )
% 0.71/1.11  , clause( 2, [ =( f( t, s ), ts ) ] )
% 0.71/1.11  , 0, clause( 114, [ =( f( tt, f( t, X ) ), f( t, f( t, X ) ) ) ] )
% 0.71/1.11  , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, s )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  paramod(
% 0.71/1.11  clause( 118, [ =( f( tt, ts ), f( t, ts ) ) ] )
% 0.71/1.11  , clause( 2, [ =( f( t, s ), ts ) ] )
% 0.71/1.11  , 0, clause( 117, [ =( f( tt, f( t, s ) ), f( t, ts ) ) ] )
% 0.71/1.11  , 0, 3, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  paramod(
% 0.71/1.11  clause( 119, [ =( 'tt_ts', f( t, ts ) ) ] )
% 0.71/1.11  , clause( 3, [ =( f( tt, ts ), 'tt_ts' ) ] )
% 0.71/1.11  , 0, clause( 118, [ =( f( tt, ts ), f( t, ts ) ) ] )
% 0.71/1.11  , 0, 1, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 120, [ =( f( t, ts ), 'tt_ts' ) ] )
% 0.71/1.11  , clause( 119, [ =( 'tt_ts', f( t, ts ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 21, [ =( f( t, ts ), 'tt_ts' ) ] )
% 0.71/1.11  , clause( 120, [ =( f( t, ts ), 'tt_ts' ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  eqswap(
% 0.71/1.11  clause( 122, [ =( f( f( t, X ), tk ), f( t, f( X, k ) ) ) ] )
% 0.71/1.11  , clause( 16, [ =( f( t, f( X, k ) ), f( f( t, X ), tk ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [ :=( X, X )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  paramod(
% 0.71/1.11  clause( 124, [ =( f( f( t, ts ), tk ), f( t, tsk ) ) ] )
% 0.71/1.11  , clause( 5, [ =( f( ts, k ), tsk ) ] )
% 0.71/1.11  , 0, clause( 122, [ =( f( f( t, X ), tk ), f( t, f( X, k ) ) ) ] )
% 0.71/1.11  , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, ts )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  paramod(
% 0.71/1.11  clause( 125, [ =( f( 'tt_ts', tk ), f( t, tsk ) ) ] )
% 0.71/1.11  , clause( 21, [ =( f( t, ts ), 'tt_ts' ) ] )
% 0.71/1.11  , 0, clause( 124, [ =( f( f( t, ts ), tk ), f( t, tsk ) ) ] )
% 0.71/1.11  , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 59, [ =( f( 'tt_ts', tk ), f( t, tsk ) ) ] )
% 0.71/1.11  , clause( 125, [ =( f( 'tt_ts', tk ), f( t, tsk ) ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  resolution(
% 0.71/1.11  clause( 129, [] )
% 0.71/1.11  , clause( 6, [ ~( =( f( 'tt_ts', tk ), f( t, tsk ) ) ) ] )
% 0.71/1.11  , 0, clause( 59, [ =( f( 'tt_ts', tk ), f( t, tsk ) ) ] )
% 0.71/1.11  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 60, [] )
% 0.71/1.11  , clause( 129, [] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  end.
% 0.71/1.11  
% 0.71/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.11  
% 0.71/1.11  Memory use:
% 0.71/1.11  
% 0.71/1.11  space for terms:        830
% 0.71/1.11  space for clauses:      6600
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  clauses generated:      322
% 0.71/1.11  clauses kept:           61
% 0.71/1.11  clauses selected:       26
% 0.71/1.11  clauses deleted:        1
% 0.71/1.11  clauses inuse deleted:  0
% 0.71/1.11  
% 0.71/1.11  subsentry:          266
% 0.71/1.11  literals s-matched: 107
% 0.71/1.11  literals matched:   107
% 0.71/1.11  full subsumption:   0
% 0.71/1.11  
% 0.71/1.11  checksum:           11506151
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  Bliksem ended
%------------------------------------------------------------------------------