%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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 06:21:55 EDT 2022
% Result : Theorem 0.77s 1.33s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n013.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 : Thu Jul 7 17:01:59 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.77/1.33 *** allocated 10000 integers for termspace/termends
% 0.77/1.33 *** allocated 10000 integers for clauses
% 0.77/1.33 *** allocated 10000 integers for justifications
% 0.77/1.33 Bliksem 1.12
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33 Automatic Strategy Selection
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33 Clauses:
% 0.77/1.33
% 0.77/1.33 { ! in( X, Y ), ! in( Y, X ) }.
% 0.77/1.33 { ! empty( X ), function( X ) }.
% 0.77/1.33 { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.77/1.33 { ! ordinal( X ), epsilon_connected( X ) }.
% 0.77/1.33 { ! empty( X ), relation( X ) }.
% 0.77/1.33 { ! relation( X ), ! empty( X ), ! function( X ), relation( X ) }.
% 0.77/1.33 { ! relation( X ), ! empty( X ), ! function( X ), function( X ) }.
% 0.77/1.33 { ! relation( X ), ! empty( X ), ! function( X ), one_to_one( X ) }.
% 0.77/1.33 { ! epsilon_transitive( X ), ! epsilon_connected( X ), ordinal( X ) }.
% 0.77/1.33 { ! ordinal( X ), ! ordinal( Y ), ordinal_subset( X, Y ), ordinal_subset( Y
% 0.77/1.33 , X ) }.
% 0.77/1.33 { ! epsilon_transitive( X ), ! in( Y, X ), subset( Y, X ) }.
% 0.77/1.33 { in( skol1( X ), X ), epsilon_transitive( X ) }.
% 0.77/1.33 { ! subset( skol1( X ), X ), epsilon_transitive( X ) }.
% 0.77/1.33 { element( skol2( X ), X ) }.
% 0.77/1.33 { empty( empty_set ) }.
% 0.77/1.33 { relation( empty_set ) }.
% 0.77/1.33 { relation_empty_yielding( empty_set ) }.
% 0.77/1.33 { empty( empty_set ) }.
% 0.77/1.33 { empty( empty_set ) }.
% 0.77/1.33 { relation( empty_set ) }.
% 0.77/1.33 { relation( skol3 ) }.
% 0.77/1.33 { function( skol3 ) }.
% 0.77/1.33 { epsilon_transitive( skol4 ) }.
% 0.77/1.33 { epsilon_connected( skol4 ) }.
% 0.77/1.33 { ordinal( skol4 ) }.
% 0.77/1.33 { empty( skol5 ) }.
% 0.77/1.33 { relation( skol5 ) }.
% 0.77/1.33 { empty( skol6 ) }.
% 0.77/1.33 { relation( skol7 ) }.
% 0.77/1.33 { empty( skol7 ) }.
% 0.77/1.33 { function( skol7 ) }.
% 0.77/1.33 { ! empty( skol8 ) }.
% 0.77/1.33 { relation( skol8 ) }.
% 0.77/1.33 { ! empty( skol9 ) }.
% 0.77/1.33 { relation( skol10 ) }.
% 0.77/1.33 { function( skol10 ) }.
% 0.77/1.33 { one_to_one( skol10 ) }.
% 0.77/1.33 { relation( skol11 ) }.
% 0.77/1.33 { relation_empty_yielding( skol11 ) }.
% 0.77/1.33 { relation( skol12 ) }.
% 0.77/1.33 { relation_empty_yielding( skol12 ) }.
% 0.77/1.33 { function( skol12 ) }.
% 0.77/1.33 { relation( skol13 ) }.
% 0.77/1.33 { relation_non_empty( skol13 ) }.
% 0.77/1.33 { function( skol13 ) }.
% 0.77/1.33 { ! ordinal( X ), ! ordinal( Y ), ! ordinal_subset( X, Y ), subset( X, Y )
% 0.77/1.33 }.
% 0.77/1.33 { ! ordinal( X ), ! ordinal( Y ), ! subset( X, Y ), ordinal_subset( X, Y )
% 0.77/1.33 }.
% 0.77/1.33 { ! ordinal( X ), ! ordinal( Y ), ordinal_subset( X, X ) }.
% 0.77/1.33 { subset( X, X ) }.
% 0.77/1.33 { ! in( X, Y ), element( X, Y ) }.
% 0.77/1.33 { ! ordinal( X ), ! ordinal( Y ), in( X, Y ), X = Y, in( Y, X ) }.
% 0.77/1.33 { ordinal( skol14 ) }.
% 0.77/1.33 { ordinal( skol15 ) }.
% 0.77/1.33 { ! ordinal_subset( skol14, skol15 ) }.
% 0.77/1.33 { ! in( skol15, skol14 ) }.
% 0.77/1.33 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.77/1.33 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 0.77/1.33 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 0.77/1.33 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 0.77/1.33 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 0.77/1.33 { ! empty( X ), X = empty_set }.
% 0.77/1.33 { ! in( X, Y ), ! empty( Y ) }.
% 0.77/1.33 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.77/1.33
% 0.77/1.33 percentage equality = 0.030000, percentage horn = 0.931034
% 0.77/1.33 This is a problem with some equality
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33 Options Used:
% 0.77/1.33
% 0.77/1.33 useres = 1
% 0.77/1.33 useparamod = 1
% 0.77/1.33 useeqrefl = 1
% 0.77/1.33 useeqfact = 1
% 0.77/1.33 usefactor = 1
% 0.77/1.33 usesimpsplitting = 0
% 0.77/1.33 usesimpdemod = 5
% 0.77/1.33 usesimpres = 3
% 0.77/1.33
% 0.77/1.33 resimpinuse = 1000
% 0.77/1.33 resimpclauses = 20000
% 0.77/1.33 substype = eqrewr
% 0.77/1.33 backwardsubs = 1
% 0.77/1.33 selectoldest = 5
% 0.77/1.33
% 0.77/1.33 litorderings [0] = split
% 0.77/1.33 litorderings [1] = extend the termordering, first sorting on arguments
% 0.77/1.33
% 0.77/1.33 termordering = kbo
% 0.77/1.33
% 0.77/1.33 litapriori = 0
% 0.77/1.33 termapriori = 1
% 0.77/1.33 litaposteriori = 0
% 0.77/1.33 termaposteriori = 0
% 0.77/1.33 demodaposteriori = 0
% 0.77/1.33 ordereqreflfact = 0
% 0.77/1.33
% 0.77/1.33 litselect = negord
% 0.77/1.33
% 0.77/1.33 maxweight = 15
% 0.77/1.33 maxdepth = 30000
% 0.77/1.33 maxlength = 115
% 0.77/1.33 maxnrvars = 195
% 0.77/1.33 excuselevel = 1
% 0.77/1.33 increasemaxweight = 1
% 0.77/1.33
% 0.77/1.33 maxselected = 10000000
% 0.77/1.33 maxnrclauses = 10000000
% 0.77/1.33
% 0.77/1.33 showgenerated = 0
% 0.77/1.33 showkept = 0
% 0.77/1.33 showselected = 0
% 0.77/1.33 showdeleted = 0
% 0.77/1.33 showresimp = 1
% 0.77/1.33 showstatus = 2000
% 0.77/1.33
% 0.77/1.33 prologoutput = 0
% 0.77/1.33 nrgoals = 5000000
% 0.77/1.33 totalproof = 1
% 0.77/1.33
% 0.77/1.33 Symbols occurring in the translation:
% 0.77/1.33
% 0.77/1.33 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.77/1.33 . [1, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.77/1.33 ! [4, 1] (w:0, o:23, a:1, s:1, b:0),
% 0.77/1.33 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.77/1.33 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.77/1.33 in [37, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.77/1.33 empty [38, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.77/1.33 function [39, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.77/1.33 ordinal [40, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.77/1.33 epsilon_transitive [41, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.77/1.33 epsilon_connected [42, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.77/1.33 relation [43, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.77/1.33 one_to_one [44, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.77/1.33 ordinal_subset [45, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.77/1.33 subset [46, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.77/1.33 element [47, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.77/1.33 empty_set [48, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.77/1.33 relation_empty_yielding [49, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.77/1.33 relation_non_empty [50, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.77/1.33 powerset [51, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.77/1.33 skol1 [53, 1] (w:1, o:38, a:1, s:1, b:1),
% 0.77/1.33 skol2 [54, 1] (w:1, o:39, a:1, s:1, b:1),
% 0.77/1.33 skol3 [55, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.77/1.33 skol4 [56, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.77/1.33 skol5 [57, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.77/1.33 skol6 [58, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.77/1.33 skol7 [59, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.77/1.33 skol8 [60, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.77/1.33 skol9 [61, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.77/1.33 skol10 [62, 0] (w:1, o:17, a:1, s:1, b:1),
% 0.77/1.33 skol11 [63, 0] (w:1, o:18, a:1, s:1, b:1),
% 0.77/1.33 skol12 [64, 0] (w:1, o:19, a:1, s:1, b:1),
% 0.77/1.33 skol13 [65, 0] (w:1, o:20, a:1, s:1, b:1),
% 0.77/1.33 skol14 [66, 0] (w:1, o:21, a:1, s:1, b:1),
% 0.77/1.33 skol15 [67, 0] (w:1, o:22, a:1, s:1, b:1).
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33 Starting Search:
% 0.77/1.33
% 0.77/1.33 *** allocated 15000 integers for clauses
% 0.77/1.33 *** allocated 22500 integers for clauses
% 0.77/1.33 *** allocated 33750 integers for clauses
% 0.77/1.33 *** allocated 50625 integers for clauses
% 0.77/1.33 *** allocated 15000 integers for termspace/termends
% 0.77/1.33 Resimplifying inuse:
% 0.77/1.33 Done
% 0.77/1.33
% 0.77/1.33 *** allocated 75937 integers for clauses
% 0.77/1.33 *** allocated 22500 integers for termspace/termends
% 0.77/1.33 *** allocated 113905 integers for clauses
% 0.77/1.33 *** allocated 33750 integers for termspace/termends
% 0.77/1.33
% 0.77/1.33 Intermediate Status:
% 0.77/1.33 Generated: 8589
% 0.77/1.33 Kept: 2002
% 0.77/1.33 Inuse: 324
% 0.77/1.33 Deleted: 77
% 0.77/1.33 Deletedinuse: 36
% 0.77/1.33
% 0.77/1.33 Resimplifying inuse:
% 0.77/1.33 Done
% 0.77/1.33
% 0.77/1.33 *** allocated 50625 integers for termspace/termends
% 0.77/1.33 *** allocated 170857 integers for clauses
% 0.77/1.33 Resimplifying inuse:
% 0.77/1.33 Done
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33 Bliksems!, er is een bewijs:
% 0.77/1.33 % SZS status Theorem
% 0.77/1.33 % SZS output start Refutation
% 0.77/1.33
% 0.77/1.33 (2) {G0,W4,D2,L2,V1,M2} I { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.77/1.33 (8) {G0,W8,D2,L3,V2,M3} I { ! epsilon_transitive( X ), ! in( Y, X ), subset
% 0.77/1.33 ( Y, X ) }.
% 0.77/1.33 (41) {G0,W10,D2,L4,V2,M4} I { ! ordinal( X ), ! ordinal( Y ), ! subset( X,
% 0.77/1.33 Y ), ordinal_subset( X, Y ) }.
% 0.77/1.33 (43) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.77/1.33 (45) {G0,W13,D2,L5,V2,M5} I { ! ordinal( X ), ! ordinal( Y ), in( X, Y ), X
% 0.77/1.33 = Y, in( Y, X ) }.
% 0.77/1.33 (46) {G0,W2,D2,L1,V0,M1} I { ordinal( skol14 ) }.
% 0.77/1.33 (47) {G0,W2,D2,L1,V0,M1} I { ordinal( skol15 ) }.
% 0.77/1.33 (48) {G0,W3,D2,L1,V0,M1} I { ! ordinal_subset( skol14, skol15 ) }.
% 0.77/1.33 (49) {G0,W3,D2,L1,V0,M1} I { ! in( skol15, skol14 ) }.
% 0.77/1.33 (51) {G0,W7,D3,L2,V2,M2} I { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.77/1.33 }.
% 0.77/1.33 (52) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.77/1.33 }.
% 0.77/1.33 (61) {G1,W2,D2,L1,V0,M1} R(2,47) { epsilon_transitive( skol15 ) }.
% 0.77/1.33 (78) {G2,W6,D2,L2,V1,M2} R(8,61) { ! in( X, skol15 ), subset( X, skol15 )
% 0.77/1.33 }.
% 0.77/1.33 (112) {G1,W5,D2,L2,V0,M2} R(41,48);r(46) { ! ordinal( skol15 ), ! subset(
% 0.77/1.33 skol14, skol15 ) }.
% 0.77/1.33 (170) {G1,W8,D2,L3,V0,M3} R(45,49);r(47) { ! ordinal( skol14 ), skol15 ==>
% 0.77/1.33 skol14, in( skol14, skol15 ) }.
% 0.77/1.33 (290) {G1,W4,D3,L1,V1,M1} R(52,43) { element( X, powerset( X ) ) }.
% 0.77/1.33 (606) {G2,W3,D2,L1,V0,M1} S(112);r(47) { ! subset( skol14, skol15 ) }.
% 0.77/1.33 (607) {G3,W3,D2,L1,V0,M1} R(606,78) { ! in( skol14, skol15 ) }.
% 0.77/1.33 (608) {G3,W4,D3,L1,V0,M1} R(606,51) { ! element( skol14, powerset( skol15 )
% 0.77/1.33 ) }.
% 0.77/1.33 (3385) {G4,W3,D2,L1,V0,M1} S(170);r(46);r(607) { skol15 ==> skol14 }.
% 0.77/1.33 (3387) {G5,W0,D0,L0,V0,M0} P(3385,608);r(290) { }.
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33 % SZS output end Refutation
% 0.77/1.33 found a proof!
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33 Unprocessed initial clauses:
% 0.77/1.33
% 0.77/1.33 (3389) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.77/1.33 (3390) {G0,W4,D2,L2,V1,M2} { ! empty( X ), function( X ) }.
% 0.77/1.33 (3391) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.77/1.33 (3392) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_connected( X ) }.
% 0.77/1.33 (3393) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 0.77/1.33 (3394) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X
% 0.77/1.33 ), relation( X ) }.
% 0.77/1.33 (3395) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X
% 0.77/1.33 ), function( X ) }.
% 0.77/1.33 (3396) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X
% 0.77/1.33 ), one_to_one( X ) }.
% 0.77/1.33 (3397) {G0,W6,D2,L3,V1,M3} { ! epsilon_transitive( X ), !
% 0.77/1.33 epsilon_connected( X ), ordinal( X ) }.
% 0.77/1.33 (3398) {G0,W10,D2,L4,V2,M4} { ! ordinal( X ), ! ordinal( Y ),
% 0.77/1.33 ordinal_subset( X, Y ), ordinal_subset( Y, X ) }.
% 0.77/1.33 (3399) {G0,W8,D2,L3,V2,M3} { ! epsilon_transitive( X ), ! in( Y, X ),
% 0.77/1.33 subset( Y, X ) }.
% 0.77/1.33 (3400) {G0,W6,D3,L2,V1,M2} { in( skol1( X ), X ), epsilon_transitive( X )
% 0.77/1.33 }.
% 0.77/1.33 (3401) {G0,W6,D3,L2,V1,M2} { ! subset( skol1( X ), X ), epsilon_transitive
% 0.77/1.33 ( X ) }.
% 0.77/1.33 (3402) {G0,W4,D3,L1,V1,M1} { element( skol2( X ), X ) }.
% 0.77/1.33 (3403) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.77/1.33 (3404) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.77/1.33 (3405) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( empty_set ) }.
% 0.77/1.33 (3406) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.77/1.33 (3407) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.77/1.33 (3408) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.77/1.33 (3409) {G0,W2,D2,L1,V0,M1} { relation( skol3 ) }.
% 0.77/1.33 (3410) {G0,W2,D2,L1,V0,M1} { function( skol3 ) }.
% 0.77/1.33 (3411) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol4 ) }.
% 0.77/1.33 (3412) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol4 ) }.
% 0.77/1.33 (3413) {G0,W2,D2,L1,V0,M1} { ordinal( skol4 ) }.
% 0.77/1.33 (3414) {G0,W2,D2,L1,V0,M1} { empty( skol5 ) }.
% 0.77/1.33 (3415) {G0,W2,D2,L1,V0,M1} { relation( skol5 ) }.
% 0.77/1.33 (3416) {G0,W2,D2,L1,V0,M1} { empty( skol6 ) }.
% 0.77/1.33 (3417) {G0,W2,D2,L1,V0,M1} { relation( skol7 ) }.
% 0.77/1.33 (3418) {G0,W2,D2,L1,V0,M1} { empty( skol7 ) }.
% 0.77/1.33 (3419) {G0,W2,D2,L1,V0,M1} { function( skol7 ) }.
% 0.77/1.33 (3420) {G0,W2,D2,L1,V0,M1} { ! empty( skol8 ) }.
% 0.77/1.33 (3421) {G0,W2,D2,L1,V0,M1} { relation( skol8 ) }.
% 0.77/1.33 (3422) {G0,W2,D2,L1,V0,M1} { ! empty( skol9 ) }.
% 0.77/1.33 (3423) {G0,W2,D2,L1,V0,M1} { relation( skol10 ) }.
% 0.77/1.33 (3424) {G0,W2,D2,L1,V0,M1} { function( skol10 ) }.
% 0.77/1.33 (3425) {G0,W2,D2,L1,V0,M1} { one_to_one( skol10 ) }.
% 0.77/1.33 (3426) {G0,W2,D2,L1,V0,M1} { relation( skol11 ) }.
% 0.77/1.33 (3427) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol11 ) }.
% 0.77/1.33 (3428) {G0,W2,D2,L1,V0,M1} { relation( skol12 ) }.
% 0.77/1.33 (3429) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol12 ) }.
% 0.77/1.33 (3430) {G0,W2,D2,L1,V0,M1} { function( skol12 ) }.
% 0.77/1.33 (3431) {G0,W2,D2,L1,V0,M1} { relation( skol13 ) }.
% 0.77/1.33 (3432) {G0,W2,D2,L1,V0,M1} { relation_non_empty( skol13 ) }.
% 0.77/1.33 (3433) {G0,W2,D2,L1,V0,M1} { function( skol13 ) }.
% 0.77/1.33 (3434) {G0,W10,D2,L4,V2,M4} { ! ordinal( X ), ! ordinal( Y ), !
% 0.77/1.33 ordinal_subset( X, Y ), subset( X, Y ) }.
% 0.77/1.33 (3435) {G0,W10,D2,L4,V2,M4} { ! ordinal( X ), ! ordinal( Y ), ! subset( X
% 0.77/1.33 , Y ), ordinal_subset( X, Y ) }.
% 0.77/1.33 (3436) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! ordinal( Y ),
% 0.77/1.33 ordinal_subset( X, X ) }.
% 0.77/1.33 (3437) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.77/1.33 (3438) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.77/1.33 (3439) {G0,W13,D2,L5,V2,M5} { ! ordinal( X ), ! ordinal( Y ), in( X, Y ),
% 0.77/1.33 X = Y, in( Y, X ) }.
% 0.77/1.33 (3440) {G0,W2,D2,L1,V0,M1} { ordinal( skol14 ) }.
% 0.77/1.33 (3441) {G0,W2,D2,L1,V0,M1} { ordinal( skol15 ) }.
% 0.77/1.33 (3442) {G0,W3,D2,L1,V0,M1} { ! ordinal_subset( skol14, skol15 ) }.
% 0.77/1.33 (3443) {G0,W3,D2,L1,V0,M1} { ! in( skol15, skol14 ) }.
% 0.77/1.33 (3444) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.77/1.33 (3445) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.77/1.33 }.
% 0.77/1.33 (3446) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.77/1.33 }.
% 0.77/1.33 (3447) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) )
% 0.77/1.33 , element( X, Y ) }.
% 0.77/1.33 (3448) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) ),
% 0.77/1.33 ! empty( Z ) }.
% 0.77/1.33 (3449) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.77/1.33 (3450) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.77/1.33 (3451) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33 Total Proof:
% 0.77/1.33
% 0.77/1.33 subsumption: (2) {G0,W4,D2,L2,V1,M2} I { ! ordinal( X ), epsilon_transitive
% 0.77/1.33 ( X ) }.
% 0.77/1.33 parent0: (3391) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_transitive(
% 0.77/1.33 X ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := X
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 1 ==> 1
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (8) {G0,W8,D2,L3,V2,M3} I { ! epsilon_transitive( X ), ! in( Y
% 0.77/1.33 , X ), subset( Y, X ) }.
% 0.77/1.33 parent0: (3399) {G0,W8,D2,L3,V2,M3} { ! epsilon_transitive( X ), ! in( Y,
% 0.77/1.33 X ), subset( Y, X ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := X
% 0.77/1.33 Y := Y
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 1 ==> 1
% 0.77/1.33 2 ==> 2
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (41) {G0,W10,D2,L4,V2,M4} I { ! ordinal( X ), ! ordinal( Y ),
% 0.77/1.33 ! subset( X, Y ), ordinal_subset( X, Y ) }.
% 0.77/1.33 parent0: (3435) {G0,W10,D2,L4,V2,M4} { ! ordinal( X ), ! ordinal( Y ), !
% 0.77/1.33 subset( X, Y ), ordinal_subset( X, Y ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := X
% 0.77/1.33 Y := Y
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 1 ==> 1
% 0.77/1.33 2 ==> 2
% 0.77/1.33 3 ==> 3
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (43) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.77/1.33 parent0: (3437) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := X
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (45) {G0,W13,D2,L5,V2,M5} I { ! ordinal( X ), ! ordinal( Y ),
% 0.77/1.33 in( X, Y ), X = Y, in( Y, X ) }.
% 0.77/1.33 parent0: (3439) {G0,W13,D2,L5,V2,M5} { ! ordinal( X ), ! ordinal( Y ), in
% 0.77/1.33 ( X, Y ), X = Y, in( Y, X ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := X
% 0.77/1.33 Y := Y
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 1 ==> 1
% 0.77/1.33 2 ==> 2
% 0.77/1.33 3 ==> 3
% 0.77/1.33 4 ==> 4
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (46) {G0,W2,D2,L1,V0,M1} I { ordinal( skol14 ) }.
% 0.77/1.33 parent0: (3440) {G0,W2,D2,L1,V0,M1} { ordinal( skol14 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (47) {G0,W2,D2,L1,V0,M1} I { ordinal( skol15 ) }.
% 0.77/1.33 parent0: (3441) {G0,W2,D2,L1,V0,M1} { ordinal( skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (48) {G0,W3,D2,L1,V0,M1} I { ! ordinal_subset( skol14, skol15
% 0.77/1.33 ) }.
% 0.77/1.33 parent0: (3442) {G0,W3,D2,L1,V0,M1} { ! ordinal_subset( skol14, skol15 )
% 0.77/1.33 }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (49) {G0,W3,D2,L1,V0,M1} I { ! in( skol15, skol14 ) }.
% 0.77/1.33 parent0: (3443) {G0,W3,D2,L1,V0,M1} { ! in( skol15, skol14 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (51) {G0,W7,D3,L2,V2,M2} I { ! element( X, powerset( Y ) ),
% 0.77/1.33 subset( X, Y ) }.
% 0.77/1.33 parent0: (3445) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ),
% 0.77/1.33 subset( X, Y ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := X
% 0.77/1.33 Y := Y
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 1 ==> 1
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (52) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X,
% 0.77/1.33 powerset( Y ) ) }.
% 0.77/1.33 parent0: (3446) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X,
% 0.77/1.33 powerset( Y ) ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := X
% 0.77/1.33 Y := Y
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 1 ==> 1
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3540) {G1,W2,D2,L1,V0,M1} { epsilon_transitive( skol15 ) }.
% 0.77/1.33 parent0[0]: (2) {G0,W4,D2,L2,V1,M2} I { ! ordinal( X ), epsilon_transitive
% 0.77/1.33 ( X ) }.
% 0.77/1.33 parent1[0]: (47) {G0,W2,D2,L1,V0,M1} I { ordinal( skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := skol15
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (61) {G1,W2,D2,L1,V0,M1} R(2,47) { epsilon_transitive( skol15
% 0.77/1.33 ) }.
% 0.77/1.33 parent0: (3540) {G1,W2,D2,L1,V0,M1} { epsilon_transitive( skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3541) {G1,W6,D2,L2,V1,M2} { ! in( X, skol15 ), subset( X,
% 0.77/1.33 skol15 ) }.
% 0.77/1.33 parent0[0]: (8) {G0,W8,D2,L3,V2,M3} I { ! epsilon_transitive( X ), ! in( Y
% 0.77/1.33 , X ), subset( Y, X ) }.
% 0.77/1.33 parent1[0]: (61) {G1,W2,D2,L1,V0,M1} R(2,47) { epsilon_transitive( skol15 )
% 0.77/1.33 }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := skol15
% 0.77/1.33 Y := X
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (78) {G2,W6,D2,L2,V1,M2} R(8,61) { ! in( X, skol15 ), subset(
% 0.77/1.33 X, skol15 ) }.
% 0.77/1.33 parent0: (3541) {G1,W6,D2,L2,V1,M2} { ! in( X, skol15 ), subset( X, skol15
% 0.77/1.33 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := X
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 1 ==> 1
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3542) {G1,W7,D2,L3,V0,M3} { ! ordinal( skol14 ), ! ordinal(
% 0.77/1.33 skol15 ), ! subset( skol14, skol15 ) }.
% 0.77/1.33 parent0[0]: (48) {G0,W3,D2,L1,V0,M1} I { ! ordinal_subset( skol14, skol15 )
% 0.77/1.33 }.
% 0.77/1.33 parent1[3]: (41) {G0,W10,D2,L4,V2,M4} I { ! ordinal( X ), ! ordinal( Y ), !
% 0.77/1.33 subset( X, Y ), ordinal_subset( X, Y ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 X := skol14
% 0.77/1.33 Y := skol15
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3543) {G1,W5,D2,L2,V0,M2} { ! ordinal( skol15 ), ! subset(
% 0.77/1.33 skol14, skol15 ) }.
% 0.77/1.33 parent0[0]: (3542) {G1,W7,D2,L3,V0,M3} { ! ordinal( skol14 ), ! ordinal(
% 0.77/1.33 skol15 ), ! subset( skol14, skol15 ) }.
% 0.77/1.33 parent1[0]: (46) {G0,W2,D2,L1,V0,M1} I { ordinal( skol14 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (112) {G1,W5,D2,L2,V0,M2} R(41,48);r(46) { ! ordinal( skol15 )
% 0.77/1.33 , ! subset( skol14, skol15 ) }.
% 0.77/1.33 parent0: (3543) {G1,W5,D2,L2,V0,M2} { ! ordinal( skol15 ), ! subset(
% 0.77/1.33 skol14, skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 1 ==> 1
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3544) {G1,W10,D2,L4,V0,M4} { ! ordinal( skol15 ), ! ordinal(
% 0.77/1.33 skol14 ), skol15 = skol14, in( skol14, skol15 ) }.
% 0.77/1.33 parent0[0]: (49) {G0,W3,D2,L1,V0,M1} I { ! in( skol15, skol14 ) }.
% 0.77/1.33 parent1[2]: (45) {G0,W13,D2,L5,V2,M5} I { ! ordinal( X ), ! ordinal( Y ),
% 0.77/1.33 in( X, Y ), X = Y, in( Y, X ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 X := skol15
% 0.77/1.33 Y := skol14
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3546) {G1,W8,D2,L3,V0,M3} { ! ordinal( skol14 ), skol15 =
% 0.77/1.33 skol14, in( skol14, skol15 ) }.
% 0.77/1.33 parent0[0]: (3544) {G1,W10,D2,L4,V0,M4} { ! ordinal( skol15 ), ! ordinal(
% 0.77/1.33 skol14 ), skol15 = skol14, in( skol14, skol15 ) }.
% 0.77/1.33 parent1[0]: (47) {G0,W2,D2,L1,V0,M1} I { ordinal( skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (170) {G1,W8,D2,L3,V0,M3} R(45,49);r(47) { ! ordinal( skol14 )
% 0.77/1.33 , skol15 ==> skol14, in( skol14, skol15 ) }.
% 0.77/1.33 parent0: (3546) {G1,W8,D2,L3,V0,M3} { ! ordinal( skol14 ), skol15 = skol14
% 0.77/1.33 , in( skol14, skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 1 ==> 1
% 0.77/1.33 2 ==> 2
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3548) {G1,W4,D3,L1,V1,M1} { element( X, powerset( X ) ) }.
% 0.77/1.33 parent0[0]: (52) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X,
% 0.77/1.33 powerset( Y ) ) }.
% 0.77/1.33 parent1[0]: (43) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := X
% 0.77/1.33 Y := X
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 X := X
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (290) {G1,W4,D3,L1,V1,M1} R(52,43) { element( X, powerset( X )
% 0.77/1.33 ) }.
% 0.77/1.33 parent0: (3548) {G1,W4,D3,L1,V1,M1} { element( X, powerset( X ) ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 X := X
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3549) {G1,W3,D2,L1,V0,M1} { ! subset( skol14, skol15 ) }.
% 0.77/1.33 parent0[0]: (112) {G1,W5,D2,L2,V0,M2} R(41,48);r(46) { ! ordinal( skol15 )
% 0.77/1.33 , ! subset( skol14, skol15 ) }.
% 0.77/1.33 parent1[0]: (47) {G0,W2,D2,L1,V0,M1} I { ordinal( skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (606) {G2,W3,D2,L1,V0,M1} S(112);r(47) { ! subset( skol14,
% 0.77/1.33 skol15 ) }.
% 0.77/1.33 parent0: (3549) {G1,W3,D2,L1,V0,M1} { ! subset( skol14, skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3550) {G3,W3,D2,L1,V0,M1} { ! in( skol14, skol15 ) }.
% 0.77/1.33 parent0[0]: (606) {G2,W3,D2,L1,V0,M1} S(112);r(47) { ! subset( skol14,
% 0.77/1.33 skol15 ) }.
% 0.77/1.33 parent1[1]: (78) {G2,W6,D2,L2,V1,M2} R(8,61) { ! in( X, skol15 ), subset( X
% 0.77/1.33 , skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 X := skol14
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (607) {G3,W3,D2,L1,V0,M1} R(606,78) { ! in( skol14, skol15 )
% 0.77/1.33 }.
% 0.77/1.33 parent0: (3550) {G3,W3,D2,L1,V0,M1} { ! in( skol14, skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3551) {G1,W4,D3,L1,V0,M1} { ! element( skol14, powerset(
% 0.77/1.33 skol15 ) ) }.
% 0.77/1.33 parent0[0]: (606) {G2,W3,D2,L1,V0,M1} S(112);r(47) { ! subset( skol14,
% 0.77/1.33 skol15 ) }.
% 0.77/1.33 parent1[1]: (51) {G0,W7,D3,L2,V2,M2} I { ! element( X, powerset( Y ) ),
% 0.77/1.33 subset( X, Y ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 X := skol14
% 0.77/1.33 Y := skol15
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (608) {G3,W4,D3,L1,V0,M1} R(606,51) { ! element( skol14,
% 0.77/1.33 powerset( skol15 ) ) }.
% 0.77/1.33 parent0: (3551) {G1,W4,D3,L1,V0,M1} { ! element( skol14, powerset( skol15
% 0.77/1.33 ) ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3553) {G1,W6,D2,L2,V0,M2} { skol15 ==> skol14, in( skol14,
% 0.77/1.33 skol15 ) }.
% 0.77/1.33 parent0[0]: (170) {G1,W8,D2,L3,V0,M3} R(45,49);r(47) { ! ordinal( skol14 )
% 0.77/1.33 , skol15 ==> skol14, in( skol14, skol15 ) }.
% 0.77/1.33 parent1[0]: (46) {G0,W2,D2,L1,V0,M1} I { ordinal( skol14 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3554) {G2,W3,D2,L1,V0,M1} { skol15 ==> skol14 }.
% 0.77/1.33 parent0[0]: (607) {G3,W3,D2,L1,V0,M1} R(606,78) { ! in( skol14, skol15 )
% 0.77/1.33 }.
% 0.77/1.33 parent1[1]: (3553) {G1,W6,D2,L2,V0,M2} { skol15 ==> skol14, in( skol14,
% 0.77/1.33 skol15 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (3385) {G4,W3,D2,L1,V0,M1} S(170);r(46);r(607) { skol15 ==>
% 0.77/1.33 skol14 }.
% 0.77/1.33 parent0: (3554) {G2,W3,D2,L1,V0,M1} { skol15 ==> skol14 }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 0 ==> 0
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 paramod: (3557) {G4,W4,D3,L1,V0,M1} { ! element( skol14, powerset( skol14
% 0.77/1.33 ) ) }.
% 0.77/1.33 parent0[0]: (3385) {G4,W3,D2,L1,V0,M1} S(170);r(46);r(607) { skol15 ==>
% 0.77/1.33 skol14 }.
% 0.77/1.33 parent1[0; 4]: (608) {G3,W4,D3,L1,V0,M1} R(606,51) { ! element( skol14,
% 0.77/1.33 powerset( skol15 ) ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 resolution: (3558) {G2,W0,D0,L0,V0,M0} { }.
% 0.77/1.33 parent0[0]: (3557) {G4,W4,D3,L1,V0,M1} { ! element( skol14, powerset(
% 0.77/1.33 skol14 ) ) }.
% 0.77/1.33 parent1[0]: (290) {G1,W4,D3,L1,V1,M1} R(52,43) { element( X, powerset( X )
% 0.77/1.33 ) }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 substitution1:
% 0.77/1.33 X := skol14
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 subsumption: (3387) {G5,W0,D0,L0,V0,M0} P(3385,608);r(290) { }.
% 0.77/1.33 parent0: (3558) {G2,W0,D0,L0,V0,M0} { }.
% 0.77/1.33 substitution0:
% 0.77/1.33 end
% 0.77/1.33 permutation0:
% 0.77/1.33 end
% 0.77/1.33
% 0.77/1.33 Proof check complete!
% 0.77/1.33
% 0.77/1.33 Memory use:
% 0.77/1.33
% 0.77/1.33 space for terms: 42129
% 0.77/1.33 space for clauses: 133109
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33 clauses generated: 15532
% 0.77/1.33 clauses kept: 3388
% 0.77/1.33 clauses selected: 369
% 0.77/1.33 clauses deleted: 92
% 0.77/1.33 clauses inuse deleted: 49
% 0.77/1.33
% 0.77/1.33 subsentry: 27740
% 0.77/1.33 literals s-matched: 23199
% 0.77/1.33 literals matched: 20999
% 0.77/1.33 full subsumption: 3237
% 0.77/1.33
% 0.77/1.33 checksum: 1019551001
% 0.77/1.33
% 0.77/1.33
% 0.77/1.33 Bliksem ended
%------------------------------------------------------------------------------