TSTP Solution File: SEU121+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU121+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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 : Tue Jul 19 07:10:43 EDT 2022
% Result : Theorem 0.69s 1.09s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU121+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n015.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 Jun 20 07:05:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/1.09 *** allocated 10000 integers for termspace/termends
% 0.69/1.09 *** allocated 10000 integers for clauses
% 0.69/1.09 *** allocated 10000 integers for justifications
% 0.69/1.09 Bliksem 1.12
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Automatic Strategy Selection
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Clauses:
% 0.69/1.09
% 0.69/1.09 { ! in( X, Y ), ! in( Y, X ) }.
% 0.69/1.09 { ! subset( X, Y ), ! in( Z, X ), in( Z, Y ) }.
% 0.69/1.09 { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.69/1.09 { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.69/1.09 { && }.
% 0.69/1.09 { empty( empty_set ) }.
% 0.69/1.09 { empty( skol2 ) }.
% 0.69/1.09 { ! empty( skol3 ) }.
% 0.69/1.09 { subset( X, X ) }.
% 0.69/1.09 { subset( skol4, skol6 ) }.
% 0.69/1.09 { subset( skol6, skol5 ) }.
% 0.69/1.09 { ! subset( skol4, skol5 ) }.
% 0.69/1.09 { ! empty( X ), X = empty_set }.
% 0.69/1.09 { ! in( X, Y ), ! empty( Y ) }.
% 0.69/1.09 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.69/1.09
% 0.69/1.09 percentage equality = 0.083333, percentage horn = 0.933333
% 0.69/1.09 This is a problem with some equality
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Options Used:
% 0.69/1.09
% 0.69/1.09 useres = 1
% 0.69/1.09 useparamod = 1
% 0.69/1.09 useeqrefl = 1
% 0.69/1.09 useeqfact = 1
% 0.69/1.09 usefactor = 1
% 0.69/1.09 usesimpsplitting = 0
% 0.69/1.09 usesimpdemod = 5
% 0.69/1.09 usesimpres = 3
% 0.69/1.09
% 0.69/1.09 resimpinuse = 1000
% 0.69/1.09 resimpclauses = 20000
% 0.69/1.09 substype = eqrewr
% 0.69/1.09 backwardsubs = 1
% 0.69/1.09 selectoldest = 5
% 0.69/1.09
% 0.69/1.09 litorderings [0] = split
% 0.69/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.09
% 0.69/1.09 termordering = kbo
% 0.69/1.09
% 0.69/1.09 litapriori = 0
% 0.69/1.09 termapriori = 1
% 0.69/1.09 litaposteriori = 0
% 0.69/1.09 termaposteriori = 0
% 0.69/1.09 demodaposteriori = 0
% 0.69/1.09 ordereqreflfact = 0
% 0.69/1.09
% 0.69/1.09 litselect = negord
% 0.69/1.09
% 0.69/1.09 maxweight = 15
% 0.69/1.09 maxdepth = 30000
% 0.69/1.09 maxlength = 115
% 0.69/1.09 maxnrvars = 195
% 0.69/1.09 excuselevel = 1
% 0.69/1.09 increasemaxweight = 1
% 0.69/1.09
% 0.69/1.09 maxselected = 10000000
% 0.69/1.09 maxnrclauses = 10000000
% 0.69/1.09
% 0.69/1.09 showgenerated = 0
% 0.69/1.09 showkept = 0
% 0.69/1.09 showselected = 0
% 0.69/1.09 showdeleted = 0
% 0.69/1.09 showresimp = 1
% 0.69/1.09 showstatus = 2000
% 0.69/1.09
% 0.69/1.09 prologoutput = 0
% 0.69/1.09 nrgoals = 5000000
% 0.69/1.09 totalproof = 1
% 0.69/1.09
% 0.69/1.09 Symbols occurring in the translation:
% 0.69/1.09
% 0.69/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.09 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.09 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.69/1.09 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.69/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 in [37, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.69/1.09 subset [38, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.69/1.09 empty_set [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.69/1.09 empty [41, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.09 skol1 [42, 2] (w:1, o:47, a:1, s:1, b:1),
% 0.69/1.09 skol2 [43, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.69/1.09 skol3 [44, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.69/1.09 skol4 [45, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.69/1.09 skol5 [46, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.69/1.09 skol6 [47, 0] (w:1, o:14, a:1, s:1, b:1).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Starting Search:
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksems!, er is een bewijs:
% 0.69/1.09 % SZS status Theorem
% 0.69/1.09 % SZS output start Refutation
% 0.69/1.09
% 0.69/1.09 (1) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! in( Z, X ), in( Z, Y ) }.
% 0.69/1.09 (2) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.69/1.09 (3) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.69/1.09 (9) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.69/1.09 (10) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.69/1.09 (11) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.69/1.09 (17) {G1,W6,D2,L2,V1,M2} R(1,9) { ! in( X, skol4 ), in( X, skol6 ) }.
% 0.69/1.09 (18) {G1,W6,D2,L2,V1,M2} R(1,10) { ! in( X, skol6 ), in( X, skol5 ) }.
% 0.69/1.09 (35) {G1,W5,D3,L1,V1,M1} R(2,11) { ! in( skol1( X, skol5 ), skol5 ) }.
% 0.69/1.09 (92) {G2,W5,D3,L1,V1,M1} R(18,35) { ! in( skol1( X, skol5 ), skol6 ) }.
% 0.69/1.09 (103) {G3,W5,D3,L1,V1,M1} R(92,17) { ! in( skol1( X, skol5 ), skol4 ) }.
% 0.69/1.09 (109) {G4,W0,D0,L0,V0,M0} R(103,3);r(11) { }.
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 % SZS output end Refutation
% 0.69/1.09 found a proof!
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Unprocessed initial clauses:
% 0.69/1.09
% 0.69/1.09 (111) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.69/1.09 (112) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! in( Z, X ), in( Z, Y ) }.
% 0.69/1.09 (113) {G0,W8,D3,L2,V3,M2} { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.69/1.09 (114) {G0,W8,D3,L2,V2,M2} { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.69/1.09 (115) {G0,W1,D1,L1,V0,M1} { && }.
% 0.69/1.09 (116) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.69/1.09 (117) {G0,W2,D2,L1,V0,M1} { empty( skol2 ) }.
% 0.69/1.09 (118) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 0.69/1.09 (119) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.69/1.09 (120) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol6 ) }.
% 0.69/1.09 (121) {G0,W3,D2,L1,V0,M1} { subset( skol6, skol5 ) }.
% 0.69/1.09 (122) {G0,W3,D2,L1,V0,M1} { ! subset( skol4, skol5 ) }.
% 0.69/1.09 (123) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.69/1.09 (124) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.69/1.09 (125) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Total Proof:
% 0.69/1.09
% 0.69/1.09 subsumption: (1) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! in( Z, X ), in
% 0.69/1.09 ( Z, Y ) }.
% 0.69/1.09 parent0: (112) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! in( Z, X ), in( Z
% 0.69/1.09 , Y ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 Z := Z
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 1 ==> 1
% 0.69/1.09 2 ==> 2
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (2) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset(
% 0.69/1.09 X, Y ) }.
% 0.69/1.09 parent0: (113) {G0,W8,D3,L2,V3,M2} { ! in( skol1( Z, Y ), Y ), subset( X,
% 0.69/1.09 Y ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 Z := Z
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 1 ==> 1
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (3) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X
% 0.69/1.09 , Y ) }.
% 0.69/1.09 parent0: (114) {G0,W8,D3,L2,V2,M2} { in( skol1( X, Y ), X ), subset( X, Y
% 0.69/1.09 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 1 ==> 1
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (9) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.69/1.09 parent0: (120) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol6 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (10) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.69/1.09 parent0: (121) {G0,W3,D2,L1,V0,M1} { subset( skol6, skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (11) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.69/1.09 parent0: (122) {G0,W3,D2,L1,V0,M1} { ! subset( skol4, skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (132) {G1,W6,D2,L2,V1,M2} { ! in( X, skol4 ), in( X, skol6 )
% 0.69/1.09 }.
% 0.69/1.09 parent0[0]: (1) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! in( Z, X ), in
% 0.69/1.09 ( Z, Y ) }.
% 0.69/1.09 parent1[0]: (9) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol4
% 0.69/1.09 Y := skol6
% 0.69/1.09 Z := X
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (17) {G1,W6,D2,L2,V1,M2} R(1,9) { ! in( X, skol4 ), in( X,
% 0.69/1.09 skol6 ) }.
% 0.69/1.09 parent0: (132) {G1,W6,D2,L2,V1,M2} { ! in( X, skol4 ), in( X, skol6 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 1 ==> 1
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (133) {G1,W6,D2,L2,V1,M2} { ! in( X, skol6 ), in( X, skol5 )
% 0.69/1.09 }.
% 0.69/1.09 parent0[0]: (1) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! in( Z, X ), in
% 0.69/1.09 ( Z, Y ) }.
% 0.69/1.09 parent1[0]: (10) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol6
% 0.69/1.09 Y := skol5
% 0.69/1.09 Z := X
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (18) {G1,W6,D2,L2,V1,M2} R(1,10) { ! in( X, skol6 ), in( X,
% 0.69/1.09 skol5 ) }.
% 0.69/1.09 parent0: (133) {G1,W6,D2,L2,V1,M2} { ! in( X, skol6 ), in( X, skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 1 ==> 1
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (134) {G1,W5,D3,L1,V1,M1} { ! in( skol1( X, skol5 ), skol5 )
% 0.69/1.09 }.
% 0.69/1.09 parent0[0]: (11) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.69/1.09 parent1[1]: (2) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset( X
% 0.69/1.09 , Y ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 X := skol4
% 0.69/1.09 Y := skol5
% 0.69/1.09 Z := X
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (35) {G1,W5,D3,L1,V1,M1} R(2,11) { ! in( skol1( X, skol5 ),
% 0.69/1.09 skol5 ) }.
% 0.69/1.09 parent0: (134) {G1,W5,D3,L1,V1,M1} { ! in( skol1( X, skol5 ), skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (135) {G2,W5,D3,L1,V1,M1} { ! in( skol1( X, skol5 ), skol6 )
% 0.69/1.09 }.
% 0.69/1.09 parent0[0]: (35) {G1,W5,D3,L1,V1,M1} R(2,11) { ! in( skol1( X, skol5 ),
% 0.69/1.09 skol5 ) }.
% 0.69/1.09 parent1[1]: (18) {G1,W6,D2,L2,V1,M2} R(1,10) { ! in( X, skol6 ), in( X,
% 0.69/1.09 skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 X := skol1( X, skol5 )
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (92) {G2,W5,D3,L1,V1,M1} R(18,35) { ! in( skol1( X, skol5 ),
% 0.69/1.09 skol6 ) }.
% 0.69/1.09 parent0: (135) {G2,W5,D3,L1,V1,M1} { ! in( skol1( X, skol5 ), skol6 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (136) {G2,W5,D3,L1,V1,M1} { ! in( skol1( X, skol5 ), skol4 )
% 0.69/1.09 }.
% 0.69/1.09 parent0[0]: (92) {G2,W5,D3,L1,V1,M1} R(18,35) { ! in( skol1( X, skol5 ),
% 0.69/1.09 skol6 ) }.
% 0.69/1.09 parent1[1]: (17) {G1,W6,D2,L2,V1,M2} R(1,9) { ! in( X, skol4 ), in( X,
% 0.69/1.09 skol6 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 X := skol1( X, skol5 )
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (103) {G3,W5,D3,L1,V1,M1} R(92,17) { ! in( skol1( X, skol5 ),
% 0.69/1.09 skol4 ) }.
% 0.69/1.09 parent0: (136) {G2,W5,D3,L1,V1,M1} { ! in( skol1( X, skol5 ), skol4 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (137) {G1,W3,D2,L1,V0,M1} { subset( skol4, skol5 ) }.
% 0.69/1.09 parent0[0]: (103) {G3,W5,D3,L1,V1,M1} R(92,17) { ! in( skol1( X, skol5 ),
% 0.69/1.09 skol4 ) }.
% 0.69/1.09 parent1[0]: (3) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X,
% 0.69/1.09 Y ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol4
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 X := skol4
% 0.69/1.09 Y := skol5
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (138) {G1,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 parent0[0]: (11) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.69/1.09 parent1[0]: (137) {G1,W3,D2,L1,V0,M1} { subset( skol4, skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (109) {G4,W0,D0,L0,V0,M0} R(103,3);r(11) { }.
% 0.69/1.09 parent0: (138) {G1,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 Proof check complete!
% 0.69/1.09
% 0.69/1.09 Memory use:
% 0.69/1.09
% 0.69/1.09 space for terms: 1210
% 0.69/1.09 space for clauses: 4694
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 clauses generated: 374
% 0.69/1.09 clauses kept: 110
% 0.69/1.09 clauses selected: 43
% 0.69/1.09 clauses deleted: 2
% 0.69/1.09 clauses inuse deleted: 0
% 0.69/1.09
% 0.69/1.09 subsentry: 960
% 0.69/1.09 literals s-matched: 795
% 0.69/1.09 literals matched: 795
% 0.69/1.09 full subsumption: 307
% 0.69/1.09
% 0.69/1.09 checksum: 5461514
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksem ended
%------------------------------------------------------------------------------