TSTP Solution File: SET631+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n025.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:58 EDT 2022
% Result : Theorem 0.79s 1.17s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% 0.13/0.14 % Command : bliksem %s
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % DateTime : Sun Jul 10 00:01:16 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.79/1.17 *** allocated 10000 integers for termspace/termends
% 0.79/1.17 *** allocated 10000 integers for clauses
% 0.79/1.17 *** allocated 10000 integers for justifications
% 0.79/1.17 Bliksem 1.12
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Automatic Strategy Selection
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Clauses:
% 0.79/1.17
% 0.79/1.17 { ! member( Z, difference( X, Y ) ), member( Z, X ) }.
% 0.79/1.17 { ! member( Z, difference( X, Y ) ), ! member( Z, Y ) }.
% 0.79/1.17 { ! member( Z, X ), member( Z, Y ), member( Z, difference( X, Y ) ) }.
% 0.79/1.17 { ! intersect( X, Y ), member( skol1( Z, Y ), Y ) }.
% 0.79/1.17 { ! intersect( X, Y ), member( skol1( X, Y ), X ) }.
% 0.79/1.17 { ! member( Z, X ), ! member( Z, Y ), intersect( X, Y ) }.
% 0.79/1.17 { ! intersect( X, Y ), intersect( Y, X ) }.
% 0.79/1.17 { intersect( skol2, difference( skol3, skol4 ) ) }.
% 0.79/1.17 { ! intersect( skol2, skol3 ) }.
% 0.79/1.17
% 0.79/1.17 percentage equality = 0.000000, percentage horn = 0.888889
% 0.79/1.17 This a non-horn, non-equality problem
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Options Used:
% 0.79/1.17
% 0.79/1.17 useres = 1
% 0.79/1.17 useparamod = 0
% 0.79/1.17 useeqrefl = 0
% 0.79/1.17 useeqfact = 0
% 0.79/1.17 usefactor = 1
% 0.79/1.17 usesimpsplitting = 0
% 0.79/1.17 usesimpdemod = 0
% 0.79/1.17 usesimpres = 3
% 0.79/1.17
% 0.79/1.17 resimpinuse = 1000
% 0.79/1.17 resimpclauses = 20000
% 0.79/1.17 substype = standard
% 0.79/1.17 backwardsubs = 1
% 0.79/1.17 selectoldest = 5
% 0.79/1.17
% 0.79/1.17 litorderings [0] = split
% 0.79/1.17 litorderings [1] = liftord
% 0.79/1.17
% 0.79/1.17 termordering = none
% 0.79/1.17
% 0.79/1.17 litapriori = 1
% 0.79/1.17 termapriori = 0
% 0.79/1.17 litaposteriori = 0
% 0.79/1.17 termaposteriori = 0
% 0.79/1.17 demodaposteriori = 0
% 0.79/1.17 ordereqreflfact = 0
% 0.79/1.17
% 0.79/1.17 litselect = none
% 0.79/1.17
% 0.79/1.17 maxweight = 15
% 0.79/1.17 maxdepth = 30000
% 0.79/1.17 maxlength = 115
% 0.79/1.17 maxnrvars = 195
% 0.79/1.17 excuselevel = 1
% 0.79/1.17 increasemaxweight = 1
% 0.79/1.17
% 0.79/1.17 maxselected = 10000000
% 0.79/1.17 maxnrclauses = 10000000
% 0.79/1.17
% 0.79/1.17 showgenerated = 0
% 0.79/1.17 showkept = 0
% 0.79/1.17 showselected = 0
% 0.79/1.17 showdeleted = 0
% 0.79/1.17 showresimp = 1
% 0.79/1.17 showstatus = 2000
% 0.79/1.17
% 0.79/1.17 prologoutput = 0
% 0.79/1.17 nrgoals = 5000000
% 0.79/1.17 totalproof = 1
% 0.79/1.17
% 0.79/1.17 Symbols occurring in the translation:
% 0.79/1.17
% 0.79/1.17 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.79/1.17 . [1, 2] (w:1, o:17, a:1, s:1, b:0),
% 0.79/1.17 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.79/1.17 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.79/1.17 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.79/1.17 difference [38, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.79/1.17 member [39, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.79/1.17 intersect [40, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.79/1.17 skol1 [41, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.79/1.17 skol2 [42, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.79/1.17 skol3 [43, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.79/1.17 skol4 [44, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Starting Search:
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Bliksems!, er is een bewijs:
% 0.79/1.17 % SZS status Theorem
% 0.79/1.17 % SZS output start Refutation
% 0.79/1.17
% 0.79/1.17 (0) {G0,W8,D3,L2,V3,M2} I { member( Z, X ), ! member( Z, difference( X, Y )
% 0.79/1.17 ) }.
% 0.79/1.17 (3) {G0,W8,D3,L2,V3,M1} I { member( skol1( Z, Y ), Y ), ! intersect( X, Y )
% 0.79/1.17 }.
% 0.79/1.17 (4) {G0,W8,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), ! intersect( X, Y )
% 0.79/1.17 }.
% 0.79/1.17 (5) {G0,W9,D2,L3,V3,M1} I { ! member( Z, X ), ! member( Z, Y ), intersect(
% 0.79/1.17 X, Y ) }.
% 0.79/1.17 (6) {G0,W6,D2,L2,V2,M2} I { intersect( Y, X ), ! intersect( X, Y ) }.
% 0.79/1.17 (7) {G0,W5,D3,L1,V0,M1} I { intersect( skol2, difference( skol3, skol4 ) )
% 0.79/1.17 }.
% 0.79/1.17 (8) {G0,W3,D2,L1,V0,M1} I { ! intersect( skol2, skol3 ) }.
% 0.79/1.17 (11) {G1,W3,D2,L1,V0,M1} R(6,8) { ! intersect( skol3, skol2 ) }.
% 0.79/1.17 (16) {G1,W9,D4,L1,V1,M1} R(3,7) { member( skol1( X, difference( skol3,
% 0.79/1.17 skol4 ) ), difference( skol3, skol4 ) ) }.
% 0.79/1.17 (48) {G1,W7,D4,L1,V0,M1} R(4,7) { member( skol1( skol2, difference( skol3,
% 0.79/1.17 skol4 ) ), skol2 ) }.
% 0.79/1.17 (51) {G2,W6,D2,L2,V1,M1} R(5,11) { ! member( X, skol2 ), ! member( X, skol3
% 0.79/1.17 ) }.
% 0.79/1.17 (65) {G3,W8,D3,L2,V2,M1} R(51,0) { ! member( X, skol2 ), ! member( X,
% 0.79/1.17 difference( skol3, Y ) ) }.
% 0.79/1.17 (77) {G4,W7,D4,L1,V1,M1} R(16,65) { ! member( skol1( X, difference( skol3,
% 0.79/1.17 skol4 ) ), skol2 ) }.
% 0.79/1.17 (82) {G5,W0,D0,L0,V0,M0} R(77,48) { }.
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 % SZS output end Refutation
% 0.79/1.17 found a proof!
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Unprocessed initial clauses:
% 0.79/1.17
% 0.79/1.17 (84) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), member( Z, X
% 0.79/1.17 ) }.
% 0.79/1.17 (85) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), ! member( Z
% 0.79/1.17 , Y ) }.
% 0.79/1.17 (86) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), member( Z, Y ), member( Z,
% 0.79/1.17 difference( X, Y ) ) }.
% 0.79/1.17 (87) {G0,W8,D3,L2,V3,M2} { ! intersect( X, Y ), member( skol1( Z, Y ), Y )
% 0.79/1.17 }.
% 0.79/1.17 (88) {G0,W8,D3,L2,V2,M2} { ! intersect( X, Y ), member( skol1( X, Y ), X )
% 0.79/1.17 }.
% 0.79/1.17 (89) {G0,W9,D2,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ), intersect(
% 0.79/1.17 X, Y ) }.
% 0.79/1.17 (90) {G0,W6,D2,L2,V2,M2} { ! intersect( X, Y ), intersect( Y, X ) }.
% 0.79/1.17 (91) {G0,W5,D3,L1,V0,M1} { intersect( skol2, difference( skol3, skol4 ) )
% 0.79/1.17 }.
% 0.79/1.17 (92) {G0,W3,D2,L1,V0,M1} { ! intersect( skol2, skol3 ) }.
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Total Proof:
% 0.79/1.17
% 0.79/1.17 subsumption: (0) {G0,W8,D3,L2,V3,M2} I { member( Z, X ), ! member( Z,
% 0.79/1.17 difference( X, Y ) ) }.
% 0.79/1.17 parent0: (84) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ),
% 0.79/1.17 member( Z, X ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 Y := Y
% 0.79/1.17 Z := Z
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 1
% 0.79/1.17 1 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (3) {G0,W8,D3,L2,V3,M1} I { member( skol1( Z, Y ), Y ), !
% 0.79/1.17 intersect( X, Y ) }.
% 0.79/1.17 parent0: (87) {G0,W8,D3,L2,V3,M2} { ! intersect( X, Y ), member( skol1( Z
% 0.79/1.17 , Y ), Y ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 Y := Y
% 0.79/1.17 Z := Z
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 1
% 0.79/1.17 1 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (4) {G0,W8,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), !
% 0.79/1.17 intersect( X, Y ) }.
% 0.79/1.17 parent0: (88) {G0,W8,D3,L2,V2,M2} { ! intersect( X, Y ), member( skol1( X
% 0.79/1.17 , Y ), X ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 Y := Y
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 1
% 0.79/1.17 1 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (5) {G0,W9,D2,L3,V3,M1} I { ! member( Z, X ), ! member( Z, Y )
% 0.79/1.17 , intersect( X, Y ) }.
% 0.79/1.17 parent0: (89) {G0,W9,D2,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ),
% 0.79/1.17 intersect( X, Y ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 Y := Y
% 0.79/1.17 Z := Z
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 1 ==> 1
% 0.79/1.17 2 ==> 2
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (6) {G0,W6,D2,L2,V2,M2} I { intersect( Y, X ), ! intersect( X
% 0.79/1.17 , Y ) }.
% 0.79/1.17 parent0: (90) {G0,W6,D2,L2,V2,M2} { ! intersect( X, Y ), intersect( Y, X )
% 0.79/1.17 }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 Y := Y
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 1
% 0.79/1.17 1 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (7) {G0,W5,D3,L1,V0,M1} I { intersect( skol2, difference(
% 0.79/1.17 skol3, skol4 ) ) }.
% 0.79/1.17 parent0: (91) {G0,W5,D3,L1,V0,M1} { intersect( skol2, difference( skol3,
% 0.79/1.17 skol4 ) ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (8) {G0,W3,D2,L1,V0,M1} I { ! intersect( skol2, skol3 ) }.
% 0.79/1.17 parent0: (92) {G0,W3,D2,L1,V0,M1} { ! intersect( skol2, skol3 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (97) {G1,W3,D2,L1,V0,M1} { ! intersect( skol3, skol2 ) }.
% 0.79/1.17 parent0[0]: (8) {G0,W3,D2,L1,V0,M1} I { ! intersect( skol2, skol3 ) }.
% 0.79/1.17 parent1[0]: (6) {G0,W6,D2,L2,V2,M2} I { intersect( Y, X ), ! intersect( X,
% 0.79/1.17 Y ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 X := skol3
% 0.79/1.17 Y := skol2
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (11) {G1,W3,D2,L1,V0,M1} R(6,8) { ! intersect( skol3, skol2 )
% 0.79/1.17 }.
% 0.79/1.17 parent0: (97) {G1,W3,D2,L1,V0,M1} { ! intersect( skol3, skol2 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (98) {G1,W9,D4,L1,V1,M1} { member( skol1( X, difference( skol3
% 0.79/1.17 , skol4 ) ), difference( skol3, skol4 ) ) }.
% 0.79/1.17 parent0[1]: (3) {G0,W8,D3,L2,V3,M1} I { member( skol1( Z, Y ), Y ), !
% 0.79/1.17 intersect( X, Y ) }.
% 0.79/1.17 parent1[0]: (7) {G0,W5,D3,L1,V0,M1} I { intersect( skol2, difference( skol3
% 0.79/1.17 , skol4 ) ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := skol2
% 0.79/1.17 Y := difference( skol3, skol4 )
% 0.79/1.17 Z := X
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (16) {G1,W9,D4,L1,V1,M1} R(3,7) { member( skol1( X, difference
% 0.79/1.17 ( skol3, skol4 ) ), difference( skol3, skol4 ) ) }.
% 0.79/1.17 parent0: (98) {G1,W9,D4,L1,V1,M1} { member( skol1( X, difference( skol3,
% 0.79/1.17 skol4 ) ), difference( skol3, skol4 ) ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (99) {G1,W7,D4,L1,V0,M1} { member( skol1( skol2, difference(
% 0.79/1.17 skol3, skol4 ) ), skol2 ) }.
% 0.79/1.17 parent0[1]: (4) {G0,W8,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), !
% 0.79/1.17 intersect( X, Y ) }.
% 0.79/1.17 parent1[0]: (7) {G0,W5,D3,L1,V0,M1} I { intersect( skol2, difference( skol3
% 0.79/1.17 , skol4 ) ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := skol2
% 0.79/1.17 Y := difference( skol3, skol4 )
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (48) {G1,W7,D4,L1,V0,M1} R(4,7) { member( skol1( skol2,
% 0.79/1.17 difference( skol3, skol4 ) ), skol2 ) }.
% 0.79/1.17 parent0: (99) {G1,W7,D4,L1,V0,M1} { member( skol1( skol2, difference(
% 0.79/1.17 skol3, skol4 ) ), skol2 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (100) {G1,W6,D2,L2,V1,M2} { ! member( X, skol3 ), ! member( X
% 0.79/1.17 , skol2 ) }.
% 0.79/1.17 parent0[0]: (11) {G1,W3,D2,L1,V0,M1} R(6,8) { ! intersect( skol3, skol2 )
% 0.79/1.17 }.
% 0.79/1.17 parent1[2]: (5) {G0,W9,D2,L3,V3,M1} I { ! member( Z, X ), ! member( Z, Y )
% 0.79/1.17 , intersect( X, Y ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 X := skol3
% 0.79/1.17 Y := skol2
% 0.79/1.17 Z := X
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (51) {G2,W6,D2,L2,V1,M1} R(5,11) { ! member( X, skol2 ), !
% 0.79/1.17 member( X, skol3 ) }.
% 0.79/1.17 parent0: (100) {G1,W6,D2,L2,V1,M2} { ! member( X, skol3 ), ! member( X,
% 0.79/1.17 skol2 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 1
% 0.79/1.17 1 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (102) {G1,W8,D3,L2,V2,M2} { ! member( X, skol2 ), ! member( X
% 0.79/1.17 , difference( skol3, Y ) ) }.
% 0.79/1.17 parent0[1]: (51) {G2,W6,D2,L2,V1,M1} R(5,11) { ! member( X, skol2 ), !
% 0.79/1.17 member( X, skol3 ) }.
% 0.79/1.17 parent1[0]: (0) {G0,W8,D3,L2,V3,M2} I { member( Z, X ), ! member( Z,
% 0.79/1.17 difference( X, Y ) ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 X := skol3
% 0.79/1.17 Y := Y
% 0.79/1.17 Z := X
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (65) {G3,W8,D3,L2,V2,M1} R(51,0) { ! member( X, skol2 ), !
% 0.79/1.17 member( X, difference( skol3, Y ) ) }.
% 0.79/1.17 parent0: (102) {G1,W8,D3,L2,V2,M2} { ! member( X, skol2 ), ! member( X,
% 0.79/1.17 difference( skol3, Y ) ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 Y := Y
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 1 ==> 1
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (103) {G2,W7,D4,L1,V1,M1} { ! member( skol1( X, difference(
% 0.79/1.17 skol3, skol4 ) ), skol2 ) }.
% 0.79/1.17 parent0[1]: (65) {G3,W8,D3,L2,V2,M1} R(51,0) { ! member( X, skol2 ), !
% 0.79/1.17 member( X, difference( skol3, Y ) ) }.
% 0.79/1.17 parent1[0]: (16) {G1,W9,D4,L1,V1,M1} R(3,7) { member( skol1( X, difference
% 0.79/1.17 ( skol3, skol4 ) ), difference( skol3, skol4 ) ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := skol1( X, difference( skol3, skol4 ) )
% 0.79/1.17 Y := skol4
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 X := X
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (77) {G4,W7,D4,L1,V1,M1} R(16,65) { ! member( skol1( X,
% 0.79/1.17 difference( skol3, skol4 ) ), skol2 ) }.
% 0.79/1.17 parent0: (103) {G2,W7,D4,L1,V1,M1} { ! member( skol1( X, difference( skol3
% 0.79/1.17 , skol4 ) ), skol2 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := X
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 0 ==> 0
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 resolution: (104) {G2,W0,D0,L0,V0,M0} { }.
% 0.79/1.17 parent0[0]: (77) {G4,W7,D4,L1,V1,M1} R(16,65) { ! member( skol1( X,
% 0.79/1.17 difference( skol3, skol4 ) ), skol2 ) }.
% 0.79/1.17 parent1[0]: (48) {G1,W7,D4,L1,V0,M1} R(4,7) { member( skol1( skol2,
% 0.79/1.17 difference( skol3, skol4 ) ), skol2 ) }.
% 0.79/1.17 substitution0:
% 0.79/1.17 X := skol2
% 0.79/1.17 end
% 0.79/1.17 substitution1:
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 subsumption: (82) {G5,W0,D0,L0,V0,M0} R(77,48) { }.
% 0.79/1.17 parent0: (104) {G2,W0,D0,L0,V0,M0} { }.
% 0.79/1.17 substitution0:
% 0.79/1.17 end
% 0.79/1.17 permutation0:
% 0.79/1.17 end
% 0.79/1.17
% 0.79/1.17 Proof check complete!
% 0.79/1.17
% 0.79/1.17 Memory use:
% 0.79/1.17
% 0.79/1.17 space for terms: 1097
% 0.79/1.17 space for clauses: 4497
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 clauses generated: 132
% 0.79/1.17 clauses kept: 83
% 0.79/1.17 clauses selected: 27
% 0.79/1.17 clauses deleted: 0
% 0.79/1.17 clauses inuse deleted: 0
% 0.79/1.17
% 0.79/1.17 subsentry: 315
% 0.79/1.17 literals s-matched: 192
% 0.79/1.17 literals matched: 189
% 0.79/1.17 full subsumption: 63
% 0.79/1.17
% 0.79/1.17 checksum: 2068418534
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 Bliksem ended
%------------------------------------------------------------------------------