TSTP Solution File: SEU116+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU116+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n004.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 Jul 19 07:10:41 EDT 2022
% Result : Theorem 0.71s 1.08s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU116+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Sun Jun 19 11:42:38 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.71/1.08 *** allocated 10000 integers for termspace/termends
% 0.71/1.08 *** allocated 10000 integers for clauses
% 0.71/1.08 *** allocated 10000 integers for justifications
% 0.71/1.08 Bliksem 1.12
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Automatic Strategy Selection
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Clauses:
% 0.71/1.08
% 0.71/1.08 { subset( X, X ) }.
% 0.71/1.08 { ! in( X, Y ), ! in( Y, X ) }.
% 0.71/1.08 { empty( empty_set ) }.
% 0.71/1.08 { ! in( X, Y ), element( X, Y ) }.
% 0.71/1.08 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 0.71/1.08 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 0.71/1.08 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.71/1.08 { ! empty( powerset( X ) ) }.
% 0.71/1.08 { cup_closed( powerset( X ) ) }.
% 0.71/1.08 { diff_closed( powerset( X ) ) }.
% 0.71/1.08 { preboolean( powerset( X ) ) }.
% 0.71/1.08 { ! preboolean( X ), cup_closed( X ) }.
% 0.71/1.08 { ! preboolean( X ), diff_closed( X ) }.
% 0.71/1.08 { ! cup_closed( X ), ! diff_closed( X ), preboolean( X ) }.
% 0.71/1.08 { ! empty( X ), finite( X ) }.
% 0.71/1.08 { ! finite( X ), ! element( Y, powerset( X ) ), finite( Y ) }.
% 0.71/1.08 { ! empty( powerset( X ) ) }.
% 0.71/1.08 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.71/1.08 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 0.71/1.08 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 0.71/1.08 { ! empty( X ), X = empty_set }.
% 0.71/1.08 { ! in( X, Y ), ! empty( Y ) }.
% 0.71/1.08 { element( skol1( X ), X ) }.
% 0.71/1.08 { preboolean( finite_subsets( X ) ) }.
% 0.71/1.08 { ! empty( finite_subsets( X ) ) }.
% 0.71/1.08 { cup_closed( finite_subsets( X ) ) }.
% 0.71/1.08 { diff_closed( finite_subsets( X ) ) }.
% 0.71/1.08 { preboolean( finite_subsets( X ) ) }.
% 0.71/1.08 { ! element( X, finite_subsets( Y ) ), finite( X ) }.
% 0.71/1.08 { ! empty( skol2 ) }.
% 0.71/1.08 { cup_closed( skol2 ) }.
% 0.71/1.08 { cap_closed( skol2 ) }.
% 0.71/1.08 { diff_closed( skol2 ) }.
% 0.71/1.08 { preboolean( skol2 ) }.
% 0.71/1.08 { ! empty( skol3 ) }.
% 0.71/1.08 { finite( skol3 ) }.
% 0.71/1.08 { empty( skol4( Y ) ) }.
% 0.71/1.08 { relation( skol4( Y ) ) }.
% 0.71/1.08 { function( skol4( Y ) ) }.
% 0.71/1.08 { one_to_one( skol4( Y ) ) }.
% 0.71/1.08 { epsilon_transitive( skol4( Y ) ) }.
% 0.71/1.08 { epsilon_connected( skol4( Y ) ) }.
% 0.71/1.08 { ordinal( skol4( Y ) ) }.
% 0.71/1.08 { natural( skol4( Y ) ) }.
% 0.71/1.08 { finite( skol4( Y ) ) }.
% 0.71/1.08 { element( skol4( X ), powerset( X ) ) }.
% 0.71/1.08 { empty( X ), ! empty( skol5( Y ) ) }.
% 0.71/1.08 { empty( X ), finite( skol5( Y ) ) }.
% 0.71/1.08 { empty( X ), element( skol5( X ), powerset( X ) ) }.
% 0.71/1.08 { empty( X ), ! empty( skol6( Y ) ) }.
% 0.71/1.08 { empty( X ), finite( skol6( Y ) ) }.
% 0.71/1.08 { empty( X ), element( skol6( X ), powerset( X ) ) }.
% 0.71/1.08 { empty( X ), ! empty( skol7( Y ) ) }.
% 0.71/1.08 { empty( X ), element( skol7( X ), powerset( X ) ) }.
% 0.71/1.08 { empty( skol8( Y ) ) }.
% 0.71/1.08 { element( skol8( X ), powerset( X ) ) }.
% 0.71/1.08 { empty( skol9 ) }.
% 0.71/1.08 { ! empty( skol10 ) }.
% 0.71/1.08 { element( skol11, finite_subsets( skol12 ) ) }.
% 0.71/1.08 { ! finite( skol11 ) }.
% 0.71/1.08
% 0.71/1.08 percentage equality = 0.022727, percentage horn = 0.896552
% 0.71/1.08 This is a problem with some equality
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Options Used:
% 0.71/1.08
% 0.71/1.08 useres = 1
% 0.71/1.08 useparamod = 1
% 0.71/1.08 useeqrefl = 1
% 0.71/1.08 useeqfact = 1
% 0.71/1.08 usefactor = 1
% 0.71/1.08 usesimpsplitting = 0
% 0.71/1.08 usesimpdemod = 5
% 0.71/1.08 usesimpres = 3
% 0.71/1.08
% 0.71/1.08 resimpinuse = 1000
% 0.71/1.08 resimpclauses = 20000
% 0.71/1.08 substype = eqrewr
% 0.71/1.08 backwardsubs = 1
% 0.71/1.08 selectoldest = 5
% 0.71/1.08
% 0.71/1.08 litorderings [0] = split
% 0.71/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.08
% 0.71/1.08 termordering = kbo
% 0.71/1.08
% 0.71/1.08 litapriori = 0
% 0.71/1.08 termapriori = 1
% 0.71/1.08 litaposteriori = 0
% 0.71/1.08 termaposteriori = 0
% 0.71/1.08 demodaposteriori = 0
% 0.71/1.08 ordereqreflfact = 0
% 0.71/1.08
% 0.71/1.08 litselect = negord
% 0.71/1.08
% 0.71/1.08 maxweight = 15
% 0.71/1.08 maxdepth = 30000
% 0.71/1.08 maxlength = 115
% 0.71/1.08 maxnrvars = 195
% 0.71/1.08 excuselevel = 1
% 0.71/1.08 increasemaxweight = 1
% 0.71/1.08
% 0.71/1.08 maxselected = 10000000
% 0.71/1.08 maxnrclauses = 10000000
% 0.71/1.08
% 0.71/1.08 showgenerated = 0
% 0.71/1.08 showkept = 0
% 0.71/1.08 showselected = 0
% 0.71/1.08 showdeleted = 0
% 0.71/1.08 showresimp = 1
% 0.71/1.08 showstatus = 2000
% 0.71/1.08
% 0.71/1.08 prologoutput = 0
% 0.71/1.08 nrgoals = 5000000
% 0.71/1.08 totalproof = 1
% 0.71/1.08
% 0.71/1.08 Symbols occurring in the translation:
% 0.71/1.08
% 0.71/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.08 . [1, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.71/1.08 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.71/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.08 subset [37, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.71/1.08 in [38, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.71/1.08 empty_set [39, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.71/1.08 empty [40, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.71/1.08 element [41, 2] (w:1, o:68, a:1, s:1, b:0),
% 0.71/1.08 powerset [43, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.71/1.08 cup_closed [44, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.71/1.08 diff_closed [45, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.08 preboolean [46, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.71/1.08 finite [47, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.71/1.08 finite_subsets [48, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.71/1.08 cap_closed [49, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.08 relation [50, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.71/1.08 function [51, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.71/1.08 one_to_one [52, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.71/1.08 epsilon_transitive [53, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.71/1.08 epsilon_connected [54, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.71/1.08 ordinal [55, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.71/1.08 natural [56, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.71/1.08 skol1 [57, 1] (w:1, o:36, a:1, s:1, b:1),
% 0.71/1.08 skol2 [58, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.71/1.08 skol3 [59, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.71/1.08 skol4 [60, 1] (w:1, o:37, a:1, s:1, b:1),
% 0.71/1.08 skol5 [61, 1] (w:1, o:38, a:1, s:1, b:1),
% 0.71/1.08 skol6 [62, 1] (w:1, o:39, a:1, s:1, b:1),
% 0.71/1.08 skol7 [63, 1] (w:1, o:40, a:1, s:1, b:1),
% 0.71/1.08 skol8 [64, 1] (w:1, o:41, a:1, s:1, b:1),
% 0.71/1.08 skol9 [65, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.71/1.08 skol10 [66, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.71/1.08 skol11 [67, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.71/1.08 skol12 [68, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Starting Search:
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Bliksems!, er is een bewijs:
% 0.71/1.08 % SZS status Theorem
% 0.71/1.08 % SZS output start Refutation
% 0.71/1.08
% 0.71/1.08 (26) {G0,W6,D3,L2,V2,M2} I { ! element( X, finite_subsets( Y ) ), finite( X
% 0.71/1.08 ) }.
% 0.71/1.08 (56) {G0,W4,D3,L1,V0,M1} I { element( skol11, finite_subsets( skol12 ) )
% 0.71/1.08 }.
% 0.71/1.08 (57) {G0,W2,D2,L1,V0,M1} I { ! finite( skol11 ) }.
% 0.71/1.08 (172) {G1,W0,D0,L0,V0,M0} R(26,56);r(57) { }.
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 % SZS output end Refutation
% 0.71/1.08 found a proof!
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Unprocessed initial clauses:
% 0.71/1.08
% 0.71/1.08 (174) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.71/1.08 (175) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.71/1.08 (176) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.71/1.08 (177) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.71/1.08 (178) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) ),
% 0.71/1.08 element( X, Y ) }.
% 0.71/1.08 (179) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) ), !
% 0.71/1.08 empty( Z ) }.
% 0.71/1.08 (180) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.71/1.08 (181) {G0,W3,D3,L1,V1,M1} { ! empty( powerset( X ) ) }.
% 0.71/1.08 (182) {G0,W3,D3,L1,V1,M1} { cup_closed( powerset( X ) ) }.
% 0.71/1.08 (183) {G0,W3,D3,L1,V1,M1} { diff_closed( powerset( X ) ) }.
% 0.71/1.08 (184) {G0,W3,D3,L1,V1,M1} { preboolean( powerset( X ) ) }.
% 0.71/1.08 (185) {G0,W4,D2,L2,V1,M2} { ! preboolean( X ), cup_closed( X ) }.
% 0.71/1.08 (186) {G0,W4,D2,L2,V1,M2} { ! preboolean( X ), diff_closed( X ) }.
% 0.71/1.08 (187) {G0,W6,D2,L3,V1,M3} { ! cup_closed( X ), ! diff_closed( X ),
% 0.71/1.08 preboolean( X ) }.
% 0.71/1.08 (188) {G0,W4,D2,L2,V1,M2} { ! empty( X ), finite( X ) }.
% 0.71/1.08 (189) {G0,W8,D3,L3,V2,M3} { ! finite( X ), ! element( Y, powerset( X ) ),
% 0.71/1.08 finite( Y ) }.
% 0.71/1.08 (190) {G0,W3,D3,L1,V1,M1} { ! empty( powerset( X ) ) }.
% 0.71/1.08 (191) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.71/1.08 (192) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.71/1.08 }.
% 0.71/1.08 (193) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.71/1.08 }.
% 0.71/1.08 (194) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.71/1.08 (195) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.71/1.08 (196) {G0,W4,D3,L1,V1,M1} { element( skol1( X ), X ) }.
% 0.71/1.08 (197) {G0,W3,D3,L1,V1,M1} { preboolean( finite_subsets( X ) ) }.
% 0.71/1.08 (198) {G0,W3,D3,L1,V1,M1} { ! empty( finite_subsets( X ) ) }.
% 0.71/1.08 (199) {G0,W3,D3,L1,V1,M1} { cup_closed( finite_subsets( X ) ) }.
% 0.71/1.08 (200) {G0,W3,D3,L1,V1,M1} { diff_closed( finite_subsets( X ) ) }.
% 0.71/1.08 (201) {G0,W3,D3,L1,V1,M1} { preboolean( finite_subsets( X ) ) }.
% 0.71/1.08 (202) {G0,W6,D3,L2,V2,M2} { ! element( X, finite_subsets( Y ) ), finite( X
% 0.71/1.08 ) }.
% 0.71/1.08 (203) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.71/1.08 (204) {G0,W2,D2,L1,V0,M1} { cup_closed( skol2 ) }.
% 0.71/1.08 (205) {G0,W2,D2,L1,V0,M1} { cap_closed( skol2 ) }.
% 0.71/1.08 (206) {G0,W2,D2,L1,V0,M1} { diff_closed( skol2 ) }.
% 0.71/1.08 (207) {G0,W2,D2,L1,V0,M1} { preboolean( skol2 ) }.
% 0.71/1.08 (208) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 0.71/1.08 (209) {G0,W2,D2,L1,V0,M1} { finite( skol3 ) }.
% 0.71/1.08 (210) {G0,W3,D3,L1,V1,M1} { empty( skol4( Y ) ) }.
% 0.71/1.08 (211) {G0,W3,D3,L1,V1,M1} { relation( skol4( Y ) ) }.
% 0.71/1.08 (212) {G0,W3,D3,L1,V1,M1} { function( skol4( Y ) ) }.
% 0.71/1.08 (213) {G0,W3,D3,L1,V1,M1} { one_to_one( skol4( Y ) ) }.
% 0.71/1.08 (214) {G0,W3,D3,L1,V1,M1} { epsilon_transitive( skol4( Y ) ) }.
% 0.71/1.08 (215) {G0,W3,D3,L1,V1,M1} { epsilon_connected( skol4( Y ) ) }.
% 0.71/1.08 (216) {G0,W3,D3,L1,V1,M1} { ordinal( skol4( Y ) ) }.
% 0.71/1.08 (217) {G0,W3,D3,L1,V1,M1} { natural( skol4( Y ) ) }.
% 0.71/1.08 (218) {G0,W3,D3,L1,V1,M1} { finite( skol4( Y ) ) }.
% 0.71/1.08 (219) {G0,W5,D3,L1,V1,M1} { element( skol4( X ), powerset( X ) ) }.
% 0.71/1.08 (220) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol5( Y ) ) }.
% 0.71/1.08 (221) {G0,W5,D3,L2,V2,M2} { empty( X ), finite( skol5( Y ) ) }.
% 0.71/1.08 (222) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol5( X ), powerset( X )
% 0.71/1.08 ) }.
% 0.71/1.08 (223) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol6( Y ) ) }.
% 0.71/1.08 (224) {G0,W5,D3,L2,V2,M2} { empty( X ), finite( skol6( Y ) ) }.
% 0.71/1.08 (225) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol6( X ), powerset( X )
% 0.71/1.08 ) }.
% 0.71/1.08 (226) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol7( Y ) ) }.
% 0.71/1.08 (227) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol7( X ), powerset( X )
% 0.71/1.08 ) }.
% 0.71/1.08 (228) {G0,W3,D3,L1,V1,M1} { empty( skol8( Y ) ) }.
% 0.71/1.08 (229) {G0,W5,D3,L1,V1,M1} { element( skol8( X ), powerset( X ) ) }.
% 0.71/1.08 (230) {G0,W2,D2,L1,V0,M1} { empty( skol9 ) }.
% 0.71/1.08 (231) {G0,W2,D2,L1,V0,M1} { ! empty( skol10 ) }.
% 0.71/1.08 (232) {G0,W4,D3,L1,V0,M1} { element( skol11, finite_subsets( skol12 ) )
% 0.71/1.08 }.
% 0.71/1.08 (233) {G0,W2,D2,L1,V0,M1} { ! finite( skol11 ) }.
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Total Proof:
% 0.71/1.08
% 0.71/1.08 subsumption: (26) {G0,W6,D3,L2,V2,M2} I { ! element( X, finite_subsets( Y )
% 0.71/1.08 ), finite( X ) }.
% 0.71/1.08 parent0: (202) {G0,W6,D3,L2,V2,M2} { ! element( X, finite_subsets( Y ) ),
% 0.71/1.08 finite( X ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 X := X
% 0.71/1.08 Y := Y
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 0
% 0.71/1.08 1 ==> 1
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (56) {G0,W4,D3,L1,V0,M1} I { element( skol11, finite_subsets(
% 0.71/1.08 skol12 ) ) }.
% 0.71/1.08 parent0: (232) {G0,W4,D3,L1,V0,M1} { element( skol11, finite_subsets(
% 0.71/1.08 skol12 ) ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 0
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (57) {G0,W2,D2,L1,V0,M1} I { ! finite( skol11 ) }.
% 0.71/1.08 parent0: (233) {G0,W2,D2,L1,V0,M1} { ! finite( skol11 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 0
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 resolution: (243) {G1,W2,D2,L1,V0,M1} { finite( skol11 ) }.
% 0.71/1.08 parent0[0]: (26) {G0,W6,D3,L2,V2,M2} I { ! element( X, finite_subsets( Y )
% 0.71/1.08 ), finite( X ) }.
% 0.71/1.08 parent1[0]: (56) {G0,W4,D3,L1,V0,M1} I { element( skol11, finite_subsets(
% 0.71/1.08 skol12 ) ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 X := skol11
% 0.71/1.08 Y := skol12
% 0.71/1.08 end
% 0.71/1.08 substitution1:
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 resolution: (244) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.08 parent0[0]: (57) {G0,W2,D2,L1,V0,M1} I { ! finite( skol11 ) }.
% 0.71/1.08 parent1[0]: (243) {G1,W2,D2,L1,V0,M1} { finite( skol11 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 substitution1:
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (172) {G1,W0,D0,L0,V0,M0} R(26,56);r(57) { }.
% 0.71/1.08 parent0: (244) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 Proof check complete!
% 0.71/1.08
% 0.71/1.08 Memory use:
% 0.71/1.08
% 0.71/1.08 space for terms: 1905
% 0.71/1.08 space for clauses: 8431
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 clauses generated: 500
% 0.71/1.08 clauses kept: 173
% 0.71/1.08 clauses selected: 90
% 0.71/1.08 clauses deleted: 1
% 0.71/1.08 clauses inuse deleted: 0
% 0.71/1.08
% 0.71/1.08 subsentry: 462
% 0.71/1.08 literals s-matched: 411
% 0.71/1.08 literals matched: 411
% 0.71/1.08 full subsumption: 54
% 0.71/1.08
% 0.71/1.08 checksum: -1537670121
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Bliksem ended
%------------------------------------------------------------------------------