TSTP Solution File: KRS068+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KRS068+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 02:42:07 EDT 2022
% Result : Unsatisfiable 0.80s 1.16s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS068+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n023.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 : Tue Jun 7 13:51:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.80/1.16 *** allocated 10000 integers for termspace/termends
% 0.80/1.16 *** allocated 10000 integers for clauses
% 0.80/1.16 *** allocated 10000 integers for justifications
% 0.80/1.16 Bliksem 1.12
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Automatic Strategy Selection
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Clauses:
% 0.80/1.16
% 0.80/1.16 { cowlThing( X ) }.
% 0.80/1.16 { ! cowlNothing( X ) }.
% 0.80/1.16 { ! xsd_string( X ), ! xsd_integer( X ) }.
% 0.80/1.16 { xsd_integer( X ), xsd_string( X ) }.
% 0.80/1.16 { ! cUnsatisfiable( X ), cc( X ) }.
% 0.80/1.16 { ! cUnsatisfiable( X ), ! cd( X ) }.
% 0.80/1.16 { ! cc( X ), ! rr( X, Y ), cc( Y ) }.
% 0.80/1.16 { cUnsatisfiable( i2003_11_14_17_18_23845 ) }.
% 0.80/1.16 { ! cc( skol1( Y ) ), cd( X ) }.
% 0.80/1.16 { rr( X, skol1( X ) ), cd( X ) }.
% 0.80/1.16
% 0.80/1.16 percentage equality = 0.000000, percentage horn = 0.800000
% 0.80/1.16 This a non-horn, non-equality problem
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Options Used:
% 0.80/1.16
% 0.80/1.16 useres = 1
% 0.80/1.16 useparamod = 0
% 0.80/1.16 useeqrefl = 0
% 0.80/1.16 useeqfact = 0
% 0.80/1.16 usefactor = 1
% 0.80/1.16 usesimpsplitting = 0
% 0.80/1.16 usesimpdemod = 0
% 0.80/1.16 usesimpres = 3
% 0.80/1.16
% 0.80/1.16 resimpinuse = 1000
% 0.80/1.16 resimpclauses = 20000
% 0.80/1.16 substype = standard
% 0.80/1.16 backwardsubs = 1
% 0.80/1.16 selectoldest = 5
% 0.80/1.16
% 0.80/1.16 litorderings [0] = split
% 0.80/1.16 litorderings [1] = liftord
% 0.80/1.16
% 0.80/1.16 termordering = none
% 0.80/1.16
% 0.80/1.16 litapriori = 1
% 0.80/1.16 termapriori = 0
% 0.80/1.16 litaposteriori = 0
% 0.80/1.16 termaposteriori = 0
% 0.80/1.16 demodaposteriori = 0
% 0.80/1.16 ordereqreflfact = 0
% 0.80/1.16
% 0.80/1.16 litselect = none
% 0.80/1.16
% 0.80/1.16 maxweight = 15
% 0.80/1.16 maxdepth = 30000
% 0.80/1.16 maxlength = 115
% 0.80/1.16 maxnrvars = 195
% 0.80/1.16 excuselevel = 1
% 0.80/1.16 increasemaxweight = 1
% 0.80/1.16
% 0.80/1.16 maxselected = 10000000
% 0.80/1.16 maxnrclauses = 10000000
% 0.80/1.16
% 0.80/1.16 showgenerated = 0
% 0.80/1.16 showkept = 0
% 0.80/1.16 showselected = 0
% 0.80/1.16 showdeleted = 0
% 0.80/1.16 showresimp = 1
% 0.80/1.16 showstatus = 2000
% 0.80/1.16
% 0.80/1.16 prologoutput = 0
% 0.80/1.16 nrgoals = 5000000
% 0.80/1.16 totalproof = 1
% 0.80/1.16
% 0.80/1.16 Symbols occurring in the translation:
% 0.80/1.16
% 0.80/1.16 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.80/1.16 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.80/1.16 ! [4, 1] (w:0, o:9, a:1, s:1, b:0),
% 0.80/1.16 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.80/1.16 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.80/1.16 cowlThing [36, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.80/1.16 cowlNothing [37, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.80/1.16 xsd_string [38, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.80/1.16 xsd_integer [39, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.80/1.16 cUnsatisfiable [40, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.80/1.16 cc [41, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.80/1.16 cd [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.80/1.16 rr [44, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.80/1.16 i2003_11_14_17_18_23845 [45, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.80/1.16 skol1 [46, 1] (w:1, o:21, a:1, s:1, b:0).
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Starting Search:
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Bliksems!, er is een bewijs:
% 0.80/1.16 % SZS status Unsatisfiable
% 0.80/1.16 % SZS output start Refutation
% 0.80/1.16
% 0.80/1.16 (4) {G0,W4,D2,L2,V1,M1} I { ! cUnsatisfiable( X ), cc( X ) }.
% 0.80/1.16 (5) {G0,W4,D2,L2,V1,M1} I { ! cUnsatisfiable( X ), ! cd( X ) }.
% 0.80/1.16 (6) {G0,W7,D2,L3,V2,M1} I { ! cc( X ), cc( Y ), ! rr( X, Y ) }.
% 0.80/1.16 (7) {G0,W2,D2,L1,V0,M1} I { cUnsatisfiable( i2003_11_14_17_18_23845 ) }.
% 0.80/1.16 (8) {G0,W5,D3,L2,V2,M1} I { ! cc( skol1( Y ) ), cd( X ) }.
% 0.80/1.16 (9) {G0,W6,D3,L2,V1,M1} I { cd( X ), rr( X, skol1( X ) ) }.
% 0.80/1.16 (10) {G1,W5,D3,L2,V2,M1} R(8,5) { ! cUnsatisfiable( Y ), ! cc( skol1( X ) )
% 0.80/1.16 }.
% 0.80/1.16 (13) {G1,W7,D3,L3,V1,M1} R(9,6) { ! cc( X ), cc( skol1( X ) ), cd( X ) }.
% 0.80/1.16 (14) {G2,W5,D3,L2,V1,M1} R(13,5);r(4) { ! cUnsatisfiable( X ), cc( skol1( X
% 0.80/1.16 ) ) }.
% 0.80/1.16 (15) {G3,W4,D2,L2,V2,M2} R(14,10) { ! cUnsatisfiable( Y ), ! cUnsatisfiable
% 0.80/1.16 ( X ) }.
% 0.80/1.16 (16) {G4,W2,D2,L1,V1,M1} F(15) { ! cUnsatisfiable( X ) }.
% 0.80/1.16 (17) {G5,W0,D0,L0,V0,M0} R(16,7) { }.
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 % SZS output end Refutation
% 0.80/1.16 found a proof!
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Unprocessed initial clauses:
% 0.80/1.16
% 0.80/1.16 (19) {G0,W2,D2,L1,V1,M1} { cowlThing( X ) }.
% 0.80/1.16 (20) {G0,W2,D2,L1,V1,M1} { ! cowlNothing( X ) }.
% 0.80/1.16 (21) {G0,W4,D2,L2,V1,M2} { ! xsd_string( X ), ! xsd_integer( X ) }.
% 0.80/1.16 (22) {G0,W4,D2,L2,V1,M2} { xsd_integer( X ), xsd_string( X ) }.
% 0.80/1.16 (23) {G0,W4,D2,L2,V1,M2} { ! cUnsatisfiable( X ), cc( X ) }.
% 0.80/1.16 (24) {G0,W4,D2,L2,V1,M2} { ! cUnsatisfiable( X ), ! cd( X ) }.
% 0.80/1.16 (25) {G0,W7,D2,L3,V2,M3} { ! cc( X ), ! rr( X, Y ), cc( Y ) }.
% 0.80/1.16 (26) {G0,W2,D2,L1,V0,M1} { cUnsatisfiable( i2003_11_14_17_18_23845 ) }.
% 0.80/1.16 (27) {G0,W5,D3,L2,V2,M2} { ! cc( skol1( Y ) ), cd( X ) }.
% 0.80/1.16 (28) {G0,W6,D3,L2,V1,M2} { rr( X, skol1( X ) ), cd( X ) }.
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Total Proof:
% 0.80/1.16
% 0.80/1.16 subsumption: (4) {G0,W4,D2,L2,V1,M1} I { ! cUnsatisfiable( X ), cc( X ) }.
% 0.80/1.16 parent0: (23) {G0,W4,D2,L2,V1,M2} { ! cUnsatisfiable( X ), cc( X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 1 ==> 1
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (5) {G0,W4,D2,L2,V1,M1} I { ! cUnsatisfiable( X ), ! cd( X )
% 0.80/1.16 }.
% 0.80/1.16 parent0: (24) {G0,W4,D2,L2,V1,M2} { ! cUnsatisfiable( X ), ! cd( X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 1 ==> 1
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (6) {G0,W7,D2,L3,V2,M1} I { ! cc( X ), cc( Y ), ! rr( X, Y )
% 0.80/1.16 }.
% 0.80/1.16 parent0: (25) {G0,W7,D2,L3,V2,M3} { ! cc( X ), ! rr( X, Y ), cc( Y ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 Y := Y
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 1 ==> 2
% 0.80/1.16 2 ==> 1
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (7) {G0,W2,D2,L1,V0,M1} I { cUnsatisfiable(
% 0.80/1.16 i2003_11_14_17_18_23845 ) }.
% 0.80/1.16 parent0: (26) {G0,W2,D2,L1,V0,M1} { cUnsatisfiable(
% 0.80/1.16 i2003_11_14_17_18_23845 ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (8) {G0,W5,D3,L2,V2,M1} I { ! cc( skol1( Y ) ), cd( X ) }.
% 0.80/1.16 parent0: (27) {G0,W5,D3,L2,V2,M2} { ! cc( skol1( Y ) ), cd( X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 Y := Y
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 1 ==> 1
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (9) {G0,W6,D3,L2,V1,M1} I { cd( X ), rr( X, skol1( X ) ) }.
% 0.80/1.16 parent0: (28) {G0,W6,D3,L2,V1,M2} { rr( X, skol1( X ) ), cd( X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 1
% 0.80/1.16 1 ==> 0
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 resolution: (29) {G1,W5,D3,L2,V2,M2} { ! cUnsatisfiable( X ), ! cc( skol1
% 0.80/1.16 ( Y ) ) }.
% 0.80/1.16 parent0[1]: (5) {G0,W4,D2,L2,V1,M1} I { ! cUnsatisfiable( X ), ! cd( X )
% 0.80/1.16 }.
% 0.80/1.16 parent1[1]: (8) {G0,W5,D3,L2,V2,M1} I { ! cc( skol1( Y ) ), cd( X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16 substitution1:
% 0.80/1.16 X := X
% 0.80/1.16 Y := Y
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (10) {G1,W5,D3,L2,V2,M1} R(8,5) { ! cUnsatisfiable( Y ), ! cc
% 0.80/1.16 ( skol1( X ) ) }.
% 0.80/1.16 parent0: (29) {G1,W5,D3,L2,V2,M2} { ! cUnsatisfiable( X ), ! cc( skol1( Y
% 0.80/1.16 ) ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := Y
% 0.80/1.16 Y := X
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 1 ==> 1
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 resolution: (30) {G1,W7,D3,L3,V1,M3} { ! cc( X ), cc( skol1( X ) ), cd( X
% 0.80/1.16 ) }.
% 0.80/1.16 parent0[2]: (6) {G0,W7,D2,L3,V2,M1} I { ! cc( X ), cc( Y ), ! rr( X, Y )
% 0.80/1.16 }.
% 0.80/1.16 parent1[1]: (9) {G0,W6,D3,L2,V1,M1} I { cd( X ), rr( X, skol1( X ) ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 Y := skol1( X )
% 0.80/1.16 end
% 0.80/1.16 substitution1:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (13) {G1,W7,D3,L3,V1,M1} R(9,6) { ! cc( X ), cc( skol1( X ) )
% 0.80/1.16 , cd( X ) }.
% 0.80/1.16 parent0: (30) {G1,W7,D3,L3,V1,M3} { ! cc( X ), cc( skol1( X ) ), cd( X )
% 0.80/1.16 }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 1 ==> 1
% 0.80/1.16 2 ==> 2
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 resolution: (31) {G1,W7,D3,L3,V1,M3} { ! cUnsatisfiable( X ), ! cc( X ),
% 0.80/1.16 cc( skol1( X ) ) }.
% 0.80/1.16 parent0[1]: (5) {G0,W4,D2,L2,V1,M1} I { ! cUnsatisfiable( X ), ! cd( X )
% 0.80/1.16 }.
% 0.80/1.16 parent1[2]: (13) {G1,W7,D3,L3,V1,M1} R(9,6) { ! cc( X ), cc( skol1( X ) ),
% 0.80/1.16 cd( X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16 substitution1:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 resolution: (32) {G1,W7,D3,L3,V1,M3} { ! cUnsatisfiable( X ), cc( skol1( X
% 0.80/1.16 ) ), ! cUnsatisfiable( X ) }.
% 0.80/1.16 parent0[1]: (31) {G1,W7,D3,L3,V1,M3} { ! cUnsatisfiable( X ), ! cc( X ),
% 0.80/1.16 cc( skol1( X ) ) }.
% 0.80/1.16 parent1[1]: (4) {G0,W4,D2,L2,V1,M1} I { ! cUnsatisfiable( X ), cc( X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16 substitution1:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 factor: (33) {G1,W5,D3,L2,V1,M2} { ! cUnsatisfiable( X ), cc( skol1( X ) )
% 0.80/1.16 }.
% 0.80/1.16 parent0[0, 2]: (32) {G1,W7,D3,L3,V1,M3} { ! cUnsatisfiable( X ), cc( skol1
% 0.80/1.16 ( X ) ), ! cUnsatisfiable( X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (14) {G2,W5,D3,L2,V1,M1} R(13,5);r(4) { ! cUnsatisfiable( X )
% 0.80/1.16 , cc( skol1( X ) ) }.
% 0.80/1.16 parent0: (33) {G1,W5,D3,L2,V1,M2} { ! cUnsatisfiable( X ), cc( skol1( X )
% 0.80/1.16 ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 1 ==> 1
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 resolution: (34) {G2,W4,D2,L2,V2,M2} { ! cUnsatisfiable( X ), !
% 0.80/1.16 cUnsatisfiable( Y ) }.
% 0.80/1.16 parent0[1]: (10) {G1,W5,D3,L2,V2,M1} R(8,5) { ! cUnsatisfiable( Y ), ! cc(
% 0.80/1.16 skol1( X ) ) }.
% 0.80/1.16 parent1[1]: (14) {G2,W5,D3,L2,V1,M1} R(13,5);r(4) { ! cUnsatisfiable( X ),
% 0.80/1.16 cc( skol1( X ) ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := Y
% 0.80/1.16 Y := X
% 0.80/1.16 end
% 0.80/1.16 substitution1:
% 0.80/1.16 X := Y
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (15) {G3,W4,D2,L2,V2,M2} R(14,10) { ! cUnsatisfiable( Y ), !
% 0.80/1.16 cUnsatisfiable( X ) }.
% 0.80/1.16 parent0: (34) {G2,W4,D2,L2,V2,M2} { ! cUnsatisfiable( X ), !
% 0.80/1.16 cUnsatisfiable( Y ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := Y
% 0.80/1.16 Y := Y
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 1 ==> 0
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 factor: (36) {G3,W2,D2,L1,V1,M1} { ! cUnsatisfiable( X ) }.
% 0.80/1.16 parent0[0, 1]: (15) {G3,W4,D2,L2,V2,M2} R(14,10) { ! cUnsatisfiable( Y ), !
% 0.80/1.16 cUnsatisfiable( X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 Y := X
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (16) {G4,W2,D2,L1,V1,M1} F(15) { ! cUnsatisfiable( X ) }.
% 0.80/1.16 parent0: (36) {G3,W2,D2,L1,V1,M1} { ! cUnsatisfiable( X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 resolution: (37) {G1,W0,D0,L0,V0,M0} { }.
% 0.80/1.16 parent0[0]: (16) {G4,W2,D2,L1,V1,M1} F(15) { ! cUnsatisfiable( X ) }.
% 0.80/1.16 parent1[0]: (7) {G0,W2,D2,L1,V0,M1} I { cUnsatisfiable(
% 0.80/1.16 i2003_11_14_17_18_23845 ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := i2003_11_14_17_18_23845
% 0.80/1.16 end
% 0.80/1.16 substitution1:
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (17) {G5,W0,D0,L0,V0,M0} R(16,7) { }.
% 0.80/1.16 parent0: (37) {G1,W0,D0,L0,V0,M0} { }.
% 0.80/1.16 substitution0:
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 Proof check complete!
% 0.80/1.16
% 0.80/1.16 Memory use:
% 0.80/1.16
% 0.80/1.16 space for terms: 227
% 0.80/1.16 space for clauses: 879
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 clauses generated: 19
% 0.80/1.16 clauses kept: 18
% 0.80/1.16 clauses selected: 15
% 0.80/1.16 clauses deleted: 2
% 0.80/1.16 clauses inuse deleted: 0
% 0.80/1.16
% 0.80/1.16 subsentry: 7
% 0.80/1.16 literals s-matched: 4
% 0.80/1.16 literals matched: 4
% 0.80/1.16 full subsumption: 0
% 0.80/1.16
% 0.80/1.16 checksum: 35740100
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Bliksem ended
%------------------------------------------------------------------------------