TSTP Solution File: SET958+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET958+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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 : Mon Jul 18 22:53:37 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.11/0.12 % Problem : SET958+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Mon Jul 11 07:58:45 EDT 2022
% 0.13/0.35 % 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 { unordered_pair( X, Y ) = unordered_pair( 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 { ordered_pair( X, Y ) = unordered_pair( unordered_pair( X, Y ), singleton
% 0.69/1.09 ( X ) ) }.
% 0.69/1.09 { ! empty( ordered_pair( X, Y ) ) }.
% 0.69/1.09 { empty( skol2 ) }.
% 0.69/1.09 { ! empty( skol3 ) }.
% 0.69/1.09 { subset( X, X ) }.
% 0.69/1.09 { ! in( X, skol4 ), X = ordered_pair( skol6( X ), skol7( X ) ) }.
% 0.69/1.09 { ! in( ordered_pair( X, Y ), skol4 ), in( ordered_pair( X, Y ), skol5 ) }
% 0.69/1.09 .
% 0.69/1.09 { ! subset( skol4, skol5 ) }.
% 0.69/1.09
% 0.69/1.09 percentage equality = 0.150000, percentage horn = 0.923077
% 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:24, 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:48, a:1, s:1, b:0),
% 0.69/1.09 unordered_pair [38, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.69/1.09 subset [39, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.69/1.09 ordered_pair [41, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.69/1.09 singleton [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.09 empty [43, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.09 skol1 [46, 2] (w:1, o:52, a:1, s:1, b:1),
% 0.69/1.09 skol2 [47, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.69/1.09 skol3 [48, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.69/1.09 skol4 [49, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.69/1.09 skol5 [50, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.69/1.09 skol6 [51, 1] (w:1, o:22, a:1, s:1, b:1),
% 0.69/1.09 skol7 [52, 1] (w:1, o:23, 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 (3) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.69/1.09 (4) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.69/1.09 (10) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol4 ), ordered_pair( skol6( X ),
% 0.69/1.09 skol7( X ) ) ==> X }.
% 0.69/1.09 (11) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ), skol4 ), in(
% 0.69/1.09 ordered_pair( X, Y ), skol5 ) }.
% 0.69/1.09 (12) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.69/1.09 (14) {G1,W5,D3,L1,V1,M1} R(3,12) { ! in( skol1( X, skol5 ), skol5 ) }.
% 0.69/1.09 (32) {G1,W5,D3,L1,V0,M1} R(4,12) { in( skol1( skol4, skol5 ), skol4 ) }.
% 0.69/1.09 (63) {G1,W6,D2,L2,V1,M2} P(10,11);f { ! in( X, skol4 ), in( X, skol5 ) }.
% 0.69/1.09 (65) {G2,W0,D0,L0,V0,M0} R(63,32);r(14) { }.
% 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 (67) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.69/1.09 (68) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.69/1.09 }.
% 0.69/1.09 (69) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! in( Z, X ), in( Z, Y ) }.
% 0.69/1.09 (70) {G0,W8,D3,L2,V3,M2} { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.69/1.09 (71) {G0,W8,D3,L2,V2,M2} { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.69/1.09 (72) {G0,W10,D4,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 0.69/1.09 unordered_pair( X, Y ), singleton( X ) ) }.
% 0.69/1.09 (73) {G0,W4,D3,L1,V2,M1} { ! empty( ordered_pair( X, Y ) ) }.
% 0.69/1.09 (74) {G0,W2,D2,L1,V0,M1} { empty( skol2 ) }.
% 0.69/1.09 (75) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 0.69/1.09 (76) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.69/1.09 (77) {G0,W10,D4,L2,V1,M2} { ! in( X, skol4 ), X = ordered_pair( skol6( X )
% 0.69/1.09 , skol7( X ) ) }.
% 0.69/1.09 (78) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol4 ), in(
% 0.69/1.09 ordered_pair( X, Y ), skol5 ) }.
% 0.69/1.09 (79) {G0,W3,D2,L1,V0,M1} { ! subset( skol4, skol5 ) }.
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Total Proof:
% 0.69/1.09
% 0.69/1.09 subsumption: (3) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset(
% 0.69/1.09 X, Y ) }.
% 0.69/1.09 parent0: (70) {G0,W8,D3,L2,V3,M2} { ! in( skol1( Z, Y ), Y ), 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 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: (4) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X
% 0.69/1.09 , Y ) }.
% 0.69/1.09 parent0: (71) {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 eqswap: (84) {G0,W10,D4,L2,V1,M2} { ordered_pair( skol6( X ), skol7( X ) )
% 0.69/1.09 = X, ! in( X, skol4 ) }.
% 0.69/1.09 parent0[1]: (77) {G0,W10,D4,L2,V1,M2} { ! in( X, skol4 ), X = ordered_pair
% 0.69/1.09 ( skol6( X ), skol7( X ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (10) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol4 ), ordered_pair(
% 0.69/1.09 skol6( X ), skol7( X ) ) ==> X }.
% 0.69/1.09 parent0: (84) {G0,W10,D4,L2,V1,M2} { ordered_pair( skol6( X ), skol7( X )
% 0.69/1.09 ) = X, ! in( X, 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 ==> 1
% 0.69/1.09 1 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (11) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ),
% 0.69/1.09 skol4 ), in( ordered_pair( X, Y ), skol5 ) }.
% 0.69/1.09 parent0: (78) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol4 ),
% 0.69/1.09 in( ordered_pair( X, Y ), skol5 ) }.
% 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: (12) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.69/1.09 parent0: (79) {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: (91) {G1,W5,D3,L1,V1,M1} { ! in( skol1( X, skol5 ), skol5 )
% 0.69/1.09 }.
% 0.69/1.09 parent0[0]: (12) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.69/1.09 parent1[1]: (3) {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: (14) {G1,W5,D3,L1,V1,M1} R(3,12) { ! in( skol1( X, skol5 ),
% 0.69/1.09 skol5 ) }.
% 0.69/1.09 parent0: (91) {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: (92) {G1,W5,D3,L1,V0,M1} { in( skol1( skol4, skol5 ), skol4 )
% 0.69/1.09 }.
% 0.69/1.09 parent0[0]: (12) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.69/1.09 parent1[1]: (4) {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 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 subsumption: (32) {G1,W5,D3,L1,V0,M1} R(4,12) { in( skol1( skol4, skol5 ),
% 0.69/1.09 skol4 ) }.
% 0.69/1.09 parent0: (92) {G1,W5,D3,L1,V0,M1} { in( skol1( skol4, skol5 ), skol4 ) }.
% 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 paramod: (95) {G1,W13,D4,L3,V1,M3} { in( X, skol5 ), ! in( X, skol4 ), !
% 0.69/1.09 in( ordered_pair( skol6( X ), skol7( X ) ), skol4 ) }.
% 0.69/1.09 parent0[1]: (10) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol4 ), ordered_pair(
% 0.69/1.09 skol6( X ), skol7( X ) ) ==> X }.
% 0.69/1.09 parent1[1; 1]: (11) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ),
% 0.69/1.09 skol4 ), in( ordered_pair( X, Y ), 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 := skol6( X )
% 0.69/1.09 Y := skol7( X )
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 paramod: (96) {G1,W12,D2,L4,V1,M4} { ! in( X, skol4 ), ! in( X, skol4 ),
% 0.69/1.09 in( X, skol5 ), ! in( X, skol4 ) }.
% 0.69/1.09 parent0[1]: (10) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol4 ), ordered_pair(
% 0.69/1.09 skol6( X ), skol7( X ) ) ==> X }.
% 0.69/1.09 parent1[2; 2]: (95) {G1,W13,D4,L3,V1,M3} { in( X, skol5 ), ! in( X, skol4
% 0.69/1.09 ), ! in( ordered_pair( skol6( X ), skol7( X ) ), skol4 ) }.
% 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 := X
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 factor: (98) {G1,W9,D2,L3,V1,M3} { ! in( X, skol4 ), in( X, skol5 ), ! in
% 0.69/1.09 ( X, skol4 ) }.
% 0.69/1.09 parent0[0, 1]: (96) {G1,W12,D2,L4,V1,M4} { ! in( X, skol4 ), ! in( X,
% 0.69/1.09 skol4 ), in( X, skol5 ), ! in( X, skol4 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 factor: (99) {G1,W6,D2,L2,V1,M2} { ! in( X, skol4 ), in( X, skol5 ) }.
% 0.69/1.09 parent0[0, 2]: (98) {G1,W9,D2,L3,V1,M3} { ! in( X, skol4 ), in( X, skol5 )
% 0.69/1.09 , ! in( X, skol4 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (63) {G1,W6,D2,L2,V1,M2} P(10,11);f { ! in( X, skol4 ), in( X
% 0.69/1.09 , skol5 ) }.
% 0.69/1.09 parent0: (99) {G1,W6,D2,L2,V1,M2} { ! in( X, skol4 ), 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: (100) {G2,W5,D3,L1,V0,M1} { in( skol1( skol4, skol5 ), skol5 )
% 0.69/1.09 }.
% 0.69/1.09 parent0[0]: (63) {G1,W6,D2,L2,V1,M2} P(10,11);f { ! in( X, skol4 ), in( X,
% 0.69/1.09 skol5 ) }.
% 0.69/1.09 parent1[0]: (32) {G1,W5,D3,L1,V0,M1} R(4,12) { in( skol1( skol4, skol5 ),
% 0.69/1.09 skol4 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol1( skol4, skol5 )
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (101) {G2,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 parent0[0]: (14) {G1,W5,D3,L1,V1,M1} R(3,12) { ! in( skol1( X, skol5 ),
% 0.69/1.09 skol5 ) }.
% 0.69/1.09 parent1[0]: (100) {G2,W5,D3,L1,V0,M1} { in( skol1( skol4, skol5 ), skol5 )
% 0.69/1.09 }.
% 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 end
% 0.69/1.09
% 0.69/1.09 subsumption: (65) {G2,W0,D0,L0,V0,M0} R(63,32);r(14) { }.
% 0.69/1.09 parent0: (101) {G2,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: 867
% 0.69/1.09 space for clauses: 4030
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 clauses generated: 112
% 0.69/1.09 clauses kept: 66
% 0.69/1.09 clauses selected: 27
% 0.69/1.09 clauses deleted: 0
% 0.69/1.09 clauses inuse deleted: 0
% 0.69/1.09
% 0.69/1.09 subsentry: 239
% 0.69/1.09 literals s-matched: 164
% 0.69/1.09 literals matched: 164
% 0.69/1.09 full subsumption: 48
% 0.69/1.09
% 0.69/1.09 checksum: 690625875
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksem ended
%------------------------------------------------------------------------------