TSTP Solution File: CSR025+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CSR025+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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 : Fri Jul 15 02:00:54 EDT 2022
% Result : Theorem 0.67s 1.04s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : CSR025+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.11 % Command : bliksem %s
% 0.10/0.30 % Computer : n021.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % DateTime : Sat Jun 11 01:31:39 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.67/1.04 *** allocated 10000 integers for termspace/termends
% 0.67/1.04 *** allocated 10000 integers for clauses
% 0.67/1.04 *** allocated 10000 integers for justifications
% 0.67/1.04 Bliksem 1.12
% 0.67/1.04
% 0.67/1.04
% 0.67/1.04 Automatic Strategy Selection
% 0.67/1.04
% 0.67/1.04
% 0.67/1.04 Clauses:
% 0.67/1.04
% 0.67/1.04 { transitivebinarypredicate( c_genlmt ) }.
% 0.67/1.04 { genlmt( c_basekb, c_universalvocabularymt ) }.
% 0.67/1.04 { genlmt( c_patterndetectormt, c_basekb ) }.
% 0.67/1.04 { genls( c_tptpcol_16_130933, c_tptpcol_15_130931 ) }.
% 0.67/1.04 { ! tptpcol_16_130933( X ), tptpcol_15_130931( X ) }.
% 0.67/1.04 { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith( Y, Z ) }.
% 0.67/1.04 { ! genlinverse( X, Z ), ! genlinverse( Z, Y ), genlpreds( X, Y ) }.
% 0.67/1.04 { ! genlpreds( Y, X ), predicate( X ) }.
% 0.67/1.04 { ! genlpreds( Y, X ), predicate( X ) }.
% 0.67/1.04 { ! genlpreds( X, Y ), predicate( X ) }.
% 0.67/1.04 { ! genlpreds( X, Y ), predicate( X ) }.
% 0.67/1.04 { ! genlpreds( X, Z ), ! genlpreds( Z, Y ), genlpreds( X, Y ) }.
% 0.67/1.04 { ! predicate( X ), genlpreds( X, X ) }.
% 0.67/1.04 { ! predicate( X ), genlpreds( X, X ) }.
% 0.67/1.04 { ! genlinverse( Y, X ), binarypredicate( X ) }.
% 0.67/1.04 { ! genlinverse( X, Y ), binarypredicate( X ) }.
% 0.67/1.04 { ! genlinverse( Z, X ), ! genlpreds( Y, Z ), genlinverse( Y, X ) }.
% 0.67/1.04 { ! genlinverse( X, Z ), ! genlpreds( Z, Y ), genlinverse( X, Y ) }.
% 0.67/1.04 { ! disjointwith( Y, X ), collection( X ) }.
% 0.67/1.04 { ! disjointwith( X, Y ), collection( X ) }.
% 0.67/1.04 { ! disjointwith( X, Y ), disjointwith( Y, X ) }.
% 0.67/1.04 { ! disjointwith( X, Z ), ! genls( Y, Z ), disjointwith( X, Y ) }.
% 0.67/1.04 { ! disjointwith( Z, X ), ! genls( Y, Z ), disjointwith( Y, X ) }.
% 0.67/1.04 { ! isa( X, c_tptpcol_15_130931 ), tptpcol_15_130931( X ) }.
% 0.67/1.04 { ! tptpcol_15_130931( X ), isa( X, c_tptpcol_15_130931 ) }.
% 0.67/1.04 { ! isa( X, c_tptpcol_16_130933 ), tptpcol_16_130933( X ) }.
% 0.67/1.04 { ! tptpcol_16_130933( X ), isa( X, c_tptpcol_16_130933 ) }.
% 0.67/1.04 { ! genls( Y, X ), collection( X ) }.
% 0.67/1.04 { ! genls( Y, X ), collection( X ) }.
% 0.67/1.04 { ! genls( X, Y ), collection( X ) }.
% 0.67/1.04 { ! genls( X, Y ), collection( X ) }.
% 0.67/1.04 { ! genls( X, Z ), ! genls( Z, Y ), genls( X, Y ) }.
% 0.67/1.04 { ! collection( X ), genls( X, X ) }.
% 0.67/1.04 { ! collection( X ), genls( X, X ) }.
% 0.67/1.04 { ! genls( Z, X ), ! genls( Y, Z ), genls( Y, X ) }.
% 0.67/1.04 { ! genls( X, Z ), ! genls( Z, Y ), genls( X, Y ) }.
% 0.67/1.04 { mtvisible( c_basekb ) }.
% 0.67/1.04 { ! isa( X, c_transitivebinarypredicate ), transitivebinarypredicate( X ) }
% 0.67/1.04 .
% 0.67/1.04 { ! transitivebinarypredicate( X ), isa( X, c_transitivebinarypredicate ) }
% 0.67/1.04 .
% 0.67/1.04 { ! mtvisible( Y ), ! genlmt( Y, X ), mtvisible( X ) }.
% 0.67/1.04 { ! genlmt( Y, X ), microtheory( X ) }.
% 0.67/1.04 { ! genlmt( Y, X ), microtheory( X ) }.
% 0.67/1.04 { ! genlmt( X, Y ), microtheory( X ) }.
% 0.67/1.04 { ! genlmt( X, Y ), microtheory( X ) }.
% 0.67/1.04 { ! genlmt( X, Z ), ! genlmt( Z, Y ), genlmt( X, Y ) }.
% 0.67/1.04 { ! microtheory( X ), genlmt( X, X ) }.
% 0.67/1.04 { ! microtheory( X ), genlmt( X, X ) }.
% 0.67/1.04 { ! isa( Y, X ), collection( X ) }.
% 0.67/1.04 { ! isa( Y, X ), collection( X ) }.
% 0.67/1.04 { ! isa( X, Y ), thing( X ) }.
% 0.67/1.04 { ! isa( X, Y ), thing( X ) }.
% 0.67/1.04 { ! isa( X, Z ), ! genls( Z, Y ), isa( X, Y ) }.
% 0.67/1.04 { mtvisible( c_universalvocabularymt ) }.
% 0.67/1.04 { mtvisible( c_patterndetectormt ) }.
% 0.67/1.04 { ! genls( c_tptpcol_16_130933, c_tptpcol_15_130931 ) }.
% 0.67/1.04
% 0.67/1.04 percentage equality = 0.000000, percentage horn = 1.000000
% 0.67/1.04 This is a near-Horn, non-equality problem
% 0.67/1.04
% 0.67/1.04
% 0.67/1.04 Options Used:
% 0.67/1.04
% 0.67/1.04 useres = 1
% 0.67/1.04 useparamod = 0
% 0.67/1.04 useeqrefl = 0
% 0.67/1.04 useeqfact = 0
% 0.67/1.04 usefactor = 1
% 0.67/1.04 usesimpsplitting = 0
% 0.67/1.04 usesimpdemod = 0
% 0.67/1.04 usesimpres = 4
% 0.67/1.04
% 0.67/1.04 resimpinuse = 1000
% 0.67/1.04 resimpclauses = 20000
% 0.67/1.04 substype = standard
% 0.67/1.04 backwardsubs = 1
% 0.67/1.04 selectoldest = 5
% 0.67/1.04
% 0.67/1.04 litorderings [0] = split
% 0.67/1.04 litorderings [1] = liftord
% 0.67/1.04
% 0.67/1.04 termordering = none
% 0.67/1.04
% 0.67/1.04 litapriori = 1
% 0.67/1.04 termapriori = 0
% 0.67/1.04 litaposteriori = 0
% 0.67/1.04 termaposteriori = 0
% 0.67/1.04 demodaposteriori = 0
% 0.67/1.04 ordereqreflfact = 0
% 0.67/1.04
% 0.67/1.04 litselect = negative
% 0.67/1.04
% 0.67/1.04 maxweight = 30000
% 0.67/1.04 maxdepth = 30000
% 0.67/1.04 maxlength = 115
% 0.67/1.04 maxnrvars = 195
% 0.67/1.04 excuselevel = 0
% 0.67/1.04 increasemaxweight = 0
% 0.67/1.04
% 0.67/1.04 maxselected = 10000000
% 0.67/1.04 maxnrclauses = 10000000
% 0.67/1.04
% 0.67/1.04 showgenerated = 0
% 0.67/1.04 showkept = 0
% 0.67/1.04 showselected = 0
% 0.67/1.04 showdeleted = 0
% 0.67/1.04 showresimp = 1
% 0.67/1.04 showstatus = 2000
% 0.67/1.04
% 0.67/1.04 prologoutput = 0
% 0.67/1.04 nrgoals = 5000000
% 0.67/1.04 totalproof = 1
% 0.67/1.04
% 0.67/1.04 Symbols occurring in the translation:
% 0.67/1.04
% 0.67/1.04 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.67/1.04 . [1, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.67/1.04 ! [4, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.67/1.04 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.04 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.04 c_genlmt [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.67/1.04 transitivebinarypredicate [36, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.67/1.04 c_basekb [37, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.67/1.04 c_universalvocabularymt [38, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.67/1.04 genlmt [39, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.67/1.04 c_patterndetectormt [40, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.67/1.04 c_tptpcol_16_130933 [41, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.67/1.04 c_tptpcol_15_130931 [42, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.67/1.04 genls [43, 2] (w:1, o:68, a:1, s:1, b:0),
% 0.67/1.04 tptpcol_16_130933 [45, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.67/1.04 tptpcol_15_130931 [46, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.67/1.04 isa [49, 2] (w:1, o:69, a:1, s:1, b:0),
% 0.67/1.04 disjointwith [50, 2] (w:1, o:70, a:1, s:1, b:0),
% 0.67/1.04 genlinverse [54, 2] (w:1, o:71, a:1, s:1, b:0),
% 0.67/1.04 genlpreds [55, 2] (w:1, o:72, a:1, s:1, b:0),
% 0.67/1.04 predicate [58, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.67/1.04 binarypredicate [63, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.67/1.04 collection [66, 1] (w:1, o:39, a:1, s:1, b:0),
% 0.67/1.04 mtvisible [67, 1] (w:1, o:40, a:1, s:1, b:0),
% 0.67/1.04 c_transitivebinarypredicate [68, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.67/1.04 microtheory [71, 1] (w:1, o:41, a:1, s:1, b:0),
% 0.67/1.04 thing [72, 1] (w:1, o:42, a:1, s:1, b:0).
% 0.67/1.04
% 0.67/1.04
% 0.67/1.04 Starting Search:
% 0.67/1.04
% 0.67/1.04
% 0.67/1.04 Bliksems!, er is een bewijs:
% 0.67/1.04 % SZS status Theorem
% 0.67/1.04 % SZS output start Refutation
% 0.67/1.04
% 0.67/1.04 (3) {G0,W3,D2,L1,V0,M1} I { genls( c_tptpcol_16_130933, c_tptpcol_15_130931
% 0.67/1.04 ) }.
% 0.67/1.04 (41) {G1,W0,D0,L0,V0,M0} I;r(3) { }.
% 0.67/1.04
% 0.67/1.04
% 0.67/1.04 % SZS output end Refutation
% 0.67/1.04 found a proof!
% 0.67/1.04
% 0.67/1.04
% 0.67/1.04 Unprocessed initial clauses:
% 0.67/1.04
% 0.67/1.04 (43) {G0,W2,D2,L1,V0,M1} { transitivebinarypredicate( c_genlmt ) }.
% 0.67/1.04 (44) {G0,W3,D2,L1,V0,M1} { genlmt( c_basekb, c_universalvocabularymt ) }.
% 0.67/1.04 (45) {G0,W3,D2,L1,V0,M1} { genlmt( c_patterndetectormt, c_basekb ) }.
% 0.67/1.04 (46) {G0,W3,D2,L1,V0,M1} { genls( c_tptpcol_16_130933, c_tptpcol_15_130931
% 0.67/1.04 ) }.
% 0.67/1.04 (47) {G0,W5,D2,L2,V1,M2} { ! tptpcol_16_130933( X ), tptpcol_15_130931( X
% 0.67/1.04 ) }.
% 0.67/1.04 (48) {G0,W12,D2,L3,V3,M3} { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith(
% 0.67/1.04 Y, Z ) }.
% 0.67/1.04 (49) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlinverse( Z, Y ),
% 0.67/1.04 genlpreds( X, Y ) }.
% 0.67/1.04 (50) {G0,W6,D2,L2,V2,M2} { ! genlpreds( Y, X ), predicate( X ) }.
% 0.67/1.04 (51) {G0,W6,D2,L2,V2,M2} { ! genlpreds( Y, X ), predicate( X ) }.
% 0.67/1.04 (52) {G0,W6,D2,L2,V2,M2} { ! genlpreds( X, Y ), predicate( X ) }.
% 0.67/1.04 (53) {G0,W6,D2,L2,V2,M2} { ! genlpreds( X, Y ), predicate( X ) }.
% 0.67/1.04 (54) {G0,W11,D2,L3,V3,M3} { ! genlpreds( X, Z ), ! genlpreds( Z, Y ),
% 0.67/1.04 genlpreds( X, Y ) }.
% 0.67/1.04 (55) {G0,W6,D2,L2,V1,M2} { ! predicate( X ), genlpreds( X, X ) }.
% 0.67/1.04 (56) {G0,W6,D2,L2,V1,M2} { ! predicate( X ), genlpreds( X, X ) }.
% 0.67/1.04 (57) {G0,W6,D2,L2,V2,M2} { ! genlinverse( Y, X ), binarypredicate( X ) }.
% 0.67/1.04 (58) {G0,W6,D2,L2,V2,M2} { ! genlinverse( X, Y ), binarypredicate( X ) }.
% 0.67/1.04 (59) {G0,W11,D2,L3,V3,M3} { ! genlinverse( Z, X ), ! genlpreds( Y, Z ),
% 0.67/1.04 genlinverse( Y, X ) }.
% 0.67/1.04 (60) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlpreds( Z, Y ),
% 0.67/1.04 genlinverse( X, Y ) }.
% 0.67/1.04 (61) {G0,W6,D2,L2,V2,M2} { ! disjointwith( Y, X ), collection( X ) }.
% 0.67/1.04 (62) {G0,W6,D2,L2,V2,M2} { ! disjointwith( X, Y ), collection( X ) }.
% 0.67/1.04 (63) {G0,W7,D2,L2,V2,M2} { ! disjointwith( X, Y ), disjointwith( Y, X )
% 0.67/1.04 }.
% 0.67/1.04 (64) {G0,W11,D2,L3,V3,M3} { ! disjointwith( X, Z ), ! genls( Y, Z ),
% 0.67/1.04 disjointwith( X, Y ) }.
% 0.67/1.04 (65) {G0,W11,D2,L3,V3,M3} { ! disjointwith( Z, X ), ! genls( Y, Z ),
% 0.67/1.04 disjointwith( Y, X ) }.
% 0.67/1.04 (66) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_tptpcol_15_130931 ),
% 0.67/1.04 tptpcol_15_130931( X ) }.
% 0.67/1.04 (67) {G0,W6,D2,L2,V1,M2} { ! tptpcol_15_130931( X ), isa( X,
% 0.67/1.04 c_tptpcol_15_130931 ) }.
% 0.67/1.04 (68) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_tptpcol_16_130933 ),
% 0.67/1.04 tptpcol_16_130933( X ) }.
% 0.67/1.04 (69) {G0,W6,D2,L2,V1,M2} { ! tptpcol_16_130933( X ), isa( X,
% 0.67/1.04 c_tptpcol_16_130933 ) }.
% 0.67/1.04 (70) {G0,W6,D2,L2,V2,M2} { ! genls( Y, X ), collection( X ) }.
% 0.67/1.04 (71) {G0,W6,D2,L2,V2,M2} { ! genls( Y, X ), collection( X ) }.
% 0.67/1.04 (72) {G0,W6,D2,L2,V2,M2} { ! genls( X, Y ), collection( X ) }.
% 0.67/1.04 (73) {G0,W6,D2,L2,V2,M2} { ! genls( X, Y ), collection( X ) }.
% 0.67/1.04 (74) {G0,W11,D2,L3,V3,M3} { ! genls( X, Z ), ! genls( Z, Y ), genls( X, Y
% 0.67/1.04 ) }.
% 0.67/1.04 (75) {G0,W6,D2,L2,V1,M2} { ! collection( X ), genls( X, X ) }.
% 0.67/1.04 (76) {G0,W6,D2,L2,V1,M2} { ! collection( X ), genls( X, X ) }.
% 0.67/1.04 (77) {G0,W11,D2,L3,V3,M3} { ! genls( Z, X ), ! genls( Y, Z ), genls( Y, X
% 0.67/1.04 ) }.
% 0.67/1.04 (78) {G0,W11,D2,L3,V3,M3} { ! genls( X, Z ), ! genls( Z, Y ), genls( X, Y
% 0.67/1.04 ) }.
% 0.67/1.04 (79) {G0,W2,D2,L1,V0,M1} { mtvisible( c_basekb ) }.
% 0.67/1.04 (80) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_transitivebinarypredicate ),
% 0.67/1.04 transitivebinarypredicate( X ) }.
% 0.67/1.04 (81) {G0,W6,D2,L2,V1,M2} { ! transitivebinarypredicate( X ), isa( X,
% 0.67/1.04 c_transitivebinarypredicate ) }.
% 0.67/1.04 (82) {G0,W9,D2,L3,V2,M3} { ! mtvisible( Y ), ! genlmt( Y, X ), mtvisible(
% 0.67/1.04 X ) }.
% 0.67/1.04 (83) {G0,W6,D2,L2,V2,M2} { ! genlmt( Y, X ), microtheory( X ) }.
% 0.67/1.04 (84) {G0,W6,D2,L2,V2,M2} { ! genlmt( Y, X ), microtheory( X ) }.
% 0.67/1.04 (85) {G0,W6,D2,L2,V2,M2} { ! genlmt( X, Y ), microtheory( X ) }.
% 0.67/1.04 (86) {G0,W6,D2,L2,V2,M2} { ! genlmt( X, Y ), microtheory( X ) }.
% 0.67/1.04 (87) {G0,W11,D2,L3,V3,M3} { ! genlmt( X, Z ), ! genlmt( Z, Y ), genlmt( X
% 0.67/1.04 , Y ) }.
% 0.67/1.04 (88) {G0,W6,D2,L2,V1,M2} { ! microtheory( X ), genlmt( X, X ) }.
% 0.67/1.04 (89) {G0,W6,D2,L2,V1,M2} { ! microtheory( X ), genlmt( X, X ) }.
% 0.67/1.04 (90) {G0,W6,D2,L2,V2,M2} { ! isa( Y, X ), collection( X ) }.
% 0.67/1.04 (91) {G0,W6,D2,L2,V2,M2} { ! isa( Y, X ), collection( X ) }.
% 0.67/1.04 (92) {G0,W6,D2,L2,V2,M2} { ! isa( X, Y ), thing( X ) }.
% 0.67/1.04 (93) {G0,W6,D2,L2,V2,M2} { ! isa( X, Y ), thing( X ) }.
% 0.67/1.04 (94) {G0,W11,D2,L3,V3,M3} { ! isa( X, Z ), ! genls( Z, Y ), isa( X, Y )
% 0.67/1.04 }.
% 0.67/1.04 (95) {G0,W2,D2,L1,V0,M1} { mtvisible( c_universalvocabularymt ) }.
% 0.67/1.04 (96) {G0,W2,D2,L1,V0,M1} { mtvisible( c_patterndetectormt ) }.
% 0.67/1.04 (97) {G0,W4,D2,L1,V0,M1} { ! genls( c_tptpcol_16_130933,
% 0.67/1.04 c_tptpcol_15_130931 ) }.
% 0.67/1.04
% 0.67/1.04
% 0.67/1.04 Total Proof:
% 0.67/1.04
% 0.67/1.04 subsumption: (3) {G0,W3,D2,L1,V0,M1} I { genls( c_tptpcol_16_130933,
% 0.67/1.04 c_tptpcol_15_130931 ) }.
% 0.67/1.04 parent0: (46) {G0,W3,D2,L1,V0,M1} { genls( c_tptpcol_16_130933,
% 0.67/1.04 c_tptpcol_15_130931 ) }.
% 0.67/1.04 substitution0:
% 0.67/1.04 end
% 0.67/1.04 permutation0:
% 0.67/1.04 0 ==> 0
% 0.67/1.04 end
% 0.67/1.04
% 0.67/1.04 resolution: (105) {G1,W0,D0,L0,V0,M0} { }.
% 0.67/1.04 parent0[0]: (97) {G0,W4,D2,L1,V0,M1} { ! genls( c_tptpcol_16_130933,
% 0.67/1.04 c_tptpcol_15_130931 ) }.
% 0.67/1.04 parent1[0]: (3) {G0,W3,D2,L1,V0,M1} I { genls( c_tptpcol_16_130933,
% 0.67/1.04 c_tptpcol_15_130931 ) }.
% 0.67/1.04 substitution0:
% 0.67/1.04 end
% 0.67/1.04 substitution1:
% 0.67/1.04 end
% 0.67/1.04
% 0.67/1.04 subsumption: (41) {G1,W0,D0,L0,V0,M0} I;r(3) { }.
% 0.67/1.04 parent0: (105) {G1,W0,D0,L0,V0,M0} { }.
% 0.67/1.04 substitution0:
% 0.67/1.04 end
% 0.67/1.04 permutation0:
% 0.67/1.04 end
% 0.67/1.04
% 0.67/1.04 Proof check complete!
% 0.67/1.04
% 0.67/1.04 Memory use:
% 0.67/1.04
% 0.67/1.04 space for terms: 1367
% 0.67/1.04 space for clauses: 1919
% 0.67/1.04
% 0.67/1.04
% 0.67/1.04 clauses generated: 55
% 0.67/1.04 clauses kept: 42
% 0.67/1.04 clauses selected: 0
% 0.67/1.04 clauses deleted: 0
% 0.67/1.04 clauses inuse deleted: 0
% 0.67/1.04
% 0.67/1.04 subsentry: 26
% 0.67/1.04 literals s-matched: 25
% 0.67/1.04 literals matched: 25
% 0.67/1.04 full subsumption: 2
% 0.67/1.04
% 0.67/1.04 checksum: -1281635199
% 0.67/1.04
% 0.67/1.04
% 0.67/1.04 Bliksem ended
%------------------------------------------------------------------------------