TSTP Solution File: SYN918+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN918+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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 : Thu Jul 21 02:58:09 EDT 2022
% Result : Theorem 0.69s 1.11s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN918+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n026.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 19:31:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.11 *** allocated 10000 integers for termspace/termends
% 0.69/1.11 *** allocated 10000 integers for clauses
% 0.69/1.11 *** allocated 10000 integers for justifications
% 0.69/1.11 Bliksem 1.12
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Automatic Strategy Selection
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Clauses:
% 0.69/1.11
% 0.69/1.11 { alpha1, f( skol1 ) }.
% 0.69/1.11 { alpha1, ! g( skol1 ) }.
% 0.69/1.11 { ! f( X ), g( X ), ! f( Y ), h( Y ) }.
% 0.69/1.11 { ! f( X ), ! h( X ), g( X ) }.
% 0.69/1.11 { ! f( X ), ! g( X ), h( X ) }.
% 0.69/1.11 { ! alpha1, f( X ) }.
% 0.69/1.11 { ! alpha1, g( X ) }.
% 0.69/1.11 { ! alpha1, ! h( X ) }.
% 0.69/1.11 { ! f( skol2 ), ! g( skol2 ), h( skol2 ), alpha1 }.
% 0.69/1.11
% 0.69/1.11 percentage equality = 0.000000, percentage horn = 0.666667
% 0.69/1.11 This a non-horn, non-equality problem
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Options Used:
% 0.69/1.11
% 0.69/1.11 useres = 1
% 0.69/1.11 useparamod = 0
% 0.69/1.11 useeqrefl = 0
% 0.69/1.11 useeqfact = 0
% 0.69/1.11 usefactor = 1
% 0.69/1.11 usesimpsplitting = 0
% 0.69/1.11 usesimpdemod = 0
% 0.69/1.11 usesimpres = 3
% 0.69/1.11
% 0.69/1.11 resimpinuse = 1000
% 0.69/1.11 resimpclauses = 20000
% 0.69/1.11 substype = standard
% 0.69/1.11 backwardsubs = 1
% 0.69/1.11 selectoldest = 5
% 0.69/1.11
% 0.69/1.11 litorderings [0] = split
% 0.69/1.11 litorderings [1] = liftord
% 0.69/1.11
% 0.69/1.11 termordering = none
% 0.69/1.11
% 0.69/1.11 litapriori = 1
% 0.69/1.11 termapriori = 0
% 0.69/1.11 litaposteriori = 0
% 0.69/1.11 termaposteriori = 0
% 0.69/1.11 demodaposteriori = 0
% 0.69/1.11 ordereqreflfact = 0
% 0.69/1.11
% 0.69/1.11 litselect = none
% 0.69/1.11
% 0.69/1.11 maxweight = 15
% 0.69/1.11 maxdepth = 30000
% 0.69/1.11 maxlength = 115
% 0.69/1.11 maxnrvars = 195
% 0.69/1.11 excuselevel = 1
% 0.69/1.11 increasemaxweight = 1
% 0.69/1.11
% 0.69/1.11 maxselected = 10000000
% 0.69/1.11 maxnrclauses = 10000000
% 0.69/1.11
% 0.69/1.11 showgenerated = 0
% 0.69/1.11 showkept = 0
% 0.69/1.11 showselected = 0
% 0.69/1.11 showdeleted = 0
% 0.69/1.11 showresimp = 1
% 0.69/1.11 showstatus = 2000
% 0.69/1.11
% 0.69/1.11 prologoutput = 0
% 0.69/1.11 nrgoals = 5000000
% 0.69/1.11 totalproof = 1
% 0.69/1.11
% 0.69/1.11 Symbols occurring in the translation:
% 0.69/1.11
% 0.69/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.11 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.69/1.11 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.69/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.11 f [36, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.11 g [37, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.11 h [38, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.69/1.11 alpha1 [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.69/1.11 skol1 [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.69/1.11 skol2 [46, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Starting Search:
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksems!, er is een bewijs:
% 0.69/1.11 % SZS status Theorem
% 0.69/1.11 % SZS output start Refutation
% 0.69/1.11
% 0.69/1.11 (0) {G0,W3,D2,L2,V0,M1} I { alpha1, f( skol1 ) }.
% 0.69/1.11 (1) {G0,W3,D2,L2,V0,M1} I { alpha1, ! g( skol1 ) }.
% 0.69/1.11 (2) {G0,W8,D2,L4,V2,M1} I { ! f( X ), ! f( Y ), g( X ), h( Y ) }.
% 0.69/1.11 (3) {G0,W6,D2,L3,V1,M1} I { ! f( X ), g( X ), ! h( X ) }.
% 0.69/1.11 (4) {G0,W6,D2,L3,V1,M1} I { ! f( X ), ! g( X ), h( X ) }.
% 0.69/1.11 (5) {G0,W3,D2,L2,V1,M1} I { f( X ), ! alpha1 }.
% 0.69/1.11 (7) {G0,W3,D2,L2,V1,M1} I { ! h( X ), ! alpha1 }.
% 0.69/1.11 (8) {G1,W4,D2,L2,V1,M1} F(2);r(4) { ! f( X ), h( X ) }.
% 0.69/1.11 (9) {G2,W4,D2,L2,V1,M1} S(3);r(8) { ! f( X ), g( X ) }.
% 0.69/1.11 (10) {G3,W1,D1,L1,V0,M1} R(9,1);r(0) { alpha1 }.
% 0.69/1.11 (11) {G4,W2,D2,L1,V1,M1} R(10,5) { f( X ) }.
% 0.69/1.11 (13) {G4,W2,D2,L1,V1,M1} R(10,7) { ! h( X ) }.
% 0.69/1.11 (14) {G5,W0,D0,L0,V0,M0} R(13,8);r(11) { }.
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 % SZS output end Refutation
% 0.69/1.11 found a proof!
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Unprocessed initial clauses:
% 0.69/1.11
% 0.69/1.11 (16) {G0,W3,D2,L2,V0,M2} { alpha1, f( skol1 ) }.
% 0.69/1.11 (17) {G0,W3,D2,L2,V0,M2} { alpha1, ! g( skol1 ) }.
% 0.69/1.11 (18) {G0,W8,D2,L4,V2,M4} { ! f( X ), g( X ), ! f( Y ), h( Y ) }.
% 0.69/1.11 (19) {G0,W6,D2,L3,V1,M3} { ! f( X ), ! h( X ), g( X ) }.
% 0.69/1.11 (20) {G0,W6,D2,L3,V1,M3} { ! f( X ), ! g( X ), h( X ) }.
% 0.69/1.11 (21) {G0,W3,D2,L2,V1,M2} { ! alpha1, f( X ) }.
% 0.69/1.11 (22) {G0,W3,D2,L2,V1,M2} { ! alpha1, g( X ) }.
% 0.69/1.11 (23) {G0,W3,D2,L2,V1,M2} { ! alpha1, ! h( X ) }.
% 0.69/1.11 (24) {G0,W7,D2,L4,V0,M4} { ! f( skol2 ), ! g( skol2 ), h( skol2 ), alpha1
% 0.69/1.11 }.
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Total Proof:
% 0.69/1.11
% 0.69/1.11 subsumption: (0) {G0,W3,D2,L2,V0,M1} I { alpha1, f( skol1 ) }.
% 0.69/1.11 parent0: (16) {G0,W3,D2,L2,V0,M2} { alpha1, f( skol1 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 1
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (1) {G0,W3,D2,L2,V0,M1} I { alpha1, ! g( skol1 ) }.
% 0.69/1.11 parent0: (17) {G0,W3,D2,L2,V0,M2} { alpha1, ! g( skol1 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 1
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (2) {G0,W8,D2,L4,V2,M1} I { ! f( X ), ! f( Y ), g( X ), h( Y )
% 0.69/1.11 }.
% 0.69/1.11 parent0: (18) {G0,W8,D2,L4,V2,M4} { ! f( X ), g( X ), ! f( Y ), h( Y ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 2
% 0.69/1.11 2 ==> 1
% 0.69/1.11 3 ==> 3
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (3) {G0,W6,D2,L3,V1,M1} I { ! f( X ), g( X ), ! h( X ) }.
% 0.69/1.11 parent0: (19) {G0,W6,D2,L3,V1,M3} { ! f( X ), ! h( X ), g( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 2
% 0.69/1.11 2 ==> 1
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (4) {G0,W6,D2,L3,V1,M1} I { ! f( X ), ! g( X ), h( X ) }.
% 0.69/1.11 parent0: (20) {G0,W6,D2,L3,V1,M3} { ! f( X ), ! g( X ), h( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 1
% 0.69/1.11 2 ==> 2
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (5) {G0,W3,D2,L2,V1,M1} I { f( X ), ! alpha1 }.
% 0.69/1.11 parent0: (21) {G0,W3,D2,L2,V1,M2} { ! alpha1, f( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 1
% 0.69/1.11 1 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (7) {G0,W3,D2,L2,V1,M1} I { ! h( X ), ! alpha1 }.
% 0.69/1.11 parent0: (23) {G0,W3,D2,L2,V1,M2} { ! alpha1, ! h( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 1
% 0.69/1.11 1 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 factor: (30) {G0,W6,D2,L3,V1,M3} { ! f( X ), g( X ), h( X ) }.
% 0.69/1.11 parent0[0, 1]: (2) {G0,W8,D2,L4,V2,M1} I { ! f( X ), ! f( Y ), g( X ), h( Y
% 0.69/1.11 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := X
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (31) {G1,W8,D2,L4,V1,M4} { ! f( X ), h( X ), ! f( X ), h( X )
% 0.69/1.11 }.
% 0.69/1.11 parent0[1]: (4) {G0,W6,D2,L3,V1,M1} I { ! f( X ), ! g( X ), h( X ) }.
% 0.69/1.11 parent1[1]: (30) {G0,W6,D2,L3,V1,M3} { ! f( X ), g( X ), h( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 factor: (32) {G1,W6,D2,L3,V1,M3} { ! f( X ), h( X ), h( X ) }.
% 0.69/1.11 parent0[0, 2]: (31) {G1,W8,D2,L4,V1,M4} { ! f( X ), h( X ), ! f( X ), h( X
% 0.69/1.11 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 factor: (33) {G1,W4,D2,L2,V1,M2} { ! f( X ), h( X ) }.
% 0.69/1.11 parent0[1, 2]: (32) {G1,W6,D2,L3,V1,M3} { ! f( X ), h( X ), h( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (8) {G1,W4,D2,L2,V1,M1} F(2);r(4) { ! f( X ), h( X ) }.
% 0.69/1.11 parent0: (33) {G1,W4,D2,L2,V1,M2} { ! f( X ), h( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 1
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (34) {G1,W6,D2,L3,V1,M3} { ! f( X ), g( X ), ! f( X ) }.
% 0.69/1.11 parent0[2]: (3) {G0,W6,D2,L3,V1,M1} I { ! f( X ), g( X ), ! h( X ) }.
% 0.69/1.11 parent1[1]: (8) {G1,W4,D2,L2,V1,M1} F(2);r(4) { ! f( X ), h( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 factor: (35) {G1,W4,D2,L2,V1,M2} { ! f( X ), g( X ) }.
% 0.69/1.11 parent0[0, 2]: (34) {G1,W6,D2,L3,V1,M3} { ! f( X ), g( X ), ! f( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (9) {G2,W4,D2,L2,V1,M1} S(3);r(8) { ! f( X ), g( X ) }.
% 0.69/1.11 parent0: (35) {G1,W4,D2,L2,V1,M2} { ! f( X ), g( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 1
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (36) {G1,W3,D2,L2,V0,M2} { alpha1, ! f( skol1 ) }.
% 0.69/1.11 parent0[1]: (1) {G0,W3,D2,L2,V0,M1} I { alpha1, ! g( skol1 ) }.
% 0.69/1.11 parent1[1]: (9) {G2,W4,D2,L2,V1,M1} S(3);r(8) { ! f( X ), g( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 X := skol1
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (37) {G1,W2,D1,L2,V0,M2} { alpha1, alpha1 }.
% 0.69/1.11 parent0[1]: (36) {G1,W3,D2,L2,V0,M2} { alpha1, ! f( skol1 ) }.
% 0.69/1.11 parent1[1]: (0) {G0,W3,D2,L2,V0,M1} I { alpha1, f( skol1 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 factor: (38) {G1,W1,D1,L1,V0,M1} { alpha1 }.
% 0.69/1.11 parent0[0, 1]: (37) {G1,W2,D1,L2,V0,M2} { alpha1, alpha1 }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (10) {G3,W1,D1,L1,V0,M1} R(9,1);r(0) { alpha1 }.
% 0.69/1.11 parent0: (38) {G1,W1,D1,L1,V0,M1} { alpha1 }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (39) {G1,W2,D2,L1,V1,M1} { f( X ) }.
% 0.69/1.11 parent0[1]: (5) {G0,W3,D2,L2,V1,M1} I { f( X ), ! alpha1 }.
% 0.69/1.11 parent1[0]: (10) {G3,W1,D1,L1,V0,M1} R(9,1);r(0) { alpha1 }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (11) {G4,W2,D2,L1,V1,M1} R(10,5) { f( X ) }.
% 0.69/1.11 parent0: (39) {G1,W2,D2,L1,V1,M1} { f( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (40) {G1,W2,D2,L1,V1,M1} { ! h( X ) }.
% 0.69/1.11 parent0[1]: (7) {G0,W3,D2,L2,V1,M1} I { ! h( X ), ! alpha1 }.
% 0.69/1.11 parent1[0]: (10) {G3,W1,D1,L1,V0,M1} R(9,1);r(0) { alpha1 }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (13) {G4,W2,D2,L1,V1,M1} R(10,7) { ! h( X ) }.
% 0.69/1.11 parent0: (40) {G1,W2,D2,L1,V1,M1} { ! h( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (41) {G2,W2,D2,L1,V1,M1} { ! f( X ) }.
% 0.69/1.11 parent0[0]: (13) {G4,W2,D2,L1,V1,M1} R(10,7) { ! h( X ) }.
% 0.69/1.11 parent1[1]: (8) {G1,W4,D2,L2,V1,M1} F(2);r(4) { ! f( X ), h( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (42) {G3,W0,D0,L0,V0,M0} { }.
% 0.69/1.11 parent0[0]: (41) {G2,W2,D2,L1,V1,M1} { ! f( X ) }.
% 0.69/1.11 parent1[0]: (11) {G4,W2,D2,L1,V1,M1} R(10,5) { f( X ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (14) {G5,W0,D0,L0,V0,M0} R(13,8);r(11) { }.
% 0.69/1.11 parent0: (42) {G3,W0,D0,L0,V0,M0} { }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 Proof check complete!
% 0.69/1.11
% 0.69/1.11 Memory use:
% 0.69/1.11
% 0.69/1.11 space for terms: 212
% 0.69/1.11 space for clauses: 664
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 clauses generated: 17
% 0.69/1.11 clauses kept: 15
% 0.69/1.11 clauses selected: 11
% 0.69/1.11 clauses deleted: 3
% 0.69/1.11 clauses inuse deleted: 0
% 0.69/1.11
% 0.69/1.11 subsentry: 5
% 0.69/1.11 literals s-matched: 5
% 0.69/1.11 literals matched: 5
% 0.69/1.11 full subsumption: 1
% 0.69/1.11
% 0.69/1.11 checksum: 218443
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksem ended
%------------------------------------------------------------------------------