%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU196+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n032.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:19 EDT 2022
% Result : Theorem 0.91s 1.27s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SEU196+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.08 % Command : bliksem %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % DateTime : Sun Jun 19 20:00:48 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.91/1.27 *** allocated 10000 integers for termspace/termends
% 0.91/1.27 *** allocated 10000 integers for clauses
% 0.91/1.27 *** allocated 10000 integers for justifications
% 0.91/1.27 Bliksem 1.12
% 0.91/1.27
% 0.91/1.27
% 0.91/1.27 Automatic Strategy Selection
% 0.91/1.27
% 0.91/1.27
% 0.91/1.27 Clauses:
% 0.91/1.27
% 0.91/1.27 { ! in( X, Y ), ! in( Y, X ) }.
% 0.91/1.27 { ! empty( X ), relation( X ) }.
% 0.91/1.27 { && }.
% 0.91/1.27 { && }.
% 0.91/1.27 { && }.
% 0.91/1.27 { && }.
% 0.91/1.27 { ! relation( X ), relation( relation_dom_restriction( X, Y ) ) }.
% 0.91/1.27 { && }.
% 0.91/1.27 { element( skol1( X ), X ) }.
% 0.91/1.27 { ! empty( powerset( X ) ) }.
% 0.91/1.27 { empty( empty_set ) }.
% 0.91/1.27 { empty( empty_set ) }.
% 0.91/1.27 { relation( empty_set ) }.
% 0.91/1.27 { empty( X ), ! relation( X ), ! empty( relation_dom( X ) ) }.
% 0.91/1.27 { empty( X ), ! relation( X ), ! empty( relation_rng( X ) ) }.
% 0.91/1.27 { ! empty( X ), empty( relation_dom( X ) ) }.
% 0.91/1.27 { ! empty( X ), relation( relation_dom( X ) ) }.
% 0.91/1.27 { ! empty( X ), empty( relation_rng( X ) ) }.
% 0.91/1.27 { ! empty( X ), relation( relation_rng( X ) ) }.
% 0.91/1.27 { empty( skol2 ) }.
% 0.91/1.27 { relation( skol2 ) }.
% 0.91/1.27 { empty( X ), ! empty( skol3( Y ) ) }.
% 0.91/1.27 { empty( X ), element( skol3( X ), powerset( X ) ) }.
% 0.91/1.27 { empty( skol4 ) }.
% 0.91/1.27 { ! empty( skol5 ) }.
% 0.91/1.27 { relation( skol5 ) }.
% 0.91/1.27 { empty( skol6( Y ) ) }.
% 0.91/1.27 { element( skol6( X ), powerset( X ) ) }.
% 0.91/1.27 { ! empty( skol7 ) }.
% 0.91/1.27 { subset( X, X ) }.
% 0.91/1.27 { ! in( X, Y ), element( X, Y ) }.
% 0.91/1.27 { ! relation( X ), ! relation( Y ), ! subset( X, Y ), subset( relation_dom
% 0.91/1.27 ( X ), relation_dom( Y ) ) }.
% 0.91/1.27 { ! relation( X ), ! relation( Y ), ! subset( X, Y ), subset( relation_rng
% 0.91/1.27 ( X ), relation_rng( Y ) ) }.
% 0.91/1.27 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.91/1.27 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 0.91/1.27 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 0.91/1.27 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 0.91/1.27 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 0.91/1.27 { ! empty( X ), X = empty_set }.
% 0.91/1.27 { ! in( X, Y ), ! empty( Y ) }.
% 0.91/1.27 { ! relation( X ), subset( relation_dom_restriction( X, Y ), X ) }.
% 0.91/1.27 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.91/1.27 { relation( skol8 ) }.
% 0.91/1.27 { ! subset( relation_rng( relation_dom_restriction( skol8, skol9 ) ),
% 0.91/1.27 relation_rng( skol8 ) ) }.
% 0.91/1.27
% 0.91/1.27 percentage equality = 0.027778, percentage horn = 0.948718
% 0.91/1.27 This is a problem with some equality
% 0.91/1.27
% 0.91/1.27
% 0.91/1.27
% 0.91/1.27 Options Used:
% 0.91/1.27
% 0.91/1.27 useres = 1
% 0.91/1.27 useparamod = 1
% 0.91/1.27 useeqrefl = 1
% 0.91/1.27 useeqfact = 1
% 0.91/1.27 usefactor = 1
% 0.91/1.27 usesimpsplitting = 0
% 0.91/1.27 usesimpdemod = 5
% 0.91/1.27 usesimpres = 3
% 0.91/1.27
% 0.91/1.27 resimpinuse = 1000
% 0.91/1.27 resimpclauses = 20000
% 0.91/1.27 substype = eqrewr
% 0.91/1.27 backwardsubs = 1
% 0.91/1.27 selectoldest = 5
% 0.91/1.27
% 0.91/1.27 litorderings [0] = split
% 0.91/1.27 litorderings [1] = extend the termordering, first sorting on arguments
% 0.91/1.27
% 0.91/1.27 termordering = kbo
% 0.91/1.27
% 0.91/1.27 litapriori = 0
% 0.91/1.27 termapriori = 1
% 0.91/1.27 litaposteriori = 0
% 0.91/1.27 termaposteriori = 0
% 0.91/1.27 demodaposteriori = 0
% 0.91/1.27 ordereqreflfact = 0
% 0.91/1.27
% 0.91/1.27 litselect = negord
% 0.91/1.27
% 0.91/1.27 maxweight = 15
% 0.91/1.27 maxdepth = 30000
% 0.91/1.27 maxlength = 115
% 0.91/1.27 maxnrvars = 195
% 0.91/1.27 excuselevel = 1
% 0.91/1.27 increasemaxweight = 1
% 0.91/1.27
% 0.91/1.27 maxselected = 10000000
% 0.91/1.27 maxnrclauses = 10000000
% 0.91/1.27
% 0.91/1.27 showgenerated = 0
% 0.91/1.27 showkept = 0
% 0.91/1.27 showselected = 0
% 0.91/1.27 showdeleted = 0
% 0.91/1.27 showresimp = 1
% 0.91/1.27 showstatus = 2000
% 0.91/1.27
% 0.91/1.27 prologoutput = 0
% 0.91/1.27 nrgoals = 5000000
% 0.91/1.27 totalproof = 1
% 0.91/1.27
% 0.91/1.27 Symbols occurring in the translation:
% 0.91/1.27
% 0.91/1.27 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.91/1.27 . [1, 2] (w:1, o:29, a:1, s:1, b:0),
% 0.91/1.27 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.91/1.27 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.91/1.27 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.91/1.27 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.91/1.27 in [37, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.91/1.27 empty [38, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.91/1.27 relation [39, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.91/1.27 relation_dom_restriction [40, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.91/1.27 element [41, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.91/1.27 powerset [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.91/1.27 empty_set [43, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.91/1.27 relation_dom [44, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.91/1.27 relation_rng [45, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.91/1.27 subset [46, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.91/1.27 skol1 [48, 1] (w:1, o:26, a:1, s:1, b:1),
% 0.91/1.27 skol2 [49, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.91/1.27 skol3 [50, 1] (w:1, o:27, a:1, s:1, b:1),
% 0.91/1.27 skol4 [51, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.91/1.27 skol5 [52, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.91/1.27 skol6 [53, 1] (w:1, o:28, a:1, s:1, b:1),
% 0.91/1.27 skol7 [54, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.91/1.27 skol8 [55, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.91/1.27 skol9 [56, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.91/1.27
% 0.91/1.27
% 0.91/1.27 Starting Search:
% 0.91/1.27
% 0.91/1.27 *** allocated 15000 integers for clauses
% 0.91/1.27 *** allocated 22500 integers for clauses
% 0.91/1.27 *** allocated 33750 integers for clauses
% 0.91/1.27 *** allocated 50625 integers for clauses
% 0.91/1.27 *** allocated 15000 integers for termspace/termends
% 0.91/1.27 *** allocated 75937 integers for clauses
% 0.91/1.27 Resimplifying inuse:
% 0.91/1.27 Done
% 0.91/1.27
% 0.91/1.27 *** allocated 22500 integers for termspace/termends
% 0.91/1.27 *** allocated 113905 integers for clauses
% 0.91/1.27 *** allocated 33750 integers for termspace/termends
% 0.91/1.27
% 0.91/1.27 Intermediate Status:
% 0.91/1.27 Generated: 9912
% 0.91/1.27 Kept: 2005
% 0.91/1.27 Inuse: 296
% 0.91/1.27 Deleted: 84
% 0.91/1.27 Deletedinuse: 32
% 0.91/1.27
% 0.91/1.27 Resimplifying inuse:
% 0.91/1.27 Done
% 0.91/1.27
% 0.91/1.27 *** allocated 170857 integers for clauses
% 0.91/1.27 *** allocated 50625 integers for termspace/termends
% 0.91/1.27 Resimplifying inuse:
% 0.91/1.27 Done
% 0.91/1.27
% 0.91/1.27 *** allocated 256285 integers for clauses
% 0.91/1.27
% 0.91/1.27 Intermediate Status:
% 0.91/1.27 Generated: 29266
% 0.91/1.27 Kept: 4005
% 0.91/1.27 Inuse: 505
% 0.91/1.27 Deleted: 125
% 0.91/1.27 Deletedinuse: 39
% 0.91/1.27
% 0.91/1.27 Resimplifying inuse:
% 0.91/1.27 Done
% 0.91/1.27
% 0.91/1.27 *** allocated 75937 integers for termspace/termends
% 0.91/1.27
% 0.91/1.27 Bliksems!, er is een bewijs:
% 0.91/1.27 % SZS status Theorem
% 0.91/1.27 % SZS output start Refutation
% 0.91/1.27
% 0.91/1.27 (3) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 0.91/1.27 relation_dom_restriction( X, Y ) ) }.
% 0.91/1.27 (27) {G0,W12,D3,L4,V2,M4} I { ! relation( X ), ! relation( Y ), ! subset( X
% 0.91/1.27 , Y ), subset( relation_rng( X ), relation_rng( Y ) ) }.
% 0.91/1.27 (35) {G0,W7,D3,L2,V2,M2} I { ! relation( X ), subset(
% 0.91/1.27 relation_dom_restriction( X, Y ), X ) }.
% 0.91/1.27 (37) {G0,W2,D2,L1,V0,M1} I { relation( skol8 ) }.
% 0.91/1.27 (38) {G0,W7,D4,L1,V0,M1} I { ! subset( relation_rng(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ) ), relation_rng( skol8 ) ) }.
% 0.91/1.27 (47) {G1,W4,D3,L1,V1,M1} R(3,37) { relation( relation_dom_restriction(
% 0.91/1.27 skol8, X ) ) }.
% 0.91/1.27 (187) {G2,W14,D4,L3,V2,M3} R(27,47) { ! relation( X ), ! subset(
% 0.91/1.27 relation_dom_restriction( skol8, Y ), X ), subset( relation_rng(
% 0.91/1.27 relation_dom_restriction( skol8, Y ) ), relation_rng( X ) ) }.
% 0.91/1.27 (349) {G1,W5,D3,L1,V1,M1} R(35,37) { subset( relation_dom_restriction(
% 0.91/1.27 skol8, X ), skol8 ) }.
% 0.91/1.27 (4163) {G3,W5,D3,L1,V0,M1} R(187,38);r(37) { ! subset(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ), skol8 ) }.
% 0.91/1.27 (4169) {G4,W0,D0,L0,V0,M0} S(4163);r(349) { }.
% 0.91/1.27
% 0.91/1.27
% 0.91/1.27 % SZS output end Refutation
% 0.91/1.27 found a proof!
% 0.91/1.27
% 0.91/1.27
% 0.91/1.27 Unprocessed initial clauses:
% 0.91/1.27
% 0.91/1.27 (4171) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.91/1.27 (4172) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 0.91/1.27 (4173) {G0,W1,D1,L1,V0,M1} { && }.
% 0.91/1.27 (4174) {G0,W1,D1,L1,V0,M1} { && }.
% 0.91/1.27 (4175) {G0,W1,D1,L1,V0,M1} { && }.
% 0.91/1.27 (4176) {G0,W1,D1,L1,V0,M1} { && }.
% 0.91/1.27 (4177) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 0.91/1.27 relation_dom_restriction( X, Y ) ) }.
% 0.91/1.27 (4178) {G0,W1,D1,L1,V0,M1} { && }.
% 0.91/1.27 (4179) {G0,W4,D3,L1,V1,M1} { element( skol1( X ), X ) }.
% 0.91/1.27 (4180) {G0,W3,D3,L1,V1,M1} { ! empty( powerset( X ) ) }.
% 0.91/1.27 (4181) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.91/1.27 (4182) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.91/1.27 (4183) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.91/1.27 (4184) {G0,W7,D3,L3,V1,M3} { empty( X ), ! relation( X ), ! empty(
% 0.91/1.27 relation_dom( X ) ) }.
% 0.91/1.27 (4185) {G0,W7,D3,L3,V1,M3} { empty( X ), ! relation( X ), ! empty(
% 0.91/1.27 relation_rng( X ) ) }.
% 0.91/1.27 (4186) {G0,W5,D3,L2,V1,M2} { ! empty( X ), empty( relation_dom( X ) ) }.
% 0.91/1.27 (4187) {G0,W5,D3,L2,V1,M2} { ! empty( X ), relation( relation_dom( X ) )
% 0.91/1.27 }.
% 0.91/1.27 (4188) {G0,W5,D3,L2,V1,M2} { ! empty( X ), empty( relation_rng( X ) ) }.
% 0.91/1.27 (4189) {G0,W5,D3,L2,V1,M2} { ! empty( X ), relation( relation_rng( X ) )
% 0.91/1.27 }.
% 0.91/1.27 (4190) {G0,W2,D2,L1,V0,M1} { empty( skol2 ) }.
% 0.91/1.27 (4191) {G0,W2,D2,L1,V0,M1} { relation( skol2 ) }.
% 0.91/1.27 (4192) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol3( Y ) ) }.
% 0.91/1.27 (4193) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol3( X ), powerset( X
% 0.91/1.27 ) ) }.
% 0.91/1.27 (4194) {G0,W2,D2,L1,V0,M1} { empty( skol4 ) }.
% 0.91/1.27 (4195) {G0,W2,D2,L1,V0,M1} { ! empty( skol5 ) }.
% 0.91/1.27 (4196) {G0,W2,D2,L1,V0,M1} { relation( skol5 ) }.
% 0.91/1.27 (4197) {G0,W3,D3,L1,V1,M1} { empty( skol6( Y ) ) }.
% 0.91/1.27 (4198) {G0,W5,D3,L1,V1,M1} { element( skol6( X ), powerset( X ) ) }.
% 0.91/1.27 (4199) {G0,W2,D2,L1,V0,M1} { ! empty( skol7 ) }.
% 0.91/1.27 (4200) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.91/1.27 (4201) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.91/1.27 (4202) {G0,W12,D3,L4,V2,M4} { ! relation( X ), ! relation( Y ), ! subset(
% 0.91/1.27 X, Y ), subset( relation_dom( X ), relation_dom( Y ) ) }.
% 0.91/1.27 (4203) {G0,W12,D3,L4,V2,M4} { ! relation( X ), ! relation( Y ), ! subset(
% 0.91/1.27 X, Y ), subset( relation_rng( X ), relation_rng( Y ) ) }.
% 0.91/1.27 (4204) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.91/1.27 (4205) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.91/1.27 }.
% 0.91/1.27 (4206) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.91/1.27 }.
% 0.91/1.27 (4207) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) )
% 0.91/1.27 , element( X, Y ) }.
% 0.91/1.27 (4208) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) ),
% 0.91/1.27 ! empty( Z ) }.
% 0.91/1.27 (4209) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.91/1.27 (4210) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.91/1.27 (4211) {G0,W7,D3,L2,V2,M2} { ! relation( X ), subset(
% 0.91/1.27 relation_dom_restriction( X, Y ), X ) }.
% 0.91/1.27 (4212) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.91/1.27 (4213) {G0,W2,D2,L1,V0,M1} { relation( skol8 ) }.
% 0.91/1.27 (4214) {G0,W7,D4,L1,V0,M1} { ! subset( relation_rng(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ) ), relation_rng( skol8 ) ) }.
% 0.91/1.27
% 0.91/1.27
% 0.91/1.27 Total Proof:
% 0.91/1.27
% 0.91/1.27 subsumption: (3) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 0.91/1.27 relation_dom_restriction( X, Y ) ) }.
% 0.91/1.27 parent0: (4177) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 0.91/1.27 relation_dom_restriction( X, Y ) ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 X := X
% 0.91/1.27 Y := Y
% 0.91/1.27 end
% 0.91/1.27 permutation0:
% 0.91/1.27 0 ==> 0
% 0.91/1.27 1 ==> 1
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 subsumption: (27) {G0,W12,D3,L4,V2,M4} I { ! relation( X ), ! relation( Y )
% 0.91/1.27 , ! subset( X, Y ), subset( relation_rng( X ), relation_rng( Y ) ) }.
% 0.91/1.27 parent0: (4203) {G0,W12,D3,L4,V2,M4} { ! relation( X ), ! relation( Y ), !
% 0.91/1.27 subset( X, Y ), subset( relation_rng( X ), relation_rng( Y ) ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 X := X
% 0.91/1.27 Y := Y
% 0.91/1.27 end
% 0.91/1.27 permutation0:
% 0.91/1.27 0 ==> 0
% 0.91/1.27 1 ==> 1
% 0.91/1.27 2 ==> 2
% 0.91/1.27 3 ==> 3
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 subsumption: (35) {G0,W7,D3,L2,V2,M2} I { ! relation( X ), subset(
% 0.91/1.27 relation_dom_restriction( X, Y ), X ) }.
% 0.91/1.27 parent0: (4211) {G0,W7,D3,L2,V2,M2} { ! relation( X ), subset(
% 0.91/1.27 relation_dom_restriction( X, Y ), X ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 X := X
% 0.91/1.27 Y := Y
% 0.91/1.27 end
% 0.91/1.27 permutation0:
% 0.91/1.27 0 ==> 0
% 0.91/1.27 1 ==> 1
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 subsumption: (37) {G0,W2,D2,L1,V0,M1} I { relation( skol8 ) }.
% 0.91/1.27 parent0: (4213) {G0,W2,D2,L1,V0,M1} { relation( skol8 ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 end
% 0.91/1.27 permutation0:
% 0.91/1.27 0 ==> 0
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 subsumption: (38) {G0,W7,D4,L1,V0,M1} I { ! subset( relation_rng(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ) ), relation_rng( skol8 ) ) }.
% 0.91/1.27 parent0: (4214) {G0,W7,D4,L1,V0,M1} { ! subset( relation_rng(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ) ), relation_rng( skol8 ) ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 end
% 0.91/1.27 permutation0:
% 0.91/1.27 0 ==> 0
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 resolution: (4233) {G1,W4,D3,L1,V1,M1} { relation(
% 0.91/1.27 relation_dom_restriction( skol8, X ) ) }.
% 0.91/1.27 parent0[0]: (3) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 0.91/1.27 relation_dom_restriction( X, Y ) ) }.
% 0.91/1.27 parent1[0]: (37) {G0,W2,D2,L1,V0,M1} I { relation( skol8 ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 X := skol8
% 0.91/1.27 Y := X
% 0.91/1.27 end
% 0.91/1.27 substitution1:
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 subsumption: (47) {G1,W4,D3,L1,V1,M1} R(3,37) { relation(
% 0.91/1.27 relation_dom_restriction( skol8, X ) ) }.
% 0.91/1.27 parent0: (4233) {G1,W4,D3,L1,V1,M1} { relation( relation_dom_restriction(
% 0.91/1.27 skol8, X ) ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 X := X
% 0.91/1.27 end
% 0.91/1.27 permutation0:
% 0.91/1.27 0 ==> 0
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 resolution: (4234) {G1,W14,D4,L3,V2,M3} { ! relation( Y ), ! subset(
% 0.91/1.27 relation_dom_restriction( skol8, X ), Y ), subset( relation_rng(
% 0.91/1.27 relation_dom_restriction( skol8, X ) ), relation_rng( Y ) ) }.
% 0.91/1.27 parent0[0]: (27) {G0,W12,D3,L4,V2,M4} I { ! relation( X ), ! relation( Y )
% 0.91/1.27 , ! subset( X, Y ), subset( relation_rng( X ), relation_rng( Y ) ) }.
% 0.91/1.27 parent1[0]: (47) {G1,W4,D3,L1,V1,M1} R(3,37) { relation(
% 0.91/1.27 relation_dom_restriction( skol8, X ) ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 X := relation_dom_restriction( skol8, X )
% 0.91/1.27 Y := Y
% 0.91/1.27 end
% 0.91/1.27 substitution1:
% 0.91/1.27 X := X
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 subsumption: (187) {G2,W14,D4,L3,V2,M3} R(27,47) { ! relation( X ), !
% 0.91/1.27 subset( relation_dom_restriction( skol8, Y ), X ), subset( relation_rng(
% 0.91/1.27 relation_dom_restriction( skol8, Y ) ), relation_rng( X ) ) }.
% 0.91/1.27 parent0: (4234) {G1,W14,D4,L3,V2,M3} { ! relation( Y ), ! subset(
% 0.91/1.27 relation_dom_restriction( skol8, X ), Y ), subset( relation_rng(
% 0.91/1.27 relation_dom_restriction( skol8, X ) ), relation_rng( Y ) ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 X := Y
% 0.91/1.27 Y := X
% 0.91/1.27 end
% 0.91/1.27 permutation0:
% 0.91/1.27 0 ==> 0
% 0.91/1.27 1 ==> 1
% 0.91/1.27 2 ==> 2
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 resolution: (4236) {G1,W5,D3,L1,V1,M1} { subset( relation_dom_restriction
% 0.91/1.27 ( skol8, X ), skol8 ) }.
% 0.91/1.27 parent0[0]: (35) {G0,W7,D3,L2,V2,M2} I { ! relation( X ), subset(
% 0.91/1.27 relation_dom_restriction( X, Y ), X ) }.
% 0.91/1.27 parent1[0]: (37) {G0,W2,D2,L1,V0,M1} I { relation( skol8 ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 X := skol8
% 0.91/1.27 Y := X
% 0.91/1.27 end
% 0.91/1.27 substitution1:
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 subsumption: (349) {G1,W5,D3,L1,V1,M1} R(35,37) { subset(
% 0.91/1.27 relation_dom_restriction( skol8, X ), skol8 ) }.
% 0.91/1.27 parent0: (4236) {G1,W5,D3,L1,V1,M1} { subset( relation_dom_restriction(
% 0.91/1.27 skol8, X ), skol8 ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 X := X
% 0.91/1.27 end
% 0.91/1.27 permutation0:
% 0.91/1.27 0 ==> 0
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 resolution: (4237) {G1,W7,D3,L2,V0,M2} { ! relation( skol8 ), ! subset(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ), skol8 ) }.
% 0.91/1.27 parent0[0]: (38) {G0,W7,D4,L1,V0,M1} I { ! subset( relation_rng(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ) ), relation_rng( skol8 ) ) }.
% 0.91/1.27 parent1[2]: (187) {G2,W14,D4,L3,V2,M3} R(27,47) { ! relation( X ), ! subset
% 0.91/1.27 ( relation_dom_restriction( skol8, Y ), X ), subset( relation_rng(
% 0.91/1.27 relation_dom_restriction( skol8, Y ) ), relation_rng( X ) ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 end
% 0.91/1.27 substitution1:
% 0.91/1.27 X := skol8
% 0.91/1.27 Y := skol9
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 resolution: (4238) {G1,W5,D3,L1,V0,M1} { ! subset(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ), skol8 ) }.
% 0.91/1.27 parent0[0]: (4237) {G1,W7,D3,L2,V0,M2} { ! relation( skol8 ), ! subset(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ), skol8 ) }.
% 0.91/1.27 parent1[0]: (37) {G0,W2,D2,L1,V0,M1} I { relation( skol8 ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 end
% 0.91/1.27 substitution1:
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 subsumption: (4163) {G3,W5,D3,L1,V0,M1} R(187,38);r(37) { ! subset(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ), skol8 ) }.
% 0.91/1.27 parent0: (4238) {G1,W5,D3,L1,V0,M1} { ! subset( relation_dom_restriction(
% 0.91/1.27 skol8, skol9 ), skol8 ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 end
% 0.91/1.27 permutation0:
% 0.91/1.27 0 ==> 0
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 resolution: (4239) {G2,W0,D0,L0,V0,M0} { }.
% 0.91/1.27 parent0[0]: (4163) {G3,W5,D3,L1,V0,M1} R(187,38);r(37) { ! subset(
% 0.91/1.27 relation_dom_restriction( skol8, skol9 ), skol8 ) }.
% 0.91/1.27 parent1[0]: (349) {G1,W5,D3,L1,V1,M1} R(35,37) { subset(
% 0.91/1.27 relation_dom_restriction( skol8, X ), skol8 ) }.
% 0.91/1.27 substitution0:
% 0.91/1.27 end
% 0.91/1.27 substitution1:
% 0.91/1.27 X := skol9
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 subsumption: (4169) {G4,W0,D0,L0,V0,M0} S(4163);r(349) { }.
% 0.91/1.27 parent0: (4239) {G2,W0,D0,L0,V0,M0} { }.
% 0.91/1.27 substitution0:
% 0.91/1.27 end
% 0.91/1.27 permutation0:
% 0.91/1.27 end
% 0.91/1.27
% 0.91/1.27 Proof check complete!
% 0.91/1.27
% 0.91/1.27 Memory use:
% 0.91/1.27
% 0.91/1.27 space for terms: 51205
% 0.91/1.27 space for clauses: 198980
% 0.91/1.27
% 0.91/1.27
% 0.91/1.27 clauses generated: 31940
% 0.91/1.27 clauses kept: 4170
% 0.91/1.27 clauses selected: 529
% 0.91/1.27 clauses deleted: 135
% 0.91/1.27 clauses inuse deleted: 42
% 0.91/1.27
% 0.91/1.27 subsentry: 86342
% 0.91/1.27 literals s-matched: 62557
% 0.91/1.27 literals matched: 58629
% 0.91/1.27 full subsumption: 6037
% 0.91/1.27
% 0.91/1.27 checksum: 1682047226
% 0.91/1.27
% 0.91/1.27
% 0.91/1.27 Bliksem ended
%------------------------------------------------------------------------------