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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : PUZ001-1 : 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 : Mon Jul 18 17:58:06 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.06/0.12  % Problem  : PUZ001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n023.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % DateTime : Sat May 28 22:44:57 EDT 2022
% 0.13/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     [ lives( agatha ) ],
% 0.71/1.11     [ lives( butler ) ],
% 0.71/1.11     [ lives( charles ) ],
% 0.71/1.11     [ ~( killed( X, Y ) ), ~( richer( X, Y ) ) ],
% 0.71/1.11     [ ~( hates( agatha, X ) ), ~( hates( charles, X ) ) ],
% 0.71/1.11     [ ~( hates( X, agatha ) ), ~( hates( X, butler ) ), ~( hates( X, charles
% 0.71/1.11     ) ) ],
% 0.71/1.11     [ hates( agatha, agatha ) ],
% 0.71/1.11     [ hates( agatha, charles ) ],
% 0.71/1.11     [ ~( killed( X, Y ) ), hates( X, Y ) ],
% 0.71/1.11     [ ~( hates( agatha, X ) ), hates( butler, X ) ],
% 0.71/1.11     [ ~( lives( X ) ), richer( X, agatha ), hates( butler, X ) ],
% 0.71/1.11     [ killed( butler, agatha ), killed( charles, agatha ) ]
% 0.71/1.11  ] .
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  percentage equality = 0.000000, percentage horn = 0.833333
% 0.71/1.11  This a non-horn, non-equality problem
% 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 =        0
% 0.71/1.11  useeqrefl =         0
% 0.71/1.11  useeqfact =         0
% 0.71/1.11  usefactor =         1
% 0.71/1.11  usesimpsplitting =  0
% 0.71/1.11  usesimpdemod =      0
% 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 =          standard
% 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] =  liftord
% 0.71/1.11  
% 0.71/1.11  termordering =      none
% 0.71/1.11  
% 0.71/1.11  litapriori =        1
% 0.71/1.11  termapriori =       0
% 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 =         none
% 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:20, a:1, s:1, b:0), 
% 0.71/1.11  !  [4, 1]      (w:0, o:14, 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  agatha  [39, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.71/1.11  lives  [40, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.71/1.11  butler  [41, 0]      (w:1, o:10, a:1, s:1, b:0), 
% 0.71/1.11  charles  [42, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 0.71/1.11  killed  [45, 2]      (w:1, o:45, a:1, s:1, b:0), 
% 0.71/1.11  richer  [46, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.71/1.11  hates  [47, 2]      (w:1, o:47, 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( 1, [ lives( butler ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 3, [ ~( killed( X, Y ) ), ~( richer( X, Y ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 4, [ ~( hates( agatha, X ) ), ~( hates( charles, X ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 5, [ ~( hates( X, agatha ) ), ~( hates( X, butler ) ), ~( hates( X
% 0.71/1.11    , charles ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 6, [ hates( agatha, agatha ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 7, [ hates( agatha, charles ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 8, [ ~( killed( X, Y ) ), hates( X, Y ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 9, [ ~( hates( agatha, X ) ), hates( butler, X ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 10, [ ~( lives( X ) ), richer( X, agatha ), hates( butler, X ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 11, [ killed( butler, agatha ), killed( charles, agatha ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 12, [ ~( killed( charles, X ) ), ~( hates( agatha, X ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 14, [ ~( killed( charles, agatha ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 16, [ ~( hates( butler, agatha ) ), ~( hates( butler, butler ) ) ]
% 0.71/1.11     )
% 0.71/1.11  .
% 0.71/1.11  clause( 20, [ richer( butler, agatha ), ~( hates( butler, agatha ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 24, [ ~( killed( butler, agatha ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 25, [] )
% 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( 27, [ lives( agatha ) ] )
% 0.71/1.11  , clause( 28, [ lives( butler ) ] )
% 0.71/1.11  , clause( 29, [ lives( charles ) ] )
% 0.71/1.11  , clause( 30, [ ~( killed( X, Y ) ), ~( richer( X, Y ) ) ] )
% 0.71/1.11  , clause( 31, [ ~( hates( agatha, X ) ), ~( hates( charles, X ) ) ] )
% 0.71/1.11  , clause( 32, [ ~( hates( X, agatha ) ), ~( hates( X, butler ) ), ~( hates( 
% 0.71/1.11    X, charles ) ) ] )
% 0.71/1.11  , clause( 33, [ hates( agatha, agatha ) ] )
% 0.71/1.11  , clause( 34, [ hates( agatha, charles ) ] )
% 0.71/1.11  , clause( 35, [ ~( killed( X, Y ) ), hates( X, Y ) ] )
% 0.71/1.11  , clause( 36, [ ~( hates( agatha, X ) ), hates( butler, X ) ] )
% 0.71/1.11  , clause( 37, [ ~( lives( X ) ), richer( X, agatha ), hates( butler, X ) ]
% 0.71/1.11     )
% 0.71/1.11  , clause( 38, [ killed( butler, agatha ), killed( charles, agatha ) ] )
% 0.71/1.11  ] ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 1, [ lives( butler ) ] )
% 0.71/1.11  , clause( 28, [ lives( butler ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 3, [ ~( killed( X, Y ) ), ~( richer( X, Y ) ) ] )
% 0.71/1.11  , clause( 30, [ ~( killed( X, Y ) ), ~( richer( X, Y ) ) ] )
% 0.71/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.11     ), ==>( 1, 1 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 4, [ ~( hates( agatha, X ) ), ~( hates( charles, X ) ) ] )
% 0.71/1.11  , clause( 31, [ ~( hates( agatha, X ) ), ~( hates( charles, X ) ) ] )
% 0.71/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.71/1.11    1 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 5, [ ~( hates( X, agatha ) ), ~( hates( X, butler ) ), ~( hates( X
% 0.71/1.11    , charles ) ) ] )
% 0.71/1.11  , clause( 32, [ ~( hates( X, agatha ) ), ~( hates( X, butler ) ), ~( hates( 
% 0.71/1.11    X, charles ) ) ] )
% 0.71/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.71/1.11    1 ), ==>( 2, 2 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 6, [ hates( agatha, agatha ) ] )
% 0.71/1.11  , clause( 33, [ hates( agatha, agatha ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 7, [ hates( agatha, charles ) ] )
% 0.71/1.11  , clause( 34, [ hates( agatha, charles ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 8, [ ~( killed( X, Y ) ), hates( X, Y ) ] )
% 0.71/1.11  , clause( 35, [ ~( killed( X, Y ) ), hates( X, Y ) ] )
% 0.71/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.11     ), ==>( 1, 1 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 9, [ ~( hates( agatha, X ) ), hates( butler, X ) ] )
% 0.71/1.11  , clause( 36, [ ~( hates( agatha, X ) ), hates( butler, X ) ] )
% 0.71/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.71/1.11    1 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 10, [ ~( lives( X ) ), richer( X, agatha ), hates( butler, X ) ] )
% 0.71/1.11  , clause( 37, [ ~( lives( X ) ), richer( X, agatha ), hates( butler, X ) ]
% 0.71/1.11     )
% 0.71/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.71/1.11    1 ), ==>( 2, 2 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 11, [ killed( butler, agatha ), killed( charles, agatha ) ] )
% 0.71/1.11  , clause( 38, [ killed( butler, agatha ), killed( charles, agatha ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.71/1.11     ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  resolution(
% 0.71/1.11  clause( 40, [ ~( hates( agatha, X ) ), ~( killed( charles, X ) ) ] )
% 0.71/1.11  , clause( 4, [ ~( hates( agatha, X ) ), ~( hates( charles, X ) ) ] )
% 0.71/1.11  , 1, clause( 8, [ ~( killed( X, Y ) ), hates( X, Y ) ] )
% 0.71/1.11  , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, charles )
% 0.71/1.11    , :=( Y, X )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 12, [ ~( killed( charles, X ) ), ~( hates( agatha, X ) ) ] )
% 0.71/1.11  , clause( 40, [ ~( hates( agatha, X ) ), ~( killed( charles, X ) ) ] )
% 0.71/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 
% 0.71/1.11    0 )] ) ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  resolution(
% 0.71/1.11  clause( 41, [ ~( killed( charles, agatha ) ) ] )
% 0.71/1.11  , clause( 12, [ ~( killed( charles, X ) ), ~( hates( agatha, X ) ) ] )
% 0.71/1.11  , 1, clause( 6, [ hates( agatha, agatha ) ] )
% 0.71/1.11  , 0, substitution( 0, [ :=( X, agatha )] ), substitution( 1, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 14, [ ~( killed( charles, agatha ) ) ] )
% 0.71/1.11  , clause( 41, [ ~( killed( charles, agatha ) ) ] )
% 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( 44, [ ~( hates( butler, agatha ) ), ~( hates( butler, butler ) ), 
% 0.71/1.11    ~( hates( agatha, charles ) ) ] )
% 0.71/1.11  , clause( 5, [ ~( hates( X, agatha ) ), ~( hates( X, butler ) ), ~( hates( 
% 0.71/1.11    X, charles ) ) ] )
% 0.71/1.11  , 2, clause( 9, [ ~( hates( agatha, X ) ), hates( butler, X ) ] )
% 0.71/1.11  , 1, substitution( 0, [ :=( X, butler )] ), substitution( 1, [ :=( X, 
% 0.71/1.11    charles )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  resolution(
% 0.71/1.11  clause( 45, [ ~( hates( butler, agatha ) ), ~( hates( butler, butler ) ) ]
% 0.71/1.11     )
% 0.71/1.11  , clause( 44, [ ~( hates( butler, agatha ) ), ~( hates( butler, butler ) )
% 0.71/1.11    , ~( hates( agatha, charles ) ) ] )
% 0.71/1.11  , 2, clause( 7, [ hates( agatha, charles ) ] )
% 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( 16, [ ~( hates( butler, agatha ) ), ~( hates( butler, butler ) ) ]
% 0.71/1.11     )
% 0.71/1.11  , clause( 45, [ ~( hates( butler, agatha ) ), ~( hates( butler, butler ) )
% 0.71/1.11     ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.71/1.11     ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  resolution(
% 0.71/1.11  clause( 47, [ ~( hates( butler, agatha ) ), ~( lives( butler ) ), richer( 
% 0.71/1.11    butler, agatha ) ] )
% 0.71/1.11  , clause( 16, [ ~( hates( butler, agatha ) ), ~( hates( butler, butler ) )
% 0.71/1.11     ] )
% 0.71/1.11  , 1, clause( 10, [ ~( lives( X ) ), richer( X, agatha ), hates( butler, X )
% 0.71/1.11     ] )
% 0.71/1.11  , 2, substitution( 0, [] ), substitution( 1, [ :=( X, butler )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  resolution(
% 0.71/1.11  clause( 48, [ ~( hates( butler, agatha ) ), richer( butler, agatha ) ] )
% 0.71/1.11  , clause( 47, [ ~( hates( butler, agatha ) ), ~( lives( butler ) ), richer( 
% 0.71/1.11    butler, agatha ) ] )
% 0.71/1.11  , 1, clause( 1, [ lives( butler ) ] )
% 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( 20, [ richer( butler, agatha ), ~( hates( butler, agatha ) ) ] )
% 0.71/1.11  , clause( 48, [ ~( hates( butler, agatha ) ), richer( butler, agatha ) ] )
% 0.71/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.71/1.11     ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  resolution(
% 0.71/1.11  clause( 49, [ richer( butler, agatha ), ~( killed( butler, agatha ) ) ] )
% 0.71/1.11  , clause( 20, [ richer( butler, agatha ), ~( hates( butler, agatha ) ) ] )
% 0.71/1.11  , 1, clause( 8, [ ~( killed( X, Y ) ), hates( X, Y ) ] )
% 0.71/1.11  , 1, substitution( 0, [] ), substitution( 1, [ :=( X, butler ), :=( Y, 
% 0.71/1.11    agatha )] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  resolution(
% 0.71/1.11  clause( 50, [ ~( killed( butler, agatha ) ), ~( killed( butler, agatha ) )
% 0.71/1.11     ] )
% 0.71/1.11  , clause( 3, [ ~( killed( X, Y ) ), ~( richer( X, Y ) ) ] )
% 0.71/1.11  , 1, clause( 49, [ richer( butler, agatha ), ~( killed( butler, agatha ) )
% 0.71/1.11     ] )
% 0.71/1.11  , 0, substitution( 0, [ :=( X, butler ), :=( Y, agatha )] ), substitution( 
% 0.71/1.11    1, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  factor(
% 0.71/1.11  clause( 51, [ ~( killed( butler, agatha ) ) ] )
% 0.71/1.11  , clause( 50, [ ~( killed( butler, agatha ) ), ~( killed( butler, agatha )
% 0.71/1.11     ) ] )
% 0.71/1.11  , 0, 1, substitution( 0, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 24, [ ~( killed( butler, agatha ) ) ] )
% 0.71/1.11  , clause( 51, [ ~( killed( butler, agatha ) ) ] )
% 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( 52, [ killed( charles, agatha ) ] )
% 0.71/1.11  , clause( 24, [ ~( killed( butler, agatha ) ) ] )
% 0.71/1.11  , 0, clause( 11, [ killed( butler, agatha ), killed( charles, agatha ) ] )
% 0.71/1.11  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  resolution(
% 0.71/1.11  clause( 53, [] )
% 0.71/1.11  , clause( 14, [ ~( killed( charles, agatha ) ) ] )
% 0.71/1.11  , 0, clause( 52, [ killed( charles, agatha ) ] )
% 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( 25, [] )
% 0.71/1.11  , clause( 53, [] )
% 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:        363
% 0.71/1.11  space for clauses:      1360
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  clauses generated:      29
% 0.71/1.11  clauses kept:           26
% 0.71/1.11  clauses selected:       20
% 0.71/1.11  clauses deleted:        1
% 0.71/1.11  clauses inuse deleted:  0
% 0.71/1.11  
% 0.71/1.11  subsentry:          13
% 0.71/1.11  literals s-matched: 3
% 0.71/1.11  literals matched:   3
% 0.71/1.11  full subsumption:   0
% 0.71/1.11  
% 0.71/1.11  checksum:           -537589782
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  Bliksem ended
%------------------------------------------------------------------------------