TSTP Solution File: SEU294+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU294+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:12 EDT 2022
% Result : Theorem 0.70s 1.10s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU294+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n027.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 : Mon Jun 20 04:47:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.70/1.10 *** allocated 10000 integers for termspace/termends
% 0.70/1.10 *** allocated 10000 integers for clauses
% 0.70/1.10 *** allocated 10000 integers for justifications
% 0.70/1.10 Bliksem 1.12
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Automatic Strategy Selection
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Clauses:
% 0.70/1.10
% 0.70/1.10 { ! in( X, Y ), ! in( Y, X ) }.
% 0.70/1.10 { ! ordinal( X ), ! element( Y, X ), epsilon_transitive( Y ) }.
% 0.70/1.10 { ! ordinal( X ), ! element( Y, X ), epsilon_connected( Y ) }.
% 0.70/1.10 { ! ordinal( X ), ! element( Y, X ), ordinal( Y ) }.
% 0.70/1.10 { ! empty( X ), finite( X ) }.
% 0.70/1.10 { ! empty( X ), function( X ) }.
% 0.70/1.10 { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.70/1.10 { ! ordinal( X ), epsilon_connected( X ) }.
% 0.70/1.10 { ! empty( X ), relation( X ) }.
% 0.70/1.10 { ! empty( X ), ! ordinal( X ), alpha1( X ) }.
% 0.70/1.10 { ! empty( X ), ! ordinal( X ), natural( X ) }.
% 0.70/1.10 { ! alpha1( X ), epsilon_transitive( X ) }.
% 0.70/1.10 { ! alpha1( X ), epsilon_connected( X ) }.
% 0.70/1.10 { ! alpha1( X ), ordinal( X ) }.
% 0.70/1.10 { ! epsilon_transitive( X ), ! epsilon_connected( X ), ! ordinal( X ),
% 0.70/1.10 alpha1( X ) }.
% 0.70/1.10 { ! finite( X ), ! element( Y, powerset( X ) ), finite( Y ) }.
% 0.70/1.10 { ! relation( X ), ! empty( X ), ! function( X ), relation( X ) }.
% 0.70/1.10 { ! relation( X ), ! empty( X ), ! function( X ), function( X ) }.
% 0.70/1.10 { ! relation( X ), ! empty( X ), ! function( X ), one_to_one( X ) }.
% 0.70/1.10 { ! epsilon_transitive( X ), ! epsilon_connected( X ), ordinal( X ) }.
% 0.70/1.10 { ! empty( X ), epsilon_transitive( X ) }.
% 0.70/1.10 { ! empty( X ), epsilon_connected( X ) }.
% 0.70/1.10 { ! empty( X ), ordinal( X ) }.
% 0.70/1.10 { && }.
% 0.70/1.10 { && }.
% 0.70/1.10 { && }.
% 0.70/1.10 { element( skol1( X ), X ) }.
% 0.70/1.10 { empty( empty_set ) }.
% 0.70/1.10 { relation( empty_set ) }.
% 0.70/1.10 { relation_empty_yielding( empty_set ) }.
% 0.70/1.10 { ! empty( powerset( X ) ) }.
% 0.70/1.10 { empty( empty_set ) }.
% 0.70/1.10 { relation( empty_set ) }.
% 0.70/1.10 { relation_empty_yielding( empty_set ) }.
% 0.70/1.10 { function( empty_set ) }.
% 0.70/1.10 { one_to_one( empty_set ) }.
% 0.70/1.10 { empty( empty_set ) }.
% 0.70/1.10 { epsilon_transitive( empty_set ) }.
% 0.70/1.10 { epsilon_connected( empty_set ) }.
% 0.70/1.10 { ordinal( empty_set ) }.
% 0.70/1.10 { empty( empty_set ) }.
% 0.70/1.10 { relation( empty_set ) }.
% 0.70/1.10 { ! empty( skol2 ) }.
% 0.70/1.10 { epsilon_transitive( skol2 ) }.
% 0.70/1.10 { epsilon_connected( skol2 ) }.
% 0.70/1.10 { ordinal( skol2 ) }.
% 0.70/1.10 { natural( skol2 ) }.
% 0.70/1.10 { ! empty( skol3 ) }.
% 0.70/1.10 { finite( skol3 ) }.
% 0.70/1.10 { relation( skol4 ) }.
% 0.70/1.10 { function( skol4 ) }.
% 0.70/1.10 { epsilon_transitive( skol5 ) }.
% 0.70/1.10 { epsilon_connected( skol5 ) }.
% 0.70/1.10 { ordinal( skol5 ) }.
% 0.70/1.10 { empty( skol6 ) }.
% 0.70/1.10 { relation( skol6 ) }.
% 0.70/1.10 { empty( X ), ! empty( skol7( Y ) ) }.
% 0.70/1.10 { empty( X ), element( skol7( X ), powerset( X ) ) }.
% 0.70/1.10 { empty( skol8 ) }.
% 0.70/1.10 { empty( skol9( Y ) ) }.
% 0.70/1.10 { relation( skol9( Y ) ) }.
% 0.70/1.10 { function( skol9( Y ) ) }.
% 0.70/1.10 { one_to_one( skol9( Y ) ) }.
% 0.70/1.10 { epsilon_transitive( skol9( Y ) ) }.
% 0.70/1.10 { epsilon_connected( skol9( Y ) ) }.
% 0.70/1.10 { ordinal( skol9( Y ) ) }.
% 0.70/1.10 { natural( skol9( Y ) ) }.
% 0.70/1.10 { finite( skol9( Y ) ) }.
% 0.70/1.10 { element( skol9( X ), powerset( X ) ) }.
% 0.70/1.10 { relation( skol10 ) }.
% 0.70/1.10 { empty( skol10 ) }.
% 0.70/1.10 { function( skol10 ) }.
% 0.70/1.10 { relation( skol11 ) }.
% 0.70/1.10 { function( skol11 ) }.
% 0.70/1.10 { one_to_one( skol11 ) }.
% 0.70/1.10 { empty( skol11 ) }.
% 0.70/1.10 { epsilon_transitive( skol11 ) }.
% 0.70/1.10 { epsilon_connected( skol11 ) }.
% 0.70/1.10 { ordinal( skol11 ) }.
% 0.70/1.10 { ! empty( skol12 ) }.
% 0.70/1.10 { relation( skol12 ) }.
% 0.70/1.10 { empty( skol13( Y ) ) }.
% 0.70/1.10 { element( skol13( X ), powerset( X ) ) }.
% 0.70/1.10 { ! empty( skol14 ) }.
% 0.70/1.10 { empty( X ), ! empty( skol15( Y ) ) }.
% 0.70/1.10 { empty( X ), finite( skol15( Y ) ) }.
% 0.70/1.10 { empty( X ), element( skol15( X ), powerset( X ) ) }.
% 0.70/1.10 { relation( skol16 ) }.
% 0.70/1.10 { function( skol16 ) }.
% 0.70/1.10 { one_to_one( skol16 ) }.
% 0.70/1.10 { ! empty( skol17 ) }.
% 0.70/1.10 { epsilon_transitive( skol17 ) }.
% 0.70/1.10 { epsilon_connected( skol17 ) }.
% 0.70/1.10 { ordinal( skol17 ) }.
% 0.70/1.10 { relation( skol18 ) }.
% 0.70/1.10 { relation_empty_yielding( skol18 ) }.
% 0.70/1.10 { relation( skol19 ) }.
% 0.70/1.10 { relation_empty_yielding( skol19 ) }.
% 0.70/1.10 { function( skol19 ) }.
% 0.70/1.10 { subset( X, X ) }.
% 0.70/1.10 { subset( skol20, skol21 ) }.
% 0.70/1.10 { finite( skol21 ) }.
% 0.70/1.10 { ! finite( skol20 ) }.
% 0.70/1.10 { ! in( X, Y ), element( X, Y ) }.
% 0.70/1.10 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.70/1.10 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 0.70/1.10 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 0.70/1.10 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 0.70/1.10 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 0.70/1.10 { ! empty( X ), X = empty_set }.
% 0.70/1.10 { ! in( X, Y ), ! empty( Y ) }.
% 0.70/1.10 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.70/1.10
% 0.70/1.10 percentage equality = 0.013158, percentage horn = 0.960784
% 0.70/1.10 This is a problem with some equality
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Options Used:
% 0.70/1.10
% 0.70/1.10 useres = 1
% 0.70/1.10 useparamod = 1
% 0.70/1.10 useeqrefl = 1
% 0.70/1.10 useeqfact = 1
% 0.70/1.10 usefactor = 1
% 0.70/1.10 usesimpsplitting = 0
% 0.70/1.10 usesimpdemod = 5
% 0.70/1.10 usesimpres = 3
% 0.70/1.10
% 0.70/1.10 resimpinuse = 1000
% 0.70/1.10 resimpclauses = 20000
% 0.70/1.10 substype = eqrewr
% 0.70/1.10 backwardsubs = 1
% 0.70/1.10 selectoldest = 5
% 0.70/1.10
% 0.70/1.10 litorderings [0] = split
% 0.70/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.10
% 0.70/1.10 termordering = kbo
% 0.70/1.10
% 0.70/1.10 litapriori = 0
% 0.70/1.10 termapriori = 1
% 0.70/1.10 litaposteriori = 0
% 0.70/1.10 termaposteriori = 0
% 0.70/1.10 demodaposteriori = 0
% 0.70/1.10 ordereqreflfact = 0
% 0.70/1.10
% 0.70/1.10 litselect = negord
% 0.70/1.10
% 0.70/1.10 maxweight = 15
% 0.70/1.10 maxdepth = 30000
% 0.70/1.10 maxlength = 115
% 0.70/1.10 maxnrvars = 195
% 0.70/1.10 excuselevel = 1
% 0.70/1.10 increasemaxweight = 1
% 0.70/1.10
% 0.70/1.10 maxselected = 10000000
% 0.70/1.10 maxnrclauses = 10000000
% 0.70/1.10
% 0.70/1.10 showgenerated = 0
% 0.70/1.10 showkept = 0
% 0.70/1.10 showselected = 0
% 0.70/1.10 showdeleted = 0
% 0.70/1.10 showresimp = 1
% 0.70/1.10 showstatus = 2000
% 0.70/1.10
% 0.70/1.10 prologoutput = 0
% 0.70/1.10 nrgoals = 5000000
% 0.70/1.10 totalproof = 1
% 0.70/1.10
% 0.70/1.10 Symbols occurring in the translation:
% 0.70/1.10
% 0.70/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.10 . [1, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.70/1.10 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.70/1.10 ! [4, 1] (w:0, o:26, a:1, s:1, b:0),
% 0.70/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 in [37, 2] (w:1, o:72, a:1, s:1, b:0),
% 0.70/1.10 ordinal [38, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.70/1.10 element [39, 2] (w:1, o:73, a:1, s:1, b:0),
% 0.70/1.10 epsilon_transitive [40, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.70/1.10 epsilon_connected [41, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.70/1.10 empty [42, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.70/1.10 finite [43, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.70/1.10 function [44, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.70/1.10 relation [45, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.70/1.10 natural [46, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.70/1.10 powerset [47, 1] (w:1, o:40, a:1, s:1, b:0),
% 0.70/1.10 one_to_one [48, 1] (w:1, o:39, a:1, s:1, b:0),
% 0.70/1.10 empty_set [49, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.70/1.10 relation_empty_yielding [50, 1] (w:1, o:41, a:1, s:1, b:0),
% 0.70/1.10 subset [51, 2] (w:1, o:74, a:1, s:1, b:0),
% 0.70/1.10 alpha1 [53, 1] (w:1, o:42, a:1, s:1, b:1),
% 0.70/1.10 skol1 [54, 1] (w:1, o:43, a:1, s:1, b:1),
% 0.70/1.10 skol2 [55, 0] (w:1, o:18, a:1, s:1, b:1),
% 0.70/1.10 skol3 [56, 0] (w:1, o:21, a:1, s:1, b:1),
% 0.70/1.10 skol4 [57, 0] (w:1, o:22, a:1, s:1, b:1),
% 0.70/1.10 skol5 [58, 0] (w:1, o:23, a:1, s:1, b:1),
% 0.70/1.10 skol6 [59, 0] (w:1, o:24, a:1, s:1, b:1),
% 0.70/1.10 skol7 [60, 1] (w:1, o:44, a:1, s:1, b:1),
% 0.70/1.10 skol8 [61, 0] (w:1, o:25, a:1, s:1, b:1),
% 0.70/1.10 skol9 [62, 1] (w:1, o:45, a:1, s:1, b:1),
% 0.70/1.10 skol10 [63, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.70/1.10 skol11 [64, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.70/1.10 skol12 [65, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.70/1.10 skol13 [66, 1] (w:1, o:46, a:1, s:1, b:1),
% 0.70/1.10 skol14 [67, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.70/1.10 skol15 [68, 1] (w:1, o:47, a:1, s:1, b:1),
% 0.70/1.10 skol16 [69, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.70/1.10 skol17 [70, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.70/1.10 skol18 [71, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.70/1.10 skol19 [72, 0] (w:1, o:17, a:1, s:1, b:1),
% 0.70/1.10 skol20 [73, 0] (w:1, o:19, a:1, s:1, b:1),
% 0.70/1.10 skol21 [74, 0] (w:1, o:20, a:1, s:1, b:1).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Starting Search:
% 0.70/1.10
% 0.70/1.10 *** allocated 15000 integers for clauses
% 0.70/1.10 *** allocated 22500 integers for clauses
% 0.70/1.10
% 0.70/1.10 Bliksems!, er is een bewijs:
% 0.70/1.10 % SZS status Theorem
% 0.70/1.10 % SZS output start Refutation
% 0.70/1.10
% 0.70/1.10 (15) {G0,W8,D3,L3,V2,M3} I { ! finite( X ), ! element( Y, powerset( X ) ),
% 0.70/1.10 finite( Y ) }.
% 0.70/1.10 (90) {G0,W3,D2,L1,V0,M1} I { subset( skol20, skol21 ) }.
% 0.70/1.10 (91) {G0,W2,D2,L1,V0,M1} I { finite( skol21 ) }.
% 0.70/1.10 (92) {G0,W2,D2,L1,V0,M1} I { ! finite( skol20 ) }.
% 0.70/1.10 (96) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.70/1.10 }.
% 0.70/1.10 (336) {G1,W4,D3,L1,V0,M1} R(96,90) { element( skol20, powerset( skol21 ) )
% 0.70/1.10 }.
% 0.70/1.10 (370) {G2,W2,D2,L1,V0,M1} R(336,15);r(91) { finite( skol20 ) }.
% 0.70/1.10 (392) {G3,W0,D0,L0,V0,M0} S(370);r(92) { }.
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 % SZS output end Refutation
% 0.70/1.10 found a proof!
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Unprocessed initial clauses:
% 0.70/1.10
% 0.70/1.10 (394) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.70/1.10 (395) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! element( Y, X ),
% 0.70/1.10 epsilon_transitive( Y ) }.
% 0.70/1.10 (396) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! element( Y, X ),
% 0.70/1.10 epsilon_connected( Y ) }.
% 0.70/1.10 (397) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! element( Y, X ), ordinal( Y
% 0.70/1.10 ) }.
% 0.70/1.10 (398) {G0,W4,D2,L2,V1,M2} { ! empty( X ), finite( X ) }.
% 0.70/1.10 (399) {G0,W4,D2,L2,V1,M2} { ! empty( X ), function( X ) }.
% 0.70/1.10 (400) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.70/1.10 (401) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_connected( X ) }.
% 0.70/1.10 (402) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 0.70/1.10 (403) {G0,W6,D2,L3,V1,M3} { ! empty( X ), ! ordinal( X ), alpha1( X ) }.
% 0.70/1.10 (404) {G0,W6,D2,L3,V1,M3} { ! empty( X ), ! ordinal( X ), natural( X ) }.
% 0.70/1.10 (405) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), epsilon_transitive( X ) }.
% 0.70/1.10 (406) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), epsilon_connected( X ) }.
% 0.70/1.10 (407) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), ordinal( X ) }.
% 0.70/1.10 (408) {G0,W8,D2,L4,V1,M4} { ! epsilon_transitive( X ), ! epsilon_connected
% 0.70/1.10 ( X ), ! ordinal( X ), alpha1( X ) }.
% 0.70/1.10 (409) {G0,W8,D3,L3,V2,M3} { ! finite( X ), ! element( Y, powerset( X ) ),
% 0.70/1.10 finite( Y ) }.
% 0.70/1.10 (410) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.70/1.10 , relation( X ) }.
% 0.70/1.10 (411) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.70/1.10 , function( X ) }.
% 0.70/1.10 (412) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.70/1.10 , one_to_one( X ) }.
% 0.70/1.10 (413) {G0,W6,D2,L3,V1,M3} { ! epsilon_transitive( X ), ! epsilon_connected
% 0.70/1.10 ( X ), ordinal( X ) }.
% 0.70/1.10 (414) {G0,W4,D2,L2,V1,M2} { ! empty( X ), epsilon_transitive( X ) }.
% 0.70/1.10 (415) {G0,W4,D2,L2,V1,M2} { ! empty( X ), epsilon_connected( X ) }.
% 0.70/1.10 (416) {G0,W4,D2,L2,V1,M2} { ! empty( X ), ordinal( X ) }.
% 0.70/1.10 (417) {G0,W1,D1,L1,V0,M1} { && }.
% 0.70/1.10 (418) {G0,W1,D1,L1,V0,M1} { && }.
% 0.70/1.10 (419) {G0,W1,D1,L1,V0,M1} { && }.
% 0.70/1.10 (420) {G0,W4,D3,L1,V1,M1} { element( skol1( X ), X ) }.
% 0.70/1.10 (421) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.70/1.10 (422) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.70/1.10 (423) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( empty_set ) }.
% 0.70/1.10 (424) {G0,W3,D3,L1,V1,M1} { ! empty( powerset( X ) ) }.
% 0.70/1.10 (425) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.70/1.10 (426) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.70/1.10 (427) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( empty_set ) }.
% 0.70/1.10 (428) {G0,W2,D2,L1,V0,M1} { function( empty_set ) }.
% 0.70/1.10 (429) {G0,W2,D2,L1,V0,M1} { one_to_one( empty_set ) }.
% 0.70/1.10 (430) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.70/1.10 (431) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( empty_set ) }.
% 0.70/1.10 (432) {G0,W2,D2,L1,V0,M1} { epsilon_connected( empty_set ) }.
% 0.70/1.10 (433) {G0,W2,D2,L1,V0,M1} { ordinal( empty_set ) }.
% 0.70/1.10 (434) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.70/1.10 (435) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.70/1.10 (436) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.70/1.10 (437) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol2 ) }.
% 0.70/1.10 (438) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol2 ) }.
% 0.70/1.10 (439) {G0,W2,D2,L1,V0,M1} { ordinal( skol2 ) }.
% 0.70/1.10 (440) {G0,W2,D2,L1,V0,M1} { natural( skol2 ) }.
% 0.70/1.10 (441) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 0.70/1.10 (442) {G0,W2,D2,L1,V0,M1} { finite( skol3 ) }.
% 0.70/1.10 (443) {G0,W2,D2,L1,V0,M1} { relation( skol4 ) }.
% 0.70/1.10 (444) {G0,W2,D2,L1,V0,M1} { function( skol4 ) }.
% 0.70/1.10 (445) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol5 ) }.
% 0.70/1.10 (446) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol5 ) }.
% 0.70/1.10 (447) {G0,W2,D2,L1,V0,M1} { ordinal( skol5 ) }.
% 0.70/1.10 (448) {G0,W2,D2,L1,V0,M1} { empty( skol6 ) }.
% 0.70/1.10 (449) {G0,W2,D2,L1,V0,M1} { relation( skol6 ) }.
% 0.70/1.10 (450) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol7( Y ) ) }.
% 0.70/1.10 (451) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol7( X ), powerset( X )
% 0.70/1.10 ) }.
% 0.70/1.10 (452) {G0,W2,D2,L1,V0,M1} { empty( skol8 ) }.
% 0.70/1.10 (453) {G0,W3,D3,L1,V1,M1} { empty( skol9( Y ) ) }.
% 0.70/1.10 (454) {G0,W3,D3,L1,V1,M1} { relation( skol9( Y ) ) }.
% 0.70/1.10 (455) {G0,W3,D3,L1,V1,M1} { function( skol9( Y ) ) }.
% 0.70/1.10 (456) {G0,W3,D3,L1,V1,M1} { one_to_one( skol9( Y ) ) }.
% 0.70/1.10 (457) {G0,W3,D3,L1,V1,M1} { epsilon_transitive( skol9( Y ) ) }.
% 0.70/1.10 (458) {G0,W3,D3,L1,V1,M1} { epsilon_connected( skol9( Y ) ) }.
% 0.70/1.10 (459) {G0,W3,D3,L1,V1,M1} { ordinal( skol9( Y ) ) }.
% 0.70/1.10 (460) {G0,W3,D3,L1,V1,M1} { natural( skol9( Y ) ) }.
% 0.70/1.10 (461) {G0,W3,D3,L1,V1,M1} { finite( skol9( Y ) ) }.
% 0.70/1.10 (462) {G0,W5,D3,L1,V1,M1} { element( skol9( X ), powerset( X ) ) }.
% 0.70/1.10 (463) {G0,W2,D2,L1,V0,M1} { relation( skol10 ) }.
% 0.70/1.10 (464) {G0,W2,D2,L1,V0,M1} { empty( skol10 ) }.
% 0.70/1.10 (465) {G0,W2,D2,L1,V0,M1} { function( skol10 ) }.
% 0.70/1.10 (466) {G0,W2,D2,L1,V0,M1} { relation( skol11 ) }.
% 0.70/1.10 (467) {G0,W2,D2,L1,V0,M1} { function( skol11 ) }.
% 0.70/1.10 (468) {G0,W2,D2,L1,V0,M1} { one_to_one( skol11 ) }.
% 0.70/1.10 (469) {G0,W2,D2,L1,V0,M1} { empty( skol11 ) }.
% 0.70/1.10 (470) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol11 ) }.
% 0.70/1.10 (471) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol11 ) }.
% 0.70/1.10 (472) {G0,W2,D2,L1,V0,M1} { ordinal( skol11 ) }.
% 0.70/1.10 (473) {G0,W2,D2,L1,V0,M1} { ! empty( skol12 ) }.
% 0.70/1.10 (474) {G0,W2,D2,L1,V0,M1} { relation( skol12 ) }.
% 0.70/1.10 (475) {G0,W3,D3,L1,V1,M1} { empty( skol13( Y ) ) }.
% 0.70/1.10 (476) {G0,W5,D3,L1,V1,M1} { element( skol13( X ), powerset( X ) ) }.
% 0.70/1.10 (477) {G0,W2,D2,L1,V0,M1} { ! empty( skol14 ) }.
% 0.70/1.10 (478) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol15( Y ) ) }.
% 0.70/1.10 (479) {G0,W5,D3,L2,V2,M2} { empty( X ), finite( skol15( Y ) ) }.
% 0.70/1.10 (480) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol15( X ), powerset( X
% 0.70/1.10 ) ) }.
% 0.70/1.10 (481) {G0,W2,D2,L1,V0,M1} { relation( skol16 ) }.
% 0.70/1.10 (482) {G0,W2,D2,L1,V0,M1} { function( skol16 ) }.
% 0.70/1.10 (483) {G0,W2,D2,L1,V0,M1} { one_to_one( skol16 ) }.
% 0.70/1.10 (484) {G0,W2,D2,L1,V0,M1} { ! empty( skol17 ) }.
% 0.70/1.10 (485) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol17 ) }.
% 0.70/1.10 (486) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol17 ) }.
% 0.70/1.10 (487) {G0,W2,D2,L1,V0,M1} { ordinal( skol17 ) }.
% 0.70/1.10 (488) {G0,W2,D2,L1,V0,M1} { relation( skol18 ) }.
% 0.70/1.10 (489) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol18 ) }.
% 0.70/1.10 (490) {G0,W2,D2,L1,V0,M1} { relation( skol19 ) }.
% 0.70/1.10 (491) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol19 ) }.
% 0.70/1.10 (492) {G0,W2,D2,L1,V0,M1} { function( skol19 ) }.
% 0.70/1.10 (493) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.70/1.10 (494) {G0,W3,D2,L1,V0,M1} { subset( skol20, skol21 ) }.
% 0.70/1.10 (495) {G0,W2,D2,L1,V0,M1} { finite( skol21 ) }.
% 0.70/1.10 (496) {G0,W2,D2,L1,V0,M1} { ! finite( skol20 ) }.
% 0.70/1.10 (497) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.70/1.10 (498) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.70/1.10 (499) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.70/1.10 }.
% 0.70/1.10 (500) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.70/1.10 }.
% 0.70/1.10 (501) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) ),
% 0.70/1.10 element( X, Y ) }.
% 0.70/1.10 (502) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) ), !
% 0.70/1.10 empty( Z ) }.
% 0.70/1.10 (503) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.70/1.10 (504) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.70/1.10 (505) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Total Proof:
% 0.70/1.10
% 0.70/1.10 subsumption: (15) {G0,W8,D3,L3,V2,M3} I { ! finite( X ), ! element( Y,
% 0.70/1.10 powerset( X ) ), finite( Y ) }.
% 0.70/1.10 parent0: (409) {G0,W8,D3,L3,V2,M3} { ! finite( X ), ! element( Y, powerset
% 0.70/1.10 ( X ) ), finite( Y ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 1 ==> 1
% 0.70/1.10 2 ==> 2
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (90) {G0,W3,D2,L1,V0,M1} I { subset( skol20, skol21 ) }.
% 0.70/1.10 parent0: (494) {G0,W3,D2,L1,V0,M1} { subset( skol20, skol21 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (91) {G0,W2,D2,L1,V0,M1} I { finite( skol21 ) }.
% 0.70/1.10 parent0: (495) {G0,W2,D2,L1,V0,M1} { finite( skol21 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (92) {G0,W2,D2,L1,V0,M1} I { ! finite( skol20 ) }.
% 0.70/1.10 parent0: (496) {G0,W2,D2,L1,V0,M1} { ! finite( skol20 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (96) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X,
% 0.70/1.10 powerset( Y ) ) }.
% 0.70/1.10 parent0: (500) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X,
% 0.70/1.10 powerset( Y ) ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 1 ==> 1
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (511) {G1,W4,D3,L1,V0,M1} { element( skol20, powerset( skol21
% 0.70/1.10 ) ) }.
% 0.70/1.10 parent0[0]: (96) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X,
% 0.70/1.10 powerset( Y ) ) }.
% 0.70/1.10 parent1[0]: (90) {G0,W3,D2,L1,V0,M1} I { subset( skol20, skol21 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := skol20
% 0.70/1.10 Y := skol21
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (336) {G1,W4,D3,L1,V0,M1} R(96,90) { element( skol20, powerset
% 0.70/1.10 ( skol21 ) ) }.
% 0.70/1.10 parent0: (511) {G1,W4,D3,L1,V0,M1} { element( skol20, powerset( skol21 ) )
% 0.70/1.10 }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (512) {G1,W4,D2,L2,V0,M2} { ! finite( skol21 ), finite( skol20
% 0.70/1.10 ) }.
% 0.70/1.10 parent0[1]: (15) {G0,W8,D3,L3,V2,M3} I { ! finite( X ), ! element( Y,
% 0.70/1.10 powerset( X ) ), finite( Y ) }.
% 0.70/1.10 parent1[0]: (336) {G1,W4,D3,L1,V0,M1} R(96,90) { element( skol20, powerset
% 0.70/1.10 ( skol21 ) ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := skol21
% 0.70/1.10 Y := skol20
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (513) {G1,W2,D2,L1,V0,M1} { finite( skol20 ) }.
% 0.70/1.10 parent0[0]: (512) {G1,W4,D2,L2,V0,M2} { ! finite( skol21 ), finite( skol20
% 0.70/1.10 ) }.
% 0.70/1.10 parent1[0]: (91) {G0,W2,D2,L1,V0,M1} I { finite( skol21 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (370) {G2,W2,D2,L1,V0,M1} R(336,15);r(91) { finite( skol20 )
% 0.70/1.10 }.
% 0.70/1.10 parent0: (513) {G1,W2,D2,L1,V0,M1} { finite( skol20 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (514) {G1,W0,D0,L0,V0,M0} { }.
% 0.70/1.10 parent0[0]: (92) {G0,W2,D2,L1,V0,M1} I { ! finite( skol20 ) }.
% 0.70/1.10 parent1[0]: (370) {G2,W2,D2,L1,V0,M1} R(336,15);r(91) { finite( skol20 )
% 0.70/1.10 }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (392) {G3,W0,D0,L0,V0,M0} S(370);r(92) { }.
% 0.70/1.10 parent0: (514) {G1,W0,D0,L0,V0,M0} { }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 Proof check complete!
% 0.70/1.10
% 0.70/1.10 Memory use:
% 0.70/1.10
% 0.70/1.10 space for terms: 3636
% 0.70/1.10 space for clauses: 18151
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 clauses generated: 650
% 0.70/1.10 clauses kept: 393
% 0.70/1.10 clauses selected: 169
% 0.70/1.10 clauses deleted: 8
% 0.70/1.10 clauses inuse deleted: 0
% 0.70/1.10
% 0.70/1.10 subsentry: 526
% 0.70/1.10 literals s-matched: 449
% 0.70/1.10 literals matched: 443
% 0.70/1.10 full subsumption: 36
% 0.70/1.10
% 0.70/1.10 checksum: -701556737
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksem ended
%------------------------------------------------------------------------------