TSTP Solution File: LCL117-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL117-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n014.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:50:34 EDT 2022
% Result : Unsatisfiable 0.40s 1.05s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL117-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Mon Jul 4 23:27:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/1.05 *** allocated 10000 integers for termspace/termends
% 0.40/1.05 *** allocated 10000 integers for clauses
% 0.40/1.05 *** allocated 10000 integers for justifications
% 0.40/1.05 Bliksem 1.12
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 Automatic Strategy Selection
% 0.40/1.05
% 0.40/1.05 Clauses:
% 0.40/1.05 [
% 0.40/1.05 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.40/1.05 'is_a_theorem'( Y ) ],
% 0.40/1.05 [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( equivalent(
% 0.40/1.05 Z, Y ), equivalent( Z, X ) ) ) ) ],
% 0.40/1.05 [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b ),
% 0.40/1.05 equivalent( a, c ) ), equivalent( c, b ) ) ) ) ]
% 0.40/1.05 ] .
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 percentage equality = 0.000000, percentage horn = 1.000000
% 0.40/1.05 This is a near-Horn, non-equality problem
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 Options Used:
% 0.40/1.05
% 0.40/1.05 useres = 1
% 0.40/1.05 useparamod = 0
% 0.40/1.05 useeqrefl = 0
% 0.40/1.05 useeqfact = 0
% 0.40/1.05 usefactor = 1
% 0.40/1.05 usesimpsplitting = 0
% 0.40/1.05 usesimpdemod = 0
% 0.40/1.05 usesimpres = 4
% 0.40/1.05
% 0.40/1.05 resimpinuse = 1000
% 0.40/1.05 resimpclauses = 20000
% 0.40/1.05 substype = standard
% 0.40/1.05 backwardsubs = 1
% 0.40/1.05 selectoldest = 5
% 0.40/1.05
% 0.40/1.05 litorderings [0] = split
% 0.40/1.05 litorderings [1] = liftord
% 0.40/1.05
% 0.40/1.05 termordering = none
% 0.40/1.05
% 0.40/1.05 litapriori = 1
% 0.40/1.05 termapriori = 0
% 0.40/1.05 litaposteriori = 0
% 0.40/1.05 termaposteriori = 0
% 0.40/1.05 demodaposteriori = 0
% 0.40/1.05 ordereqreflfact = 0
% 0.40/1.05
% 0.40/1.05 litselect = negative
% 0.40/1.05
% 0.40/1.05 maxweight = 30000
% 0.40/1.05 maxdepth = 30000
% 0.40/1.05 maxlength = 115
% 0.40/1.05 maxnrvars = 195
% 0.40/1.05 excuselevel = 0
% 0.40/1.05 increasemaxweight = 0
% 0.40/1.05
% 0.40/1.05 maxselected = 10000000
% 0.40/1.05 maxnrclauses = 10000000
% 0.40/1.05
% 0.40/1.05 showgenerated = 0
% 0.40/1.05 showkept = 0
% 0.40/1.05 showselected = 0
% 0.40/1.05 showdeleted = 0
% 0.40/1.05 showresimp = 1
% 0.40/1.05 showstatus = 2000
% 0.40/1.05
% 0.40/1.05 prologoutput = 1
% 0.40/1.05 nrgoals = 5000000
% 0.40/1.05 totalproof = 1
% 0.40/1.05
% 0.40/1.05 Symbols occurring in the translation:
% 0.40/1.05
% 0.40/1.05 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.40/1.05 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.40/1.05 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.40/1.05 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.40/1.05 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.40/1.05 equivalent [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.40/1.05 'is_a_theorem' [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.40/1.05 a [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.40/1.05 b [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.40/1.05 c [46, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 Starting Search:
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 Bliksems!, er is een bewijs:
% 0.40/1.05 % SZS status Unsatisfiable
% 0.40/1.05 % SZS output start Refutation
% 0.40/1.05
% 0.40/1.05 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.40/1.05 , ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.05 .
% 0.40/1.05 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.05 equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.40/1.05 .
% 0.40/1.05 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.40/1.05 , equivalent( a, c ) ), equivalent( c, b ) ) ) ) ] )
% 0.40/1.05 .
% 0.40/1.05 clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.40/1.05 equivalent( X, Y ), equivalent( equivalent( Z, Y ), equivalent( Z, X ) )
% 0.40/1.05 ), T ) ) ) ] )
% 0.40/1.05 .
% 0.40/1.05 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.05 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( T
% 0.40/1.05 , Z ) ) ) ) ] )
% 0.40/1.05 .
% 0.40/1.05 clause( 5, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.40/1.05 , Y ) ) ) ] )
% 0.40/1.05 .
% 0.40/1.05 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.40/1.05 equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.40/1.05 .
% 0.40/1.05 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.05 equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ] )
% 0.40/1.05 .
% 0.40/1.05 clause( 11, [] )
% 0.40/1.05 .
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 % SZS output end Refutation
% 0.40/1.05 found a proof!
% 0.40/1.05
% 0.40/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.40/1.05
% 0.40/1.05 initialclauses(
% 0.40/1.05 [ clause( 13, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.40/1.05 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.40/1.05 , clause( 14, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.05 equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.40/1.05 , clause( 15, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b
% 0.40/1.05 ), equivalent( a, c ) ), equivalent( c, b ) ) ) ) ] )
% 0.40/1.05 ] ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 subsumption(
% 0.40/1.05 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.40/1.05 , ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.05 , clause( 13, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.40/1.05 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.40/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.40/1.05 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 subsumption(
% 0.40/1.05 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.05 equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.40/1.05 , clause( 14, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.05 equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.40/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.40/1.05 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 subsumption(
% 0.40/1.05 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.40/1.05 , equivalent( a, c ) ), equivalent( c, b ) ) ) ) ] )
% 0.40/1.05 , clause( 15, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b
% 0.40/1.05 ), equivalent( a, c ) ), equivalent( c, b ) ) ) ) ] )
% 0.40/1.05 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 resolution(
% 0.40/1.05 clause( 17, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.40/1.05 , equivalent( equivalent( Z, Y ), equivalent( Z, X ) ) ), T ) ) ),
% 0.40/1.05 'is_a_theorem'( T ) ] )
% 0.40/1.05 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.40/1.05 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.05 , 2, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.40/1.05 equivalent( equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.40/1.05 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.05 equivalent( Z, Y ), equivalent( Z, X ) ) ) ), :=( Y, T )] ),
% 0.40/1.05 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 subsumption(
% 0.40/1.05 clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.40/1.05 equivalent( X, Y ), equivalent( equivalent( Z, Y ), equivalent( Z, X ) )
% 0.40/1.05 ), T ) ) ) ] )
% 0.40/1.05 , clause( 17, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.40/1.05 ), equivalent( equivalent( Z, Y ), equivalent( Z, X ) ) ), T ) ) ),
% 0.40/1.05 'is_a_theorem'( T ) ] )
% 0.40/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.40/1.05 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 resolution(
% 0.40/1.05 clause( 18, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.05 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( T
% 0.40/1.05 , Z ) ) ) ) ] )
% 0.40/1.05 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.05 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, Y ),
% 0.40/1.05 equivalent( Z, X ) ) ), T ) ) ) ] )
% 0.40/1.05 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.40/1.05 equivalent( equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.40/1.05 , 0, substitution( 0, [ :=( X, T ), :=( Y, Z ), :=( Z, Y ), :=( T,
% 0.40/1.05 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y
% 0.40/1.05 , T ) ) ), equivalent( X, equivalent( T, Z ) ) ) )] ), substitution( 1, [
% 0.40/1.05 :=( X, equivalent( T, Z ) ), :=( Y, equivalent( equivalent( Y, Z ),
% 0.40/1.05 equivalent( Y, T ) ) ), :=( Z, X )] )).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 subsumption(
% 0.40/1.05 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.05 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( T
% 0.40/1.05 , Z ) ) ) ) ] )
% 0.40/1.05 , clause( 18, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.05 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( T
% 0.40/1.05 , Z ) ) ) ) ] )
% 0.40/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.40/1.05 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 resolution(
% 0.40/1.05 clause( 19, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.40/1.05 , Y ) ) ) ] )
% 0.40/1.05 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.05 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, Y ),
% 0.40/1.05 equivalent( Z, X ) ) ), T ) ) ) ] )
% 0.40/1.05 , 1, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.05 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( T
% 0.40/1.05 , Z ) ) ) ) ] )
% 0.40/1.05 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T,
% 0.40/1.05 equivalent( equivalent( X, Y ), equivalent( X, Y ) ) )] ), substitution(
% 0.40/1.05 1, [ :=( X, equivalent( X, Y ) ), :=( Y, Z ), :=( Z, Y ), :=( T, X )] )
% 0.40/1.05 ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 subsumption(
% 0.40/1.05 clause( 5, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.40/1.05 , Y ) ) ) ] )
% 0.40/1.05 , clause( 19, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.05 X, Y ) ) ) ] )
% 0.40/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.40/1.05 )] ) ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 resolution(
% 0.40/1.05 clause( 21, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.40/1.05 , equivalent( X, Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.40/1.05 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.40/1.05 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.05 , 2, clause( 5, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.40/1.05 equivalent( X, Y ) ) ) ] )
% 0.40/1.05 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.05 X, Y ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.40/1.05 ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 subsumption(
% 0.40/1.05 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.40/1.05 equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.40/1.05 , clause( 21, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.40/1.05 ), equivalent( X, Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.40/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.40/1.05 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 resolution(
% 0.40/1.05 clause( 22, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.05 equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ] )
% 0.40/1.05 , clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.05 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.40/1.05 , 1, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.05 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( T
% 0.40/1.05 , Z ) ) ) ) ] )
% 0.40/1.05 , 0, substitution( 0, [ :=( X, equivalent( X, Y ) ), :=( Y, equivalent( X,
% 0.40/1.05 Z ) ), :=( Z, equivalent( equivalent( equivalent( X, Y ), equivalent( X,
% 0.40/1.05 Z ) ), equivalent( Z, Y ) ) )] ), substitution( 1, [ :=( X, equivalent(
% 0.40/1.05 equivalent( X, Y ), equivalent( X, Z ) ) ), :=( Y, X ), :=( Z, Y ), :=( T
% 0.40/1.05 , Z )] )).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 subsumption(
% 0.40/1.05 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.05 equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ] )
% 0.40/1.05 , clause( 22, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.40/1.05 , equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ] )
% 0.40/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.40/1.05 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 resolution(
% 0.40/1.05 clause( 23, [] )
% 0.40/1.05 , clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b
% 0.40/1.05 ), equivalent( a, c ) ), equivalent( c, b ) ) ) ) ] )
% 0.40/1.05 , 0, clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.40/1.05 ), equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ] )
% 0.40/1.05 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.40/1.05 Z, c )] )).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 subsumption(
% 0.40/1.05 clause( 11, [] )
% 0.40/1.05 , clause( 23, [] )
% 0.40/1.05 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 end.
% 0.40/1.05
% 0.40/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.40/1.05
% 0.40/1.05 Memory use:
% 0.40/1.05
% 0.40/1.05 space for terms: 227
% 0.40/1.05 space for clauses: 1086
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 clauses generated: 15
% 0.40/1.05 clauses kept: 12
% 0.40/1.05 clauses selected: 8
% 0.40/1.05 clauses deleted: 0
% 0.40/1.05 clauses inuse deleted: 0
% 0.40/1.05
% 0.40/1.05 subsentry: 10
% 0.40/1.05 literals s-matched: 3
% 0.40/1.05 literals matched: 3
% 0.40/1.05 full subsumption: 0
% 0.40/1.05
% 0.40/1.05 checksum: 814767385
% 0.40/1.05
% 0.40/1.05
% 0.40/1.05 Bliksem ended
%------------------------------------------------------------------------------