TSTP Solution File: NUM388+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM388+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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:53 EDT 2022
% Result : Theorem 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM388+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Thu Jul 7 09:54:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.10 *** allocated 10000 integers for termspace/termends
% 0.71/1.10 *** allocated 10000 integers for clauses
% 0.71/1.10 *** allocated 10000 integers for justifications
% 0.71/1.10 Bliksem 1.12
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Automatic Strategy Selection
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Clauses:
% 0.71/1.10
% 0.71/1.10 { ! in( X, Y ), ! in( Y, X ) }.
% 0.71/1.10 { ! empty( X ), function( X ) }.
% 0.71/1.10 { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.71/1.10 { ! ordinal( X ), epsilon_connected( X ) }.
% 0.71/1.10 { ! empty( X ), relation( X ) }.
% 0.71/1.10 { ! relation( X ), ! empty( X ), ! function( X ), relation( X ) }.
% 0.71/1.10 { ! relation( X ), ! empty( X ), ! function( X ), function( X ) }.
% 0.71/1.10 { ! relation( X ), ! empty( X ), ! function( X ), one_to_one( X ) }.
% 0.71/1.10 { ! epsilon_transitive( X ), ! epsilon_connected( X ), ordinal( X ) }.
% 0.71/1.10 { ! epsilon_transitive( X ), ! in( Y, X ), subset( Y, X ) }.
% 0.71/1.10 { in( skol1( X ), X ), epsilon_transitive( X ) }.
% 0.71/1.10 { ! subset( skol1( X ), X ), epsilon_transitive( X ) }.
% 0.71/1.10 { element( skol2( X ), X ) }.
% 0.71/1.10 { empty( empty_set ) }.
% 0.71/1.10 { relation( empty_set ) }.
% 0.71/1.10 { relation_empty_yielding( empty_set ) }.
% 0.71/1.10 { empty( empty_set ) }.
% 0.71/1.10 { empty( empty_set ) }.
% 0.71/1.10 { relation( empty_set ) }.
% 0.71/1.10 { relation( skol3 ) }.
% 0.71/1.10 { function( skol3 ) }.
% 0.71/1.10 { epsilon_transitive( skol4 ) }.
% 0.71/1.10 { epsilon_connected( skol4 ) }.
% 0.71/1.10 { ordinal( skol4 ) }.
% 0.71/1.10 { empty( skol5 ) }.
% 0.71/1.10 { relation( skol5 ) }.
% 0.71/1.10 { empty( skol6 ) }.
% 0.71/1.10 { relation( skol7 ) }.
% 0.71/1.10 { empty( skol7 ) }.
% 0.71/1.10 { function( skol7 ) }.
% 0.71/1.10 { ! empty( skol8 ) }.
% 0.71/1.10 { relation( skol8 ) }.
% 0.71/1.10 { ! empty( skol9 ) }.
% 0.71/1.10 { relation( skol10 ) }.
% 0.71/1.10 { function( skol10 ) }.
% 0.71/1.10 { one_to_one( skol10 ) }.
% 0.71/1.10 { relation( skol11 ) }.
% 0.71/1.10 { relation_empty_yielding( skol11 ) }.
% 0.71/1.10 { relation( skol12 ) }.
% 0.71/1.10 { relation_empty_yielding( skol12 ) }.
% 0.71/1.10 { function( skol12 ) }.
% 0.71/1.10 { relation( skol13 ) }.
% 0.71/1.10 { relation_non_empty( skol13 ) }.
% 0.71/1.10 { function( skol13 ) }.
% 0.71/1.10 { subset( X, X ) }.
% 0.71/1.10 { ordinal( skol14 ) }.
% 0.71/1.10 { ordinal( skol15 ) }.
% 0.71/1.10 { epsilon_transitive( skol16 ) }.
% 0.71/1.10 { in( skol16, skol14 ) }.
% 0.71/1.10 { in( skol14, skol15 ) }.
% 0.71/1.10 { ! in( skol16, skol15 ) }.
% 0.71/1.10 { ! in( X, Y ), element( X, Y ) }.
% 0.71/1.10 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.71/1.10 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 0.71/1.10 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 0.71/1.10 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 0.71/1.10 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 0.71/1.10 { ! empty( X ), X = empty_set }.
% 0.71/1.10 { ! in( X, Y ), ! empty( Y ) }.
% 0.71/1.10 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.71/1.10
% 0.71/1.10 percentage equality = 0.024390, percentage horn = 0.963636
% 0.71/1.10 This is a problem with some equality
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Options Used:
% 0.71/1.10
% 0.71/1.10 useres = 1
% 0.71/1.10 useparamod = 1
% 0.71/1.10 useeqrefl = 1
% 0.71/1.10 useeqfact = 1
% 0.71/1.10 usefactor = 1
% 0.71/1.10 usesimpsplitting = 0
% 0.71/1.10 usesimpdemod = 5
% 0.71/1.10 usesimpres = 3
% 0.71/1.10
% 0.71/1.10 resimpinuse = 1000
% 0.71/1.10 resimpclauses = 20000
% 0.71/1.10 substype = eqrewr
% 0.71/1.10 backwardsubs = 1
% 0.71/1.10 selectoldest = 5
% 0.71/1.10
% 0.71/1.10 litorderings [0] = split
% 0.71/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.10
% 0.71/1.10 termordering = kbo
% 0.71/1.10
% 0.71/1.10 litapriori = 0
% 0.71/1.10 termapriori = 1
% 0.71/1.10 litaposteriori = 0
% 0.71/1.10 termaposteriori = 0
% 0.71/1.10 demodaposteriori = 0
% 0.71/1.10 ordereqreflfact = 0
% 0.71/1.10
% 0.71/1.10 litselect = negord
% 0.71/1.10
% 0.71/1.10 maxweight = 15
% 0.71/1.10 maxdepth = 30000
% 0.71/1.10 maxlength = 115
% 0.71/1.10 maxnrvars = 195
% 0.71/1.10 excuselevel = 1
% 0.71/1.10 increasemaxweight = 1
% 0.71/1.10
% 0.71/1.10 maxselected = 10000000
% 0.71/1.10 maxnrclauses = 10000000
% 0.71/1.10
% 0.71/1.10 showgenerated = 0
% 0.71/1.10 showkept = 0
% 0.71/1.10 showselected = 0
% 0.71/1.10 showdeleted = 0
% 0.71/1.10 showresimp = 1
% 0.71/1.10 showstatus = 2000
% 0.71/1.10
% 0.71/1.10 prologoutput = 0
% 0.71/1.10 nrgoals = 5000000
% 0.71/1.10 totalproof = 1
% 0.71/1.10
% 0.71/1.10 Symbols occurring in the translation:
% 0.71/1.10
% 0.71/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.10 . [1, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.71/1.10 ! [4, 1] (w:0, o:24, a:1, s:1, b:0),
% 0.71/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 in [37, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.71/1.10 empty [38, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.71/1.10 function [39, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.71/1.10 ordinal [40, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.71/1.10 epsilon_transitive [41, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.71/1.10 epsilon_connected [42, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.71/1.10 relation [43, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.71/1.10 one_to_one [44, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.71/1.10 subset [45, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.71/1.10 element [46, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.71/1.10 empty_set [47, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.71/1.10 relation_empty_yielding [48, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.71/1.10 relation_non_empty [49, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.71/1.10 powerset [51, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.71/1.10 skol1 [52, 1] (w:1, o:39, a:1, s:1, b:1),
% 0.71/1.10 skol2 [53, 1] (w:1, o:40, a:1, s:1, b:1),
% 0.71/1.10 skol3 [54, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.71/1.10 skol4 [55, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.71/1.10 skol5 [56, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.71/1.10 skol6 [57, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.71/1.10 skol7 [58, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.71/1.10 skol8 [59, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.71/1.10 skol9 [60, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.71/1.10 skol10 [61, 0] (w:1, o:17, a:1, s:1, b:1),
% 0.71/1.10 skol11 [62, 0] (w:1, o:18, a:1, s:1, b:1),
% 0.71/1.10 skol12 [63, 0] (w:1, o:19, a:1, s:1, b:1),
% 0.71/1.10 skol13 [64, 0] (w:1, o:20, a:1, s:1, b:1),
% 0.71/1.10 skol14 [65, 0] (w:1, o:21, a:1, s:1, b:1),
% 0.71/1.10 skol15 [66, 0] (w:1, o:22, a:1, s:1, b:1),
% 0.71/1.10 skol16 [67, 0] (w:1, o:23, a:1, s:1, b:1).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Starting Search:
% 0.71/1.10
% 0.71/1.10 *** allocated 15000 integers for clauses
% 0.71/1.10 *** allocated 22500 integers for clauses
% 0.71/1.10
% 0.71/1.10 Bliksems!, er is een bewijs:
% 0.71/1.10 % SZS status Theorem
% 0.71/1.10 % SZS output start Refutation
% 0.71/1.10
% 0.71/1.10 (2) {G0,W4,D2,L2,V1,M2} I { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.71/1.10 (7) {G0,W8,D2,L3,V2,M3} I { ! epsilon_transitive( X ), ! in( Y, X ), subset
% 0.71/1.10 ( Y, X ) }.
% 0.71/1.10 (41) {G0,W2,D2,L1,V0,M1} I { ordinal( skol15 ) }.
% 0.71/1.10 (43) {G0,W3,D2,L1,V0,M1} I { in( skol16, skol14 ) }.
% 0.71/1.10 (44) {G0,W3,D2,L1,V0,M1} I { in( skol14, skol15 ) }.
% 0.71/1.10 (45) {G0,W3,D2,L1,V0,M1} I { ! in( skol16, skol15 ) }.
% 0.71/1.10 (47) {G0,W8,D2,L3,V2,M3} I { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.71/1.10 (49) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.71/1.10 }.
% 0.71/1.10 (50) {G0,W10,D3,L3,V3,M3} I { ! in( X, Z ), ! element( Z, powerset( Y ) ),
% 0.71/1.10 element( X, Y ) }.
% 0.71/1.10 (53) {G0,W5,D2,L2,V2,M2} I { ! in( X, Y ), ! empty( Y ) }.
% 0.71/1.10 (57) {G1,W2,D2,L1,V0,M1} R(2,41) { epsilon_transitive( skol15 ) }.
% 0.71/1.10 (76) {G2,W3,D2,L1,V0,M1} R(44,7);r(57) { subset( skol14, skol15 ) }.
% 0.71/1.10 (91) {G1,W5,D2,L2,V0,M2} R(47,45) { ! element( skol16, skol15 ), empty(
% 0.71/1.10 skol15 ) }.
% 0.71/1.10 (101) {G1,W2,D2,L1,V0,M1} R(53,44) { ! empty( skol15 ) }.
% 0.71/1.10 (116) {G3,W4,D3,L1,V0,M1} R(49,76) { element( skol14, powerset( skol15 ) )
% 0.71/1.10 }.
% 0.71/1.10 (200) {G4,W6,D2,L2,V1,M2} R(116,50) { ! in( X, skol14 ), element( X, skol15
% 0.71/1.10 ) }.
% 0.71/1.10 (294) {G2,W3,D2,L1,V0,M1} S(91);r(101) { ! element( skol16, skol15 ) }.
% 0.71/1.10 (366) {G5,W0,D0,L0,V0,M0} R(200,294);r(43) { }.
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 % SZS output end Refutation
% 0.71/1.10 found a proof!
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Unprocessed initial clauses:
% 0.71/1.10
% 0.71/1.10 (368) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.71/1.10 (369) {G0,W4,D2,L2,V1,M2} { ! empty( X ), function( X ) }.
% 0.71/1.10 (370) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.71/1.10 (371) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_connected( X ) }.
% 0.71/1.10 (372) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 0.71/1.10 (373) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.71/1.10 , relation( X ) }.
% 0.71/1.10 (374) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.71/1.10 , function( X ) }.
% 0.71/1.10 (375) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.71/1.10 , one_to_one( X ) }.
% 0.71/1.10 (376) {G0,W6,D2,L3,V1,M3} { ! epsilon_transitive( X ), ! epsilon_connected
% 0.71/1.10 ( X ), ordinal( X ) }.
% 0.71/1.10 (377) {G0,W8,D2,L3,V2,M3} { ! epsilon_transitive( X ), ! in( Y, X ),
% 0.71/1.10 subset( Y, X ) }.
% 0.71/1.10 (378) {G0,W6,D3,L2,V1,M2} { in( skol1( X ), X ), epsilon_transitive( X )
% 0.71/1.10 }.
% 0.71/1.10 (379) {G0,W6,D3,L2,V1,M2} { ! subset( skol1( X ), X ), epsilon_transitive
% 0.71/1.10 ( X ) }.
% 0.71/1.10 (380) {G0,W4,D3,L1,V1,M1} { element( skol2( X ), X ) }.
% 0.71/1.10 (381) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.71/1.10 (382) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.71/1.10 (383) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( empty_set ) }.
% 0.71/1.10 (384) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.71/1.10 (385) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.71/1.10 (386) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.71/1.10 (387) {G0,W2,D2,L1,V0,M1} { relation( skol3 ) }.
% 0.71/1.10 (388) {G0,W2,D2,L1,V0,M1} { function( skol3 ) }.
% 0.71/1.10 (389) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol4 ) }.
% 0.71/1.10 (390) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol4 ) }.
% 0.71/1.10 (391) {G0,W2,D2,L1,V0,M1} { ordinal( skol4 ) }.
% 0.71/1.10 (392) {G0,W2,D2,L1,V0,M1} { empty( skol5 ) }.
% 0.71/1.10 (393) {G0,W2,D2,L1,V0,M1} { relation( skol5 ) }.
% 0.71/1.10 (394) {G0,W2,D2,L1,V0,M1} { empty( skol6 ) }.
% 0.71/1.10 (395) {G0,W2,D2,L1,V0,M1} { relation( skol7 ) }.
% 0.71/1.10 (396) {G0,W2,D2,L1,V0,M1} { empty( skol7 ) }.
% 0.71/1.10 (397) {G0,W2,D2,L1,V0,M1} { function( skol7 ) }.
% 0.71/1.10 (398) {G0,W2,D2,L1,V0,M1} { ! empty( skol8 ) }.
% 0.71/1.10 (399) {G0,W2,D2,L1,V0,M1} { relation( skol8 ) }.
% 0.71/1.10 (400) {G0,W2,D2,L1,V0,M1} { ! empty( skol9 ) }.
% 0.71/1.10 (401) {G0,W2,D2,L1,V0,M1} { relation( skol10 ) }.
% 0.71/1.10 (402) {G0,W2,D2,L1,V0,M1} { function( skol10 ) }.
% 0.71/1.10 (403) {G0,W2,D2,L1,V0,M1} { one_to_one( skol10 ) }.
% 0.71/1.10 (404) {G0,W2,D2,L1,V0,M1} { relation( skol11 ) }.
% 0.71/1.10 (405) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol11 ) }.
% 0.71/1.10 (406) {G0,W2,D2,L1,V0,M1} { relation( skol12 ) }.
% 0.71/1.10 (407) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol12 ) }.
% 0.71/1.10 (408) {G0,W2,D2,L1,V0,M1} { function( skol12 ) }.
% 0.71/1.10 (409) {G0,W2,D2,L1,V0,M1} { relation( skol13 ) }.
% 0.71/1.10 (410) {G0,W2,D2,L1,V0,M1} { relation_non_empty( skol13 ) }.
% 0.71/1.10 (411) {G0,W2,D2,L1,V0,M1} { function( skol13 ) }.
% 0.71/1.10 (412) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.71/1.10 (413) {G0,W2,D2,L1,V0,M1} { ordinal( skol14 ) }.
% 0.71/1.10 (414) {G0,W2,D2,L1,V0,M1} { ordinal( skol15 ) }.
% 0.71/1.10 (415) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol16 ) }.
% 0.71/1.10 (416) {G0,W3,D2,L1,V0,M1} { in( skol16, skol14 ) }.
% 0.71/1.10 (417) {G0,W3,D2,L1,V0,M1} { in( skol14, skol15 ) }.
% 0.71/1.10 (418) {G0,W3,D2,L1,V0,M1} { ! in( skol16, skol15 ) }.
% 0.71/1.10 (419) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.71/1.10 (420) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.71/1.10 (421) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.71/1.10 }.
% 0.71/1.10 (422) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.71/1.10 }.
% 0.71/1.10 (423) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) ),
% 0.71/1.10 element( X, Y ) }.
% 0.71/1.10 (424) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) ), !
% 0.71/1.10 empty( Z ) }.
% 0.71/1.10 (425) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.71/1.10 (426) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.71/1.10 (427) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Total Proof:
% 0.71/1.10
% 0.71/1.10 subsumption: (2) {G0,W4,D2,L2,V1,M2} I { ! ordinal( X ), epsilon_transitive
% 0.71/1.10 ( X ) }.
% 0.71/1.10 parent0: (370) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_transitive( X
% 0.71/1.10 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (7) {G0,W8,D2,L3,V2,M3} I { ! epsilon_transitive( X ), ! in( Y
% 0.71/1.10 , X ), subset( Y, X ) }.
% 0.71/1.10 parent0: (377) {G0,W8,D2,L3,V2,M3} { ! epsilon_transitive( X ), ! in( Y, X
% 0.71/1.10 ), subset( Y, X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 2 ==> 2
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (41) {G0,W2,D2,L1,V0,M1} I { ordinal( skol15 ) }.
% 0.71/1.10 parent0: (414) {G0,W2,D2,L1,V0,M1} { ordinal( skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (43) {G0,W3,D2,L1,V0,M1} I { in( skol16, skol14 ) }.
% 0.71/1.10 parent0: (416) {G0,W3,D2,L1,V0,M1} { in( skol16, skol14 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (44) {G0,W3,D2,L1,V0,M1} I { in( skol14, skol15 ) }.
% 0.71/1.10 parent0: (417) {G0,W3,D2,L1,V0,M1} { in( skol14, skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (45) {G0,W3,D2,L1,V0,M1} I { ! in( skol16, skol15 ) }.
% 0.71/1.10 parent0: (418) {G0,W3,D2,L1,V0,M1} { ! in( skol16, skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (47) {G0,W8,D2,L3,V2,M3} I { ! element( X, Y ), empty( Y ), in
% 0.71/1.10 ( X, Y ) }.
% 0.71/1.10 parent0: (420) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X
% 0.71/1.10 , Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 2 ==> 2
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (49) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X,
% 0.71/1.10 powerset( Y ) ) }.
% 0.71/1.10 parent0: (422) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X,
% 0.71/1.10 powerset( Y ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (50) {G0,W10,D3,L3,V3,M3} I { ! in( X, Z ), ! element( Z,
% 0.71/1.10 powerset( Y ) ), element( X, Y ) }.
% 0.71/1.10 parent0: (423) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset
% 0.71/1.10 ( Y ) ), element( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 2 ==> 2
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (53) {G0,W5,D2,L2,V2,M2} I { ! in( X, Y ), ! empty( Y ) }.
% 0.71/1.10 parent0: (426) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (439) {G1,W2,D2,L1,V0,M1} { epsilon_transitive( skol15 ) }.
% 0.71/1.10 parent0[0]: (2) {G0,W4,D2,L2,V1,M2} I { ! ordinal( X ), epsilon_transitive
% 0.71/1.10 ( X ) }.
% 0.71/1.10 parent1[0]: (41) {G0,W2,D2,L1,V0,M1} I { ordinal( skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol15
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (57) {G1,W2,D2,L1,V0,M1} R(2,41) { epsilon_transitive( skol15
% 0.71/1.10 ) }.
% 0.71/1.10 parent0: (439) {G1,W2,D2,L1,V0,M1} { epsilon_transitive( skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (440) {G1,W5,D2,L2,V0,M2} { ! epsilon_transitive( skol15 ),
% 0.71/1.10 subset( skol14, skol15 ) }.
% 0.71/1.10 parent0[1]: (7) {G0,W8,D2,L3,V2,M3} I { ! epsilon_transitive( X ), ! in( Y
% 0.71/1.10 , X ), subset( Y, X ) }.
% 0.71/1.10 parent1[0]: (44) {G0,W3,D2,L1,V0,M1} I { in( skol14, skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol15
% 0.71/1.10 Y := skol14
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (441) {G2,W3,D2,L1,V0,M1} { subset( skol14, skol15 ) }.
% 0.71/1.10 parent0[0]: (440) {G1,W5,D2,L2,V0,M2} { ! epsilon_transitive( skol15 ),
% 0.71/1.10 subset( skol14, skol15 ) }.
% 0.71/1.10 parent1[0]: (57) {G1,W2,D2,L1,V0,M1} R(2,41) { epsilon_transitive( skol15 )
% 0.71/1.10 }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (76) {G2,W3,D2,L1,V0,M1} R(44,7);r(57) { subset( skol14,
% 0.71/1.10 skol15 ) }.
% 0.71/1.10 parent0: (441) {G2,W3,D2,L1,V0,M1} { subset( skol14, skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (442) {G1,W5,D2,L2,V0,M2} { ! element( skol16, skol15 ), empty
% 0.71/1.10 ( skol15 ) }.
% 0.71/1.10 parent0[0]: (45) {G0,W3,D2,L1,V0,M1} I { ! in( skol16, skol15 ) }.
% 0.71/1.10 parent1[2]: (47) {G0,W8,D2,L3,V2,M3} I { ! element( X, Y ), empty( Y ), in
% 0.71/1.10 ( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := skol16
% 0.71/1.10 Y := skol15
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (91) {G1,W5,D2,L2,V0,M2} R(47,45) { ! element( skol16, skol15
% 0.71/1.10 ), empty( skol15 ) }.
% 0.71/1.10 parent0: (442) {G1,W5,D2,L2,V0,M2} { ! element( skol16, skol15 ), empty(
% 0.71/1.10 skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (443) {G1,W2,D2,L1,V0,M1} { ! empty( skol15 ) }.
% 0.71/1.10 parent0[0]: (53) {G0,W5,D2,L2,V2,M2} I { ! in( X, Y ), ! empty( Y ) }.
% 0.71/1.10 parent1[0]: (44) {G0,W3,D2,L1,V0,M1} I { in( skol14, skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol14
% 0.71/1.10 Y := skol15
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (101) {G1,W2,D2,L1,V0,M1} R(53,44) { ! empty( skol15 ) }.
% 0.71/1.10 parent0: (443) {G1,W2,D2,L1,V0,M1} { ! empty( skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (444) {G1,W4,D3,L1,V0,M1} { element( skol14, powerset( skol15
% 0.71/1.10 ) ) }.
% 0.71/1.10 parent0[0]: (49) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X,
% 0.71/1.10 powerset( Y ) ) }.
% 0.71/1.10 parent1[0]: (76) {G2,W3,D2,L1,V0,M1} R(44,7);r(57) { subset( skol14, skol15
% 0.71/1.10 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol14
% 0.71/1.10 Y := skol15
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (116) {G3,W4,D3,L1,V0,M1} R(49,76) { element( skol14, powerset
% 0.71/1.10 ( skol15 ) ) }.
% 0.71/1.10 parent0: (444) {G1,W4,D3,L1,V0,M1} { element( skol14, powerset( skol15 ) )
% 0.71/1.10 }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (445) {G1,W6,D2,L2,V1,M2} { ! in( X, skol14 ), element( X,
% 0.71/1.10 skol15 ) }.
% 0.71/1.10 parent0[1]: (50) {G0,W10,D3,L3,V3,M3} I { ! in( X, Z ), ! element( Z,
% 0.71/1.10 powerset( Y ) ), element( X, Y ) }.
% 0.71/1.10 parent1[0]: (116) {G3,W4,D3,L1,V0,M1} R(49,76) { element( skol14, powerset
% 0.71/1.10 ( skol15 ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := skol15
% 0.71/1.10 Z := skol14
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (200) {G4,W6,D2,L2,V1,M2} R(116,50) { ! in( X, skol14 ),
% 0.71/1.10 element( X, skol15 ) }.
% 0.71/1.10 parent0: (445) {G1,W6,D2,L2,V1,M2} { ! in( X, skol14 ), element( X, skol15
% 0.71/1.10 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (446) {G2,W3,D2,L1,V0,M1} { ! element( skol16, skol15 ) }.
% 0.71/1.10 parent0[0]: (101) {G1,W2,D2,L1,V0,M1} R(53,44) { ! empty( skol15 ) }.
% 0.71/1.10 parent1[1]: (91) {G1,W5,D2,L2,V0,M2} R(47,45) { ! element( skol16, skol15 )
% 0.71/1.10 , empty( skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (294) {G2,W3,D2,L1,V0,M1} S(91);r(101) { ! element( skol16,
% 0.71/1.10 skol15 ) }.
% 0.71/1.10 parent0: (446) {G2,W3,D2,L1,V0,M1} { ! element( skol16, skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (447) {G3,W3,D2,L1,V0,M1} { ! in( skol16, skol14 ) }.
% 0.71/1.10 parent0[0]: (294) {G2,W3,D2,L1,V0,M1} S(91);r(101) { ! element( skol16,
% 0.71/1.10 skol15 ) }.
% 0.71/1.10 parent1[1]: (200) {G4,W6,D2,L2,V1,M2} R(116,50) { ! in( X, skol14 ),
% 0.71/1.10 element( X, skol15 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := skol16
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (448) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 parent0[0]: (447) {G3,W3,D2,L1,V0,M1} { ! in( skol16, skol14 ) }.
% 0.71/1.10 parent1[0]: (43) {G0,W3,D2,L1,V0,M1} I { in( skol16, skol14 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (366) {G5,W0,D0,L0,V0,M0} R(200,294);r(43) { }.
% 0.71/1.10 parent0: (448) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 Proof check complete!
% 0.71/1.10
% 0.71/1.10 Memory use:
% 0.71/1.10
% 0.71/1.10 space for terms: 3654
% 0.71/1.10 space for clauses: 16888
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 clauses generated: 1332
% 0.71/1.10 clauses kept: 367
% 0.71/1.10 clauses selected: 141
% 0.71/1.10 clauses deleted: 4
% 0.71/1.10 clauses inuse deleted: 0
% 0.71/1.10
% 0.71/1.10 subsentry: 1544
% 0.71/1.10 literals s-matched: 1364
% 0.71/1.10 literals matched: 1357
% 0.71/1.10 full subsumption: 171
% 0.71/1.10
% 0.71/1.10 checksum: 2119884589
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksem ended
%------------------------------------------------------------------------------