TSTP Solution File: SET063+4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET063+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Mon Jul 18 22:46:23 EDT 2022
% Result : Theorem 0.42s 1.07s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET063+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Sun Jul 10 10:01:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.07 *** allocated 10000 integers for termspace/termends
% 0.42/1.07 *** allocated 10000 integers for clauses
% 0.42/1.07 *** allocated 10000 integers for justifications
% 0.42/1.07 Bliksem 1.12
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Automatic Strategy Selection
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Clauses:
% 0.42/1.07
% 0.42/1.07 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.42/1.07 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.42/1.07 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.42/1.07 { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.42/1.07 { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.42/1.07 { ! subset( X, Y ), ! subset( Y, X ), equal_set( X, Y ) }.
% 0.42/1.07 { ! member( X, power_set( Y ) ), subset( X, Y ) }.
% 0.42/1.07 { ! subset( X, Y ), member( X, power_set( Y ) ) }.
% 0.42/1.07 { ! member( X, intersection( Y, Z ) ), member( X, Y ) }.
% 0.42/1.07 { ! member( X, intersection( Y, Z ) ), member( X, Z ) }.
% 0.42/1.07 { ! member( X, Y ), ! member( X, Z ), member( X, intersection( Y, Z ) ) }.
% 0.42/1.07 { ! member( X, union( Y, Z ) ), member( X, Y ), member( X, Z ) }.
% 0.42/1.07 { ! member( X, Y ), member( X, union( Y, Z ) ) }.
% 0.42/1.07 { ! member( X, Z ), member( X, union( Y, Z ) ) }.
% 0.42/1.07 { ! member( X, empty_set ) }.
% 0.42/1.07 { ! member( X, difference( Z, Y ) ), member( X, Z ) }.
% 0.42/1.07 { ! member( X, difference( Z, Y ) ), ! member( X, Y ) }.
% 0.42/1.07 { ! member( X, Z ), member( X, Y ), member( X, difference( Z, Y ) ) }.
% 0.42/1.07 { ! member( X, singleton( Y ) ), X = Y }.
% 0.42/1.07 { ! X = Y, member( X, singleton( Y ) ) }.
% 0.42/1.07 { ! member( X, unordered_pair( Y, Z ) ), X = Y, X = Z }.
% 0.42/1.07 { ! X = Y, member( X, unordered_pair( Y, Z ) ) }.
% 0.42/1.07 { ! X = Z, member( X, unordered_pair( Y, Z ) ) }.
% 0.42/1.07 { ! member( X, sum( Y ) ), member( skol2( Z, Y ), Y ) }.
% 0.42/1.07 { ! member( X, sum( Y ) ), member( X, skol2( X, Y ) ) }.
% 0.42/1.07 { ! member( Z, Y ), ! member( X, Z ), member( X, sum( Y ) ) }.
% 0.42/1.07 { ! member( X, product( Y ) ), ! member( Z, Y ), member( X, Z ) }.
% 0.42/1.07 { member( skol3( Z, Y ), Y ), member( X, product( Y ) ) }.
% 0.42/1.07 { ! member( X, skol3( X, Y ) ), member( X, product( Y ) ) }.
% 0.42/1.07 { ! equal_set( intersection( skol4, empty_set ), empty_set ) }.
% 0.42/1.07
% 0.42/1.07 percentage equality = 0.090909, percentage horn = 0.833333
% 0.42/1.07 This is a problem with some equality
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Options Used:
% 0.42/1.07
% 0.42/1.07 useres = 1
% 0.42/1.07 useparamod = 1
% 0.42/1.07 useeqrefl = 1
% 0.42/1.07 useeqfact = 1
% 0.42/1.07 usefactor = 1
% 0.42/1.07 usesimpsplitting = 0
% 0.42/1.07 usesimpdemod = 5
% 0.42/1.07 usesimpres = 3
% 0.42/1.07
% 0.42/1.07 resimpinuse = 1000
% 0.42/1.07 resimpclauses = 20000
% 0.42/1.07 substype = eqrewr
% 0.42/1.07 backwardsubs = 1
% 0.42/1.07 selectoldest = 5
% 0.42/1.07
% 0.42/1.07 litorderings [0] = split
% 0.42/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.42/1.07
% 0.42/1.07 termordering = kbo
% 0.42/1.07
% 0.42/1.07 litapriori = 0
% 0.42/1.07 termapriori = 1
% 0.42/1.07 litaposteriori = 0
% 0.42/1.07 termaposteriori = 0
% 0.42/1.07 demodaposteriori = 0
% 0.42/1.07 ordereqreflfact = 0
% 0.42/1.07
% 0.42/1.07 litselect = negord
% 0.42/1.07
% 0.42/1.07 maxweight = 15
% 0.42/1.07 maxdepth = 30000
% 0.42/1.07 maxlength = 115
% 0.42/1.07 maxnrvars = 195
% 0.42/1.07 excuselevel = 1
% 0.42/1.07 increasemaxweight = 1
% 0.42/1.07
% 0.42/1.07 maxselected = 10000000
% 0.42/1.07 maxnrclauses = 10000000
% 0.42/1.07
% 0.42/1.07 showgenerated = 0
% 0.42/1.07 showkept = 0
% 0.42/1.07 showselected = 0
% 0.42/1.07 showdeleted = 0
% 0.42/1.07 showresimp = 1
% 0.42/1.07 showstatus = 2000
% 0.42/1.07
% 0.42/1.07 prologoutput = 0
% 0.42/1.07 nrgoals = 5000000
% 0.42/1.07 totalproof = 1
% 0.42/1.07
% 0.42/1.07 Symbols occurring in the translation:
% 0.42/1.07
% 0.42/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.07 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.42/1.07 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.42/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.07 subset [37, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.42/1.07 member [39, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.42/1.07 equal_set [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.42/1.07 power_set [41, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.42/1.07 intersection [42, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.42/1.07 union [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.42/1.07 empty_set [44, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.42/1.07 difference [46, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.42/1.07 singleton [47, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.07 unordered_pair [48, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.42/1.07 sum [49, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.42/1.07 product [51, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.42/1.07 skol1 [52, 2] (w:1, o:53, a:1, s:1, b:1),
% 0.42/1.07 skol2 [53, 2] (w:1, o:54, a:1, s:1, b:1),
% 0.42/1.07 skol3 [54, 2] (w:1, o:55, a:1, s:1, b:1),
% 0.42/1.07 skol4 [55, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Starting Search:
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Bliksems!, er is een bewijs:
% 0.42/1.07 % SZS status Theorem
% 0.42/1.07 % SZS output start Refutation
% 0.42/1.07
% 0.42/1.07 (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.42/1.07 (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X ), equal_set(
% 0.42/1.07 X, Y ) }.
% 0.42/1.07 (9) {G0,W8,D3,L2,V3,M2} I { ! member( X, intersection( Y, Z ) ), member( X
% 0.42/1.07 , Z ) }.
% 0.42/1.07 (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.42/1.07 (29) {G0,W5,D3,L1,V0,M1} I { ! equal_set( intersection( skol4, empty_set )
% 0.42/1.07 , empty_set ) }.
% 0.42/1.07 (67) {G1,W3,D2,L1,V1,M1} R(2,14) { subset( empty_set, X ) }.
% 0.42/1.07 (77) {G2,W5,D3,L1,V0,M1} R(5,29);r(67) { ! subset( intersection( skol4,
% 0.42/1.07 empty_set ), empty_set ) }.
% 0.42/1.07 (149) {G1,W5,D3,L1,V2,M1} R(9,14) { ! member( X, intersection( Y, empty_set
% 0.42/1.07 ) ) }.
% 0.42/1.07 (152) {G2,W5,D3,L1,V2,M1} R(149,2) { subset( intersection( X, empty_set ),
% 0.42/1.07 Y ) }.
% 0.42/1.07 (155) {G3,W0,D0,L0,V0,M0} R(152,77) { }.
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 % SZS output end Refutation
% 0.42/1.07 found a proof!
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Unprocessed initial clauses:
% 0.42/1.07
% 0.42/1.07 (157) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.42/1.07 , Y ) }.
% 0.42/1.07 (158) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.42/1.07 }.
% 0.42/1.07 (159) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.42/1.07 (160) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.42/1.07 (161) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.42/1.07 (162) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), equal_set
% 0.42/1.07 ( X, Y ) }.
% 0.42/1.07 (163) {G0,W7,D3,L2,V2,M2} { ! member( X, power_set( Y ) ), subset( X, Y )
% 0.42/1.07 }.
% 0.42/1.07 (164) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), member( X, power_set( Y ) )
% 0.42/1.07 }.
% 0.42/1.07 (165) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member( X
% 0.42/1.07 , Y ) }.
% 0.42/1.07 (166) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member( X
% 0.42/1.07 , Z ) }.
% 0.42/1.07 (167) {G0,W11,D3,L3,V3,M3} { ! member( X, Y ), ! member( X, Z ), member( X
% 0.42/1.07 , intersection( Y, Z ) ) }.
% 0.42/1.07 (168) {G0,W11,D3,L3,V3,M3} { ! member( X, union( Y, Z ) ), member( X, Y )
% 0.42/1.07 , member( X, Z ) }.
% 0.42/1.07 (169) {G0,W8,D3,L2,V3,M2} { ! member( X, Y ), member( X, union( Y, Z ) )
% 0.42/1.07 }.
% 0.42/1.07 (170) {G0,W8,D3,L2,V3,M2} { ! member( X, Z ), member( X, union( Y, Z ) )
% 0.42/1.07 }.
% 0.42/1.07 (171) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.42/1.07 (172) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), member( X,
% 0.42/1.07 Z ) }.
% 0.42/1.07 (173) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), ! member( X
% 0.42/1.07 , Y ) }.
% 0.42/1.07 (174) {G0,W11,D3,L3,V3,M3} { ! member( X, Z ), member( X, Y ), member( X,
% 0.42/1.07 difference( Z, Y ) ) }.
% 0.42/1.07 (175) {G0,W7,D3,L2,V2,M2} { ! member( X, singleton( Y ) ), X = Y }.
% 0.42/1.07 (176) {G0,W7,D3,L2,V2,M2} { ! X = Y, member( X, singleton( Y ) ) }.
% 0.42/1.07 (177) {G0,W11,D3,L3,V3,M3} { ! member( X, unordered_pair( Y, Z ) ), X = Y
% 0.42/1.07 , X = Z }.
% 0.42/1.07 (178) {G0,W8,D3,L2,V3,M2} { ! X = Y, member( X, unordered_pair( Y, Z ) )
% 0.42/1.07 }.
% 0.42/1.07 (179) {G0,W8,D3,L2,V3,M2} { ! X = Z, member( X, unordered_pair( Y, Z ) )
% 0.42/1.07 }.
% 0.42/1.07 (180) {G0,W9,D3,L2,V3,M2} { ! member( X, sum( Y ) ), member( skol2( Z, Y )
% 0.42/1.07 , Y ) }.
% 0.42/1.07 (181) {G0,W9,D3,L2,V2,M2} { ! member( X, sum( Y ) ), member( X, skol2( X,
% 0.42/1.07 Y ) ) }.
% 0.42/1.07 (182) {G0,W10,D3,L3,V3,M3} { ! member( Z, Y ), ! member( X, Z ), member( X
% 0.42/1.07 , sum( Y ) ) }.
% 0.42/1.07 (183) {G0,W10,D3,L3,V3,M3} { ! member( X, product( Y ) ), ! member( Z, Y )
% 0.42/1.07 , member( X, Z ) }.
% 0.42/1.07 (184) {G0,W9,D3,L2,V3,M2} { member( skol3( Z, Y ), Y ), member( X, product
% 0.42/1.07 ( Y ) ) }.
% 0.42/1.07 (185) {G0,W9,D3,L2,V2,M2} { ! member( X, skol3( X, Y ) ), member( X,
% 0.42/1.07 product( Y ) ) }.
% 0.42/1.07 (186) {G0,W5,D3,L1,V0,M1} { ! equal_set( intersection( skol4, empty_set )
% 0.42/1.07 , empty_set ) }.
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Total Proof:
% 0.42/1.07
% 0.42/1.07 subsumption: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.42/1.07 ( X, Y ) }.
% 0.42/1.07 parent0: (159) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X
% 0.42/1.07 , Y ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.42/1.07 , equal_set( X, Y ) }.
% 0.42/1.07 parent0: (162) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ),
% 0.42/1.07 equal_set( X, Y ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (9) {G0,W8,D3,L2,V3,M2} I { ! member( X, intersection( Y, Z )
% 0.42/1.07 ), member( X, Z ) }.
% 0.42/1.07 parent0: (166) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ),
% 0.42/1.07 member( X, Z ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 Z := Z
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.42/1.07 parent0: (171) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (29) {G0,W5,D3,L1,V0,M1} I { ! equal_set( intersection( skol4
% 0.42/1.07 , empty_set ), empty_set ) }.
% 0.42/1.07 parent0: (186) {G0,W5,D3,L1,V0,M1} { ! equal_set( intersection( skol4,
% 0.42/1.07 empty_set ), empty_set ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (205) {G1,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 0.42/1.07 parent0[0]: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.42/1.07 parent1[0]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.42/1.07 ( X, Y ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1( empty_set, X )
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := empty_set
% 0.42/1.07 Y := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (67) {G1,W3,D2,L1,V1,M1} R(2,14) { subset( empty_set, X ) }.
% 0.42/1.07 parent0: (205) {G1,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (206) {G1,W10,D3,L2,V0,M2} { ! subset( intersection( skol4,
% 0.42/1.07 empty_set ), empty_set ), ! subset( empty_set, intersection( skol4,
% 0.42/1.07 empty_set ) ) }.
% 0.42/1.07 parent0[0]: (29) {G0,W5,D3,L1,V0,M1} I { ! equal_set( intersection( skol4,
% 0.42/1.07 empty_set ), empty_set ) }.
% 0.42/1.07 parent1[2]: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.42/1.07 , equal_set( X, Y ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := intersection( skol4, empty_set )
% 0.42/1.07 Y := empty_set
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (207) {G2,W5,D3,L1,V0,M1} { ! subset( intersection( skol4,
% 0.42/1.07 empty_set ), empty_set ) }.
% 0.42/1.07 parent0[1]: (206) {G1,W10,D3,L2,V0,M2} { ! subset( intersection( skol4,
% 0.42/1.07 empty_set ), empty_set ), ! subset( empty_set, intersection( skol4,
% 0.42/1.07 empty_set ) ) }.
% 0.42/1.07 parent1[0]: (67) {G1,W3,D2,L1,V1,M1} R(2,14) { subset( empty_set, X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := intersection( skol4, empty_set )
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (77) {G2,W5,D3,L1,V0,M1} R(5,29);r(67) { ! subset(
% 0.42/1.07 intersection( skol4, empty_set ), empty_set ) }.
% 0.42/1.07 parent0: (207) {G2,W5,D3,L1,V0,M1} { ! subset( intersection( skol4,
% 0.42/1.07 empty_set ), empty_set ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (208) {G1,W5,D3,L1,V2,M1} { ! member( X, intersection( Y,
% 0.42/1.07 empty_set ) ) }.
% 0.42/1.07 parent0[0]: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.42/1.07 parent1[1]: (9) {G0,W8,D3,L2,V3,M2} I { ! member( X, intersection( Y, Z ) )
% 0.42/1.07 , member( X, Z ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 Z := empty_set
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (149) {G1,W5,D3,L1,V2,M1} R(9,14) { ! member( X, intersection
% 0.42/1.07 ( Y, empty_set ) ) }.
% 0.42/1.07 parent0: (208) {G1,W5,D3,L1,V2,M1} { ! member( X, intersection( Y,
% 0.42/1.07 empty_set ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (209) {G1,W5,D3,L1,V2,M1} { subset( intersection( X, empty_set
% 0.42/1.07 ), Y ) }.
% 0.42/1.07 parent0[0]: (149) {G1,W5,D3,L1,V2,M1} R(9,14) { ! member( X, intersection(
% 0.42/1.07 Y, empty_set ) ) }.
% 0.42/1.07 parent1[0]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.42/1.07 ( X, Y ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1( intersection( X, empty_set ), Y )
% 0.42/1.07 Y := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := intersection( X, empty_set )
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (152) {G2,W5,D3,L1,V2,M1} R(149,2) { subset( intersection( X,
% 0.42/1.07 empty_set ), Y ) }.
% 0.42/1.07 parent0: (209) {G1,W5,D3,L1,V2,M1} { subset( intersection( X, empty_set )
% 0.42/1.07 , Y ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (210) {G3,W0,D0,L0,V0,M0} { }.
% 0.42/1.07 parent0[0]: (77) {G2,W5,D3,L1,V0,M1} R(5,29);r(67) { ! subset( intersection
% 0.42/1.07 ( skol4, empty_set ), empty_set ) }.
% 0.42/1.07 parent1[0]: (152) {G2,W5,D3,L1,V2,M1} R(149,2) { subset( intersection( X,
% 0.42/1.07 empty_set ), Y ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := skol4
% 0.42/1.07 Y := empty_set
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (155) {G3,W0,D0,L0,V0,M0} R(152,77) { }.
% 0.42/1.07 parent0: (210) {G3,W0,D0,L0,V0,M0} { }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 Proof check complete!
% 0.42/1.07
% 0.42/1.07 Memory use:
% 0.42/1.07
% 0.42/1.07 space for terms: 1936
% 0.42/1.07 space for clauses: 8073
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 clauses generated: 245
% 0.42/1.07 clauses kept: 156
% 0.42/1.07 clauses selected: 42
% 0.42/1.07 clauses deleted: 1
% 0.42/1.07 clauses inuse deleted: 0
% 0.42/1.07
% 0.42/1.07 subsentry: 264
% 0.42/1.07 literals s-matched: 224
% 0.42/1.07 literals matched: 224
% 0.42/1.07 full subsumption: 47
% 0.42/1.07
% 0.42/1.07 checksum: 1554704732
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Bliksem ended
%------------------------------------------------------------------------------