%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU295+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n005.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:12:13 EDT 2022
% Result : Theorem 0.42s 1.08s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU295+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Mon Jun 20 06:34:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.42/1.08 *** allocated 10000 integers for termspace/termends
% 0.42/1.08 *** allocated 10000 integers for clauses
% 0.42/1.08 *** allocated 10000 integers for justifications
% 0.42/1.08 Bliksem 1.12
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Automatic Strategy Selection
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Clauses:
% 0.42/1.08
% 0.42/1.08 { ! in( X, Y ), ! in( Y, X ) }.
% 0.42/1.08 { ! ordinal( X ), ! element( Y, X ), epsilon_transitive( Y ) }.
% 0.42/1.08 { ! ordinal( X ), ! element( Y, X ), epsilon_connected( Y ) }.
% 0.42/1.08 { ! ordinal( X ), ! element( Y, X ), ordinal( Y ) }.
% 0.42/1.08 { ! empty( X ), finite( X ) }.
% 0.42/1.08 { ! empty( X ), function( X ) }.
% 0.42/1.08 { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.42/1.08 { ! ordinal( X ), epsilon_connected( X ) }.
% 0.42/1.08 { ! empty( X ), relation( X ) }.
% 0.42/1.08 { ! empty( X ), ! ordinal( X ), alpha1( X ) }.
% 0.42/1.08 { ! empty( X ), ! ordinal( X ), natural( X ) }.
% 0.42/1.08 { ! alpha1( X ), epsilon_transitive( X ) }.
% 0.42/1.08 { ! alpha1( X ), epsilon_connected( X ) }.
% 0.42/1.08 { ! alpha1( X ), ordinal( X ) }.
% 0.42/1.08 { ! epsilon_transitive( X ), ! epsilon_connected( X ), ! ordinal( X ),
% 0.42/1.08 alpha1( X ) }.
% 0.42/1.08 { ! finite( X ), ! element( Y, powerset( X ) ), finite( Y ) }.
% 0.42/1.08 { ! relation( X ), ! empty( X ), ! function( X ), relation( X ) }.
% 0.42/1.08 { ! relation( X ), ! empty( X ), ! function( X ), function( X ) }.
% 0.42/1.08 { ! relation( X ), ! empty( X ), ! function( X ), one_to_one( X ) }.
% 0.42/1.08 { ! epsilon_transitive( X ), ! epsilon_connected( X ), ordinal( X ) }.
% 0.42/1.08 { ! empty( X ), epsilon_transitive( X ) }.
% 0.42/1.08 { ! empty( X ), epsilon_connected( X ) }.
% 0.42/1.08 { ! empty( X ), ordinal( X ) }.
% 0.42/1.08 { set_intersection2( X, Y ) = set_intersection2( Y, X ) }.
% 0.42/1.08 { && }.
% 0.42/1.08 { && }.
% 0.42/1.08 { && }.
% 0.42/1.08 { && }.
% 0.42/1.08 { element( skol1( X ), X ) }.
% 0.42/1.08 { ! finite( X ), finite( set_intersection2( Y, X ) ) }.
% 0.42/1.08 { ! finite( X ), finite( set_intersection2( X, Y ) ) }.
% 0.42/1.08 { empty( empty_set ) }.
% 0.42/1.08 { relation( empty_set ) }.
% 0.42/1.08 { relation_empty_yielding( empty_set ) }.
% 0.42/1.08 { ! relation( X ), ! relation( Y ), relation( set_intersection2( X, Y ) ) }
% 0.42/1.08 .
% 0.42/1.08 { ! empty( powerset( X ) ) }.
% 0.42/1.08 { empty( empty_set ) }.
% 0.42/1.08 { relation( empty_set ) }.
% 0.42/1.08 { relation_empty_yielding( empty_set ) }.
% 0.42/1.08 { function( empty_set ) }.
% 0.42/1.08 { one_to_one( empty_set ) }.
% 0.42/1.08 { empty( empty_set ) }.
% 0.42/1.08 { epsilon_transitive( empty_set ) }.
% 0.42/1.08 { epsilon_connected( empty_set ) }.
% 0.42/1.08 { ordinal( empty_set ) }.
% 0.42/1.08 { empty( empty_set ) }.
% 0.42/1.08 { relation( empty_set ) }.
% 0.42/1.08 { set_intersection2( X, X ) = X }.
% 0.42/1.08 { ! empty( skol2 ) }.
% 0.42/1.08 { epsilon_transitive( skol2 ) }.
% 0.42/1.08 { epsilon_connected( skol2 ) }.
% 0.42/1.08 { ordinal( skol2 ) }.
% 0.42/1.08 { natural( skol2 ) }.
% 0.42/1.08 { ! empty( skol3 ) }.
% 0.42/1.08 { finite( skol3 ) }.
% 0.42/1.08 { relation( skol4 ) }.
% 0.42/1.08 { function( skol4 ) }.
% 0.42/1.08 { epsilon_transitive( skol5 ) }.
% 0.42/1.08 { epsilon_connected( skol5 ) }.
% 0.42/1.08 { ordinal( skol5 ) }.
% 0.42/1.08 { empty( skol6 ) }.
% 0.42/1.08 { relation( skol6 ) }.
% 0.42/1.08 { empty( X ), ! empty( skol7( Y ) ) }.
% 0.42/1.08 { empty( X ), element( skol7( X ), powerset( X ) ) }.
% 0.42/1.08 { empty( skol8 ) }.
% 0.42/1.08 { empty( skol9( Y ) ) }.
% 0.42/1.08 { relation( skol9( Y ) ) }.
% 0.42/1.08 { function( skol9( Y ) ) }.
% 0.42/1.08 { one_to_one( skol9( Y ) ) }.
% 0.42/1.08 { epsilon_transitive( skol9( Y ) ) }.
% 0.42/1.08 { epsilon_connected( skol9( Y ) ) }.
% 0.42/1.08 { ordinal( skol9( Y ) ) }.
% 0.42/1.08 { natural( skol9( Y ) ) }.
% 0.42/1.08 { finite( skol9( Y ) ) }.
% 0.42/1.08 { element( skol9( X ), powerset( X ) ) }.
% 0.42/1.08 { relation( skol10 ) }.
% 0.42/1.08 { empty( skol10 ) }.
% 0.42/1.08 { function( skol10 ) }.
% 0.42/1.08 { relation( skol11 ) }.
% 0.42/1.08 { function( skol11 ) }.
% 0.42/1.08 { one_to_one( skol11 ) }.
% 0.42/1.08 { empty( skol11 ) }.
% 0.42/1.08 { epsilon_transitive( skol11 ) }.
% 0.42/1.08 { epsilon_connected( skol11 ) }.
% 0.42/1.08 { ordinal( skol11 ) }.
% 0.42/1.08 { ! empty( skol12 ) }.
% 0.42/1.08 { relation( skol12 ) }.
% 0.42/1.08 { empty( skol13( Y ) ) }.
% 0.42/1.08 { element( skol13( X ), powerset( X ) ) }.
% 0.42/1.08 { ! empty( skol14 ) }.
% 0.42/1.08 { empty( X ), ! empty( skol15( Y ) ) }.
% 0.42/1.08 { empty( X ), finite( skol15( Y ) ) }.
% 0.42/1.08 { empty( X ), element( skol15( X ), powerset( X ) ) }.
% 0.42/1.08 { relation( skol16 ) }.
% 0.42/1.08 { function( skol16 ) }.
% 0.42/1.08 { one_to_one( skol16 ) }.
% 0.42/1.08 { ! empty( skol17 ) }.
% 0.42/1.08 { epsilon_transitive( skol17 ) }.
% 0.42/1.08 { epsilon_connected( skol17 ) }.
% 0.42/1.08 { ordinal( skol17 ) }.
% 0.42/1.08 { relation( skol18 ) }.
% 0.42/1.08 { relation_empty_yielding( skol18 ) }.
% 0.42/1.08 { relation( skol19 ) }.
% 0.42/1.08 { relation_empty_yielding( skol19 ) }.
% 0.42/1.08 { function( skol19 ) }.
% 0.42/1.08 { subset( X, X ) }.
% 0.42/1.08 { ! subset( X, Y ), ! finite( Y ), finite( X ) }.
% 0.42/1.08 { finite( skol20 ) }.
% 0.42/1.08 { ! finite( set_intersection2( skol20, skol21 ) ) }.
% 0.42/1.08 { subset( set_intersection2( X, Y ), X ) }.
% 0.42/1.08 { ! in( X, Y ), element( X, Y ) }.
% 0.42/1.08 { set_intersection2( X, empty_set ) = empty_set }.
% 0.42/1.08 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.42/1.08 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 0.42/1.08 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 0.42/1.08 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 0.42/1.08 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 0.42/1.08 { ! empty( X ), X = empty_set }.
% 0.42/1.08 { ! in( X, Y ), ! empty( Y ) }.
% 0.42/1.08 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.42/1.08
% 0.42/1.08 percentage equality = 0.030303, percentage horn = 0.963303
% 0.42/1.08 This is a problem with some equality
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Options Used:
% 0.42/1.08
% 0.42/1.08 useres = 1
% 0.42/1.08 useparamod = 1
% 0.42/1.08 useeqrefl = 1
% 0.42/1.08 useeqfact = 1
% 0.42/1.08 usefactor = 1
% 0.42/1.08 usesimpsplitting = 0
% 0.42/1.08 usesimpdemod = 5
% 0.42/1.08 usesimpres = 3
% 0.42/1.08
% 0.42/1.08 resimpinuse = 1000
% 0.42/1.08 resimpclauses = 20000
% 0.42/1.08 substype = eqrewr
% 0.42/1.08 backwardsubs = 1
% 0.42/1.08 selectoldest = 5
% 0.42/1.08
% 0.42/1.08 litorderings [0] = split
% 0.42/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.42/1.08
% 0.42/1.08 termordering = kbo
% 0.42/1.08
% 0.42/1.08 litapriori = 0
% 0.42/1.08 termapriori = 1
% 0.42/1.08 litaposteriori = 0
% 0.42/1.08 termaposteriori = 0
% 0.42/1.08 demodaposteriori = 0
% 0.42/1.08 ordereqreflfact = 0
% 0.42/1.08
% 0.42/1.08 litselect = negord
% 0.42/1.08
% 0.42/1.08 maxweight = 15
% 0.42/1.08 maxdepth = 30000
% 0.42/1.08 maxlength = 115
% 0.42/1.08 maxnrvars = 195
% 0.42/1.08 excuselevel = 1
% 0.42/1.08 increasemaxweight = 1
% 0.42/1.08
% 0.42/1.08 maxselected = 10000000
% 0.42/1.08 maxnrclauses = 10000000
% 0.42/1.08
% 0.42/1.08 showgenerated = 0
% 0.42/1.08 showkept = 0
% 0.42/1.08 showselected = 0
% 0.42/1.08 showdeleted = 0
% 0.42/1.08 showresimp = 1
% 0.42/1.08 showstatus = 2000
% 0.42/1.08
% 0.42/1.08 prologoutput = 0
% 0.42/1.08 nrgoals = 5000000
% 0.42/1.08 totalproof = 1
% 0.42/1.08
% 0.42/1.08 Symbols occurring in the translation:
% 0.42/1.08
% 0.42/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.08 . [1, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.42/1.08 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.42/1.08 ! [4, 1] (w:0, o:26, a:1, s:1, b:0),
% 0.42/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.08 in [37, 2] (w:1, o:72, a:1, s:1, b:0),
% 0.42/1.08 ordinal [38, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.42/1.08 element [39, 2] (w:1, o:73, a:1, s:1, b:0),
% 0.42/1.08 epsilon_transitive [40, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.42/1.08 epsilon_connected [41, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.42/1.08 empty [42, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.42/1.08 finite [43, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.42/1.08 function [44, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.42/1.08 relation [45, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.42/1.08 natural [46, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.42/1.08 powerset [47, 1] (w:1, o:40, a:1, s:1, b:0),
% 0.42/1.08 one_to_one [48, 1] (w:1, o:39, a:1, s:1, b:0),
% 0.42/1.08 set_intersection2 [49, 2] (w:1, o:74, a:1, s:1, b:0),
% 0.42/1.08 empty_set [50, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.42/1.08 relation_empty_yielding [51, 1] (w:1, o:41, a:1, s:1, b:0),
% 0.42/1.08 subset [52, 2] (w:1, o:75, a:1, s:1, b:0),
% 0.42/1.08 alpha1 [54, 1] (w:1, o:42, a:1, s:1, b:1),
% 0.42/1.08 skol1 [55, 1] (w:1, o:43, a:1, s:1, b:1),
% 0.42/1.08 skol2 [56, 0] (w:1, o:18, a:1, s:1, b:1),
% 0.42/1.08 skol3 [57, 0] (w:1, o:21, a:1, s:1, b:1),
% 0.42/1.08 skol4 [58, 0] (w:1, o:22, a:1, s:1, b:1),
% 0.42/1.08 skol5 [59, 0] (w:1, o:23, a:1, s:1, b:1),
% 0.42/1.08 skol6 [60, 0] (w:1, o:24, a:1, s:1, b:1),
% 0.42/1.08 skol7 [61, 1] (w:1, o:44, a:1, s:1, b:1),
% 0.42/1.08 skol8 [62, 0] (w:1, o:25, a:1, s:1, b:1),
% 0.42/1.08 skol9 [63, 1] (w:1, o:45, a:1, s:1, b:1),
% 0.42/1.08 skol10 [64, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.42/1.08 skol11 [65, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.42/1.08 skol12 [66, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.42/1.08 skol13 [67, 1] (w:1, o:46, a:1, s:1, b:1),
% 0.42/1.08 skol14 [68, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.42/1.08 skol15 [69, 1] (w:1, o:47, a:1, s:1, b:1),
% 0.42/1.08 skol16 [70, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.42/1.08 skol17 [71, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.42/1.08 skol18 [72, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.42/1.08 skol19 [73, 0] (w:1, o:17, a:1, s:1, b:1),
% 0.42/1.08 skol20 [74, 0] (w:1, o:19, a:1, s:1, b:1),
% 0.42/1.08 skol21 [75, 0] (w:1, o:20, a:1, s:1, b:1).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Starting Search:
% 0.42/1.08
% 0.42/1.08 *** allocated 15000 integers for clauses
% 0.42/1.08 *** allocated 22500 integers for clauses
% 0.42/1.08
% 0.42/1.08 Bliksems!, er is een bewijs:
% 0.42/1.08 % SZS status Theorem
% 0.42/1.08 % SZS output start Refutation
% 0.42/1.08
% 0.42/1.08 (25) {G0,W6,D3,L2,V2,M2} I { ! finite( X ), finite( set_intersection2( X, Y
% 0.42/1.08 ) ) }.
% 0.42/1.08 (96) {G0,W2,D2,L1,V0,M1} I { finite( skol20 ) }.
% 0.42/1.08 (97) {G0,W4,D3,L1,V0,M1} I { ! finite( set_intersection2( skol20, skol21 )
% 0.42/1.08 ) }.
% 0.42/1.08 (239) {G1,W4,D3,L1,V1,M1} R(25,96) { finite( set_intersection2( skol20, X )
% 0.42/1.08 ) }.
% 0.42/1.08 (343) {G2,W0,D0,L0,V0,M0} S(97);r(239) { }.
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 % SZS output end Refutation
% 0.42/1.08 found a proof!
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Unprocessed initial clauses:
% 0.42/1.08
% 0.42/1.08 (345) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.42/1.08 (346) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! element( Y, X ),
% 0.42/1.08 epsilon_transitive( Y ) }.
% 0.42/1.08 (347) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! element( Y, X ),
% 0.42/1.08 epsilon_connected( Y ) }.
% 0.42/1.08 (348) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! element( Y, X ), ordinal( Y
% 0.42/1.08 ) }.
% 0.42/1.08 (349) {G0,W4,D2,L2,V1,M2} { ! empty( X ), finite( X ) }.
% 0.42/1.08 (350) {G0,W4,D2,L2,V1,M2} { ! empty( X ), function( X ) }.
% 0.42/1.08 (351) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.42/1.08 (352) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_connected( X ) }.
% 0.42/1.08 (353) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 0.42/1.08 (354) {G0,W6,D2,L3,V1,M3} { ! empty( X ), ! ordinal( X ), alpha1( X ) }.
% 0.42/1.08 (355) {G0,W6,D2,L3,V1,M3} { ! empty( X ), ! ordinal( X ), natural( X ) }.
% 0.42/1.08 (356) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), epsilon_transitive( X ) }.
% 0.42/1.08 (357) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), epsilon_connected( X ) }.
% 0.42/1.08 (358) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), ordinal( X ) }.
% 0.42/1.08 (359) {G0,W8,D2,L4,V1,M4} { ! epsilon_transitive( X ), ! epsilon_connected
% 0.42/1.08 ( X ), ! ordinal( X ), alpha1( X ) }.
% 0.42/1.08 (360) {G0,W8,D3,L3,V2,M3} { ! finite( X ), ! element( Y, powerset( X ) ),
% 0.42/1.08 finite( Y ) }.
% 0.42/1.08 (361) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.42/1.08 , relation( X ) }.
% 0.42/1.08 (362) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.42/1.08 , function( X ) }.
% 0.42/1.08 (363) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.42/1.08 , one_to_one( X ) }.
% 0.42/1.08 (364) {G0,W6,D2,L3,V1,M3} { ! epsilon_transitive( X ), ! epsilon_connected
% 0.42/1.08 ( X ), ordinal( X ) }.
% 0.42/1.08 (365) {G0,W4,D2,L2,V1,M2} { ! empty( X ), epsilon_transitive( X ) }.
% 0.42/1.08 (366) {G0,W4,D2,L2,V1,M2} { ! empty( X ), epsilon_connected( X ) }.
% 0.42/1.08 (367) {G0,W4,D2,L2,V1,M2} { ! empty( X ), ordinal( X ) }.
% 0.42/1.08 (368) {G0,W7,D3,L1,V2,M1} { set_intersection2( X, Y ) = set_intersection2
% 0.42/1.08 ( Y, X ) }.
% 0.42/1.08 (369) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.08 (370) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.08 (371) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.08 (372) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.08 (373) {G0,W4,D3,L1,V1,M1} { element( skol1( X ), X ) }.
% 0.42/1.08 (374) {G0,W6,D3,L2,V2,M2} { ! finite( X ), finite( set_intersection2( Y, X
% 0.42/1.08 ) ) }.
% 0.42/1.08 (375) {G0,W6,D3,L2,V2,M2} { ! finite( X ), finite( set_intersection2( X, Y
% 0.42/1.08 ) ) }.
% 0.42/1.08 (376) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.42/1.08 (377) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.42/1.08 (378) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( empty_set ) }.
% 0.42/1.08 (379) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! relation( Y ), relation(
% 0.42/1.08 set_intersection2( X, Y ) ) }.
% 0.42/1.08 (380) {G0,W3,D3,L1,V1,M1} { ! empty( powerset( X ) ) }.
% 0.42/1.08 (381) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.42/1.08 (382) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.42/1.08 (383) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( empty_set ) }.
% 0.42/1.08 (384) {G0,W2,D2,L1,V0,M1} { function( empty_set ) }.
% 0.42/1.08 (385) {G0,W2,D2,L1,V0,M1} { one_to_one( empty_set ) }.
% 0.42/1.08 (386) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.42/1.08 (387) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( empty_set ) }.
% 0.42/1.08 (388) {G0,W2,D2,L1,V0,M1} { epsilon_connected( empty_set ) }.
% 0.42/1.08 (389) {G0,W2,D2,L1,V0,M1} { ordinal( empty_set ) }.
% 0.42/1.08 (390) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.42/1.08 (391) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.42/1.08 (392) {G0,W5,D3,L1,V1,M1} { set_intersection2( X, X ) = X }.
% 0.42/1.08 (393) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.42/1.08 (394) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol2 ) }.
% 0.42/1.08 (395) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol2 ) }.
% 0.42/1.08 (396) {G0,W2,D2,L1,V0,M1} { ordinal( skol2 ) }.
% 0.42/1.08 (397) {G0,W2,D2,L1,V0,M1} { natural( skol2 ) }.
% 0.42/1.08 (398) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 0.42/1.08 (399) {G0,W2,D2,L1,V0,M1} { finite( skol3 ) }.
% 0.42/1.08 (400) {G0,W2,D2,L1,V0,M1} { relation( skol4 ) }.
% 0.42/1.08 (401) {G0,W2,D2,L1,V0,M1} { function( skol4 ) }.
% 0.42/1.08 (402) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol5 ) }.
% 0.42/1.08 (403) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol5 ) }.
% 0.42/1.08 (404) {G0,W2,D2,L1,V0,M1} { ordinal( skol5 ) }.
% 0.42/1.08 (405) {G0,W2,D2,L1,V0,M1} { empty( skol6 ) }.
% 0.42/1.08 (406) {G0,W2,D2,L1,V0,M1} { relation( skol6 ) }.
% 0.42/1.08 (407) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol7( Y ) ) }.
% 0.42/1.08 (408) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol7( X ), powerset( X )
% 0.42/1.08 ) }.
% 0.42/1.08 (409) {G0,W2,D2,L1,V0,M1} { empty( skol8 ) }.
% 0.42/1.08 (410) {G0,W3,D3,L1,V1,M1} { empty( skol9( Y ) ) }.
% 0.42/1.08 (411) {G0,W3,D3,L1,V1,M1} { relation( skol9( Y ) ) }.
% 0.42/1.08 (412) {G0,W3,D3,L1,V1,M1} { function( skol9( Y ) ) }.
% 0.42/1.08 (413) {G0,W3,D3,L1,V1,M1} { one_to_one( skol9( Y ) ) }.
% 0.42/1.08 (414) {G0,W3,D3,L1,V1,M1} { epsilon_transitive( skol9( Y ) ) }.
% 0.42/1.08 (415) {G0,W3,D3,L1,V1,M1} { epsilon_connected( skol9( Y ) ) }.
% 0.42/1.08 (416) {G0,W3,D3,L1,V1,M1} { ordinal( skol9( Y ) ) }.
% 0.42/1.08 (417) {G0,W3,D3,L1,V1,M1} { natural( skol9( Y ) ) }.
% 0.42/1.08 (418) {G0,W3,D3,L1,V1,M1} { finite( skol9( Y ) ) }.
% 0.42/1.08 (419) {G0,W5,D3,L1,V1,M1} { element( skol9( X ), powerset( X ) ) }.
% 0.42/1.08 (420) {G0,W2,D2,L1,V0,M1} { relation( skol10 ) }.
% 0.42/1.08 (421) {G0,W2,D2,L1,V0,M1} { empty( skol10 ) }.
% 0.42/1.08 (422) {G0,W2,D2,L1,V0,M1} { function( skol10 ) }.
% 0.42/1.08 (423) {G0,W2,D2,L1,V0,M1} { relation( skol11 ) }.
% 0.42/1.08 (424) {G0,W2,D2,L1,V0,M1} { function( skol11 ) }.
% 0.42/1.08 (425) {G0,W2,D2,L1,V0,M1} { one_to_one( skol11 ) }.
% 0.42/1.08 (426) {G0,W2,D2,L1,V0,M1} { empty( skol11 ) }.
% 0.42/1.08 (427) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol11 ) }.
% 0.42/1.08 (428) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol11 ) }.
% 0.42/1.08 (429) {G0,W2,D2,L1,V0,M1} { ordinal( skol11 ) }.
% 0.42/1.08 (430) {G0,W2,D2,L1,V0,M1} { ! empty( skol12 ) }.
% 0.42/1.08 (431) {G0,W2,D2,L1,V0,M1} { relation( skol12 ) }.
% 0.42/1.08 (432) {G0,W3,D3,L1,V1,M1} { empty( skol13( Y ) ) }.
% 0.42/1.08 (433) {G0,W5,D3,L1,V1,M1} { element( skol13( X ), powerset( X ) ) }.
% 0.42/1.08 (434) {G0,W2,D2,L1,V0,M1} { ! empty( skol14 ) }.
% 0.42/1.08 (435) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol15( Y ) ) }.
% 0.42/1.08 (436) {G0,W5,D3,L2,V2,M2} { empty( X ), finite( skol15( Y ) ) }.
% 0.42/1.08 (437) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol15( X ), powerset( X
% 0.42/1.08 ) ) }.
% 0.42/1.08 (438) {G0,W2,D2,L1,V0,M1} { relation( skol16 ) }.
% 0.42/1.08 (439) {G0,W2,D2,L1,V0,M1} { function( skol16 ) }.
% 0.42/1.08 (440) {G0,W2,D2,L1,V0,M1} { one_to_one( skol16 ) }.
% 0.42/1.08 (441) {G0,W2,D2,L1,V0,M1} { ! empty( skol17 ) }.
% 0.42/1.08 (442) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol17 ) }.
% 0.42/1.08 (443) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol17 ) }.
% 0.42/1.08 (444) {G0,W2,D2,L1,V0,M1} { ordinal( skol17 ) }.
% 0.42/1.08 (445) {G0,W2,D2,L1,V0,M1} { relation( skol18 ) }.
% 0.42/1.08 (446) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol18 ) }.
% 0.42/1.08 (447) {G0,W2,D2,L1,V0,M1} { relation( skol19 ) }.
% 0.42/1.08 (448) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol19 ) }.
% 0.42/1.08 (449) {G0,W2,D2,L1,V0,M1} { function( skol19 ) }.
% 0.42/1.08 (450) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.42/1.08 (451) {G0,W7,D2,L3,V2,M3} { ! subset( X, Y ), ! finite( Y ), finite( X )
% 0.42/1.08 }.
% 0.42/1.08 (452) {G0,W2,D2,L1,V0,M1} { finite( skol20 ) }.
% 0.42/1.08 (453) {G0,W4,D3,L1,V0,M1} { ! finite( set_intersection2( skol20, skol21 )
% 0.42/1.08 ) }.
% 0.42/1.08 (454) {G0,W5,D3,L1,V2,M1} { subset( set_intersection2( X, Y ), X ) }.
% 0.42/1.08 (455) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.42/1.08 (456) {G0,W5,D3,L1,V1,M1} { set_intersection2( X, empty_set ) = empty_set
% 0.42/1.08 }.
% 0.42/1.08 (457) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.42/1.08 (458) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.42/1.08 }.
% 0.42/1.08 (459) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.42/1.08 }.
% 0.42/1.08 (460) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) ),
% 0.42/1.08 element( X, Y ) }.
% 0.42/1.08 (461) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) ), !
% 0.42/1.08 empty( Z ) }.
% 0.42/1.08 (462) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.42/1.08 (463) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.42/1.08 (464) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Total Proof:
% 0.42/1.08
% 0.42/1.08 subsumption: (25) {G0,W6,D3,L2,V2,M2} I { ! finite( X ), finite(
% 0.42/1.08 set_intersection2( X, Y ) ) }.
% 0.42/1.08 parent0: (375) {G0,W6,D3,L2,V2,M2} { ! finite( X ), finite(
% 0.42/1.08 set_intersection2( X, Y ) ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 X := X
% 0.42/1.08 Y := Y
% 0.42/1.08 end
% 0.42/1.08 permutation0:
% 0.42/1.08 0 ==> 0
% 0.42/1.08 1 ==> 1
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 subsumption: (96) {G0,W2,D2,L1,V0,M1} I { finite( skol20 ) }.
% 0.42/1.08 parent0: (452) {G0,W2,D2,L1,V0,M1} { finite( skol20 ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 end
% 0.42/1.08 permutation0:
% 0.42/1.08 0 ==> 0
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 subsumption: (97) {G0,W4,D3,L1,V0,M1} I { ! finite( set_intersection2(
% 0.42/1.08 skol20, skol21 ) ) }.
% 0.42/1.08 parent0: (453) {G0,W4,D3,L1,V0,M1} { ! finite( set_intersection2( skol20,
% 0.42/1.08 skol21 ) ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 end
% 0.42/1.08 permutation0:
% 0.42/1.08 0 ==> 0
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 resolution: (472) {G1,W4,D3,L1,V1,M1} { finite( set_intersection2( skol20
% 0.42/1.08 , X ) ) }.
% 0.42/1.08 parent0[0]: (25) {G0,W6,D3,L2,V2,M2} I { ! finite( X ), finite(
% 0.42/1.08 set_intersection2( X, Y ) ) }.
% 0.42/1.08 parent1[0]: (96) {G0,W2,D2,L1,V0,M1} I { finite( skol20 ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 X := skol20
% 0.42/1.08 Y := X
% 0.42/1.08 end
% 0.42/1.08 substitution1:
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 subsumption: (239) {G1,W4,D3,L1,V1,M1} R(25,96) { finite( set_intersection2
% 0.42/1.08 ( skol20, X ) ) }.
% 0.42/1.08 parent0: (472) {G1,W4,D3,L1,V1,M1} { finite( set_intersection2( skol20, X
% 0.42/1.08 ) ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 X := X
% 0.42/1.08 end
% 0.42/1.08 permutation0:
% 0.42/1.08 0 ==> 0
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 resolution: (473) {G1,W0,D0,L0,V0,M0} { }.
% 0.42/1.08 parent0[0]: (97) {G0,W4,D3,L1,V0,M1} I { ! finite( set_intersection2(
% 0.42/1.08 skol20, skol21 ) ) }.
% 0.42/1.08 parent1[0]: (239) {G1,W4,D3,L1,V1,M1} R(25,96) { finite( set_intersection2
% 0.73/1.08 ( skol20, X ) ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 end
% 0.73/1.08 substitution1:
% 0.73/1.08 X := skol21
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 subsumption: (343) {G2,W0,D0,L0,V0,M0} S(97);r(239) { }.
% 0.73/1.08 parent0: (473) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.08 substitution0:
% 0.73/1.08 end
% 0.73/1.08 permutation0:
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 Proof check complete!
% 0.73/1.08
% 0.73/1.08 Memory use:
% 0.73/1.08
% 0.73/1.08 space for terms: 3362
% 0.73/1.08 space for clauses: 16269
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 clauses generated: 578
% 0.73/1.08 clauses kept: 344
% 0.73/1.08 clauses selected: 151
% 0.73/1.08 clauses deleted: 8
% 0.73/1.08 clauses inuse deleted: 0
% 0.73/1.08
% 0.73/1.08 subsentry: 354
% 0.73/1.08 literals s-matched: 308
% 0.73/1.08 literals matched: 308
% 0.73/1.08 full subsumption: 26
% 0.73/1.08
% 0.73/1.08 checksum: -609549284
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 Bliksem ended
%------------------------------------------------------------------------------