TSTP Solution File: SET602+4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET602+4 : TPTP v8.1.0. Released v2.2.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 : Mon Jul 18 22:50:38 EDT 2022
% Result : Theorem 0.45s 1.08s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET602+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Sat Jul 9 20:28:32 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.45/1.08 *** allocated 10000 integers for termspace/termends
% 0.45/1.08 *** allocated 10000 integers for clauses
% 0.45/1.08 *** allocated 10000 integers for justifications
% 0.45/1.08 Bliksem 1.12
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 Automatic Strategy Selection
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 Clauses:
% 0.45/1.08
% 0.45/1.08 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.45/1.08 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.45/1.08 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.45/1.08 { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.45/1.08 { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.45/1.08 { ! subset( X, Y ), ! subset( Y, X ), equal_set( X, Y ) }.
% 0.45/1.08 { ! member( X, power_set( Y ) ), subset( X, Y ) }.
% 0.45/1.08 { ! subset( X, Y ), member( X, power_set( Y ) ) }.
% 0.45/1.08 { ! member( X, intersection( Y, Z ) ), member( X, Y ) }.
% 0.45/1.08 { ! member( X, intersection( Y, Z ) ), member( X, Z ) }.
% 0.45/1.08 { ! member( X, Y ), ! member( X, Z ), member( X, intersection( Y, Z ) ) }.
% 0.45/1.08 { ! member( X, union( Y, Z ) ), member( X, Y ), member( X, Z ) }.
% 0.45/1.08 { ! member( X, Y ), member( X, union( Y, Z ) ) }.
% 0.45/1.08 { ! member( X, Z ), member( X, union( Y, Z ) ) }.
% 0.45/1.08 { ! member( X, empty_set ) }.
% 0.45/1.08 { ! member( X, difference( Z, Y ) ), member( X, Z ) }.
% 0.45/1.08 { ! member( X, difference( Z, Y ) ), ! member( X, Y ) }.
% 0.45/1.08 { ! member( X, Z ), member( X, Y ), member( X, difference( Z, Y ) ) }.
% 0.45/1.08 { ! member( X, singleton( Y ) ), X = Y }.
% 0.45/1.08 { ! X = Y, member( X, singleton( Y ) ) }.
% 0.45/1.08 { ! member( X, unordered_pair( Y, Z ) ), X = Y, X = Z }.
% 0.45/1.08 { ! X = Y, member( X, unordered_pair( Y, Z ) ) }.
% 0.45/1.08 { ! X = Z, member( X, unordered_pair( Y, Z ) ) }.
% 0.45/1.08 { ! member( X, sum( Y ) ), member( skol2( Z, Y ), Y ) }.
% 0.45/1.08 { ! member( X, sum( Y ) ), member( X, skol2( X, Y ) ) }.
% 0.45/1.08 { ! member( Z, Y ), ! member( X, Z ), member( X, sum( Y ) ) }.
% 0.45/1.08 { ! member( X, product( Y ) ), ! member( Z, Y ), member( X, Z ) }.
% 0.45/1.08 { member( skol3( Z, Y ), Y ), member( X, product( Y ) ) }.
% 0.45/1.08 { ! member( X, skol3( X, Y ) ), member( X, product( Y ) ) }.
% 0.45/1.08 { ! equal_set( difference( skol4, skol4 ), empty_set ) }.
% 0.45/1.08
% 0.45/1.08 percentage equality = 0.090909, percentage horn = 0.833333
% 0.45/1.08 This is a problem with some equality
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 Options Used:
% 0.45/1.08
% 0.45/1.08 useres = 1
% 0.45/1.08 useparamod = 1
% 0.45/1.08 useeqrefl = 1
% 0.45/1.08 useeqfact = 1
% 0.45/1.08 usefactor = 1
% 0.45/1.08 usesimpsplitting = 0
% 0.45/1.08 usesimpdemod = 5
% 0.45/1.08 usesimpres = 3
% 0.45/1.08
% 0.45/1.08 resimpinuse = 1000
% 0.45/1.08 resimpclauses = 20000
% 0.45/1.08 substype = eqrewr
% 0.45/1.08 backwardsubs = 1
% 0.45/1.08 selectoldest = 5
% 0.45/1.08
% 0.45/1.08 litorderings [0] = split
% 0.45/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.45/1.08
% 0.45/1.08 termordering = kbo
% 0.45/1.08
% 0.45/1.08 litapriori = 0
% 0.45/1.08 termapriori = 1
% 0.45/1.08 litaposteriori = 0
% 0.45/1.08 termaposteriori = 0
% 0.45/1.08 demodaposteriori = 0
% 0.45/1.08 ordereqreflfact = 0
% 0.45/1.08
% 0.45/1.08 litselect = negord
% 0.45/1.08
% 0.45/1.08 maxweight = 15
% 0.45/1.08 maxdepth = 30000
% 0.45/1.08 maxlength = 115
% 0.45/1.08 maxnrvars = 195
% 0.45/1.08 excuselevel = 1
% 0.45/1.08 increasemaxweight = 1
% 0.45/1.08
% 0.45/1.08 maxselected = 10000000
% 0.45/1.08 maxnrclauses = 10000000
% 0.45/1.08
% 0.45/1.08 showgenerated = 0
% 0.45/1.08 showkept = 0
% 0.45/1.08 showselected = 0
% 0.45/1.08 showdeleted = 0
% 0.45/1.08 showresimp = 1
% 0.45/1.08 showstatus = 2000
% 0.45/1.08
% 0.45/1.08 prologoutput = 0
% 0.45/1.08 nrgoals = 5000000
% 0.45/1.08 totalproof = 1
% 0.45/1.08
% 0.45/1.08 Symbols occurring in the translation:
% 0.45/1.08
% 0.45/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.08 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.45/1.08 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.45/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.08 subset [37, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.45/1.08 member [39, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.45/1.08 equal_set [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.45/1.08 power_set [41, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.45/1.08 intersection [42, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.45/1.08 union [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.45/1.08 empty_set [44, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.45/1.08 difference [46, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.45/1.08 singleton [47, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.45/1.08 unordered_pair [48, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.45/1.08 sum [49, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.45/1.08 product [51, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.45/1.08 skol1 [52, 2] (w:1, o:53, a:1, s:1, b:1),
% 0.45/1.08 skol2 [53, 2] (w:1, o:54, a:1, s:1, b:1),
% 0.45/1.08 skol3 [54, 2] (w:1, o:55, a:1, s:1, b:1),
% 0.45/1.08 skol4 [55, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 Starting Search:
% 0.45/1.08
% 0.45/1.08 *** allocated 15000 integers for clauses
% 0.45/1.08 *** allocated 22500 integers for clauses
% 0.45/1.08 *** allocated 33750 integers for clauses
% 0.45/1.08
% 0.45/1.08 Bliksems!, er is een bewijs:
% 0.45/1.08 % SZS status Theorem
% 0.45/1.08 % SZS output start Refutation
% 0.45/1.08
% 0.45/1.08 (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.45/1.08 (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X ), equal_set(
% 0.45/1.08 X, Y ) }.
% 0.45/1.08 (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.45/1.08 (15) {G0,W8,D3,L2,V3,M2} I { ! member( X, difference( Z, Y ) ), member( X,
% 0.45/1.08 Z ) }.
% 0.45/1.08 (16) {G0,W8,D3,L2,V3,M2} I { ! member( X, difference( Z, Y ) ), ! member( X
% 0.45/1.08 , Y ) }.
% 0.45/1.08 (29) {G0,W5,D3,L1,V0,M1} I { ! equal_set( difference( skol4, skol4 ),
% 0.45/1.08 empty_set ) }.
% 0.45/1.08 (67) {G1,W3,D2,L1,V1,M1} R(2,14) { subset( empty_set, X ) }.
% 0.45/1.08 (77) {G2,W5,D3,L1,V0,M1} R(5,29);r(67) { ! subset( difference( skol4, skol4
% 0.45/1.08 ), empty_set ) }.
% 0.45/1.08 (411) {G1,W10,D3,L2,V4,M2} R(16,15) { ! member( X, difference( Y, Z ) ), !
% 0.45/1.08 member( X, difference( Z, T ) ) }.
% 0.45/1.08 (439) {G2,W5,D3,L1,V2,M1} F(411) { ! member( X, difference( Y, Y ) ) }.
% 0.45/1.08 (445) {G3,W5,D3,L1,V2,M1} R(439,2) { subset( difference( X, X ), Y ) }.
% 0.45/1.08 (450) {G4,W0,D0,L0,V0,M0} R(445,77) { }.
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 % SZS output end Refutation
% 0.45/1.08 found a proof!
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 Unprocessed initial clauses:
% 0.45/1.08
% 0.45/1.08 (452) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.45/1.08 , Y ) }.
% 0.45/1.08 (453) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.45/1.08 }.
% 0.45/1.08 (454) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.45/1.08 (455) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.45/1.08 (456) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.45/1.08 (457) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), equal_set
% 0.45/1.08 ( X, Y ) }.
% 0.45/1.08 (458) {G0,W7,D3,L2,V2,M2} { ! member( X, power_set( Y ) ), subset( X, Y )
% 0.45/1.08 }.
% 0.45/1.08 (459) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), member( X, power_set( Y ) )
% 0.45/1.08 }.
% 0.45/1.08 (460) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member( X
% 0.45/1.08 , Y ) }.
% 0.45/1.08 (461) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member( X
% 0.45/1.08 , Z ) }.
% 0.45/1.08 (462) {G0,W11,D3,L3,V3,M3} { ! member( X, Y ), ! member( X, Z ), member( X
% 0.45/1.08 , intersection( Y, Z ) ) }.
% 0.45/1.08 (463) {G0,W11,D3,L3,V3,M3} { ! member( X, union( Y, Z ) ), member( X, Y )
% 0.45/1.08 , member( X, Z ) }.
% 0.45/1.08 (464) {G0,W8,D3,L2,V3,M2} { ! member( X, Y ), member( X, union( Y, Z ) )
% 0.45/1.08 }.
% 0.45/1.08 (465) {G0,W8,D3,L2,V3,M2} { ! member( X, Z ), member( X, union( Y, Z ) )
% 0.45/1.08 }.
% 0.45/1.08 (466) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.45/1.08 (467) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), member( X,
% 0.45/1.08 Z ) }.
% 0.45/1.08 (468) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), ! member( X
% 0.45/1.08 , Y ) }.
% 0.45/1.08 (469) {G0,W11,D3,L3,V3,M3} { ! member( X, Z ), member( X, Y ), member( X,
% 0.45/1.08 difference( Z, Y ) ) }.
% 0.45/1.08 (470) {G0,W7,D3,L2,V2,M2} { ! member( X, singleton( Y ) ), X = Y }.
% 0.45/1.08 (471) {G0,W7,D3,L2,V2,M2} { ! X = Y, member( X, singleton( Y ) ) }.
% 0.45/1.08 (472) {G0,W11,D3,L3,V3,M3} { ! member( X, unordered_pair( Y, Z ) ), X = Y
% 0.45/1.08 , X = Z }.
% 0.45/1.08 (473) {G0,W8,D3,L2,V3,M2} { ! X = Y, member( X, unordered_pair( Y, Z ) )
% 0.45/1.08 }.
% 0.45/1.08 (474) {G0,W8,D3,L2,V3,M2} { ! X = Z, member( X, unordered_pair( Y, Z ) )
% 0.45/1.08 }.
% 0.45/1.08 (475) {G0,W9,D3,L2,V3,M2} { ! member( X, sum( Y ) ), member( skol2( Z, Y )
% 0.45/1.08 , Y ) }.
% 0.45/1.08 (476) {G0,W9,D3,L2,V2,M2} { ! member( X, sum( Y ) ), member( X, skol2( X,
% 0.45/1.08 Y ) ) }.
% 0.45/1.08 (477) {G0,W10,D3,L3,V3,M3} { ! member( Z, Y ), ! member( X, Z ), member( X
% 0.45/1.08 , sum( Y ) ) }.
% 0.45/1.08 (478) {G0,W10,D3,L3,V3,M3} { ! member( X, product( Y ) ), ! member( Z, Y )
% 0.45/1.08 , member( X, Z ) }.
% 0.45/1.08 (479) {G0,W9,D3,L2,V3,M2} { member( skol3( Z, Y ), Y ), member( X, product
% 0.45/1.08 ( Y ) ) }.
% 0.45/1.08 (480) {G0,W9,D3,L2,V2,M2} { ! member( X, skol3( X, Y ) ), member( X,
% 0.45/1.08 product( Y ) ) }.
% 0.45/1.08 (481) {G0,W5,D3,L1,V0,M1} { ! equal_set( difference( skol4, skol4 ),
% 0.45/1.08 empty_set ) }.
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 Total Proof:
% 0.45/1.08
% 0.45/1.08 subsumption: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.45/1.08 ( X, Y ) }.
% 0.45/1.08 parent0: (454) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X
% 0.45/1.08 , Y ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 Y := Y
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 1 ==> 1
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.45/1.08 , equal_set( X, Y ) }.
% 0.45/1.08 parent0: (457) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ),
% 0.45/1.08 equal_set( X, Y ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 Y := Y
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 1 ==> 1
% 0.45/1.08 2 ==> 2
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.45/1.08 parent0: (466) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (15) {G0,W8,D3,L2,V3,M2} I { ! member( X, difference( Z, Y ) )
% 0.45/1.08 , member( X, Z ) }.
% 0.45/1.08 parent0: (467) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ),
% 0.45/1.08 member( X, Z ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 Y := Y
% 0.45/1.08 Z := Z
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 1 ==> 1
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (16) {G0,W8,D3,L2,V3,M2} I { ! member( X, difference( Z, Y ) )
% 0.45/1.08 , ! member( X, Y ) }.
% 0.45/1.08 parent0: (468) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), !
% 0.45/1.08 member( X, Y ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 Y := Y
% 0.45/1.08 Z := Z
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 1 ==> 1
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (29) {G0,W5,D3,L1,V0,M1} I { ! equal_set( difference( skol4,
% 0.45/1.08 skol4 ), empty_set ) }.
% 0.45/1.08 parent0: (481) {G0,W5,D3,L1,V0,M1} { ! equal_set( difference( skol4, skol4
% 0.45/1.08 ), empty_set ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 resolution: (505) {G1,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 0.45/1.08 parent0[0]: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.45/1.08 parent1[0]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.45/1.08 ( X, Y ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := skol1( empty_set, X )
% 0.45/1.08 end
% 0.45/1.08 substitution1:
% 0.45/1.08 X := empty_set
% 0.45/1.08 Y := X
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (67) {G1,W3,D2,L1,V1,M1} R(2,14) { subset( empty_set, X ) }.
% 0.45/1.08 parent0: (505) {G1,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 resolution: (506) {G1,W10,D3,L2,V0,M2} { ! subset( difference( skol4,
% 0.45/1.08 skol4 ), empty_set ), ! subset( empty_set, difference( skol4, skol4 ) )
% 0.45/1.08 }.
% 0.45/1.08 parent0[0]: (29) {G0,W5,D3,L1,V0,M1} I { ! equal_set( difference( skol4,
% 0.45/1.08 skol4 ), empty_set ) }.
% 0.45/1.08 parent1[2]: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.45/1.08 , equal_set( X, Y ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 end
% 0.45/1.08 substitution1:
% 0.45/1.08 X := difference( skol4, skol4 )
% 0.45/1.08 Y := empty_set
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 resolution: (507) {G2,W5,D3,L1,V0,M1} { ! subset( difference( skol4, skol4
% 0.45/1.08 ), empty_set ) }.
% 0.45/1.08 parent0[1]: (506) {G1,W10,D3,L2,V0,M2} { ! subset( difference( skol4,
% 0.45/1.08 skol4 ), empty_set ), ! subset( empty_set, difference( skol4, skol4 ) )
% 0.45/1.08 }.
% 0.45/1.08 parent1[0]: (67) {G1,W3,D2,L1,V1,M1} R(2,14) { subset( empty_set, X ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 end
% 0.45/1.08 substitution1:
% 0.45/1.08 X := difference( skol4, skol4 )
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (77) {G2,W5,D3,L1,V0,M1} R(5,29);r(67) { ! subset( difference
% 0.45/1.08 ( skol4, skol4 ), empty_set ) }.
% 0.45/1.08 parent0: (507) {G2,W5,D3,L1,V0,M1} { ! subset( difference( skol4, skol4 )
% 0.45/1.08 , empty_set ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 resolution: (509) {G1,W10,D3,L2,V4,M2} { ! member( X, difference( Y, Z ) )
% 0.45/1.08 , ! member( X, difference( Z, T ) ) }.
% 0.45/1.08 parent0[1]: (16) {G0,W8,D3,L2,V3,M2} I { ! member( X, difference( Z, Y ) )
% 0.45/1.08 , ! member( X, Y ) }.
% 0.45/1.08 parent1[1]: (15) {G0,W8,D3,L2,V3,M2} I { ! member( X, difference( Z, Y ) )
% 0.45/1.08 , member( X, Z ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 Y := Z
% 0.45/1.08 Z := Y
% 0.45/1.08 end
% 0.45/1.08 substitution1:
% 0.45/1.08 X := X
% 0.45/1.08 Y := T
% 0.45/1.08 Z := Z
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (411) {G1,W10,D3,L2,V4,M2} R(16,15) { ! member( X, difference
% 0.45/1.08 ( Y, Z ) ), ! member( X, difference( Z, T ) ) }.
% 0.45/1.08 parent0: (509) {G1,W10,D3,L2,V4,M2} { ! member( X, difference( Y, Z ) ), !
% 0.45/1.08 member( X, difference( Z, T ) ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 Y := Y
% 0.45/1.08 Z := Z
% 0.45/1.08 T := T
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 1 ==> 1
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 factor: (511) {G1,W5,D3,L1,V2,M1} { ! member( X, difference( Y, Y ) ) }.
% 0.45/1.08 parent0[0, 1]: (411) {G1,W10,D3,L2,V4,M2} R(16,15) { ! member( X,
% 0.45/1.08 difference( Y, Z ) ), ! member( X, difference( Z, T ) ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 Y := Y
% 0.45/1.08 Z := Y
% 0.45/1.08 T := Y
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (439) {G2,W5,D3,L1,V2,M1} F(411) { ! member( X, difference( Y
% 0.45/1.08 , Y ) ) }.
% 0.45/1.08 parent0: (511) {G1,W5,D3,L1,V2,M1} { ! member( X, difference( Y, Y ) ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 Y := Y
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 resolution: (512) {G1,W5,D3,L1,V2,M1} { subset( difference( X, X ), Y )
% 0.45/1.08 }.
% 0.45/1.08 parent0[0]: (439) {G2,W5,D3,L1,V2,M1} F(411) { ! member( X, difference( Y,
% 0.45/1.08 Y ) ) }.
% 0.45/1.08 parent1[0]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.45/1.08 ( X, Y ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := skol1( difference( X, X ), Y )
% 0.45/1.08 Y := X
% 0.45/1.08 end
% 0.45/1.08 substitution1:
% 0.45/1.08 X := difference( X, X )
% 0.45/1.08 Y := Y
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (445) {G3,W5,D3,L1,V2,M1} R(439,2) { subset( difference( X, X
% 0.45/1.08 ), Y ) }.
% 0.45/1.08 parent0: (512) {G1,W5,D3,L1,V2,M1} { subset( difference( X, X ), Y ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 X := X
% 0.45/1.08 Y := Y
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 0 ==> 0
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 resolution: (513) {G3,W0,D0,L0,V0,M0} { }.
% 0.45/1.08 parent0[0]: (77) {G2,W5,D3,L1,V0,M1} R(5,29);r(67) { ! subset( difference(
% 0.45/1.08 skol4, skol4 ), empty_set ) }.
% 0.45/1.08 parent1[0]: (445) {G3,W5,D3,L1,V2,M1} R(439,2) { subset( difference( X, X )
% 0.45/1.08 , Y ) }.
% 0.45/1.08 substitution0:
% 0.45/1.08 end
% 0.45/1.08 substitution1:
% 0.45/1.08 X := skol4
% 0.45/1.08 Y := empty_set
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 subsumption: (450) {G4,W0,D0,L0,V0,M0} R(445,77) { }.
% 0.45/1.08 parent0: (513) {G3,W0,D0,L0,V0,M0} { }.
% 0.45/1.08 substitution0:
% 0.45/1.08 end
% 0.45/1.08 permutation0:
% 0.45/1.08 end
% 0.45/1.08
% 0.45/1.08 Proof check complete!
% 0.45/1.08
% 0.45/1.08 Memory use:
% 0.45/1.08
% 0.45/1.08 space for terms: 5349
% 0.45/1.08 space for clauses: 23652
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 clauses generated: 685
% 0.45/1.08 clauses kept: 451
% 0.45/1.08 clauses selected: 70
% 0.45/1.08 clauses deleted: 3
% 0.45/1.08 clauses inuse deleted: 0
% 0.45/1.08
% 0.45/1.08 subsentry: 1141
% 0.45/1.08 literals s-matched: 758
% 0.45/1.08 literals matched: 758
% 0.45/1.08 full subsumption: 181
% 0.45/1.08
% 0.45/1.08 checksum: 799418085
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 Bliksem ended
%------------------------------------------------------------------------------