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