TSTP Solution File: GRP043-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP043-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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 : Sat Jul 16 07:34:33 EDT 2022
% Result : Unsatisfiable 0.49s 1.13s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : GRP043-2 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.16 % Command : bliksem %s
% 0.15/0.37 % Computer : n026.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % DateTime : Mon Jun 13 17:47:36 EDT 2022
% 0.15/0.38 % CPUTime :
% 0.49/1.13 *** allocated 10000 integers for termspace/termends
% 0.49/1.13 *** allocated 10000 integers for clauses
% 0.49/1.13 *** allocated 10000 integers for justifications
% 0.49/1.13 Bliksem 1.12
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Automatic Strategy Selection
% 0.49/1.13
% 0.49/1.13 Clauses:
% 0.49/1.13 [
% 0.49/1.13 [ product( identity, X, X ) ],
% 0.49/1.13 [ product( inverse( X ), X, identity ) ],
% 0.49/1.13 [ product( X, Y, multiply( X, Y ) ) ],
% 0.49/1.13 [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish( Z, T ) ]
% 0.49/1.13 ,
% 0.49/1.13 [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( Z, T, W
% 0.49/1.13 ) ), product( X, U, W ) ],
% 0.49/1.13 [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( X, U, W
% 0.49/1.13 ) ), product( Z, T, W ) ],
% 0.49/1.13 [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z, T, Y ) ]
% 0.49/1.13 ,
% 0.49/1.13 [ equalish( a, b ) ],
% 0.49/1.13 [ equalish( b, c ) ],
% 0.49/1.13 [ ~( equalish( a, c ) ) ]
% 0.49/1.13 ] .
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 percentage equality = 0.000000, percentage horn = 1.000000
% 0.49/1.13 This is a near-Horn, non-equality problem
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Options Used:
% 0.49/1.13
% 0.49/1.13 useres = 1
% 0.49/1.13 useparamod = 0
% 0.49/1.13 useeqrefl = 0
% 0.49/1.13 useeqfact = 0
% 0.49/1.13 usefactor = 1
% 0.49/1.13 usesimpsplitting = 0
% 0.49/1.13 usesimpdemod = 0
% 0.49/1.13 usesimpres = 4
% 0.49/1.13
% 0.49/1.13 resimpinuse = 1000
% 0.49/1.13 resimpclauses = 20000
% 0.49/1.13 substype = standard
% 0.49/1.13 backwardsubs = 1
% 0.49/1.13 selectoldest = 5
% 0.49/1.13
% 0.49/1.13 litorderings [0] = split
% 0.49/1.13 litorderings [1] = liftord
% 0.49/1.13
% 0.49/1.13 termordering = none
% 0.49/1.13
% 0.49/1.13 litapriori = 1
% 0.49/1.13 termapriori = 0
% 0.49/1.13 litaposteriori = 0
% 0.49/1.13 termaposteriori = 0
% 0.49/1.13 demodaposteriori = 0
% 0.49/1.13 ordereqreflfact = 0
% 0.49/1.13
% 0.49/1.13 litselect = negative
% 0.49/1.13
% 0.49/1.13 maxweight = 30000
% 0.49/1.13 maxdepth = 30000
% 0.49/1.13 maxlength = 115
% 0.49/1.13 maxnrvars = 195
% 0.49/1.13 excuselevel = 0
% 0.49/1.13 increasemaxweight = 0
% 0.49/1.13
% 0.49/1.13 maxselected = 10000000
% 0.49/1.13 maxnrclauses = 10000000
% 0.49/1.13
% 0.49/1.13 showgenerated = 0
% 0.49/1.13 showkept = 0
% 0.49/1.13 showselected = 0
% 0.49/1.13 showdeleted = 0
% 0.49/1.13 showresimp = 1
% 0.49/1.13 showstatus = 2000
% 0.49/1.13
% 0.49/1.13 prologoutput = 1
% 0.49/1.13 nrgoals = 5000000
% 0.49/1.13 totalproof = 1
% 0.49/1.13
% 0.49/1.13 Symbols occurring in the translation:
% 0.49/1.13
% 0.49/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.49/1.13 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.49/1.13 ! [4, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.49/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.49/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.49/1.13 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.49/1.13 product [41, 3] (w:1, o:52, a:1, s:1, b:0),
% 0.49/1.13 inverse [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.49/1.13 multiply [44, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.49/1.13 equalish [47, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.49/1.13 a [50, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.49/1.13 b [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.49/1.13 c [52, 0] (w:1, o:18, a:1, s:1, b:0).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Starting Search:
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Bliksems!, er is een bewijs:
% 0.49/1.13 % SZS status Unsatisfiable
% 0.49/1.13 % SZS output start Refutation
% 0.49/1.13
% 0.49/1.13 clause( 0, [ product( identity, X, X ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y, T
% 0.49/1.13 ) ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 6, [ ~( equalish( X, Y ) ), product( Z, T, Y ), ~( product( Z, T, X
% 0.49/1.13 ) ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 7, [ equalish( a, b ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 8, [ equalish( b, c ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 9, [ ~( equalish( a, c ) ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 22, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 47, [ product( identity, X, Y ), ~( equalish( X, Y ) ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 52, [ product( identity, a, b ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 53, [ product( identity, b, c ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 58, [ equalish( b, a ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 73, [ equalish( c, b ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 75, [ product( identity, c, b ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 77, [ product( identity, c, X ), ~( equalish( b, X ) ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 229, [ product( identity, c, a ) ] )
% 0.49/1.13 .
% 0.49/1.13 clause( 237, [] )
% 0.49/1.13 .
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 % SZS output end Refutation
% 0.49/1.13 found a proof!
% 0.49/1.13
% 0.49/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.49/1.13
% 0.49/1.13 initialclauses(
% 0.49/1.13 [ clause( 239, [ product( identity, X, X ) ] )
% 0.49/1.13 , clause( 240, [ product( inverse( X ), X, identity ) ] )
% 0.49/1.13 , clause( 241, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.49/1.13 , clause( 242, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish(
% 0.49/1.13 Z, T ) ] )
% 0.49/1.13 , clause( 243, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.49/1.13 product( Z, T, W ) ), product( X, U, W ) ] )
% 0.49/1.13 , clause( 244, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~(
% 0.49/1.13 product( X, U, W ) ), product( Z, T, W ) ] )
% 0.49/1.13 , clause( 245, [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z
% 0.49/1.13 , T, Y ) ] )
% 0.49/1.13 , clause( 246, [ equalish( a, b ) ] )
% 0.49/1.13 , clause( 247, [ equalish( b, c ) ] )
% 0.49/1.13 , clause( 248, [ ~( equalish( a, c ) ) ] )
% 0.49/1.13 ] ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 0, [ product( identity, X, X ) ] )
% 0.49/1.13 , clause( 239, [ product( identity, X, X ) ] )
% 0.49/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y, T
% 0.49/1.13 ) ) ] )
% 0.49/1.13 , clause( 242, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish(
% 0.49/1.13 Z, T ) ] )
% 0.49/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.49/1.13 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 2 ), ==>( 2, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 6, [ ~( equalish( X, Y ) ), product( Z, T, Y ), ~( product( Z, T, X
% 0.49/1.13 ) ) ] )
% 0.49/1.13 , clause( 245, [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z
% 0.49/1.13 , T, Y ) ] )
% 0.49/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.49/1.13 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 7, [ equalish( a, b ) ] )
% 0.49/1.13 , clause( 246, [ equalish( a, b ) ] )
% 0.49/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 8, [ equalish( b, c ) ] )
% 0.49/1.13 , clause( 247, [ equalish( b, c ) ] )
% 0.49/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 9, [ ~( equalish( a, c ) ) ] )
% 0.49/1.13 , clause( 248, [ ~( equalish( a, c ) ) ] )
% 0.49/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 287, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.49/1.13 , clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y
% 0.49/1.13 , T ) ) ] )
% 0.49/1.13 , 2, clause( 0, [ product( identity, X, X ) ] )
% 0.49/1.13 , 0, substitution( 0, [ :=( X, identity ), :=( Y, Y ), :=( Z, X ), :=( T, Y
% 0.49/1.13 )] ), substitution( 1, [ :=( X, Y )] )).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 22, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.49/1.13 , clause( 287, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.49/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.49/1.13 ), ==>( 1, 1 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 288, [ ~( equalish( X, Y ) ), product( identity, X, Y ) ] )
% 0.49/1.13 , clause( 6, [ ~( equalish( X, Y ) ), product( Z, T, Y ), ~( product( Z, T
% 0.49/1.13 , X ) ) ] )
% 0.49/1.13 , 2, clause( 0, [ product( identity, X, X ) ] )
% 0.49/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, identity ), :=( T, X
% 0.49/1.13 )] ), substitution( 1, [ :=( X, X )] )).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 47, [ product( identity, X, Y ), ~( equalish( X, Y ) ) ] )
% 0.49/1.13 , clause( 288, [ ~( equalish( X, Y ) ), product( identity, X, Y ) ] )
% 0.49/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.49/1.13 ), ==>( 1, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 289, [ product( identity, a, b ) ] )
% 0.49/1.13 , clause( 47, [ product( identity, X, Y ), ~( equalish( X, Y ) ) ] )
% 0.49/1.13 , 1, clause( 7, [ equalish( a, b ) ] )
% 0.49/1.13 , 0, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.49/1.13 ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 52, [ product( identity, a, b ) ] )
% 0.49/1.13 , clause( 289, [ product( identity, a, b ) ] )
% 0.49/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 290, [ product( identity, b, c ) ] )
% 0.49/1.13 , clause( 47, [ product( identity, X, Y ), ~( equalish( X, Y ) ) ] )
% 0.49/1.13 , 1, clause( 8, [ equalish( b, c ) ] )
% 0.49/1.13 , 0, substitution( 0, [ :=( X, b ), :=( Y, c )] ), substitution( 1, [] )
% 0.49/1.13 ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 53, [ product( identity, b, c ) ] )
% 0.49/1.13 , clause( 290, [ product( identity, b, c ) ] )
% 0.49/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 291, [ equalish( b, a ) ] )
% 0.49/1.13 , clause( 22, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.49/1.13 , 1, clause( 52, [ product( identity, a, b ) ] )
% 0.49/1.13 , 0, substitution( 0, [ :=( X, b ), :=( Y, a )] ), substitution( 1, [] )
% 0.49/1.13 ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 58, [ equalish( b, a ) ] )
% 0.49/1.13 , clause( 291, [ equalish( b, a ) ] )
% 0.49/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 292, [ equalish( c, b ) ] )
% 0.49/1.13 , clause( 22, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.49/1.13 , 1, clause( 53, [ product( identity, b, c ) ] )
% 0.49/1.13 , 0, substitution( 0, [ :=( X, c ), :=( Y, b )] ), substitution( 1, [] )
% 0.49/1.13 ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 73, [ equalish( c, b ) ] )
% 0.49/1.13 , clause( 292, [ equalish( c, b ) ] )
% 0.49/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 293, [ product( identity, c, b ) ] )
% 0.49/1.13 , clause( 47, [ product( identity, X, Y ), ~( equalish( X, Y ) ) ] )
% 0.49/1.13 , 1, clause( 73, [ equalish( c, b ) ] )
% 0.49/1.13 , 0, substitution( 0, [ :=( X, c ), :=( Y, b )] ), substitution( 1, [] )
% 0.49/1.13 ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 75, [ product( identity, c, b ) ] )
% 0.49/1.13 , clause( 293, [ product( identity, c, b ) ] )
% 0.49/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 294, [ ~( equalish( b, X ) ), product( identity, c, X ) ] )
% 0.49/1.13 , clause( 6, [ ~( equalish( X, Y ) ), product( Z, T, Y ), ~( product( Z, T
% 0.49/1.13 , X ) ) ] )
% 0.49/1.13 , 2, clause( 75, [ product( identity, c, b ) ] )
% 0.49/1.13 , 0, substitution( 0, [ :=( X, b ), :=( Y, X ), :=( Z, identity ), :=( T, c
% 0.49/1.13 )] ), substitution( 1, [] )).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 77, [ product( identity, c, X ), ~( equalish( b, X ) ) ] )
% 0.49/1.13 , clause( 294, [ ~( equalish( b, X ) ), product( identity, c, X ) ] )
% 0.49/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.49/1.13 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 295, [ product( identity, c, a ) ] )
% 0.49/1.13 , clause( 77, [ product( identity, c, X ), ~( equalish( b, X ) ) ] )
% 0.49/1.13 , 1, clause( 58, [ equalish( b, a ) ] )
% 0.49/1.13 , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 229, [ product( identity, c, a ) ] )
% 0.49/1.13 , clause( 295, [ product( identity, c, a ) ] )
% 0.49/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 296, [ equalish( a, c ) ] )
% 0.49/1.13 , clause( 22, [ equalish( X, Y ), ~( product( identity, Y, X ) ) ] )
% 0.49/1.13 , 1, clause( 229, [ product( identity, c, a ) ] )
% 0.49/1.13 , 0, substitution( 0, [ :=( X, a ), :=( Y, c )] ), substitution( 1, [] )
% 0.49/1.13 ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 resolution(
% 0.49/1.13 clause( 297, [] )
% 0.49/1.13 , clause( 9, [ ~( equalish( a, c ) ) ] )
% 0.49/1.13 , 0, clause( 296, [ equalish( a, c ) ] )
% 0.49/1.13 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 subsumption(
% 0.49/1.13 clause( 237, [] )
% 0.49/1.13 , clause( 297, [] )
% 0.49/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 end.
% 0.49/1.13
% 0.49/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.49/1.13
% 0.49/1.13 Memory use:
% 0.49/1.13
% 0.49/1.13 space for terms: 2744
% 0.49/1.13 space for clauses: 12716
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 clauses generated: 323
% 0.49/1.13 clauses kept: 238
% 0.49/1.13 clauses selected: 71
% 0.49/1.13 clauses deleted: 2
% 0.49/1.13 clauses inuse deleted: 0
% 0.49/1.13
% 0.49/1.13 subsentry: 1214
% 0.49/1.13 literals s-matched: 354
% 0.49/1.13 literals matched: 250
% 0.49/1.13 full subsumption: 91
% 0.49/1.13
% 0.49/1.13 checksum: -1326998355
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 Bliksem ended
%------------------------------------------------------------------------------