TSTP Solution File: SET925+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET925+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.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:23 EDT 2022
% Result : Theorem 0.42s 1.05s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET925+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n008.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 Jul 11 04:21:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.05 *** allocated 10000 integers for termspace/termends
% 0.42/1.05 *** allocated 10000 integers for clauses
% 0.42/1.05 *** allocated 10000 integers for justifications
% 0.42/1.05 Bliksem 1.12
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Automatic Strategy Selection
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Clauses:
% 0.42/1.05
% 0.42/1.05 { ! in( X, Y ), ! in( Y, X ) }.
% 0.42/1.05 { empty( empty_set ) }.
% 0.42/1.05 { empty( skol1 ) }.
% 0.42/1.05 { ! empty( skol2 ) }.
% 0.42/1.05 { alpha1( skol3, skol4 ), in( skol3, skol4 ) }.
% 0.42/1.05 { alpha1( skol3, skol4 ), ! set_difference( singleton( skol3 ), skol4 ) =
% 0.42/1.05 empty_set }.
% 0.42/1.05 { ! alpha1( X, Y ), set_difference( singleton( X ), Y ) = empty_set }.
% 0.42/1.05 { ! alpha1( X, Y ), ! in( X, Y ) }.
% 0.42/1.05 { ! set_difference( singleton( X ), Y ) = empty_set, in( X, Y ), alpha1( X
% 0.42/1.05 , Y ) }.
% 0.42/1.05 { ! set_difference( singleton( X ), Y ) = empty_set, in( X, Y ) }.
% 0.42/1.05 { ! in( X, Y ), set_difference( singleton( X ), Y ) = empty_set }.
% 0.42/1.05
% 0.42/1.05 percentage equality = 0.250000, percentage horn = 0.818182
% 0.42/1.05 This is a problem with some equality
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Options Used:
% 0.42/1.05
% 0.42/1.05 useres = 1
% 0.42/1.05 useparamod = 1
% 0.42/1.05 useeqrefl = 1
% 0.42/1.05 useeqfact = 1
% 0.42/1.05 usefactor = 1
% 0.42/1.05 usesimpsplitting = 0
% 0.42/1.05 usesimpdemod = 5
% 0.42/1.05 usesimpres = 3
% 0.42/1.05
% 0.42/1.05 resimpinuse = 1000
% 0.42/1.05 resimpclauses = 20000
% 0.42/1.05 substype = eqrewr
% 0.42/1.05 backwardsubs = 1
% 0.42/1.05 selectoldest = 5
% 0.42/1.05
% 0.42/1.05 litorderings [0] = split
% 0.42/1.05 litorderings [1] = extend the termordering, first sorting on arguments
% 0.42/1.05
% 0.42/1.05 termordering = kbo
% 0.42/1.05
% 0.42/1.05 litapriori = 0
% 0.42/1.05 termapriori = 1
% 0.42/1.05 litaposteriori = 0
% 0.42/1.05 termaposteriori = 0
% 0.42/1.05 demodaposteriori = 0
% 0.42/1.05 ordereqreflfact = 0
% 0.42/1.05
% 0.42/1.05 litselect = negord
% 0.42/1.05
% 0.42/1.05 maxweight = 15
% 0.42/1.05 maxdepth = 30000
% 0.42/1.05 maxlength = 115
% 0.42/1.05 maxnrvars = 195
% 0.42/1.05 excuselevel = 1
% 0.42/1.05 increasemaxweight = 1
% 0.42/1.05
% 0.42/1.05 maxselected = 10000000
% 0.42/1.05 maxnrclauses = 10000000
% 0.42/1.05
% 0.42/1.05 showgenerated = 0
% 0.42/1.05 showkept = 0
% 0.42/1.05 showselected = 0
% 0.42/1.05 showdeleted = 0
% 0.42/1.05 showresimp = 1
% 0.42/1.05 showstatus = 2000
% 0.42/1.05
% 0.42/1.05 prologoutput = 0
% 0.42/1.05 nrgoals = 5000000
% 0.42/1.05 totalproof = 1
% 0.42/1.05
% 0.42/1.05 Symbols occurring in the translation:
% 0.42/1.05
% 0.42/1.05 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.05 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.42/1.05 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.42/1.05 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.05 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.05 in [37, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.42/1.05 empty_set [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.42/1.05 empty [39, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.42/1.05 singleton [40, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.05 set_difference [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.42/1.05 alpha1 [42, 2] (w:1, o:46, a:1, s:1, b:1),
% 0.42/1.05 skol1 [43, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.42/1.05 skol2 [44, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.42/1.05 skol3 [45, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.42/1.05 skol4 [46, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Starting Search:
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Bliksems!, er is een bewijs:
% 0.42/1.05 % SZS status Theorem
% 0.42/1.05 % SZS output start Refutation
% 0.42/1.05
% 0.42/1.05 (4) {G0,W6,D2,L2,V0,M2} I { alpha1( skol3, skol4 ), in( skol3, skol4 ) }.
% 0.42/1.05 (5) {G0,W9,D4,L2,V0,M2} I { alpha1( skol3, skol4 ), ! set_difference(
% 0.42/1.05 singleton( skol3 ), skol4 ) ==> empty_set }.
% 0.42/1.05 (6) {G0,W9,D4,L2,V2,M2} I { ! alpha1( X, Y ), set_difference( singleton( X
% 0.42/1.05 ), Y ) ==> empty_set }.
% 0.42/1.05 (7) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), ! in( X, Y ) }.
% 0.42/1.05 (9) {G0,W9,D4,L2,V2,M2} I { ! set_difference( singleton( X ), Y ) ==>
% 0.42/1.05 empty_set, in( X, Y ) }.
% 0.42/1.05 (10) {G0,W9,D4,L2,V2,M2} I { ! in( X, Y ), set_difference( singleton( X ),
% 0.42/1.05 Y ) ==> empty_set }.
% 0.42/1.05 (13) {G1,W3,D2,L1,V0,M1} R(10,4);r(5) { alpha1( skol3, skol4 ) }.
% 0.42/1.05 (17) {G1,W3,D2,L1,V2,M1} R(9,7);d(6);q { ! alpha1( X, Y ) }.
% 0.42/1.05 (19) {G2,W0,D0,L0,V0,M0} R(17,13) { }.
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 % SZS output end Refutation
% 0.42/1.05 found a proof!
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Unprocessed initial clauses:
% 0.42/1.05
% 0.42/1.05 (21) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.42/1.05 (22) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.42/1.05 (23) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.42/1.05 (24) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.42/1.05 (25) {G0,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), in( skol3, skol4 ) }.
% 0.42/1.05 (26) {G0,W9,D4,L2,V0,M2} { alpha1( skol3, skol4 ), ! set_difference(
% 0.42/1.05 singleton( skol3 ), skol4 ) = empty_set }.
% 0.42/1.05 (27) {G0,W9,D4,L2,V2,M2} { ! alpha1( X, Y ), set_difference( singleton( X
% 0.42/1.05 ), Y ) = empty_set }.
% 0.42/1.05 (28) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! in( X, Y ) }.
% 0.42/1.05 (29) {G0,W12,D4,L3,V2,M3} { ! set_difference( singleton( X ), Y ) =
% 0.42/1.05 empty_set, in( X, Y ), alpha1( X, Y ) }.
% 0.42/1.05 (30) {G0,W9,D4,L2,V2,M2} { ! set_difference( singleton( X ), Y ) =
% 0.42/1.05 empty_set, in( X, Y ) }.
% 0.42/1.05 (31) {G0,W9,D4,L2,V2,M2} { ! in( X, Y ), set_difference( singleton( X ), Y
% 0.42/1.05 ) = empty_set }.
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Total Proof:
% 0.42/1.05
% 0.42/1.05 subsumption: (4) {G0,W6,D2,L2,V0,M2} I { alpha1( skol3, skol4 ), in( skol3
% 0.42/1.05 , skol4 ) }.
% 0.42/1.05 parent0: (25) {G0,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), in( skol3,
% 0.42/1.05 skol4 ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 end
% 0.42/1.05 permutation0:
% 0.42/1.05 0 ==> 0
% 0.42/1.05 1 ==> 1
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 subsumption: (5) {G0,W9,D4,L2,V0,M2} I { alpha1( skol3, skol4 ), !
% 0.42/1.05 set_difference( singleton( skol3 ), skol4 ) ==> empty_set }.
% 0.42/1.05 parent0: (26) {G0,W9,D4,L2,V0,M2} { alpha1( skol3, skol4 ), !
% 0.42/1.05 set_difference( singleton( skol3 ), skol4 ) = empty_set }.
% 0.42/1.05 substitution0:
% 0.42/1.05 end
% 0.42/1.05 permutation0:
% 0.42/1.05 0 ==> 0
% 0.42/1.05 1 ==> 1
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 subsumption: (6) {G0,W9,D4,L2,V2,M2} I { ! alpha1( X, Y ), set_difference(
% 0.42/1.05 singleton( X ), Y ) ==> empty_set }.
% 0.42/1.05 parent0: (27) {G0,W9,D4,L2,V2,M2} { ! alpha1( X, Y ), set_difference(
% 0.42/1.05 singleton( X ), Y ) = empty_set }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05 permutation0:
% 0.42/1.05 0 ==> 0
% 0.42/1.05 1 ==> 1
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 subsumption: (7) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), ! in( X, Y ) }.
% 0.42/1.05 parent0: (28) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! in( X, Y ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05 permutation0:
% 0.42/1.05 0 ==> 0
% 0.42/1.05 1 ==> 1
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 subsumption: (9) {G0,W9,D4,L2,V2,M2} I { ! set_difference( singleton( X ),
% 0.42/1.05 Y ) ==> empty_set, in( X, Y ) }.
% 0.42/1.05 parent0: (30) {G0,W9,D4,L2,V2,M2} { ! set_difference( singleton( X ), Y )
% 0.42/1.05 = empty_set, in( X, Y ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05 permutation0:
% 0.42/1.05 0 ==> 0
% 0.42/1.05 1 ==> 1
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 subsumption: (10) {G0,W9,D4,L2,V2,M2} I { ! in( X, Y ), set_difference(
% 0.42/1.05 singleton( X ), Y ) ==> empty_set }.
% 0.42/1.05 parent0: (31) {G0,W9,D4,L2,V2,M2} { ! in( X, Y ), set_difference(
% 0.42/1.05 singleton( X ), Y ) = empty_set }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05 permutation0:
% 0.42/1.05 0 ==> 0
% 0.42/1.05 1 ==> 1
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 eqswap: (52) {G0,W9,D4,L2,V2,M2} { empty_set ==> set_difference( singleton
% 0.42/1.05 ( X ), Y ), ! in( X, Y ) }.
% 0.42/1.05 parent0[1]: (10) {G0,W9,D4,L2,V2,M2} I { ! in( X, Y ), set_difference(
% 0.42/1.05 singleton( X ), Y ) ==> empty_set }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 eqswap: (53) {G0,W9,D4,L2,V0,M2} { ! empty_set ==> set_difference(
% 0.42/1.05 singleton( skol3 ), skol4 ), alpha1( skol3, skol4 ) }.
% 0.42/1.05 parent0[1]: (5) {G0,W9,D4,L2,V0,M2} I { alpha1( skol3, skol4 ), !
% 0.42/1.05 set_difference( singleton( skol3 ), skol4 ) ==> empty_set }.
% 0.42/1.05 substitution0:
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 resolution: (54) {G1,W9,D4,L2,V0,M2} { empty_set ==> set_difference(
% 0.42/1.05 singleton( skol3 ), skol4 ), alpha1( skol3, skol4 ) }.
% 0.42/1.05 parent0[1]: (52) {G0,W9,D4,L2,V2,M2} { empty_set ==> set_difference(
% 0.42/1.05 singleton( X ), Y ), ! in( X, Y ) }.
% 0.42/1.05 parent1[1]: (4) {G0,W6,D2,L2,V0,M2} I { alpha1( skol3, skol4 ), in( skol3,
% 0.42/1.05 skol4 ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := skol3
% 0.42/1.05 Y := skol4
% 0.42/1.05 end
% 0.42/1.05 substitution1:
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 resolution: (55) {G1,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), alpha1(
% 0.42/1.05 skol3, skol4 ) }.
% 0.42/1.05 parent0[0]: (53) {G0,W9,D4,L2,V0,M2} { ! empty_set ==> set_difference(
% 0.42/1.05 singleton( skol3 ), skol4 ), alpha1( skol3, skol4 ) }.
% 0.42/1.05 parent1[0]: (54) {G1,W9,D4,L2,V0,M2} { empty_set ==> set_difference(
% 0.42/1.05 singleton( skol3 ), skol4 ), alpha1( skol3, skol4 ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 end
% 0.42/1.05 substitution1:
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 factor: (56) {G1,W3,D2,L1,V0,M1} { alpha1( skol3, skol4 ) }.
% 0.42/1.05 parent0[0, 1]: (55) {G1,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), alpha1(
% 0.42/1.05 skol3, skol4 ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 subsumption: (13) {G1,W3,D2,L1,V0,M1} R(10,4);r(5) { alpha1( skol3, skol4 )
% 0.42/1.05 }.
% 0.42/1.05 parent0: (56) {G1,W3,D2,L1,V0,M1} { alpha1( skol3, skol4 ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 end
% 0.42/1.05 permutation0:
% 0.42/1.05 0 ==> 0
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 eqswap: (57) {G0,W9,D4,L2,V2,M2} { ! empty_set ==> set_difference(
% 0.42/1.05 singleton( X ), Y ), in( X, Y ) }.
% 0.42/1.05 parent0[0]: (9) {G0,W9,D4,L2,V2,M2} I { ! set_difference( singleton( X ), Y
% 0.42/1.05 ) ==> empty_set, in( X, Y ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 resolution: (59) {G1,W9,D4,L2,V2,M2} { ! alpha1( X, Y ), ! empty_set ==>
% 0.42/1.05 set_difference( singleton( X ), Y ) }.
% 0.42/1.05 parent0[1]: (7) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), ! in( X, Y ) }.
% 0.42/1.05 parent1[1]: (57) {G0,W9,D4,L2,V2,M2} { ! empty_set ==> set_difference(
% 0.42/1.05 singleton( X ), Y ), in( X, Y ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05 substitution1:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 paramod: (60) {G1,W9,D2,L3,V2,M3} { ! empty_set ==> empty_set, ! alpha1( X
% 0.42/1.05 , Y ), ! alpha1( X, Y ) }.
% 0.42/1.05 parent0[1]: (6) {G0,W9,D4,L2,V2,M2} I { ! alpha1( X, Y ), set_difference(
% 0.42/1.05 singleton( X ), Y ) ==> empty_set }.
% 0.42/1.05 parent1[1; 3]: (59) {G1,W9,D4,L2,V2,M2} { ! alpha1( X, Y ), ! empty_set
% 0.42/1.05 ==> set_difference( singleton( X ), Y ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05 substitution1:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 factor: (61) {G1,W6,D2,L2,V2,M2} { ! empty_set ==> empty_set, ! alpha1( X
% 0.42/1.05 , Y ) }.
% 0.42/1.05 parent0[1, 2]: (60) {G1,W9,D2,L3,V2,M3} { ! empty_set ==> empty_set, !
% 0.42/1.05 alpha1( X, Y ), ! alpha1( X, Y ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 eqrefl: (62) {G0,W3,D2,L1,V2,M1} { ! alpha1( X, Y ) }.
% 0.42/1.05 parent0[0]: (61) {G1,W6,D2,L2,V2,M2} { ! empty_set ==> empty_set, ! alpha1
% 0.42/1.05 ( X, Y ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 subsumption: (17) {G1,W3,D2,L1,V2,M1} R(9,7);d(6);q { ! alpha1( X, Y ) }.
% 0.42/1.05 parent0: (62) {G0,W3,D2,L1,V2,M1} { ! alpha1( X, Y ) }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := X
% 0.42/1.05 Y := Y
% 0.42/1.05 end
% 0.42/1.05 permutation0:
% 0.42/1.05 0 ==> 0
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 resolution: (63) {G2,W0,D0,L0,V0,M0} { }.
% 0.42/1.05 parent0[0]: (17) {G1,W3,D2,L1,V2,M1} R(9,7);d(6);q { ! alpha1( X, Y ) }.
% 0.42/1.05 parent1[0]: (13) {G1,W3,D2,L1,V0,M1} R(10,4);r(5) { alpha1( skol3, skol4 )
% 0.42/1.05 }.
% 0.42/1.05 substitution0:
% 0.42/1.05 X := skol3
% 0.42/1.05 Y := skol4
% 0.42/1.05 end
% 0.42/1.05 substitution1:
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 subsumption: (19) {G2,W0,D0,L0,V0,M0} R(17,13) { }.
% 0.42/1.05 parent0: (63) {G2,W0,D0,L0,V0,M0} { }.
% 0.42/1.05 substitution0:
% 0.42/1.05 end
% 0.42/1.05 permutation0:
% 0.42/1.05 end
% 0.42/1.05
% 0.42/1.05 Proof check complete!
% 0.42/1.05
% 0.42/1.05 Memory use:
% 0.42/1.05
% 0.42/1.05 space for terms: 295
% 0.42/1.05 space for clauses: 1123
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 clauses generated: 32
% 0.42/1.05 clauses kept: 20
% 0.42/1.05 clauses selected: 13
% 0.42/1.05 clauses deleted: 1
% 0.42/1.05 clauses inuse deleted: 0
% 0.42/1.05
% 0.42/1.05 subsentry: 114
% 0.42/1.05 literals s-matched: 60
% 0.42/1.05 literals matched: 60
% 0.42/1.05 full subsumption: 1
% 0.42/1.05
% 0.42/1.05 checksum: -2078217323
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Bliksem ended
%------------------------------------------------------------------------------