TSTP Solution File: SEU198+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU198+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n018.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:11:20 EDT 2022
% Result : Theorem 1.48s 1.86s
% Output : Refutation 1.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU198+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % DateTime : Sun Jun 19 21:26:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.48/1.86 *** allocated 10000 integers for termspace/termends
% 1.48/1.86 *** allocated 10000 integers for clauses
% 1.48/1.86 *** allocated 10000 integers for justifications
% 1.48/1.86 Bliksem 1.12
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86 Automatic Strategy Selection
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86 Clauses:
% 1.48/1.86
% 1.48/1.86 { ! in( X, Y ), ! in( Y, X ) }.
% 1.48/1.86 { ! empty( X ), relation( X ) }.
% 1.48/1.86 { ! subset( X, Y ), ! in( Z, X ), in( Z, Y ) }.
% 1.48/1.86 { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 1.48/1.86 { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 1.48/1.86 { && }.
% 1.48/1.86 { && }.
% 1.48/1.86 { && }.
% 1.48/1.86 { ! relation( X ), relation( relation_rng_restriction( Y, X ) ) }.
% 1.48/1.86 { && }.
% 1.48/1.86 { element( skol2( X ), X ) }.
% 1.48/1.86 { ! empty( powerset( X ) ) }.
% 1.48/1.86 { empty( empty_set ) }.
% 1.48/1.86 { empty( empty_set ) }.
% 1.48/1.86 { relation( empty_set ) }.
% 1.48/1.86 { empty( X ), ! relation( X ), ! empty( relation_rng( X ) ) }.
% 1.48/1.86 { ! empty( X ), empty( relation_rng( X ) ) }.
% 1.48/1.86 { ! empty( X ), relation( relation_rng( X ) ) }.
% 1.48/1.86 { empty( skol3 ) }.
% 1.48/1.86 { relation( skol3 ) }.
% 1.48/1.86 { empty( X ), ! empty( skol4( Y ) ) }.
% 1.48/1.86 { empty( X ), element( skol4( X ), powerset( X ) ) }.
% 1.48/1.86 { empty( skol5 ) }.
% 1.48/1.86 { ! empty( skol6 ) }.
% 1.48/1.86 { relation( skol6 ) }.
% 1.48/1.86 { empty( skol7( Y ) ) }.
% 1.48/1.86 { element( skol7( X ), powerset( X ) ) }.
% 1.48/1.86 { ! empty( skol8 ) }.
% 1.48/1.86 { subset( X, X ) }.
% 1.48/1.86 { ! relation( X ), ! in( Y, relation_rng( relation_rng_restriction( Z, X )
% 1.48/1.86 ) ), in( Y, Z ) }.
% 1.48/1.86 { ! relation( X ), ! in( Y, relation_rng( relation_rng_restriction( Z, X )
% 1.48/1.86 ) ), in( Y, relation_rng( X ) ) }.
% 1.48/1.86 { ! relation( X ), ! in( Y, Z ), ! in( Y, relation_rng( X ) ), in( Y,
% 1.48/1.86 relation_rng( relation_rng_restriction( Z, X ) ) ) }.
% 1.48/1.86 { relation( skol9 ) }.
% 1.48/1.86 { ! subset( relation_rng( relation_rng_restriction( skol10, skol9 ) ),
% 1.48/1.86 skol10 ) }.
% 1.48/1.86 { ! in( X, Y ), element( X, Y ) }.
% 1.48/1.86 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 1.48/1.86 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 1.48/1.86 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 1.48/1.86 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 1.48/1.86 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 1.48/1.86 { ! empty( X ), X = empty_set }.
% 1.48/1.86 { ! in( X, Y ), ! empty( Y ) }.
% 1.48/1.86 { ! empty( X ), X = Y, ! empty( Y ) }.
% 1.48/1.86
% 1.48/1.86 percentage equality = 0.027778, percentage horn = 0.923077
% 1.48/1.86 This is a problem with some equality
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86 Options Used:
% 1.48/1.86
% 1.48/1.86 useres = 1
% 1.48/1.86 useparamod = 1
% 1.48/1.86 useeqrefl = 1
% 1.48/1.86 useeqfact = 1
% 1.48/1.86 usefactor = 1
% 1.48/1.86 usesimpsplitting = 0
% 1.48/1.86 usesimpdemod = 5
% 1.48/1.86 usesimpres = 3
% 1.48/1.86
% 1.48/1.86 resimpinuse = 1000
% 1.48/1.86 resimpclauses = 20000
% 1.48/1.86 substype = eqrewr
% 1.48/1.86 backwardsubs = 1
% 1.48/1.86 selectoldest = 5
% 1.48/1.86
% 1.48/1.86 litorderings [0] = split
% 1.48/1.86 litorderings [1] = extend the termordering, first sorting on arguments
% 1.48/1.86
% 1.48/1.86 termordering = kbo
% 1.48/1.86
% 1.48/1.86 litapriori = 0
% 1.48/1.86 termapriori = 1
% 1.48/1.86 litaposteriori = 0
% 1.48/1.86 termaposteriori = 0
% 1.48/1.86 demodaposteriori = 0
% 1.48/1.86 ordereqreflfact = 0
% 1.48/1.86
% 1.48/1.86 litselect = negord
% 1.48/1.86
% 1.48/1.86 maxweight = 15
% 1.48/1.86 maxdepth = 30000
% 1.48/1.86 maxlength = 115
% 1.48/1.86 maxnrvars = 195
% 1.48/1.86 excuselevel = 1
% 1.48/1.86 increasemaxweight = 1
% 1.48/1.86
% 1.48/1.86 maxselected = 10000000
% 1.48/1.86 maxnrclauses = 10000000
% 1.48/1.86
% 1.48/1.86 showgenerated = 0
% 1.48/1.86 showkept = 0
% 1.48/1.86 showselected = 0
% 1.48/1.86 showdeleted = 0
% 1.48/1.86 showresimp = 1
% 1.48/1.86 showstatus = 2000
% 1.48/1.86
% 1.48/1.86 prologoutput = 0
% 1.48/1.86 nrgoals = 5000000
% 1.48/1.86 totalproof = 1
% 1.48/1.86
% 1.48/1.86 Symbols occurring in the translation:
% 1.48/1.86
% 1.48/1.86 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.48/1.86 . [1, 2] (w:1, o:28, a:1, s:1, b:0),
% 1.48/1.86 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 1.48/1.86 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 1.48/1.86 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.48/1.86 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.48/1.86 in [37, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.48/1.86 empty [38, 1] (w:1, o:21, a:1, s:1, b:0),
% 1.48/1.86 relation [39, 1] (w:1, o:22, a:1, s:1, b:0),
% 1.48/1.86 subset [40, 2] (w:1, o:54, a:1, s:1, b:0),
% 1.48/1.86 relation_rng_restriction [42, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.48/1.86 element [43, 2] (w:1, o:55, a:1, s:1, b:0),
% 1.48/1.86 powerset [44, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.48/1.86 empty_set [45, 0] (w:1, o:9, a:1, s:1, b:0),
% 1.48/1.86 relation_rng [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 1.48/1.86 skol1 [47, 2] (w:1, o:56, a:1, s:1, b:1),
% 1.48/1.86 skol2 [48, 1] (w:1, o:25, a:1, s:1, b:1),
% 1.48/1.86 skol3 [49, 0] (w:1, o:10, a:1, s:1, b:1),
% 1.48/1.86 skol4 [50, 1] (w:1, o:26, a:1, s:1, b:1),
% 1.48/1.86 skol5 [51, 0] (w:1, o:11, a:1, s:1, b:1),
% 1.48/1.86 skol6 [52, 0] (w:1, o:12, a:1, s:1, b:1),
% 1.48/1.86 skol7 [53, 1] (w:1, o:27, a:1, s:1, b:1),
% 1.48/1.86 skol8 [54, 0] (w:1, o:13, a:1, s:1, b:1),
% 1.48/1.86 skol9 [55, 0] (w:1, o:14, a:1, s:1, b:1),
% 1.48/1.86 skol10 [56, 0] (w:1, o:15, a:1, s:1, b:1).
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86 Starting Search:
% 1.48/1.86
% 1.48/1.86 *** allocated 15000 integers for clauses
% 1.48/1.86 *** allocated 22500 integers for clauses
% 1.48/1.86 *** allocated 33750 integers for clauses
% 1.48/1.86 *** allocated 50625 integers for clauses
% 1.48/1.86 *** allocated 15000 integers for termspace/termends
% 1.48/1.86 Resimplifying inuse:
% 1.48/1.86 Done
% 1.48/1.86
% 1.48/1.86 *** allocated 75937 integers for clauses
% 1.48/1.86 *** allocated 22500 integers for termspace/termends
% 1.48/1.86 *** allocated 113905 integers for clauses
% 1.48/1.86
% 1.48/1.86 Intermediate Status:
% 1.48/1.86 Generated: 6445
% 1.48/1.86 Kept: 2000
% 1.48/1.86 Inuse: 259
% 1.48/1.86 Deleted: 94
% 1.48/1.86 Deletedinuse: 43
% 1.48/1.86
% 1.48/1.86 Resimplifying inuse:
% 1.48/1.86 Done
% 1.48/1.86
% 1.48/1.86 *** allocated 33750 integers for termspace/termends
% 1.48/1.86 *** allocated 170857 integers for clauses
% 1.48/1.86 *** allocated 50625 integers for termspace/termends
% 1.48/1.86 Resimplifying inuse:
% 1.48/1.86 Done
% 1.48/1.86
% 1.48/1.86 *** allocated 256285 integers for clauses
% 1.48/1.86
% 1.48/1.86 Intermediate Status:
% 1.48/1.86 Generated: 13682
% 1.48/1.86 Kept: 4006
% 1.48/1.86 Inuse: 427
% 1.48/1.86 Deleted: 188
% 1.48/1.86 Deletedinuse: 59
% 1.48/1.86
% 1.48/1.86 Resimplifying inuse:
% 1.48/1.86 Done
% 1.48/1.86
% 1.48/1.86 *** allocated 75937 integers for termspace/termends
% 1.48/1.86 Resimplifying inuse:
% 1.48/1.86 Done
% 1.48/1.86
% 1.48/1.86 *** allocated 384427 integers for clauses
% 1.48/1.86
% 1.48/1.86 Intermediate Status:
% 1.48/1.86 Generated: 26229
% 1.48/1.86 Kept: 6056
% 1.48/1.86 Inuse: 551
% 1.48/1.86 Deleted: 231
% 1.48/1.86 Deletedinuse: 68
% 1.48/1.86
% 1.48/1.86 Resimplifying inuse:
% 1.48/1.86 Done
% 1.48/1.86
% 1.48/1.86 *** allocated 113905 integers for termspace/termends
% 1.48/1.86 Resimplifying inuse:
% 1.48/1.86 Done
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86 Bliksems!, er is een bewijs:
% 1.48/1.86 % SZS status Theorem
% 1.48/1.86 % SZS output start Refutation
% 1.48/1.86
% 1.48/1.86 (0) {G0,W6,D2,L2,V2,M2} I { ! in( X, Y ), ! in( Y, X ) }.
% 1.48/1.86 (3) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 1.48/1.86 (4) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 1.48/1.86 (8) {G0,W3,D3,L1,V1,M1} I { ! empty( powerset( X ) ) }.
% 1.48/1.86 (25) {G0,W11,D4,L3,V3,M3} I { ! relation( X ), ! in( Y, relation_rng(
% 1.48/1.86 relation_rng_restriction( Z, X ) ) ), in( Y, Z ) }.
% 1.48/1.86 (28) {G0,W2,D2,L1,V0,M1} I { relation( skol9 ) }.
% 1.48/1.86 (29) {G0,W6,D4,L1,V0,M1} I { ! subset( relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ), skol10 ) }.
% 1.48/1.86 (31) {G0,W8,D2,L3,V2,M3} I { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 1.48/1.86 (33) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X, powerset( Y ) )
% 1.48/1.86 }.
% 1.48/1.86 (39) {G1,W3,D2,L1,V1,M1} F(0) { ! in( X, X ) }.
% 1.48/1.86 (190) {G1,W9,D4,L2,V2,M2} R(25,28) { ! in( X, relation_rng(
% 1.48/1.86 relation_rng_restriction( Y, skol9 ) ) ), in( X, Y ) }.
% 1.48/1.86 (261) {G1,W11,D5,L1,V0,M1} R(29,4) { in( skol1( relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ), skol10 ), relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ) ) }.
% 1.48/1.86 (305) {G2,W5,D2,L2,V1,M2} R(31,39) { ! element( X, X ), empty( X ) }.
% 1.48/1.86 (341) {G3,W4,D3,L1,V1,M1} R(33,305);r(8) { ! subset( powerset( X ), X ) }.
% 1.48/1.86 (347) {G4,W5,D3,L1,V2,M1} R(341,3) { ! in( skol1( X, Y ), Y ) }.
% 1.48/1.86 (3999) {G5,W8,D4,L1,V2,M1} R(190,347) { ! in( skol1( X, Y ), relation_rng(
% 1.48/1.86 relation_rng_restriction( Y, skol9 ) ) ) }.
% 1.48/1.86 (7951) {G6,W0,D0,L0,V0,M0} S(261);r(3999) { }.
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86 % SZS output end Refutation
% 1.48/1.86 found a proof!
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86 Unprocessed initial clauses:
% 1.48/1.86
% 1.48/1.86 (7953) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 1.48/1.86 (7954) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 1.48/1.86 (7955) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! in( Z, X ), in( Z, Y )
% 1.48/1.86 }.
% 1.48/1.86 (7956) {G0,W8,D3,L2,V3,M2} { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 1.48/1.86 (7957) {G0,W8,D3,L2,V2,M2} { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 1.48/1.86 (7958) {G0,W1,D1,L1,V0,M1} { && }.
% 1.48/1.86 (7959) {G0,W1,D1,L1,V0,M1} { && }.
% 1.48/1.86 (7960) {G0,W1,D1,L1,V0,M1} { && }.
% 1.48/1.86 (7961) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 1.48/1.86 relation_rng_restriction( Y, X ) ) }.
% 1.48/1.86 (7962) {G0,W1,D1,L1,V0,M1} { && }.
% 1.48/1.86 (7963) {G0,W4,D3,L1,V1,M1} { element( skol2( X ), X ) }.
% 1.48/1.86 (7964) {G0,W3,D3,L1,V1,M1} { ! empty( powerset( X ) ) }.
% 1.48/1.86 (7965) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 1.48/1.86 (7966) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 1.48/1.86 (7967) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 1.48/1.86 (7968) {G0,W7,D3,L3,V1,M3} { empty( X ), ! relation( X ), ! empty(
% 1.48/1.86 relation_rng( X ) ) }.
% 1.48/1.86 (7969) {G0,W5,D3,L2,V1,M2} { ! empty( X ), empty( relation_rng( X ) ) }.
% 1.48/1.86 (7970) {G0,W5,D3,L2,V1,M2} { ! empty( X ), relation( relation_rng( X ) )
% 1.48/1.86 }.
% 1.48/1.86 (7971) {G0,W2,D2,L1,V0,M1} { empty( skol3 ) }.
% 1.48/1.86 (7972) {G0,W2,D2,L1,V0,M1} { relation( skol3 ) }.
% 1.48/1.86 (7973) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol4( Y ) ) }.
% 1.48/1.86 (7974) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol4( X ), powerset( X
% 1.48/1.86 ) ) }.
% 1.48/1.86 (7975) {G0,W2,D2,L1,V0,M1} { empty( skol5 ) }.
% 1.48/1.86 (7976) {G0,W2,D2,L1,V0,M1} { ! empty( skol6 ) }.
% 1.48/1.86 (7977) {G0,W2,D2,L1,V0,M1} { relation( skol6 ) }.
% 1.48/1.86 (7978) {G0,W3,D3,L1,V1,M1} { empty( skol7( Y ) ) }.
% 1.48/1.86 (7979) {G0,W5,D3,L1,V1,M1} { element( skol7( X ), powerset( X ) ) }.
% 1.48/1.86 (7980) {G0,W2,D2,L1,V0,M1} { ! empty( skol8 ) }.
% 1.48/1.86 (7981) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 1.48/1.86 (7982) {G0,W11,D4,L3,V3,M3} { ! relation( X ), ! in( Y, relation_rng(
% 1.48/1.86 relation_rng_restriction( Z, X ) ) ), in( Y, Z ) }.
% 1.48/1.86 (7983) {G0,W12,D4,L3,V3,M3} { ! relation( X ), ! in( Y, relation_rng(
% 1.48/1.86 relation_rng_restriction( Z, X ) ) ), in( Y, relation_rng( X ) ) }.
% 1.48/1.86 (7984) {G0,W15,D4,L4,V3,M4} { ! relation( X ), ! in( Y, Z ), ! in( Y,
% 1.48/1.86 relation_rng( X ) ), in( Y, relation_rng( relation_rng_restriction( Z, X
% 1.48/1.86 ) ) ) }.
% 1.48/1.86 (7985) {G0,W2,D2,L1,V0,M1} { relation( skol9 ) }.
% 1.48/1.86 (7986) {G0,W6,D4,L1,V0,M1} { ! subset( relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ), skol10 ) }.
% 1.48/1.86 (7987) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 1.48/1.86 (7988) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 1.48/1.86 (7989) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 1.48/1.86 }.
% 1.48/1.86 (7990) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 1.48/1.86 }.
% 1.48/1.86 (7991) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) )
% 1.48/1.86 , element( X, Y ) }.
% 1.48/1.86 (7992) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) ),
% 1.48/1.86 ! empty( Z ) }.
% 1.48/1.86 (7993) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 1.48/1.86 (7994) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 1.48/1.86 (7995) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86 Total Proof:
% 1.48/1.86
% 1.48/1.86 subsumption: (0) {G0,W6,D2,L2,V2,M2} I { ! in( X, Y ), ! in( Y, X ) }.
% 1.48/1.86 parent0: (7953) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 Y := Y
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 1 ==> 1
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (3) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset(
% 1.48/1.86 X, Y ) }.
% 1.48/1.86 parent0: (7956) {G0,W8,D3,L2,V3,M2} { ! in( skol1( Z, Y ), Y ), subset( X
% 1.48/1.86 , Y ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 Y := Y
% 1.48/1.86 Z := Z
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 1 ==> 1
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (4) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X
% 1.48/1.86 , Y ) }.
% 1.48/1.86 parent0: (7957) {G0,W8,D3,L2,V2,M2} { in( skol1( X, Y ), X ), subset( X, Y
% 1.48/1.86 ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 Y := Y
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 1 ==> 1
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (8) {G0,W3,D3,L1,V1,M1} I { ! empty( powerset( X ) ) }.
% 1.48/1.86 parent0: (7964) {G0,W3,D3,L1,V1,M1} { ! empty( powerset( X ) ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (25) {G0,W11,D4,L3,V3,M3} I { ! relation( X ), ! in( Y,
% 1.48/1.86 relation_rng( relation_rng_restriction( Z, X ) ) ), in( Y, Z ) }.
% 1.48/1.86 parent0: (7982) {G0,W11,D4,L3,V3,M3} { ! relation( X ), ! in( Y,
% 1.48/1.86 relation_rng( relation_rng_restriction( Z, X ) ) ), in( Y, Z ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 Y := Y
% 1.48/1.86 Z := Z
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 1 ==> 1
% 1.48/1.86 2 ==> 2
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (28) {G0,W2,D2,L1,V0,M1} I { relation( skol9 ) }.
% 1.48/1.86 parent0: (7985) {G0,W2,D2,L1,V0,M1} { relation( skol9 ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (29) {G0,W6,D4,L1,V0,M1} I { ! subset( relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ), skol10 ) }.
% 1.48/1.86 parent0: (7986) {G0,W6,D4,L1,V0,M1} { ! subset( relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ), skol10 ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (31) {G0,W8,D2,L3,V2,M3} I { ! element( X, Y ), empty( Y ), in
% 1.48/1.86 ( X, Y ) }.
% 1.48/1.86 parent0: (7988) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X
% 1.48/1.86 , Y ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 Y := Y
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 1 ==> 1
% 1.48/1.86 2 ==> 2
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (33) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X,
% 1.48/1.86 powerset( Y ) ) }.
% 1.48/1.86 parent0: (7990) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X,
% 1.48/1.86 powerset( Y ) ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 Y := Y
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 1 ==> 1
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 factor: (8009) {G0,W3,D2,L1,V1,M1} { ! in( X, X ) }.
% 1.48/1.86 parent0[0, 1]: (0) {G0,W6,D2,L2,V2,M2} I { ! in( X, Y ), ! in( Y, X ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 Y := X
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (39) {G1,W3,D2,L1,V1,M1} F(0) { ! in( X, X ) }.
% 1.48/1.86 parent0: (8009) {G0,W3,D2,L1,V1,M1} { ! in( X, X ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 resolution: (8010) {G1,W9,D4,L2,V2,M2} { ! in( X, relation_rng(
% 1.48/1.86 relation_rng_restriction( Y, skol9 ) ) ), in( X, Y ) }.
% 1.48/1.86 parent0[0]: (25) {G0,W11,D4,L3,V3,M3} I { ! relation( X ), ! in( Y,
% 1.48/1.86 relation_rng( relation_rng_restriction( Z, X ) ) ), in( Y, Z ) }.
% 1.48/1.86 parent1[0]: (28) {G0,W2,D2,L1,V0,M1} I { relation( skol9 ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := skol9
% 1.48/1.86 Y := X
% 1.48/1.86 Z := Y
% 1.48/1.86 end
% 1.48/1.86 substitution1:
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (190) {G1,W9,D4,L2,V2,M2} R(25,28) { ! in( X, relation_rng(
% 1.48/1.86 relation_rng_restriction( Y, skol9 ) ) ), in( X, Y ) }.
% 1.48/1.86 parent0: (8010) {G1,W9,D4,L2,V2,M2} { ! in( X, relation_rng(
% 1.48/1.86 relation_rng_restriction( Y, skol9 ) ) ), in( X, Y ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 Y := Y
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 1 ==> 1
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 resolution: (8011) {G1,W11,D5,L1,V0,M1} { in( skol1( relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ), skol10 ), relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ) ) }.
% 1.48/1.86 parent0[0]: (29) {G0,W6,D4,L1,V0,M1} I { ! subset( relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ), skol10 ) }.
% 1.48/1.86 parent1[1]: (4) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X,
% 1.48/1.86 Y ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 end
% 1.48/1.86 substitution1:
% 1.48/1.86 X := relation_rng( relation_rng_restriction( skol10, skol9 ) )
% 1.48/1.86 Y := skol10
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (261) {G1,W11,D5,L1,V0,M1} R(29,4) { in( skol1( relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ), skol10 ), relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ) ) }.
% 1.48/1.86 parent0: (8011) {G1,W11,D5,L1,V0,M1} { in( skol1( relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ), skol10 ), relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ) ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 resolution: (8012) {G1,W5,D2,L2,V1,M2} { ! element( X, X ), empty( X ) }.
% 1.48/1.86 parent0[0]: (39) {G1,W3,D2,L1,V1,M1} F(0) { ! in( X, X ) }.
% 1.48/1.86 parent1[2]: (31) {G0,W8,D2,L3,V2,M3} I { ! element( X, Y ), empty( Y ), in
% 1.48/1.86 ( X, Y ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 end
% 1.48/1.86 substitution1:
% 1.48/1.86 X := X
% 1.48/1.86 Y := X
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (305) {G2,W5,D2,L2,V1,M2} R(31,39) { ! element( X, X ), empty
% 1.48/1.86 ( X ) }.
% 1.48/1.86 parent0: (8012) {G1,W5,D2,L2,V1,M2} { ! element( X, X ), empty( X ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 1 ==> 1
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 resolution: (8013) {G1,W7,D3,L2,V1,M2} { empty( powerset( X ) ), ! subset
% 1.48/1.86 ( powerset( X ), X ) }.
% 1.48/1.86 parent0[0]: (305) {G2,W5,D2,L2,V1,M2} R(31,39) { ! element( X, X ), empty(
% 1.48/1.86 X ) }.
% 1.48/1.86 parent1[1]: (33) {G0,W7,D3,L2,V2,M2} I { ! subset( X, Y ), element( X,
% 1.48/1.86 powerset( Y ) ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := powerset( X )
% 1.48/1.86 end
% 1.48/1.86 substitution1:
% 1.48/1.86 X := powerset( X )
% 1.48/1.86 Y := X
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 resolution: (8014) {G1,W4,D3,L1,V1,M1} { ! subset( powerset( X ), X ) }.
% 1.48/1.86 parent0[0]: (8) {G0,W3,D3,L1,V1,M1} I { ! empty( powerset( X ) ) }.
% 1.48/1.86 parent1[0]: (8013) {G1,W7,D3,L2,V1,M2} { empty( powerset( X ) ), ! subset
% 1.48/1.86 ( powerset( X ), X ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 end
% 1.48/1.86 substitution1:
% 1.48/1.86 X := X
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (341) {G3,W4,D3,L1,V1,M1} R(33,305);r(8) { ! subset( powerset
% 1.48/1.86 ( X ), X ) }.
% 1.48/1.86 parent0: (8014) {G1,W4,D3,L1,V1,M1} { ! subset( powerset( X ), X ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 resolution: (8015) {G1,W5,D3,L1,V2,M1} { ! in( skol1( Y, X ), X ) }.
% 1.48/1.86 parent0[0]: (341) {G3,W4,D3,L1,V1,M1} R(33,305);r(8) { ! subset( powerset(
% 1.48/1.86 X ), X ) }.
% 1.48/1.86 parent1[1]: (3) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset( X
% 1.48/1.86 , Y ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 end
% 1.48/1.86 substitution1:
% 1.48/1.86 X := powerset( X )
% 1.48/1.86 Y := X
% 1.48/1.86 Z := Y
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (347) {G4,W5,D3,L1,V2,M1} R(341,3) { ! in( skol1( X, Y ), Y )
% 1.48/1.86 }.
% 1.48/1.86 parent0: (8015) {G1,W5,D3,L1,V2,M1} { ! in( skol1( Y, X ), X ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := Y
% 1.48/1.86 Y := X
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 resolution: (8016) {G2,W8,D4,L1,V2,M1} { ! in( skol1( X, Y ), relation_rng
% 1.48/1.86 ( relation_rng_restriction( Y, skol9 ) ) ) }.
% 1.48/1.86 parent0[0]: (347) {G4,W5,D3,L1,V2,M1} R(341,3) { ! in( skol1( X, Y ), Y )
% 1.48/1.86 }.
% 1.48/1.86 parent1[1]: (190) {G1,W9,D4,L2,V2,M2} R(25,28) { ! in( X, relation_rng(
% 1.48/1.86 relation_rng_restriction( Y, skol9 ) ) ), in( X, Y ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 Y := Y
% 1.48/1.86 end
% 1.48/1.86 substitution1:
% 1.48/1.86 X := skol1( X, Y )
% 1.48/1.86 Y := Y
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (3999) {G5,W8,D4,L1,V2,M1} R(190,347) { ! in( skol1( X, Y ),
% 1.48/1.86 relation_rng( relation_rng_restriction( Y, skol9 ) ) ) }.
% 1.48/1.86 parent0: (8016) {G2,W8,D4,L1,V2,M1} { ! in( skol1( X, Y ), relation_rng(
% 1.48/1.86 relation_rng_restriction( Y, skol9 ) ) ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := X
% 1.48/1.86 Y := Y
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 0 ==> 0
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 resolution: (8017) {G2,W0,D0,L0,V0,M0} { }.
% 1.48/1.86 parent0[0]: (3999) {G5,W8,D4,L1,V2,M1} R(190,347) { ! in( skol1( X, Y ),
% 1.48/1.86 relation_rng( relation_rng_restriction( Y, skol9 ) ) ) }.
% 1.48/1.86 parent1[0]: (261) {G1,W11,D5,L1,V0,M1} R(29,4) { in( skol1( relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ), skol10 ), relation_rng(
% 1.48/1.86 relation_rng_restriction( skol10, skol9 ) ) ) }.
% 1.48/1.86 substitution0:
% 1.48/1.86 X := relation_rng( relation_rng_restriction( skol10, skol9 ) )
% 1.48/1.86 Y := skol10
% 1.48/1.86 end
% 1.48/1.86 substitution1:
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 subsumption: (7951) {G6,W0,D0,L0,V0,M0} S(261);r(3999) { }.
% 1.48/1.86 parent0: (8017) {G2,W0,D0,L0,V0,M0} { }.
% 1.48/1.86 substitution0:
% 1.48/1.86 end
% 1.48/1.86 permutation0:
% 1.48/1.86 end
% 1.48/1.86
% 1.48/1.86 Proof check complete!
% 1.48/1.86
% 1.48/1.86 Memory use:
% 1.48/1.86
% 1.48/1.86 space for terms: 98919
% 1.48/1.86 space for clauses: 380102
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86 clauses generated: 35150
% 1.48/1.86 clauses kept: 7952
% 1.48/1.86 clauses selected: 647
% 1.48/1.86 clauses deleted: 232
% 1.48/1.86 clauses inuse deleted: 68
% 1.48/1.86
% 1.48/1.86 subsentry: 115307
% 1.48/1.86 literals s-matched: 69367
% 1.48/1.86 literals matched: 66642
% 1.48/1.86 full subsumption: 11464
% 1.48/1.86
% 1.48/1.86 checksum: 1278176866
% 1.48/1.86
% 1.48/1.86
% 1.48/1.86 Bliksem ended
%------------------------------------------------------------------------------