%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV259-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n032.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 : Wed Jul 20 16:23:19 EDT 2022
% Result : Unsatisfiable 0.55s 0.93s
% Output : Refutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV259-2 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.10 % Command : bliksem %s
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % DateTime : Wed Jun 15 10:56:28 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.55/0.93 *** allocated 10000 integers for termspace/termends
% 0.55/0.93 *** allocated 10000 integers for clauses
% 0.55/0.93 *** allocated 10000 integers for justifications
% 0.55/0.93 Bliksem 1.12
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 Automatic Strategy Selection
% 0.55/0.93
% 0.55/0.93 Clauses:
% 0.55/0.93 [
% 0.55/0.93 [ ~( 'c_lessequals'( 'c_Message_Oparts'( 'v_H' ), 'c_Message_Oparts'(
% 0.55/0.93 'c_insert'( 'v_X', 'v_H', 'tc_Message_Omsg' ) ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ) ) ],
% 0.55/0.93 [ ~( 'c_lessequals'( 'c_Message_Oparts'( X ), 'c_Message_Oparts'( Y ),
% 0.55/0.93 'tc_set'( 'tc_Message_Omsg' ) ) ), 'c_lessequals'( X, 'c_Message_Oparts'(
% 0.55/0.93 Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ],
% 0.55/0.93 [ ~( 'c_lessequals'( X, 'c_Message_Oparts'( Y ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ) ), 'c_lessequals'( 'c_Message_Oparts'( X ),
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ],
% 0.55/0.93 [ ~( 'c_lessequals'( 'c_insert'( X, Y, Z ), T, 'tc_set'( Z ) ) ),
% 0.55/0.93 'c_lessequals'( Y, T, 'tc_set'( Z ) ) ],
% 0.55/0.93 [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ]
% 0.55/0.93 ] .
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 percentage equality = 0.000000, percentage horn = 1.000000
% 0.55/0.93 This is a near-Horn, non-equality problem
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 Options Used:
% 0.55/0.93
% 0.55/0.93 useres = 1
% 0.55/0.93 useparamod = 0
% 0.55/0.93 useeqrefl = 0
% 0.55/0.93 useeqfact = 0
% 0.55/0.93 usefactor = 1
% 0.55/0.93 usesimpsplitting = 0
% 0.55/0.93 usesimpdemod = 0
% 0.55/0.93 usesimpres = 4
% 0.55/0.93
% 0.55/0.93 resimpinuse = 1000
% 0.55/0.93 resimpclauses = 20000
% 0.55/0.93 substype = standard
% 0.55/0.93 backwardsubs = 1
% 0.55/0.93 selectoldest = 5
% 0.55/0.93
% 0.55/0.93 litorderings [0] = split
% 0.55/0.93 litorderings [1] = liftord
% 0.55/0.93
% 0.55/0.93 termordering = none
% 0.55/0.93
% 0.55/0.93 litapriori = 1
% 0.55/0.93 termapriori = 0
% 0.55/0.93 litaposteriori = 0
% 0.55/0.93 termaposteriori = 0
% 0.55/0.93 demodaposteriori = 0
% 0.55/0.93 ordereqreflfact = 0
% 0.55/0.93
% 0.55/0.93 litselect = negative
% 0.55/0.93
% 0.55/0.93 maxweight = 30000
% 0.55/0.93 maxdepth = 30000
% 0.55/0.93 maxlength = 115
% 0.55/0.93 maxnrvars = 195
% 0.55/0.93 excuselevel = 0
% 0.55/0.93 increasemaxweight = 0
% 0.55/0.93
% 0.55/0.93 maxselected = 10000000
% 0.55/0.93 maxnrclauses = 10000000
% 0.55/0.93
% 0.55/0.93 showgenerated = 0
% 0.55/0.93 showkept = 0
% 0.55/0.93 showselected = 0
% 0.55/0.93 showdeleted = 0
% 0.55/0.93 showresimp = 1
% 0.55/0.93 showstatus = 2000
% 0.55/0.93
% 0.55/0.93 prologoutput = 1
% 0.55/0.93 nrgoals = 5000000
% 0.55/0.93 totalproof = 1
% 0.55/0.93
% 0.55/0.93 Symbols occurring in the translation:
% 0.55/0.93
% 0.55/0.93 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.55/0.93 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.55/0.93 ! [4, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.55/0.93 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.55/0.93 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.55/0.93 'v_H' [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.55/0.93 'c_Message_Oparts' [40, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.55/0.93 'v_X' [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.55/0.93 'tc_Message_Omsg' [42, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.55/0.93 'c_insert' [43, 3] (w:1, o:50, a:1, s:1, b:0),
% 0.55/0.93 'tc_set' [44, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.55/0.93 'c_lessequals' [45, 3] (w:1, o:51, a:1, s:1, b:0).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 Starting Search:
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 Bliksems!, er is een bewijs:
% 0.55/0.93 % SZS status Unsatisfiable
% 0.55/0.93 % SZS output start Refutation
% 0.55/0.93
% 0.55/0.93 clause( 0, [ ~( 'c_lessequals'( 'c_Message_Oparts'( 'v_H' ),
% 0.55/0.93 'c_Message_Oparts'( 'c_insert'( 'v_X', 'v_H', 'tc_Message_Omsg' ) ),
% 0.55/0.93 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 .
% 0.55/0.93 clause( 1, [ 'c_lessequals'( X, 'c_Message_Oparts'( Y ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ), ~( 'c_lessequals'( 'c_Message_Oparts'( X ),
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 .
% 0.55/0.93 clause( 2, [ 'c_lessequals'( 'c_Message_Oparts'( X ), 'c_Message_Oparts'( Y
% 0.55/0.93 ), 'tc_set'( 'tc_Message_Omsg' ) ), ~( 'c_lessequals'( X,
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 .
% 0.55/0.93 clause( 3, [ 'c_lessequals'( Y, T, 'tc_set'( Z ) ), ~( 'c_lessequals'(
% 0.55/0.93 'c_insert'( X, Y, Z ), T, 'tc_set'( Z ) ) ) ] )
% 0.55/0.93 .
% 0.55/0.93 clause( 4, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.55/0.93 .
% 0.55/0.93 clause( 8, [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 .
% 0.55/0.93 clause( 10, [ 'c_lessequals'( X, 'c_Message_Oparts'( 'c_insert'( Y, X,
% 0.55/0.93 'tc_Message_Omsg' ) ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 .
% 0.55/0.93 clause( 17, [ 'c_lessequals'( 'c_Message_Oparts'( X ), 'c_Message_Oparts'(
% 0.55/0.93 'c_insert'( Y, X, 'tc_Message_Omsg' ) ), 'tc_set'( 'tc_Message_Omsg' ) )
% 0.55/0.93 ] )
% 0.55/0.93 .
% 0.55/0.93 clause( 24, [] )
% 0.55/0.93 .
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 % SZS output end Refutation
% 0.55/0.93 found a proof!
% 0.55/0.93
% 0.55/0.93 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.55/0.93
% 0.55/0.93 initialclauses(
% 0.55/0.93 [ clause( 26, [ ~( 'c_lessequals'( 'c_Message_Oparts'( 'v_H' ),
% 0.55/0.93 'c_Message_Oparts'( 'c_insert'( 'v_X', 'v_H', 'tc_Message_Omsg' ) ),
% 0.55/0.93 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 , clause( 27, [ ~( 'c_lessequals'( 'c_Message_Oparts'( X ),
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ),
% 0.55/0.93 'c_lessequals'( X, 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' )
% 0.55/0.93 ) ] )
% 0.55/0.93 , clause( 28, [ ~( 'c_lessequals'( X, 'c_Message_Oparts'( Y ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ) ), 'c_lessequals'( 'c_Message_Oparts'( X ),
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , clause( 29, [ ~( 'c_lessequals'( 'c_insert'( X, Y, Z ), T, 'tc_set'( Z )
% 0.55/0.93 ) ), 'c_lessequals'( Y, T, 'tc_set'( Z ) ) ] )
% 0.55/0.93 , clause( 30, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.55/0.93 ] ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 subsumption(
% 0.55/0.93 clause( 0, [ ~( 'c_lessequals'( 'c_Message_Oparts'( 'v_H' ),
% 0.55/0.93 'c_Message_Oparts'( 'c_insert'( 'v_X', 'v_H', 'tc_Message_Omsg' ) ),
% 0.55/0.93 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 , clause( 26, [ ~( 'c_lessequals'( 'c_Message_Oparts'( 'v_H' ),
% 0.55/0.93 'c_Message_Oparts'( 'c_insert'( 'v_X', 'v_H', 'tc_Message_Omsg' ) ),
% 0.55/0.93 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 subsumption(
% 0.55/0.93 clause( 1, [ 'c_lessequals'( X, 'c_Message_Oparts'( Y ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ), ~( 'c_lessequals'( 'c_Message_Oparts'( X ),
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 , clause( 27, [ ~( 'c_lessequals'( 'c_Message_Oparts'( X ),
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ),
% 0.55/0.93 'c_lessequals'( X, 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' )
% 0.55/0.93 ) ] )
% 0.55/0.93 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.55/0.93 ), ==>( 1, 0 )] ) ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 subsumption(
% 0.55/0.93 clause( 2, [ 'c_lessequals'( 'c_Message_Oparts'( X ), 'c_Message_Oparts'( Y
% 0.55/0.93 ), 'tc_set'( 'tc_Message_Omsg' ) ), ~( 'c_lessequals'( X,
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 , clause( 28, [ ~( 'c_lessequals'( X, 'c_Message_Oparts'( Y ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ) ), 'c_lessequals'( 'c_Message_Oparts'( X ),
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.55/0.93 ), ==>( 1, 0 )] ) ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 subsumption(
% 0.55/0.93 clause( 3, [ 'c_lessequals'( Y, T, 'tc_set'( Z ) ), ~( 'c_lessequals'(
% 0.55/0.93 'c_insert'( X, Y, Z ), T, 'tc_set'( Z ) ) ) ] )
% 0.55/0.93 , clause( 29, [ ~( 'c_lessequals'( 'c_insert'( X, Y, Z ), T, 'tc_set'( Z )
% 0.55/0.93 ) ), 'c_lessequals'( Y, T, 'tc_set'( Z ) ) ] )
% 0.55/0.93 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.55/0.93 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 subsumption(
% 0.55/0.93 clause( 4, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.55/0.93 , clause( 30, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.55/0.93 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.55/0.93 )] ) ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 resolution(
% 0.55/0.93 clause( 31, [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , clause( 1, [ 'c_lessequals'( X, 'c_Message_Oparts'( Y ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ), ~( 'c_lessequals'( 'c_Message_Oparts'( X ),
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 , 1, clause( 4, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.55/0.93 , 0, substitution( 0, [ :=( X, X ), :=( Y, X )] ), substitution( 1, [ :=( X
% 0.55/0.93 , 'c_Message_Oparts'( X ) ), :=( Y, 'tc_Message_Omsg' )] )).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 subsumption(
% 0.55/0.93 clause( 8, [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , clause( 31, [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 resolution(
% 0.55/0.93 clause( 32, [ 'c_lessequals'( X, 'c_Message_Oparts'( 'c_insert'( Y, X,
% 0.55/0.93 'tc_Message_Omsg' ) ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , clause( 3, [ 'c_lessequals'( Y, T, 'tc_set'( Z ) ), ~( 'c_lessequals'(
% 0.55/0.93 'c_insert'( X, Y, Z ), T, 'tc_set'( Z ) ) ) ] )
% 0.55/0.93 , 1, clause( 8, [ 'c_lessequals'( X, 'c_Message_Oparts'( X ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, 'tc_Message_Omsg' )
% 0.55/0.93 , :=( T, 'c_Message_Oparts'( 'c_insert'( Y, X, 'tc_Message_Omsg' ) ) )] )
% 0.55/0.93 , substitution( 1, [ :=( X, 'c_insert'( Y, X, 'tc_Message_Omsg' ) )] )
% 0.55/0.93 ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 subsumption(
% 0.55/0.93 clause( 10, [ 'c_lessequals'( X, 'c_Message_Oparts'( 'c_insert'( Y, X,
% 0.55/0.93 'tc_Message_Omsg' ) ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , clause( 32, [ 'c_lessequals'( X, 'c_Message_Oparts'( 'c_insert'( Y, X,
% 0.55/0.93 'tc_Message_Omsg' ) ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.55/0.93 )] ) ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 resolution(
% 0.55/0.93 clause( 33, [ 'c_lessequals'( 'c_Message_Oparts'( X ), 'c_Message_Oparts'(
% 0.55/0.93 'c_insert'( Y, X, 'tc_Message_Omsg' ) ), 'tc_set'( 'tc_Message_Omsg' ) )
% 0.55/0.93 ] )
% 0.55/0.93 , clause( 2, [ 'c_lessequals'( 'c_Message_Oparts'( X ), 'c_Message_Oparts'(
% 0.55/0.93 Y ), 'tc_set'( 'tc_Message_Omsg' ) ), ~( 'c_lessequals'( X,
% 0.55/0.93 'c_Message_Oparts'( Y ), 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 , 1, clause( 10, [ 'c_lessequals'( X, 'c_Message_Oparts'( 'c_insert'( Y, X
% 0.55/0.93 , 'tc_Message_Omsg' ) ), 'tc_set'( 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , 0, substitution( 0, [ :=( X, X ), :=( Y, 'c_insert'( Y, X,
% 0.55/0.93 'tc_Message_Omsg' ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.55/0.93 ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 subsumption(
% 0.55/0.93 clause( 17, [ 'c_lessequals'( 'c_Message_Oparts'( X ), 'c_Message_Oparts'(
% 0.55/0.93 'c_insert'( Y, X, 'tc_Message_Omsg' ) ), 'tc_set'( 'tc_Message_Omsg' ) )
% 0.55/0.93 ] )
% 0.55/0.93 , clause( 33, [ 'c_lessequals'( 'c_Message_Oparts'( X ), 'c_Message_Oparts'(
% 0.55/0.93 'c_insert'( Y, X, 'tc_Message_Omsg' ) ), 'tc_set'( 'tc_Message_Omsg' ) )
% 0.55/0.93 ] )
% 0.55/0.93 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.55/0.93 )] ) ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 resolution(
% 0.55/0.93 clause( 34, [] )
% 0.55/0.93 , clause( 0, [ ~( 'c_lessequals'( 'c_Message_Oparts'( 'v_H' ),
% 0.55/0.93 'c_Message_Oparts'( 'c_insert'( 'v_X', 'v_H', 'tc_Message_Omsg' ) ),
% 0.55/0.93 'tc_set'( 'tc_Message_Omsg' ) ) ) ] )
% 0.55/0.93 , 0, clause( 17, [ 'c_lessequals'( 'c_Message_Oparts'( X ),
% 0.55/0.93 'c_Message_Oparts'( 'c_insert'( Y, X, 'tc_Message_Omsg' ) ), 'tc_set'(
% 0.55/0.93 'tc_Message_Omsg' ) ) ] )
% 0.55/0.93 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, 'v_H' ), :=( Y, 'v_X'
% 0.55/0.93 )] )).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 subsumption(
% 0.55/0.93 clause( 24, [] )
% 0.55/0.93 , clause( 34, [] )
% 0.55/0.93 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 end.
% 0.55/0.93
% 0.55/0.93 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.55/0.93
% 0.55/0.93 Memory use:
% 0.55/0.93
% 0.55/0.93 space for terms: 392
% 0.55/0.93 space for clauses: 2071
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 clauses generated: 32
% 0.55/0.93 clauses kept: 25
% 0.55/0.93 clauses selected: 15
% 0.55/0.93 clauses deleted: 0
% 0.55/0.93 clauses inuse deleted: 0
% 0.55/0.93
% 0.55/0.93 subsentry: 7
% 0.55/0.93 literals s-matched: 7
% 0.55/0.93 literals matched: 7
% 0.55/0.93 full subsumption: 0
% 0.55/0.93
% 0.55/0.93 checksum: 402657047
% 0.55/0.93
% 0.55/0.93
% 0.55/0.93 Bliksem ended
%------------------------------------------------------------------------------