TSTP Solution File: KLE005+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KLE005+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n007.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 : Sun Jul 17 01:36:31 EDT 2022
% Result : Theorem 0.44s 1.10s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE005+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n007.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 : Thu Jun 16 08:06:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.10 *** allocated 10000 integers for termspace/termends
% 0.44/1.10 *** allocated 10000 integers for clauses
% 0.44/1.10 *** allocated 10000 integers for justifications
% 0.44/1.10 Bliksem 1.12
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Automatic Strategy Selection
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Clauses:
% 0.44/1.10
% 0.44/1.10 { addition( X, Y ) = addition( Y, X ) }.
% 0.44/1.10 { addition( Z, addition( Y, X ) ) = addition( addition( Z, Y ), X ) }.
% 0.44/1.10 { addition( X, zero ) = X }.
% 0.44/1.10 { addition( X, X ) = X }.
% 0.44/1.10 { multiplication( X, multiplication( Y, Z ) ) = multiplication(
% 0.44/1.10 multiplication( X, Y ), Z ) }.
% 0.44/1.10 { multiplication( X, one ) = X }.
% 0.44/1.10 { multiplication( one, X ) = X }.
% 0.44/1.10 { multiplication( X, addition( Y, Z ) ) = addition( multiplication( X, Y )
% 0.44/1.10 , multiplication( X, Z ) ) }.
% 0.44/1.10 { multiplication( addition( X, Y ), Z ) = addition( multiplication( X, Z )
% 0.44/1.10 , multiplication( Y, Z ) ) }.
% 0.44/1.10 { multiplication( X, zero ) = zero }.
% 0.44/1.10 { multiplication( zero, X ) = zero }.
% 0.44/1.10 { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.44/1.10 { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.44/1.10 { ! test( X ), complement( skol1( X ), X ) }.
% 0.44/1.10 { ! complement( Y, X ), test( X ) }.
% 0.44/1.10 { ! complement( Y, X ), multiplication( X, Y ) = zero }.
% 0.44/1.10 { ! complement( Y, X ), alpha1( X, Y ) }.
% 0.44/1.10 { ! multiplication( X, Y ) = zero, ! alpha1( X, Y ), complement( Y, X ) }.
% 0.44/1.10 { ! alpha1( X, Y ), multiplication( Y, X ) = zero }.
% 0.44/1.10 { ! alpha1( X, Y ), addition( X, Y ) = one }.
% 0.44/1.10 { ! multiplication( Y, X ) = zero, ! addition( X, Y ) = one, alpha1( X, Y )
% 0.44/1.10 }.
% 0.44/1.10 { ! test( X ), ! c( X ) = Y, complement( X, Y ) }.
% 0.44/1.10 { ! test( X ), ! complement( X, Y ), c( X ) = Y }.
% 0.44/1.10 { test( X ), c( X ) = zero }.
% 0.44/1.10 { ! c( one ) = zero }.
% 0.44/1.10
% 0.44/1.10 percentage equality = 0.547619, percentage horn = 0.960000
% 0.44/1.10 This is a problem with some equality
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Options Used:
% 0.44/1.10
% 0.44/1.10 useres = 1
% 0.44/1.10 useparamod = 1
% 0.44/1.10 useeqrefl = 1
% 0.44/1.10 useeqfact = 1
% 0.44/1.10 usefactor = 1
% 0.44/1.10 usesimpsplitting = 0
% 0.44/1.10 usesimpdemod = 5
% 0.44/1.10 usesimpres = 3
% 0.44/1.10
% 0.44/1.10 resimpinuse = 1000
% 0.44/1.10 resimpclauses = 20000
% 0.44/1.10 substype = eqrewr
% 0.44/1.10 backwardsubs = 1
% 0.44/1.10 selectoldest = 5
% 0.44/1.10
% 0.44/1.10 litorderings [0] = split
% 0.44/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.44/1.10
% 0.44/1.10 termordering = kbo
% 0.44/1.10
% 0.44/1.10 litapriori = 0
% 0.44/1.10 termapriori = 1
% 0.44/1.10 litaposteriori = 0
% 0.44/1.10 termaposteriori = 0
% 0.44/1.10 demodaposteriori = 0
% 0.44/1.10 ordereqreflfact = 0
% 0.44/1.10
% 0.44/1.10 litselect = negord
% 0.44/1.10
% 0.44/1.10 maxweight = 15
% 0.44/1.10 maxdepth = 30000
% 0.44/1.10 maxlength = 115
% 0.44/1.10 maxnrvars = 195
% 0.44/1.10 excuselevel = 1
% 0.44/1.10 increasemaxweight = 1
% 0.44/1.10
% 0.44/1.10 maxselected = 10000000
% 0.44/1.10 maxnrclauses = 10000000
% 0.44/1.10
% 0.44/1.10 showgenerated = 0
% 0.44/1.10 showkept = 0
% 0.44/1.10 showselected = 0
% 0.44/1.10 showdeleted = 0
% 0.44/1.10 showresimp = 1
% 0.44/1.10 showstatus = 2000
% 0.44/1.10
% 0.44/1.10 prologoutput = 0
% 0.44/1.10 nrgoals = 5000000
% 0.44/1.10 totalproof = 1
% 0.44/1.10
% 0.44/1.10 Symbols occurring in the translation:
% 0.44/1.10
% 0.44/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.10 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.44/1.10 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.44/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.10 addition [37, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.44/1.10 zero [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.44/1.10 multiplication [40, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.44/1.10 one [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.44/1.10 leq [42, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.44/1.10 test [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.44/1.10 complement [46, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.44/1.10 c [47, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.44/1.10 alpha1 [48, 2] (w:1, o:49, a:1, s:1, b:1),
% 0.44/1.10 skol1 [49, 1] (w:1, o:18, a:1, s:1, b:1).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Starting Search:
% 0.44/1.10
% 0.44/1.10 *** allocated 15000 integers for clauses
% 0.44/1.10
% 0.44/1.10 Bliksems!, er is een bewijs:
% 0.44/1.10 % SZS status Theorem
% 0.44/1.10 % SZS output start Refutation
% 0.44/1.10
% 0.44/1.10 (5) {G0,W5,D3,L1,V1,M1} I { multiplication( X, one ) ==> X }.
% 0.44/1.10 (15) {G0,W8,D3,L2,V2,M2} I { ! complement( Y, X ), multiplication( X, Y )
% 0.44/1.10 ==> zero }.
% 0.44/1.10 (21) {G0,W9,D3,L3,V2,M3} I { ! test( X ), ! c( X ) = Y, complement( X, Y )
% 0.44/1.10 }.
% 0.44/1.10 (23) {G0,W6,D3,L2,V1,M2} I { test( X ), c( X ) ==> zero }.
% 0.44/1.10 (24) {G0,W4,D3,L1,V0,M1} I { ! c( one ) ==> zero }.
% 0.44/1.10 (25) {G1,W6,D3,L2,V1,M2} Q(21) { ! test( X ), complement( X, c( X ) ) }.
% 0.44/1.10 (31) {G1,W2,D2,L1,V0,M1} R(23,24) { test( one ) }.
% 0.44/1.10 (32) {G2,W4,D3,L1,V0,M1} R(25,31) { complement( one, c( one ) ) }.
% 0.44/1.10 (163) {G3,W0,D0,L0,V0,M0} R(15,32);d(5);r(24) { }.
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 % SZS output end Refutation
% 0.44/1.10 found a proof!
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Unprocessed initial clauses:
% 0.44/1.10
% 0.44/1.10 (165) {G0,W7,D3,L1,V2,M1} { addition( X, Y ) = addition( Y, X ) }.
% 0.44/1.10 (166) {G0,W11,D4,L1,V3,M1} { addition( Z, addition( Y, X ) ) = addition(
% 0.44/1.10 addition( Z, Y ), X ) }.
% 0.44/1.10 (167) {G0,W5,D3,L1,V1,M1} { addition( X, zero ) = X }.
% 0.44/1.10 (168) {G0,W5,D3,L1,V1,M1} { addition( X, X ) = X }.
% 0.44/1.10 (169) {G0,W11,D4,L1,V3,M1} { multiplication( X, multiplication( Y, Z ) ) =
% 0.44/1.10 multiplication( multiplication( X, Y ), Z ) }.
% 0.44/1.10 (170) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 0.44/1.10 (171) {G0,W5,D3,L1,V1,M1} { multiplication( one, X ) = X }.
% 0.44/1.10 (172) {G0,W13,D4,L1,V3,M1} { multiplication( X, addition( Y, Z ) ) =
% 0.44/1.10 addition( multiplication( X, Y ), multiplication( X, Z ) ) }.
% 0.44/1.10 (173) {G0,W13,D4,L1,V3,M1} { multiplication( addition( X, Y ), Z ) =
% 0.44/1.10 addition( multiplication( X, Z ), multiplication( Y, Z ) ) }.
% 0.44/1.10 (174) {G0,W5,D3,L1,V1,M1} { multiplication( X, zero ) = zero }.
% 0.44/1.10 (175) {G0,W5,D3,L1,V1,M1} { multiplication( zero, X ) = zero }.
% 0.44/1.10 (176) {G0,W8,D3,L2,V2,M2} { ! leq( X, Y ), addition( X, Y ) = Y }.
% 0.44/1.10 (177) {G0,W8,D3,L2,V2,M2} { ! addition( X, Y ) = Y, leq( X, Y ) }.
% 0.44/1.10 (178) {G0,W6,D3,L2,V1,M2} { ! test( X ), complement( skol1( X ), X ) }.
% 0.44/1.10 (179) {G0,W5,D2,L2,V2,M2} { ! complement( Y, X ), test( X ) }.
% 0.44/1.10 (180) {G0,W8,D3,L2,V2,M2} { ! complement( Y, X ), multiplication( X, Y ) =
% 0.44/1.10 zero }.
% 0.44/1.10 (181) {G0,W6,D2,L2,V2,M2} { ! complement( Y, X ), alpha1( X, Y ) }.
% 0.44/1.10 (182) {G0,W11,D3,L3,V2,M3} { ! multiplication( X, Y ) = zero, ! alpha1( X
% 0.44/1.10 , Y ), complement( Y, X ) }.
% 0.44/1.10 (183) {G0,W8,D3,L2,V2,M2} { ! alpha1( X, Y ), multiplication( Y, X ) =
% 0.44/1.10 zero }.
% 0.44/1.10 (184) {G0,W8,D3,L2,V2,M2} { ! alpha1( X, Y ), addition( X, Y ) = one }.
% 0.44/1.10 (185) {G0,W13,D3,L3,V2,M3} { ! multiplication( Y, X ) = zero, ! addition(
% 0.44/1.10 X, Y ) = one, alpha1( X, Y ) }.
% 0.44/1.10 (186) {G0,W9,D3,L3,V2,M3} { ! test( X ), ! c( X ) = Y, complement( X, Y )
% 0.44/1.10 }.
% 0.44/1.10 (187) {G0,W9,D3,L3,V2,M3} { ! test( X ), ! complement( X, Y ), c( X ) = Y
% 0.44/1.10 }.
% 0.44/1.10 (188) {G0,W6,D3,L2,V1,M2} { test( X ), c( X ) = zero }.
% 0.44/1.10 (189) {G0,W4,D3,L1,V0,M1} { ! c( one ) = zero }.
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Total Proof:
% 0.44/1.10
% 0.44/1.10 subsumption: (5) {G0,W5,D3,L1,V1,M1} I { multiplication( X, one ) ==> X }.
% 0.44/1.10 parent0: (170) {G0,W5,D3,L1,V1,M1} { multiplication( X, one ) = X }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (15) {G0,W8,D3,L2,V2,M2} I { ! complement( Y, X ),
% 0.44/1.10 multiplication( X, Y ) ==> zero }.
% 0.44/1.10 parent0: (180) {G0,W8,D3,L2,V2,M2} { ! complement( Y, X ), multiplication
% 0.44/1.10 ( X, Y ) = zero }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 Y := Y
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 1 ==> 1
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (21) {G0,W9,D3,L3,V2,M3} I { ! test( X ), ! c( X ) = Y,
% 0.44/1.10 complement( X, Y ) }.
% 0.44/1.10 parent0: (186) {G0,W9,D3,L3,V2,M3} { ! test( X ), ! c( X ) = Y, complement
% 0.44/1.10 ( X, Y ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 Y := Y
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 1 ==> 1
% 0.44/1.10 2 ==> 2
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (23) {G0,W6,D3,L2,V1,M2} I { test( X ), c( X ) ==> zero }.
% 0.44/1.10 parent0: (188) {G0,W6,D3,L2,V1,M2} { test( X ), c( X ) = zero }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 1 ==> 1
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (24) {G0,W4,D3,L1,V0,M1} I { ! c( one ) ==> zero }.
% 0.44/1.10 parent0: (189) {G0,W4,D3,L1,V0,M1} { ! c( one ) = zero }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 eqswap: (273) {G0,W9,D3,L3,V2,M3} { ! Y = c( X ), ! test( X ), complement
% 0.44/1.10 ( X, Y ) }.
% 0.44/1.10 parent0[1]: (21) {G0,W9,D3,L3,V2,M3} I { ! test( X ), ! c( X ) = Y,
% 0.44/1.10 complement( X, Y ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 Y := Y
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 eqrefl: (274) {G0,W6,D3,L2,V1,M2} { ! test( X ), complement( X, c( X ) )
% 0.44/1.10 }.
% 0.44/1.10 parent0[0]: (273) {G0,W9,D3,L3,V2,M3} { ! Y = c( X ), ! test( X ),
% 0.44/1.10 complement( X, Y ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 Y := c( X )
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (25) {G1,W6,D3,L2,V1,M2} Q(21) { ! test( X ), complement( X, c
% 0.44/1.10 ( X ) ) }.
% 0.44/1.10 parent0: (274) {G0,W6,D3,L2,V1,M2} { ! test( X ), complement( X, c( X ) )
% 0.44/1.10 }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 1 ==> 1
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 eqswap: (275) {G0,W6,D3,L2,V1,M2} { zero ==> c( X ), test( X ) }.
% 0.44/1.10 parent0[1]: (23) {G0,W6,D3,L2,V1,M2} I { test( X ), c( X ) ==> zero }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 eqswap: (276) {G0,W4,D3,L1,V0,M1} { ! zero ==> c( one ) }.
% 0.44/1.10 parent0[0]: (24) {G0,W4,D3,L1,V0,M1} I { ! c( one ) ==> zero }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 resolution: (277) {G1,W2,D2,L1,V0,M1} { test( one ) }.
% 0.44/1.10 parent0[0]: (276) {G0,W4,D3,L1,V0,M1} { ! zero ==> c( one ) }.
% 0.44/1.10 parent1[0]: (275) {G0,W6,D3,L2,V1,M2} { zero ==> c( X ), test( X ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10 substitution1:
% 0.44/1.10 X := one
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (31) {G1,W2,D2,L1,V0,M1} R(23,24) { test( one ) }.
% 0.44/1.10 parent0: (277) {G1,W2,D2,L1,V0,M1} { test( one ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 resolution: (278) {G2,W4,D3,L1,V0,M1} { complement( one, c( one ) ) }.
% 0.44/1.10 parent0[0]: (25) {G1,W6,D3,L2,V1,M2} Q(21) { ! test( X ), complement( X, c
% 0.44/1.10 ( X ) ) }.
% 0.44/1.10 parent1[0]: (31) {G1,W2,D2,L1,V0,M1} R(23,24) { test( one ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := one
% 0.44/1.10 end
% 0.44/1.10 substitution1:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (32) {G2,W4,D3,L1,V0,M1} R(25,31) { complement( one, c( one )
% 0.44/1.10 ) }.
% 0.44/1.10 parent0: (278) {G2,W4,D3,L1,V0,M1} { complement( one, c( one ) ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 eqswap: (279) {G0,W8,D3,L2,V2,M2} { zero ==> multiplication( X, Y ), !
% 0.44/1.10 complement( Y, X ) }.
% 0.44/1.10 parent0[1]: (15) {G0,W8,D3,L2,V2,M2} I { ! complement( Y, X ),
% 0.44/1.10 multiplication( X, Y ) ==> zero }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 Y := Y
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 eqswap: (281) {G0,W4,D3,L1,V0,M1} { ! zero ==> c( one ) }.
% 0.44/1.10 parent0[0]: (24) {G0,W4,D3,L1,V0,M1} I { ! c( one ) ==> zero }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 resolution: (282) {G1,W6,D4,L1,V0,M1} { zero ==> multiplication( c( one )
% 0.44/1.10 , one ) }.
% 0.44/1.10 parent0[1]: (279) {G0,W8,D3,L2,V2,M2} { zero ==> multiplication( X, Y ), !
% 0.44/1.10 complement( Y, X ) }.
% 0.44/1.10 parent1[0]: (32) {G2,W4,D3,L1,V0,M1} R(25,31) { complement( one, c( one ) )
% 0.44/1.10 }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := c( one )
% 0.44/1.10 Y := one
% 0.44/1.10 end
% 0.44/1.10 substitution1:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 paramod: (283) {G1,W4,D3,L1,V0,M1} { zero ==> c( one ) }.
% 0.44/1.10 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { multiplication( X, one ) ==> X }.
% 0.44/1.10 parent1[0; 2]: (282) {G1,W6,D4,L1,V0,M1} { zero ==> multiplication( c( one
% 0.44/1.10 ), one ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := c( one )
% 0.44/1.10 end
% 0.44/1.10 substitution1:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 resolution: (284) {G1,W0,D0,L0,V0,M0} { }.
% 0.44/1.10 parent0[0]: (281) {G0,W4,D3,L1,V0,M1} { ! zero ==> c( one ) }.
% 0.44/1.10 parent1[0]: (283) {G1,W4,D3,L1,V0,M1} { zero ==> c( one ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10 substitution1:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (163) {G3,W0,D0,L0,V0,M0} R(15,32);d(5);r(24) { }.
% 0.44/1.10 parent0: (284) {G1,W0,D0,L0,V0,M0} { }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 Proof check complete!
% 0.44/1.10
% 0.44/1.10 Memory use:
% 0.44/1.10
% 0.44/1.10 space for terms: 1953
% 0.44/1.10 space for clauses: 10782
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 clauses generated: 431
% 0.44/1.10 clauses kept: 164
% 0.44/1.10 clauses selected: 41
% 0.44/1.10 clauses deleted: 0
% 0.44/1.10 clauses inuse deleted: 0
% 0.44/1.10
% 0.44/1.10 subsentry: 871
% 0.44/1.10 literals s-matched: 488
% 0.44/1.10 literals matched: 488
% 0.44/1.10 full subsumption: 29
% 0.44/1.10
% 0.44/1.10 checksum: -1756286365
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Bliksem ended
%------------------------------------------------------------------------------