TSTP Solution File: SET588+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET588+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n012.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:29 EDT 2022
% Result : Theorem 0.72s 1.09s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET588+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Sat Jul 9 20:57:28 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.72/1.09 *** allocated 10000 integers for termspace/termends
% 0.72/1.09 *** allocated 10000 integers for clauses
% 0.72/1.09 *** allocated 10000 integers for justifications
% 0.72/1.09 Bliksem 1.12
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Automatic Strategy Selection
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Clauses:
% 0.72/1.09
% 0.72/1.09 { ! member( Z, difference( X, Y ) ), member( Z, X ) }.
% 0.72/1.09 { ! member( Z, difference( X, Y ) ), ! member( Z, Y ) }.
% 0.72/1.09 { ! member( Z, X ), member( Z, Y ), member( Z, difference( X, Y ) ) }.
% 0.72/1.09 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.72/1.09 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.72/1.09 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.72/1.09 { subset( X, X ) }.
% 0.72/1.09 { subset( skol2, skol3 ) }.
% 0.72/1.09 { ! subset( difference( skol2, skol4 ), difference( skol3, skol4 ) ) }.
% 0.72/1.09
% 0.72/1.09 percentage equality = 0.000000, percentage horn = 0.777778
% 0.72/1.09 This a non-horn, non-equality problem
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Options Used:
% 0.72/1.09
% 0.72/1.09 useres = 1
% 0.72/1.09 useparamod = 0
% 0.72/1.09 useeqrefl = 0
% 0.72/1.09 useeqfact = 0
% 0.72/1.09 usefactor = 1
% 0.72/1.09 usesimpsplitting = 0
% 0.72/1.09 usesimpdemod = 0
% 0.72/1.09 usesimpres = 3
% 0.72/1.09
% 0.72/1.09 resimpinuse = 1000
% 0.72/1.09 resimpclauses = 20000
% 0.72/1.09 substype = standard
% 0.72/1.09 backwardsubs = 1
% 0.72/1.09 selectoldest = 5
% 0.72/1.09
% 0.72/1.09 litorderings [0] = split
% 0.72/1.09 litorderings [1] = liftord
% 0.72/1.09
% 0.72/1.09 termordering = none
% 0.72/1.09
% 0.72/1.09 litapriori = 1
% 0.72/1.09 termapriori = 0
% 0.72/1.09 litaposteriori = 0
% 0.72/1.09 termaposteriori = 0
% 0.72/1.09 demodaposteriori = 0
% 0.72/1.09 ordereqreflfact = 0
% 0.72/1.09
% 0.72/1.09 litselect = none
% 0.72/1.09
% 0.72/1.09 maxweight = 15
% 0.72/1.09 maxdepth = 30000
% 0.72/1.09 maxlength = 115
% 0.72/1.09 maxnrvars = 195
% 0.72/1.09 excuselevel = 1
% 0.72/1.09 increasemaxweight = 1
% 0.72/1.09
% 0.72/1.09 maxselected = 10000000
% 0.72/1.09 maxnrclauses = 10000000
% 0.72/1.09
% 0.72/1.09 showgenerated = 0
% 0.72/1.09 showkept = 0
% 0.72/1.09 showselected = 0
% 0.72/1.09 showdeleted = 0
% 0.72/1.09 showresimp = 1
% 0.72/1.09 showstatus = 2000
% 0.72/1.09
% 0.72/1.09 prologoutput = 0
% 0.72/1.09 nrgoals = 5000000
% 0.72/1.09 totalproof = 1
% 0.72/1.09
% 0.72/1.09 Symbols occurring in the translation:
% 0.72/1.09
% 0.72/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.09 . [1, 2] (w:1, o:17, a:1, s:1, b:0),
% 0.72/1.09 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.72/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.09 difference [38, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.72/1.09 member [39, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.72/1.09 subset [40, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.72/1.09 skol1 [41, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.72/1.09 skol2 [42, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.72/1.09 skol3 [43, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.72/1.09 skol4 [44, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Starting Search:
% 0.72/1.09
% 0.72/1.09 *** allocated 15000 integers for clauses
% 0.72/1.09 *** allocated 22500 integers for clauses
% 0.72/1.09 *** allocated 33750 integers for clauses
% 0.72/1.09 *** allocated 50625 integers for clauses
% 0.72/1.09
% 0.72/1.09 Bliksems!, er is een bewijs:
% 0.72/1.09 % SZS status Theorem
% 0.72/1.09 % SZS output start Refutation
% 0.72/1.09
% 0.72/1.09 (0) {G0,W8,D3,L2,V3,M2} I { member( Z, X ), ! member( Z, difference( X, Y )
% 0.72/1.09 ) }.
% 0.72/1.09 (1) {G0,W8,D3,L2,V3,M2} I { ! member( Z, Y ), ! member( Z, difference( X, Y
% 0.72/1.09 ) ) }.
% 0.72/1.09 (2) {G0,W11,D3,L3,V3,M3} I { member( Z, Y ), member( Z, difference( X, Y )
% 0.72/1.09 ), ! member( Z, X ) }.
% 0.72/1.09 (3) {G0,W9,D2,L3,V3,M1} I { ! member( Z, X ), member( Z, Y ), ! subset( X,
% 0.72/1.09 Y ) }.
% 0.72/1.09 (4) {G0,W8,D3,L2,V3,M1} I { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.72/1.09 }.
% 0.72/1.09 (5) {G0,W8,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.72/1.09 (7) {G0,W3,D2,L1,V0,M1} I { subset( skol2, skol3 ) }.
% 0.72/1.09 (8) {G0,W7,D3,L1,V0,M1} I { ! subset( difference( skol2, skol4 ),
% 0.72/1.09 difference( skol3, skol4 ) ) }.
% 0.72/1.09 (9) {G1,W9,D4,L1,V1,M1} R(4,8) { ! member( skol1( X, difference( skol3,
% 0.72/1.09 skol4 ) ), difference( skol3, skol4 ) ) }.
% 0.72/1.09 (16) {G1,W11,D4,L1,V0,M1} R(5,8) { member( skol1( difference( skol2, skol4
% 0.72/1.09 ), difference( skol3, skol4 ) ), difference( skol2, skol4 ) ) }.
% 0.72/1.09 (19) {G1,W6,D2,L2,V1,M1} R(3,7) { ! member( X, skol2 ), member( X, skol3 )
% 0.72/1.09 }.
% 0.72/1.09 (38) {G2,W14,D4,L2,V1,M1} R(9,2) { ! member( skol1( X, difference( skol3,
% 0.72/1.09 skol4 ) ), skol3 ), member( skol1( X, difference( skol3, skol4 ) ), skol4
% 0.72/1.09 ) }.
% 0.72/1.09 (102) {G2,W9,D4,L1,V0,M1} R(16,0) { member( skol1( difference( skol2, skol4
% 0.72/1.09 ), difference( skol3, skol4 ) ), skol2 ) }.
% 0.72/1.09 (104) {G2,W9,D4,L1,V0,M1} R(16,1) { ! member( skol1( difference( skol2,
% 0.72/1.09 skol4 ), difference( skol3, skol4 ) ), skol4 ) }.
% 0.72/1.09 (684) {G3,W9,D4,L1,V0,M1} R(38,104) { ! member( skol1( difference( skol2,
% 0.72/1.09 skol4 ), difference( skol3, skol4 ) ), skol3 ) }.
% 0.72/1.09 (692) {G4,W0,D0,L0,V0,M0} R(684,19);r(102) { }.
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 % SZS output end Refutation
% 0.72/1.09 found a proof!
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Unprocessed initial clauses:
% 0.72/1.09
% 0.72/1.09 (694) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), member( Z,
% 0.72/1.09 X ) }.
% 0.72/1.09 (695) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), ! member( Z
% 0.72/1.09 , Y ) }.
% 0.72/1.09 (696) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), member( Z, Y ), member( Z,
% 0.72/1.09 difference( X, Y ) ) }.
% 0.72/1.09 (697) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.72/1.09 , Y ) }.
% 0.72/1.09 (698) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.72/1.09 }.
% 0.72/1.09 (699) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.72/1.09 (700) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.72/1.09 (701) {G0,W3,D2,L1,V0,M1} { subset( skol2, skol3 ) }.
% 0.72/1.09 (702) {G0,W7,D3,L1,V0,M1} { ! subset( difference( skol2, skol4 ),
% 0.72/1.09 difference( skol3, skol4 ) ) }.
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Total Proof:
% 0.72/1.09
% 0.72/1.09 subsumption: (0) {G0,W8,D3,L2,V3,M2} I { member( Z, X ), ! member( Z,
% 0.72/1.09 difference( X, Y ) ) }.
% 0.72/1.09 parent0: (694) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ),
% 0.72/1.09 member( Z, X ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 Y := Y
% 0.72/1.09 Z := Z
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 1
% 0.72/1.09 1 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (1) {G0,W8,D3,L2,V3,M2} I { ! member( Z, Y ), ! member( Z,
% 0.72/1.09 difference( X, Y ) ) }.
% 0.72/1.09 parent0: (695) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), !
% 0.72/1.09 member( Z, Y ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 Y := Y
% 0.72/1.09 Z := Z
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 1
% 0.72/1.09 1 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (2) {G0,W11,D3,L3,V3,M3} I { member( Z, Y ), member( Z,
% 0.72/1.09 difference( X, Y ) ), ! member( Z, X ) }.
% 0.72/1.09 parent0: (696) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), member( Z, Y ),
% 0.72/1.09 member( Z, difference( X, Y ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 Y := Y
% 0.72/1.09 Z := Z
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 2
% 0.72/1.09 1 ==> 0
% 0.72/1.09 2 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (3) {G0,W9,D2,L3,V3,M1} I { ! member( Z, X ), member( Z, Y ),
% 0.72/1.09 ! subset( X, Y ) }.
% 0.72/1.09 parent0: (697) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ),
% 0.72/1.09 member( Z, Y ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 Y := Y
% 0.72/1.09 Z := Z
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 2
% 0.72/1.09 1 ==> 0
% 0.72/1.09 2 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (4) {G0,W8,D3,L2,V3,M1} I { ! member( skol1( Z, Y ), Y ),
% 0.72/1.09 subset( X, Y ) }.
% 0.72/1.09 parent0: (698) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset
% 0.72/1.09 ( X, Y ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 Y := Y
% 0.72/1.09 Z := Z
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (5) {G0,W8,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), subset
% 0.72/1.09 ( X, Y ) }.
% 0.72/1.09 parent0: (699) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X
% 0.72/1.09 , Y ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 Y := Y
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (7) {G0,W3,D2,L1,V0,M1} I { subset( skol2, skol3 ) }.
% 0.72/1.09 parent0: (701) {G0,W3,D2,L1,V0,M1} { subset( skol2, skol3 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (8) {G0,W7,D3,L1,V0,M1} I { ! subset( difference( skol2, skol4
% 0.72/1.09 ), difference( skol3, skol4 ) ) }.
% 0.72/1.09 parent0: (702) {G0,W7,D3,L1,V0,M1} { ! subset( difference( skol2, skol4 )
% 0.72/1.09 , difference( skol3, skol4 ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (703) {G1,W9,D4,L1,V1,M1} { ! member( skol1( X, difference(
% 0.72/1.09 skol3, skol4 ) ), difference( skol3, skol4 ) ) }.
% 0.72/1.09 parent0[0]: (8) {G0,W7,D3,L1,V0,M1} I { ! subset( difference( skol2, skol4
% 0.72/1.09 ), difference( skol3, skol4 ) ) }.
% 0.72/1.09 parent1[1]: (4) {G0,W8,D3,L2,V3,M1} I { ! member( skol1( Z, Y ), Y ),
% 0.72/1.09 subset( X, Y ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 X := difference( skol2, skol4 )
% 0.72/1.09 Y := difference( skol3, skol4 )
% 0.72/1.09 Z := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (9) {G1,W9,D4,L1,V1,M1} R(4,8) { ! member( skol1( X,
% 0.72/1.09 difference( skol3, skol4 ) ), difference( skol3, skol4 ) ) }.
% 0.72/1.09 parent0: (703) {G1,W9,D4,L1,V1,M1} { ! member( skol1( X, difference( skol3
% 0.72/1.09 , skol4 ) ), difference( skol3, skol4 ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (704) {G1,W11,D4,L1,V0,M1} { member( skol1( difference( skol2
% 0.72/1.09 , skol4 ), difference( skol3, skol4 ) ), difference( skol2, skol4 ) ) }.
% 0.72/1.09 parent0[0]: (8) {G0,W7,D3,L1,V0,M1} I { ! subset( difference( skol2, skol4
% 0.72/1.09 ), difference( skol3, skol4 ) ) }.
% 0.72/1.09 parent1[1]: (5) {G0,W8,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), subset
% 0.72/1.09 ( X, Y ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 X := difference( skol2, skol4 )
% 0.72/1.09 Y := difference( skol3, skol4 )
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (16) {G1,W11,D4,L1,V0,M1} R(5,8) { member( skol1( difference(
% 0.72/1.09 skol2, skol4 ), difference( skol3, skol4 ) ), difference( skol2, skol4 )
% 0.72/1.09 ) }.
% 0.72/1.09 parent0: (704) {G1,W11,D4,L1,V0,M1} { member( skol1( difference( skol2,
% 0.72/1.09 skol4 ), difference( skol3, skol4 ) ), difference( skol2, skol4 ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (705) {G1,W6,D2,L2,V1,M2} { ! member( X, skol2 ), member( X,
% 0.72/1.09 skol3 ) }.
% 0.72/1.09 parent0[2]: (3) {G0,W9,D2,L3,V3,M1} I { ! member( Z, X ), member( Z, Y ), !
% 0.72/1.09 subset( X, Y ) }.
% 0.72/1.09 parent1[0]: (7) {G0,W3,D2,L1,V0,M1} I { subset( skol2, skol3 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := skol2
% 0.72/1.09 Y := skol3
% 0.72/1.09 Z := X
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (19) {G1,W6,D2,L2,V1,M1} R(3,7) { ! member( X, skol2 ), member
% 0.72/1.09 ( X, skol3 ) }.
% 0.72/1.09 parent0: (705) {G1,W6,D2,L2,V1,M2} { ! member( X, skol2 ), member( X,
% 0.72/1.09 skol3 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (707) {G1,W14,D4,L2,V1,M2} { member( skol1( X, difference(
% 0.72/1.09 skol3, skol4 ) ), skol4 ), ! member( skol1( X, difference( skol3, skol4 )
% 0.72/1.09 ), skol3 ) }.
% 0.72/1.09 parent0[0]: (9) {G1,W9,D4,L1,V1,M1} R(4,8) { ! member( skol1( X, difference
% 0.72/1.09 ( skol3, skol4 ) ), difference( skol3, skol4 ) ) }.
% 0.72/1.09 parent1[1]: (2) {G0,W11,D3,L3,V3,M3} I { member( Z, Y ), member( Z,
% 0.72/1.09 difference( X, Y ) ), ! member( Z, X ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 X := skol3
% 0.72/1.09 Y := skol4
% 0.72/1.09 Z := skol1( X, difference( skol3, skol4 ) )
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (38) {G2,W14,D4,L2,V1,M1} R(9,2) { ! member( skol1( X,
% 0.72/1.09 difference( skol3, skol4 ) ), skol3 ), member( skol1( X, difference(
% 0.72/1.09 skol3, skol4 ) ), skol4 ) }.
% 0.72/1.09 parent0: (707) {G1,W14,D4,L2,V1,M2} { member( skol1( X, difference( skol3
% 0.72/1.09 , skol4 ) ), skol4 ), ! member( skol1( X, difference( skol3, skol4 ) ),
% 0.72/1.09 skol3 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 1
% 0.72/1.09 1 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (708) {G1,W9,D4,L1,V0,M1} { member( skol1( difference( skol2,
% 0.72/1.09 skol4 ), difference( skol3, skol4 ) ), skol2 ) }.
% 0.72/1.09 parent0[1]: (0) {G0,W8,D3,L2,V3,M2} I { member( Z, X ), ! member( Z,
% 0.72/1.09 difference( X, Y ) ) }.
% 0.72/1.09 parent1[0]: (16) {G1,W11,D4,L1,V0,M1} R(5,8) { member( skol1( difference(
% 0.72/1.09 skol2, skol4 ), difference( skol3, skol4 ) ), difference( skol2, skol4 )
% 0.72/1.09 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := skol2
% 0.72/1.09 Y := skol4
% 0.72/1.09 Z := skol1( difference( skol2, skol4 ), difference( skol3, skol4 ) )
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (102) {G2,W9,D4,L1,V0,M1} R(16,0) { member( skol1( difference
% 0.72/1.09 ( skol2, skol4 ), difference( skol3, skol4 ) ), skol2 ) }.
% 0.72/1.09 parent0: (708) {G1,W9,D4,L1,V0,M1} { member( skol1( difference( skol2,
% 0.72/1.09 skol4 ), difference( skol3, skol4 ) ), skol2 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 *** allocated 15000 integers for termspace/termends
% 0.72/1.09 resolution: (710) {G1,W9,D4,L1,V0,M1} { ! member( skol1( difference( skol2
% 0.72/1.09 , skol4 ), difference( skol3, skol4 ) ), skol4 ) }.
% 0.72/1.09 parent0[1]: (1) {G0,W8,D3,L2,V3,M2} I { ! member( Z, Y ), ! member( Z,
% 0.72/1.09 difference( X, Y ) ) }.
% 0.72/1.09 parent1[0]: (16) {G1,W11,D4,L1,V0,M1} R(5,8) { member( skol1( difference(
% 0.72/1.09 skol2, skol4 ), difference( skol3, skol4 ) ), difference( skol2, skol4 )
% 0.72/1.09 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := skol2
% 0.72/1.09 Y := skol4
% 0.72/1.09 Z := skol1( difference( skol2, skol4 ), difference( skol3, skol4 ) )
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (104) {G2,W9,D4,L1,V0,M1} R(16,1) { ! member( skol1(
% 0.72/1.09 difference( skol2, skol4 ), difference( skol3, skol4 ) ), skol4 ) }.
% 0.72/1.09 parent0: (710) {G1,W9,D4,L1,V0,M1} { ! member( skol1( difference( skol2,
% 0.72/1.09 skol4 ), difference( skol3, skol4 ) ), skol4 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (711) {G3,W9,D4,L1,V0,M1} { ! member( skol1( difference( skol2
% 0.72/1.09 , skol4 ), difference( skol3, skol4 ) ), skol3 ) }.
% 0.72/1.09 parent0[0]: (104) {G2,W9,D4,L1,V0,M1} R(16,1) { ! member( skol1( difference
% 0.72/1.09 ( skol2, skol4 ), difference( skol3, skol4 ) ), skol4 ) }.
% 0.72/1.09 parent1[1]: (38) {G2,W14,D4,L2,V1,M1} R(9,2) { ! member( skol1( X,
% 0.72/1.09 difference( skol3, skol4 ) ), skol3 ), member( skol1( X, difference(
% 0.72/1.09 skol3, skol4 ) ), skol4 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 X := difference( skol2, skol4 )
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (684) {G3,W9,D4,L1,V0,M1} R(38,104) { ! member( skol1(
% 0.72/1.09 difference( skol2, skol4 ), difference( skol3, skol4 ) ), skol3 ) }.
% 0.72/1.09 parent0: (711) {G3,W9,D4,L1,V0,M1} { ! member( skol1( difference( skol2,
% 0.72/1.09 skol4 ), difference( skol3, skol4 ) ), skol3 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (712) {G2,W9,D4,L1,V0,M1} { ! member( skol1( difference( skol2
% 0.72/1.09 , skol4 ), difference( skol3, skol4 ) ), skol2 ) }.
% 0.72/1.09 parent0[0]: (684) {G3,W9,D4,L1,V0,M1} R(38,104) { ! member( skol1(
% 0.72/1.09 difference( skol2, skol4 ), difference( skol3, skol4 ) ), skol3 ) }.
% 0.72/1.09 parent1[1]: (19) {G1,W6,D2,L2,V1,M1} R(3,7) { ! member( X, skol2 ), member
% 0.72/1.09 ( X, skol3 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 X := skol1( difference( skol2, skol4 ), difference( skol3, skol4 ) )
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (713) {G3,W0,D0,L0,V0,M0} { }.
% 0.72/1.09 parent0[0]: (712) {G2,W9,D4,L1,V0,M1} { ! member( skol1( difference( skol2
% 0.72/1.09 , skol4 ), difference( skol3, skol4 ) ), skol2 ) }.
% 0.72/1.09 parent1[0]: (102) {G2,W9,D4,L1,V0,M1} R(16,0) { member( skol1( difference(
% 0.72/1.09 skol2, skol4 ), difference( skol3, skol4 ) ), skol2 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (692) {G4,W0,D0,L0,V0,M0} R(684,19);r(102) { }.
% 0.72/1.09 parent0: (713) {G3,W0,D0,L0,V0,M0} { }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 Proof check complete!
% 0.72/1.09
% 0.72/1.09 Memory use:
% 0.72/1.09
% 0.72/1.09 space for terms: 9816
% 0.72/1.09 space for clauses: 36237
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 clauses generated: 3315
% 0.72/1.09 clauses kept: 693
% 0.72/1.09 clauses selected: 101
% 0.72/1.09 clauses deleted: 1
% 0.72/1.09 clauses inuse deleted: 0
% 0.72/1.09
% 0.72/1.09 subsentry: 8165
% 0.72/1.09 literals s-matched: 3725
% 0.72/1.09 literals matched: 3558
% 0.72/1.09 full subsumption: 1251
% 0.72/1.09
% 0.72/1.09 checksum: 1793596149
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Bliksem ended
%------------------------------------------------------------------------------