%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWX200+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n031.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 May 5 06:56:47 PM UTC 2026
% Result : Theorem 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX200+1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13 % Command : bliksem %s
% 0.18/0.34 % Computer : n031.cluster.edu
% 0.18/0.34 % Model : x86_64 x86_64
% 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34 % Memory : 8042.1875MB
% 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34 % CPULimit : 300
% 0.18/0.34 % DateTime : Tue May 5 11:16:23 EDT 2026
% 0.18/0.34 % CPUTime :
% 0.71/1.10 *** allocated 10000 integers for termspace/termends
% 0.71/1.10 *** allocated 10000 integers for clauses
% 0.71/1.10 *** allocated 10000 integers for justifications
% 0.71/1.10 Bliksem 1.12
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Automatic Strategy Selection
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Clauses:
% 0.71/1.10
% 0.71/1.10 { head( cons( X, Y ) ) = X }.
% 0.71/1.10 { tail( cons( X, Y ) ) = Y }.
% 0.71/1.10 { ! nil = cons( X, Y ) }.
% 0.71/1.10 { proj1S( s( X ) ) = X }.
% 0.71/1.10 { ! z = s( X ) }.
% 0.71/1.10 { leqNat( z, X ) }.
% 0.71/1.10 { ! leqNat( s( X ), z ) }.
% 0.71/1.10 { ! leqNat( s( X ), s( Y ) ), leqNat( X, Y ) }.
% 0.71/1.10 { ! leqNat( X, Y ), leqNat( s( X ), s( Y ) ) }.
% 0.71/1.10 { merge( nil, X ) = X }.
% 0.71/1.10 { merge( cons( X, Y ), nil ) = cons( X, Y ) }.
% 0.71/1.10 { ! leqNat( X, Y ), merge( cons( X, Z ), cons( Y, T ) ) = cons( X, merge( Z
% 0.71/1.10 , cons( Y, T ) ) ) }.
% 0.71/1.10 { leqNat( X, Y ), merge( cons( X, Z ), cons( Y, T ) ) = cons( Y, merge(
% 0.71/1.10 cons( X, Z ), T ) ) }.
% 0.71/1.10 { ord( nil ) }.
% 0.71/1.10 { ord( cons( X, nil ) ) }.
% 0.71/1.10 { ! ord( cons( X, cons( Y, Z ) ) ), leqNat( X, Y ) }.
% 0.71/1.10 { ! ord( cons( X, cons( Y, Z ) ) ), ord( cons( Y, Z ) ) }.
% 0.71/1.10 { ! leqNat( X, Y ), ! ord( cons( Y, Z ) ), ord( cons( X, cons( Y, Z ) ) ) }
% 0.71/1.10 .
% 0.71/1.10 { ! ord( X ), ord( Y ), ord( merge( X, Y ) ) }.
% 0.71/1.10
% 0.71/1.10 percentage equality = 0.310345, percentage horn = 0.894737
% 0.71/1.10 This is a problem with some equality
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Options Used:
% 0.71/1.10
% 0.71/1.10 useres = 1
% 0.71/1.10 useparamod = 1
% 0.71/1.10 useeqrefl = 1
% 0.71/1.10 useeqfact = 1
% 0.71/1.10 usefactor = 1
% 0.71/1.10 usesimpsplitting = 0
% 0.71/1.10 usesimpdemod = 5
% 0.71/1.10 usesimpres = 3
% 0.71/1.10
% 0.71/1.10 resimpinuse = 1000
% 0.71/1.10 resimpclauses = 20000
% 0.71/1.10 substype = eqrewr
% 0.71/1.10 backwardsubs = 1
% 0.71/1.10 selectoldest = 5
% 0.71/1.10
% 0.71/1.10 litorderings [0] = split
% 0.71/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.10
% 0.71/1.10 termordering = kbo
% 0.71/1.10
% 0.71/1.10 litapriori = 0
% 0.71/1.10 termapriori = 1
% 0.71/1.10 litaposteriori = 0
% 0.71/1.10 termaposteriori = 0
% 0.71/1.10 demodaposteriori = 0
% 0.71/1.10 ordereqreflfact = 0
% 0.71/1.10
% 0.71/1.10 litselect = negord
% 0.71/1.10
% 0.71/1.10 maxweight = 15
% 0.71/1.10 maxdepth = 30000
% 0.71/1.10 maxlength = 115
% 0.71/1.10 maxnrvars = 195
% 0.71/1.10 excuselevel = 1
% 0.71/1.10 increasemaxweight = 1
% 0.71/1.10
% 0.71/1.10 maxselected = 10000000
% 0.71/1.10 maxnrclauses = 10000000
% 0.71/1.10
% 0.71/1.10 showgenerated = 0
% 0.71/1.10 showkept = 0
% 0.71/1.10 showselected = 0
% 0.71/1.10 showdeleted = 0
% 0.71/1.10 showresimp = 1
% 0.71/1.10 showstatus = 2000
% 0.71/1.10
% 0.71/1.10 prologoutput = 0
% 0.71/1.10 nrgoals = 5000000
% 0.71/1.10 totalproof = 1
% 0.71/1.10
% 0.71/1.10 Symbols occurring in the translation:
% 0.71/1.10
% 0.71/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.10 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.71/1.10 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.71/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 cons [37, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.10 head [38, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.10 tail [39, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.71/1.10 nil [40, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.71/1.10 s [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.10 proj1S [42, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.71/1.10 z [43, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.10 leqNat [45, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.71/1.10 merge [48, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.71/1.10 ord [52, 1] (w:1, o:24, a:1, s:1, b:0).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Starting Search:
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksems!, er is een bewijs:
% 0.71/1.10 % SZS status Theorem
% 0.71/1.10 % SZS output start Refutation
% 0.71/1.10
% 0.71/1.10 (6) {G0,W4,D3,L1,V1,M1} I { ! leqNat( s( X ), z ) }.
% 0.71/1.10 (7) {G0,W8,D3,L2,V2,M2} I { ! leqNat( s( X ), s( Y ) ), leqNat( X, Y ) }.
% 0.71/1.10 (9) {G0,W5,D3,L1,V1,M1} I { merge( nil, X ) ==> X }.
% 0.71/1.10 (13) {G0,W2,D2,L1,V0,M1} I { ord( nil ) }.
% 0.71/1.10 (15) {G0,W9,D4,L2,V3,M2} I { ! ord( cons( X, cons( Y, Z ) ) ), leqNat( X, Y
% 0.71/1.10 ) }.
% 0.71/1.10 (18) {G0,W8,D3,L3,V2,M3} I { ! ord( X ), ord( Y ), ord( merge( X, Y ) ) }.
% 0.71/1.10 (20) {G1,W6,D4,L1,V1,M1} R(7,6) { ! leqNat( s( s( X ) ), s( z ) ) }.
% 0.71/1.10 (21) {G2,W8,D5,L1,V1,M1} R(20,7) { ! leqNat( s( s( s( X ) ) ), s( s( z ) )
% 0.71/1.10 ) }.
% 0.71/1.10 (29) {G1,W2,D2,L1,V1,M1} R(18,13);d(9);f { ord( X ) }.
% 0.71/1.10 (34) {G2,W3,D2,L1,V2,M1} S(15);r(29) { leqNat( X, Y ) }.
% 0.71/1.10 (36) {G3,W0,D0,L0,V0,M0} R(34,21) { }.
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 % SZS output end Refutation
% 0.71/1.10 found a proof!
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Unprocessed initial clauses:
% 0.71/1.10
% 0.71/1.10 (38) {G0,W6,D4,L1,V2,M1} { head( cons( X, Y ) ) = X }.
% 0.71/1.10 (39) {G0,W6,D4,L1,V2,M1} { tail( cons( X, Y ) ) = Y }.
% 0.71/1.10 (40) {G0,W5,D3,L1,V2,M1} { ! nil = cons( X, Y ) }.
% 0.71/1.10 (41) {G0,W5,D4,L1,V1,M1} { proj1S( s( X ) ) = X }.
% 0.71/1.10 (42) {G0,W4,D3,L1,V1,M1} { ! z = s( X ) }.
% 0.71/1.10 (43) {G0,W3,D2,L1,V1,M1} { leqNat( z, X ) }.
% 0.71/1.10 (44) {G0,W4,D3,L1,V1,M1} { ! leqNat( s( X ), z ) }.
% 0.71/1.10 (45) {G0,W8,D3,L2,V2,M2} { ! leqNat( s( X ), s( Y ) ), leqNat( X, Y ) }.
% 0.71/1.10 (46) {G0,W8,D3,L2,V2,M2} { ! leqNat( X, Y ), leqNat( s( X ), s( Y ) ) }.
% 0.71/1.10 (47) {G0,W5,D3,L1,V1,M1} { merge( nil, X ) = X }.
% 0.71/1.10 (48) {G0,W9,D4,L1,V2,M1} { merge( cons( X, Y ), nil ) = cons( X, Y ) }.
% 0.71/1.10 (49) {G0,W18,D5,L2,V4,M2} { ! leqNat( X, Y ), merge( cons( X, Z ), cons( Y
% 0.71/1.10 , T ) ) = cons( X, merge( Z, cons( Y, T ) ) ) }.
% 0.71/1.10 (50) {G0,W18,D5,L2,V4,M2} { leqNat( X, Y ), merge( cons( X, Z ), cons( Y,
% 0.71/1.10 T ) ) = cons( Y, merge( cons( X, Z ), T ) ) }.
% 0.71/1.10 (51) {G0,W2,D2,L1,V0,M1} { ord( nil ) }.
% 0.71/1.10 (52) {G0,W4,D3,L1,V1,M1} { ord( cons( X, nil ) ) }.
% 0.71/1.10 (53) {G0,W9,D4,L2,V3,M2} { ! ord( cons( X, cons( Y, Z ) ) ), leqNat( X, Y
% 0.71/1.10 ) }.
% 0.71/1.10 (54) {G0,W10,D4,L2,V3,M2} { ! ord( cons( X, cons( Y, Z ) ) ), ord( cons( Y
% 0.71/1.10 , Z ) ) }.
% 0.71/1.10 (55) {G0,W13,D4,L3,V3,M3} { ! leqNat( X, Y ), ! ord( cons( Y, Z ) ), ord(
% 0.71/1.10 cons( X, cons( Y, Z ) ) ) }.
% 0.71/1.10 (56) {G0,W8,D3,L3,V2,M3} { ! ord( X ), ord( Y ), ord( merge( X, Y ) ) }.
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Total Proof:
% 0.71/1.10
% 0.71/1.10 subsumption: (6) {G0,W4,D3,L1,V1,M1} I { ! leqNat( s( X ), z ) }.
% 0.71/1.10 parent0: (44) {G0,W4,D3,L1,V1,M1} { ! leqNat( s( X ), z ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (7) {G0,W8,D3,L2,V2,M2} I { ! leqNat( s( X ), s( Y ) ), leqNat
% 0.71/1.10 ( X, Y ) }.
% 0.71/1.10 parent0: (45) {G0,W8,D3,L2,V2,M2} { ! leqNat( s( X ), s( Y ) ), leqNat( X
% 0.71/1.10 , Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (9) {G0,W5,D3,L1,V1,M1} I { merge( nil, X ) ==> X }.
% 0.71/1.10 parent0: (47) {G0,W5,D3,L1,V1,M1} { merge( nil, X ) = X }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (13) {G0,W2,D2,L1,V0,M1} I { ord( nil ) }.
% 0.71/1.10 parent0: (51) {G0,W2,D2,L1,V0,M1} { ord( nil ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (15) {G0,W9,D4,L2,V3,M2} I { ! ord( cons( X, cons( Y, Z ) ) )
% 0.71/1.10 , leqNat( X, Y ) }.
% 0.71/1.10 parent0: (53) {G0,W9,D4,L2,V3,M2} { ! ord( cons( X, cons( Y, Z ) ) ),
% 0.71/1.10 leqNat( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (18) {G0,W8,D3,L3,V2,M3} I { ! ord( X ), ord( Y ), ord( merge
% 0.71/1.10 ( X, Y ) ) }.
% 0.71/1.10 parent0: (56) {G0,W8,D3,L3,V2,M3} { ! ord( X ), ord( Y ), ord( merge( X, Y
% 0.71/1.10 ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 2 ==> 2
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (100) {G1,W6,D4,L1,V1,M1} { ! leqNat( s( s( X ) ), s( z ) )
% 0.71/1.10 }.
% 0.71/1.10 parent0[0]: (6) {G0,W4,D3,L1,V1,M1} I { ! leqNat( s( X ), z ) }.
% 0.71/1.10 parent1[1]: (7) {G0,W8,D3,L2,V2,M2} I { ! leqNat( s( X ), s( Y ) ), leqNat
% 0.71/1.10 ( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := s( X )
% 0.71/1.10 Y := z
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (20) {G1,W6,D4,L1,V1,M1} R(7,6) { ! leqNat( s( s( X ) ), s( z
% 0.71/1.10 ) ) }.
% 0.71/1.10 parent0: (100) {G1,W6,D4,L1,V1,M1} { ! leqNat( s( s( X ) ), s( z ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (101) {G1,W8,D5,L1,V1,M1} { ! leqNat( s( s( s( X ) ) ), s( s(
% 0.71/1.10 z ) ) ) }.
% 0.71/1.10 parent0[0]: (20) {G1,W6,D4,L1,V1,M1} R(7,6) { ! leqNat( s( s( X ) ), s( z )
% 0.71/1.10 ) }.
% 0.71/1.10 parent1[1]: (7) {G0,W8,D3,L2,V2,M2} I { ! leqNat( s( X ), s( Y ) ), leqNat
% 0.71/1.10 ( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := s( s( X ) )
% 0.71/1.10 Y := s( z )
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (21) {G2,W8,D5,L1,V1,M1} R(20,7) { ! leqNat( s( s( s( X ) ) )
% 0.71/1.10 , s( s( z ) ) ) }.
% 0.71/1.10 parent0: (101) {G1,W8,D5,L1,V1,M1} { ! leqNat( s( s( s( X ) ) ), s( s( z )
% 0.71/1.10 ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (103) {G1,W6,D3,L2,V1,M2} { ord( X ), ord( merge( nil, X ) )
% 0.71/1.10 }.
% 0.71/1.10 parent0[0]: (18) {G0,W8,D3,L3,V2,M3} I { ! ord( X ), ord( Y ), ord( merge(
% 0.71/1.10 X, Y ) ) }.
% 0.71/1.10 parent1[0]: (13) {G0,W2,D2,L1,V0,M1} I { ord( nil ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := nil
% 0.71/1.10 Y := X
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 paramod: (104) {G1,W4,D2,L2,V1,M2} { ord( X ), ord( X ) }.
% 0.71/1.10 parent0[0]: (9) {G0,W5,D3,L1,V1,M1} I { merge( nil, X ) ==> X }.
% 0.71/1.10 parent1[1; 1]: (103) {G1,W6,D3,L2,V1,M2} { ord( X ), ord( merge( nil, X )
% 0.71/1.10 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 factor: (105) {G1,W2,D2,L1,V1,M1} { ord( X ) }.
% 0.71/1.10 parent0[0, 1]: (104) {G1,W4,D2,L2,V1,M2} { ord( X ), ord( X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (29) {G1,W2,D2,L1,V1,M1} R(18,13);d(9);f { ord( X ) }.
% 0.71/1.10 parent0: (105) {G1,W2,D2,L1,V1,M1} { ord( X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (106) {G1,W3,D2,L1,V2,M1} { leqNat( X, Y ) }.
% 0.71/1.10 parent0[0]: (15) {G0,W9,D4,L2,V3,M2} I { ! ord( cons( X, cons( Y, Z ) ) ),
% 0.71/1.10 leqNat( X, Y ) }.
% 0.71/1.10 parent1[0]: (29) {G1,W2,D2,L1,V1,M1} R(18,13);d(9);f { ord( X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := cons( X, cons( Y, Z ) )
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (34) {G2,W3,D2,L1,V2,M1} S(15);r(29) { leqNat( X, Y ) }.
% 0.71/1.10 parent0: (106) {G1,W3,D2,L1,V2,M1} { leqNat( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (107) {G3,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 parent0[0]: (21) {G2,W8,D5,L1,V1,M1} R(20,7) { ! leqNat( s( s( s( X ) ) ),
% 0.71/1.10 s( s( z ) ) ) }.
% 0.71/1.10 parent1[0]: (34) {G2,W3,D2,L1,V2,M1} S(15);r(29) { leqNat( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := s( s( s( X ) ) )
% 0.71/1.10 Y := s( s( z ) )
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (36) {G3,W0,D0,L0,V0,M0} R(34,21) { }.
% 0.71/1.10 parent0: (107) {G3,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 Proof check complete!
% 0.71/1.10
% 0.71/1.10 Memory use:
% 0.71/1.10
% 0.71/1.10 space for terms: 734
% 0.71/1.10 space for clauses: 2800
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 clauses generated: 68
% 0.71/1.10 clauses kept: 37
% 0.71/1.10 clauses selected: 21
% 0.71/1.10 clauses deleted: 2
% 0.71/1.10 clauses inuse deleted: 0
% 0.71/1.10
% 0.71/1.10 subsentry: 289
% 0.71/1.10 literals s-matched: 158
% 0.71/1.10 literals matched: 158
% 0.71/1.10 full subsumption: 9
% 0.71/1.10
% 0.71/1.10 checksum: -1998322358
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksem ended
%------------------------------------------------------------------------------