TSTP Solution File: LCL178-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL178-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n028.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:51:17 EDT 2022
% Result : Unsatisfiable 0.44s 1.09s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL178-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Mon Jul 4 02:29:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.09 *** allocated 10000 integers for termspace/termends
% 0.44/1.09 *** allocated 10000 integers for clauses
% 0.44/1.09 *** allocated 10000 integers for justifications
% 0.44/1.09 Bliksem 1.12
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Automatic Strategy Selection
% 0.44/1.09
% 0.44/1.09 Clauses:
% 0.44/1.09 [
% 0.44/1.09 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.44/1.09 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.44/1.09 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.44/1.09 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.44/1.09 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.44/1.09 ) ) ) ],
% 0.44/1.09 [ theorem( X ), ~( axiom( X ) ) ],
% 0.44/1.09 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.44/1.09 ,
% 0.44/1.09 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.44/1.09 theorem( or( not( Z ), Y ) ) ) ],
% 0.44/1.09 [ ~( theorem( or( not( p ), not( not( p ) ) ) ) ) ]
% 0.44/1.09 ] .
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.44/1.09 This is a near-Horn, non-equality problem
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Options Used:
% 0.44/1.09
% 0.44/1.09 useres = 1
% 0.44/1.09 useparamod = 0
% 0.44/1.09 useeqrefl = 0
% 0.44/1.09 useeqfact = 0
% 0.44/1.09 usefactor = 1
% 0.44/1.09 usesimpsplitting = 0
% 0.44/1.09 usesimpdemod = 0
% 0.44/1.09 usesimpres = 4
% 0.44/1.09
% 0.44/1.09 resimpinuse = 1000
% 0.44/1.09 resimpclauses = 20000
% 0.44/1.09 substype = standard
% 0.44/1.09 backwardsubs = 1
% 0.44/1.09 selectoldest = 5
% 0.44/1.09
% 0.44/1.09 litorderings [0] = split
% 0.44/1.09 litorderings [1] = liftord
% 0.44/1.09
% 0.44/1.09 termordering = none
% 0.44/1.09
% 0.44/1.09 litapriori = 1
% 0.44/1.09 termapriori = 0
% 0.44/1.09 litaposteriori = 0
% 0.44/1.09 termaposteriori = 0
% 0.44/1.09 demodaposteriori = 0
% 0.44/1.09 ordereqreflfact = 0
% 0.44/1.09
% 0.44/1.09 litselect = negative
% 0.44/1.09
% 0.44/1.09 maxweight = 30000
% 0.44/1.09 maxdepth = 30000
% 0.44/1.09 maxlength = 115
% 0.44/1.09 maxnrvars = 195
% 0.44/1.09 excuselevel = 0
% 0.44/1.09 increasemaxweight = 0
% 0.44/1.09
% 0.44/1.09 maxselected = 10000000
% 0.44/1.09 maxnrclauses = 10000000
% 0.44/1.09
% 0.44/1.09 showgenerated = 0
% 0.44/1.09 showkept = 0
% 0.44/1.09 showselected = 0
% 0.44/1.09 showdeleted = 0
% 0.44/1.09 showresimp = 1
% 0.44/1.09 showstatus = 2000
% 0.44/1.09
% 0.44/1.09 prologoutput = 1
% 0.44/1.09 nrgoals = 5000000
% 0.44/1.09 totalproof = 1
% 0.44/1.09
% 0.44/1.09 Symbols occurring in the translation:
% 0.44/1.09
% 0.44/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.09 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.44/1.09 ! [4, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.44/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.09 or [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.44/1.09 not [41, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.44/1.09 axiom [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.44/1.09 theorem [46, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.44/1.09 p [49, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Starting Search:
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Bliksems!, er is een bewijs:
% 0.44/1.09 % SZS status Unsatisfiable
% 0.44/1.09 % SZS output start Refutation
% 0.44/1.09
% 0.44/1.09 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.44/1.09 ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.44/1.09 ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 8, [ ~( theorem( or( not( p ), not( not( p ) ) ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.44/1.09 ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 59, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 61, [ theorem( or( not( X ), X ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 64, [ theorem( or( X, not( X ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 66, [] )
% 0.44/1.09 .
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 % SZS output end Refutation
% 0.44/1.09 found a proof!
% 0.44/1.09
% 0.44/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.09
% 0.44/1.09 initialclauses(
% 0.44/1.09 [ clause( 68, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.44/1.09 , clause( 69, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.44/1.09 , clause( 70, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.44/1.09 , clause( 71, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.44/1.09 ) ) ] )
% 0.44/1.09 , clause( 72, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.44/1.09 , or( Z, Y ) ) ) ) ] )
% 0.44/1.09 , clause( 73, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.44/1.09 , clause( 74, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.44/1.09 Y ) ) ] )
% 0.44/1.09 , clause( 75, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) )
% 0.44/1.09 ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.44/1.09 , clause( 76, [ ~( theorem( or( not( p ), not( not( p ) ) ) ) ) ] )
% 0.44/1.09 ] ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.44/1.09 , clause( 68, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.44/1.09 , clause( 69, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.44/1.09 , clause( 70, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.44/1.09 ] )
% 0.44/1.09 , clause( 71, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.44/1.09 ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.44/1.09 , clause( 73, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.44/1.09 1 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.44/1.09 ) ] )
% 0.44/1.09 , clause( 74, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.44/1.09 Y ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 8, [ ~( theorem( or( not( p ), not( not( p ) ) ) ) ) ] )
% 0.44/1.09 , clause( 76, [ ~( theorem( or( not( p ), not( not( p ) ) ) ) ) ] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 77, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.44/1.09 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.44/1.09 , 1, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, or( not( X ), or( Y, X ) ) )] ),
% 0.44/1.09 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.44/1.09 , clause( 77, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 78, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.44/1.09 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.44/1.09 ) ) ] )
% 0.44/1.09 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 0.44/1.09 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.44/1.09 , clause( 78, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 ), ==>( 1, 1 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 79, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.44/1.09 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.44/1.09 ) ) ] )
% 0.44/1.09 , 2, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 0.44/1.09 , [ :=( X, X )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.44/1.09 , clause( 79, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.44/1.09 1 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 80, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.44/1.09 ) ) ) ] )
% 0.44/1.09 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.44/1.09 ) ) ] )
% 0.44/1.09 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.44/1.09 ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.44/1.09 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.44/1.09 ) ) ) ] )
% 0.44/1.09 , clause( 80, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.44/1.09 ) ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.09 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 81, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.44/1.09 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.44/1.09 ) ) ) ) ] )
% 0.44/1.09 , 1, clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, Y )] ),
% 0.44/1.09 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 59, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.44/1.09 , clause( 81, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 82, [ theorem( or( not( X ), X ) ) ] )
% 0.44/1.09 , clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.44/1.09 , 1, clause( 59, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, or( not( X ), X ) )] ), substitution( 1, [
% 0.44/1.09 :=( X, or( not( X ), X ) ), :=( Y, X )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 61, [ theorem( or( not( X ), X ) ) ] )
% 0.44/1.09 , clause( 82, [ theorem( or( not( X ), X ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 83, [ theorem( or( X, not( X ) ) ) ] )
% 0.44/1.09 , clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.44/1.09 , 1, clause( 61, [ theorem( or( not( X ), X ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution( 1
% 0.44/1.09 , [ :=( X, X )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 64, [ theorem( or( X, not( X ) ) ) ] )
% 0.44/1.09 , clause( 83, [ theorem( or( X, not( X ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 84, [] )
% 0.44/1.09 , clause( 8, [ ~( theorem( or( not( p ), not( not( p ) ) ) ) ) ] )
% 0.44/1.09 , 0, clause( 64, [ theorem( or( X, not( X ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( p ) )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 66, [] )
% 0.44/1.09 , clause( 84, [] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 end.
% 0.44/1.09
% 0.44/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.09
% 0.44/1.09 Memory use:
% 0.44/1.09
% 0.44/1.09 space for terms: 920
% 0.44/1.09 space for clauses: 4927
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 clauses generated: 97
% 0.44/1.09 clauses kept: 67
% 0.44/1.09 clauses selected: 34
% 0.44/1.09 clauses deleted: 0
% 0.44/1.09 clauses inuse deleted: 0
% 0.44/1.09
% 0.44/1.09 subsentry: 55
% 0.44/1.09 literals s-matched: 55
% 0.44/1.09 literals matched: 55
% 0.44/1.09 full subsumption: 0
% 0.44/1.09
% 0.44/1.09 checksum: 540305790
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Bliksem ended
%------------------------------------------------------------------------------