TSTP Solution File: SET027+4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET027+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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:45 EDT 2022
% Result : Theorem 0.73s 1.09s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET027+4 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n019.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.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sun Jul 10 08:53:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.73/1.09 *** allocated 10000 integers for termspace/termends
% 0.73/1.09 *** allocated 10000 integers for clauses
% 0.73/1.09 *** allocated 10000 integers for justifications
% 0.73/1.09 Bliksem 1.12
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Automatic Strategy Selection
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Clauses:
% 0.73/1.09
% 0.73/1.09 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.73/1.09 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.73/1.09 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.73/1.09 { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.73/1.09 { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.73/1.09 { ! subset( X, Y ), ! subset( Y, X ), equal_set( X, Y ) }.
% 0.73/1.09 { ! member( X, power_set( Y ) ), subset( X, Y ) }.
% 0.73/1.09 { ! subset( X, Y ), member( X, power_set( Y ) ) }.
% 0.73/1.09 { ! member( X, intersection( Y, Z ) ), member( X, Y ) }.
% 0.73/1.09 { ! member( X, intersection( Y, Z ) ), member( X, Z ) }.
% 0.73/1.09 { ! member( X, Y ), ! member( X, Z ), member( X, intersection( Y, Z ) ) }.
% 0.73/1.09 { ! member( X, union( Y, Z ) ), member( X, Y ), member( X, Z ) }.
% 0.73/1.09 { ! member( X, Y ), member( X, union( Y, Z ) ) }.
% 0.73/1.09 { ! member( X, Z ), member( X, union( Y, Z ) ) }.
% 0.73/1.09 { ! member( X, empty_set ) }.
% 0.73/1.09 { ! member( X, difference( Z, Y ) ), member( X, Z ) }.
% 0.73/1.09 { ! member( X, difference( Z, Y ) ), ! member( X, Y ) }.
% 0.73/1.09 { ! member( X, Z ), member( X, Y ), member( X, difference( Z, Y ) ) }.
% 0.73/1.09 { ! member( X, singleton( Y ) ), X = Y }.
% 0.73/1.09 { ! X = Y, member( X, singleton( Y ) ) }.
% 0.73/1.09 { ! member( X, unordered_pair( Y, Z ) ), X = Y, X = Z }.
% 0.73/1.09 { ! X = Y, member( X, unordered_pair( Y, Z ) ) }.
% 0.73/1.09 { ! X = Z, member( X, unordered_pair( Y, Z ) ) }.
% 0.73/1.09 { ! member( X, sum( Y ) ), member( skol2( Z, Y ), Y ) }.
% 0.73/1.09 { ! member( X, sum( Y ) ), member( X, skol2( X, Y ) ) }.
% 0.73/1.09 { ! member( Z, Y ), ! member( X, Z ), member( X, sum( Y ) ) }.
% 0.73/1.09 { ! member( X, product( Y ) ), ! member( Z, Y ), member( X, Z ) }.
% 0.73/1.09 { member( skol3( Z, Y ), Y ), member( X, product( Y ) ) }.
% 0.73/1.09 { ! member( X, skol3( X, Y ) ), member( X, product( Y ) ) }.
% 0.73/1.09 { subset( skol4, skol6 ) }.
% 0.73/1.09 { subset( skol6, skol5 ) }.
% 0.73/1.09 { ! subset( skol4, skol5 ) }.
% 0.73/1.09
% 0.73/1.09 percentage equality = 0.088235, percentage horn = 0.843750
% 0.73/1.09 This is a problem with some equality
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Options Used:
% 0.73/1.09
% 0.73/1.09 useres = 1
% 0.73/1.09 useparamod = 1
% 0.73/1.09 useeqrefl = 1
% 0.73/1.09 useeqfact = 1
% 0.73/1.09 usefactor = 1
% 0.73/1.09 usesimpsplitting = 0
% 0.73/1.09 usesimpdemod = 5
% 0.73/1.09 usesimpres = 3
% 0.73/1.09
% 0.73/1.09 resimpinuse = 1000
% 0.73/1.09 resimpclauses = 20000
% 0.73/1.09 substype = eqrewr
% 0.73/1.09 backwardsubs = 1
% 0.73/1.09 selectoldest = 5
% 0.73/1.09
% 0.73/1.09 litorderings [0] = split
% 0.73/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.73/1.09
% 0.73/1.09 termordering = kbo
% 0.73/1.09
% 0.73/1.09 litapriori = 0
% 0.73/1.09 termapriori = 1
% 0.73/1.09 litaposteriori = 0
% 0.73/1.09 termaposteriori = 0
% 0.73/1.09 demodaposteriori = 0
% 0.73/1.09 ordereqreflfact = 0
% 0.73/1.09
% 0.73/1.09 litselect = negord
% 0.73/1.09
% 0.73/1.09 maxweight = 15
% 0.73/1.09 maxdepth = 30000
% 0.73/1.09 maxlength = 115
% 0.73/1.09 maxnrvars = 195
% 0.73/1.09 excuselevel = 1
% 0.73/1.09 increasemaxweight = 1
% 0.73/1.09
% 0.73/1.09 maxselected = 10000000
% 0.73/1.09 maxnrclauses = 10000000
% 0.73/1.09
% 0.73/1.09 showgenerated = 0
% 0.73/1.09 showkept = 0
% 0.73/1.09 showselected = 0
% 0.73/1.09 showdeleted = 0
% 0.73/1.09 showresimp = 1
% 0.73/1.09 showstatus = 2000
% 0.73/1.09
% 0.73/1.09 prologoutput = 0
% 0.73/1.09 nrgoals = 5000000
% 0.73/1.09 totalproof = 1
% 0.73/1.09
% 0.73/1.09 Symbols occurring in the translation:
% 0.73/1.09
% 0.73/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.09 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.73/1.09 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.73/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.09 subset [37, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.73/1.09 member [39, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.73/1.09 equal_set [40, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.73/1.09 power_set [41, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.73/1.09 intersection [42, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.73/1.09 union [43, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.73/1.09 empty_set [44, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.73/1.09 difference [46, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.73/1.09 singleton [47, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.73/1.09 unordered_pair [48, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.73/1.09 sum [49, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.73/1.09 product [51, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.73/1.09 skol1 [53, 2] (w:1, o:56, a:1, s:1, b:1),
% 0.73/1.09 skol2 [54, 2] (w:1, o:57, a:1, s:1, b:1),
% 0.73/1.09 skol3 [55, 2] (w:1, o:58, a:1, s:1, b:1),
% 0.73/1.09 skol4 [56, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.73/1.09 skol5 [57, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.73/1.09 skol6 [58, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Starting Search:
% 0.73/1.09
% 0.73/1.09 *** allocated 15000 integers for clauses
% 0.73/1.09 *** allocated 22500 integers for clauses
% 0.73/1.09 *** allocated 33750 integers for clauses
% 0.73/1.09 *** allocated 50625 integers for clauses
% 0.73/1.09 *** allocated 15000 integers for termspace/termends
% 0.73/1.09 *** allocated 75937 integers for clauses
% 0.73/1.09 *** allocated 22500 integers for termspace/termends
% 0.73/1.09 Resimplifying inuse:
% 0.73/1.09 Done
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Bliksems!, er is een bewijs:
% 0.73/1.09 % SZS status Theorem
% 0.73/1.09 % SZS output start Refutation
% 0.73/1.09
% 0.73/1.09 (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.73/1.09 Y ) }.
% 0.73/1.09 (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.73/1.09 }.
% 0.73/1.09 (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.73/1.09 (29) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.73/1.09 (30) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.73/1.09 (31) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.73/1.09 (44) {G1,W6,D2,L2,V1,M2} R(0,29) { ! member( X, skol4 ), member( X, skol6 )
% 0.73/1.09 }.
% 0.73/1.09 (45) {G1,W6,D2,L2,V1,M2} R(0,30) { ! member( X, skol6 ), member( X, skol5 )
% 0.73/1.09 }.
% 0.73/1.09 (54) {G1,W5,D3,L1,V1,M1} R(1,31) { ! member( skol1( X, skol5 ), skol5 ) }.
% 0.73/1.09 (69) {G1,W5,D3,L1,V0,M1} R(2,31) { member( skol1( skol4, skol5 ), skol4 )
% 0.73/1.09 }.
% 0.73/1.09 (563) {G2,W5,D3,L1,V0,M1} R(44,69) { member( skol1( skol4, skol5 ), skol6 )
% 0.73/1.09 }.
% 0.73/1.09 (1601) {G3,W0,D0,L0,V0,M0} R(45,563);r(54) { }.
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 % SZS output end Refutation
% 0.73/1.09 found a proof!
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Unprocessed initial clauses:
% 0.73/1.09
% 0.73/1.09 (1603) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.73/1.09 , Y ) }.
% 0.73/1.09 (1604) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.73/1.09 }.
% 0.73/1.09 (1605) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y )
% 0.73/1.09 }.
% 0.73/1.09 (1606) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.73/1.09 (1607) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.73/1.09 (1608) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), equal_set
% 0.73/1.09 ( X, Y ) }.
% 0.73/1.09 (1609) {G0,W7,D3,L2,V2,M2} { ! member( X, power_set( Y ) ), subset( X, Y )
% 0.73/1.09 }.
% 0.73/1.09 (1610) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), member( X, power_set( Y ) )
% 0.73/1.09 }.
% 0.73/1.09 (1611) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member(
% 0.73/1.09 X, Y ) }.
% 0.73/1.09 (1612) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member(
% 0.73/1.09 X, Z ) }.
% 0.73/1.09 (1613) {G0,W11,D3,L3,V3,M3} { ! member( X, Y ), ! member( X, Z ), member(
% 0.73/1.09 X, intersection( Y, Z ) ) }.
% 0.73/1.09 (1614) {G0,W11,D3,L3,V3,M3} { ! member( X, union( Y, Z ) ), member( X, Y )
% 0.73/1.09 , member( X, Z ) }.
% 0.73/1.09 (1615) {G0,W8,D3,L2,V3,M2} { ! member( X, Y ), member( X, union( Y, Z ) )
% 0.73/1.09 }.
% 0.73/1.09 (1616) {G0,W8,D3,L2,V3,M2} { ! member( X, Z ), member( X, union( Y, Z ) )
% 0.73/1.09 }.
% 0.73/1.09 (1617) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.73/1.09 (1618) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), member( X
% 0.73/1.09 , Z ) }.
% 0.73/1.09 (1619) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), ! member(
% 0.73/1.09 X, Y ) }.
% 0.73/1.09 (1620) {G0,W11,D3,L3,V3,M3} { ! member( X, Z ), member( X, Y ), member( X
% 0.73/1.09 , difference( Z, Y ) ) }.
% 0.73/1.09 (1621) {G0,W7,D3,L2,V2,M2} { ! member( X, singleton( Y ) ), X = Y }.
% 0.73/1.09 (1622) {G0,W7,D3,L2,V2,M2} { ! X = Y, member( X, singleton( Y ) ) }.
% 0.73/1.09 (1623) {G0,W11,D3,L3,V3,M3} { ! member( X, unordered_pair( Y, Z ) ), X = Y
% 0.73/1.09 , X = Z }.
% 0.73/1.09 (1624) {G0,W8,D3,L2,V3,M2} { ! X = Y, member( X, unordered_pair( Y, Z ) )
% 0.73/1.09 }.
% 0.73/1.09 (1625) {G0,W8,D3,L2,V3,M2} { ! X = Z, member( X, unordered_pair( Y, Z ) )
% 0.73/1.09 }.
% 0.73/1.09 (1626) {G0,W9,D3,L2,V3,M2} { ! member( X, sum( Y ) ), member( skol2( Z, Y
% 0.73/1.09 ), Y ) }.
% 0.73/1.09 (1627) {G0,W9,D3,L2,V2,M2} { ! member( X, sum( Y ) ), member( X, skol2( X
% 0.73/1.09 , Y ) ) }.
% 0.73/1.09 (1628) {G0,W10,D3,L3,V3,M3} { ! member( Z, Y ), ! member( X, Z ), member(
% 0.73/1.09 X, sum( Y ) ) }.
% 0.73/1.09 (1629) {G0,W10,D3,L3,V3,M3} { ! member( X, product( Y ) ), ! member( Z, Y
% 0.73/1.09 ), member( X, Z ) }.
% 0.73/1.09 (1630) {G0,W9,D3,L2,V3,M2} { member( skol3( Z, Y ), Y ), member( X,
% 0.73/1.09 product( Y ) ) }.
% 0.73/1.09 (1631) {G0,W9,D3,L2,V2,M2} { ! member( X, skol3( X, Y ) ), member( X,
% 0.73/1.09 product( Y ) ) }.
% 0.73/1.09 (1632) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol6 ) }.
% 0.73/1.09 (1633) {G0,W3,D2,L1,V0,M1} { subset( skol6, skol5 ) }.
% 0.73/1.09 (1634) {G0,W3,D2,L1,V0,M1} { ! subset( skol4, skol5 ) }.
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Total Proof:
% 0.73/1.09
% 0.73/1.09 subsumption: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.73/1.09 , member( Z, Y ) }.
% 0.73/1.09 parent0: (1603) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ),
% 0.73/1.09 member( Z, Y ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 Y := Y
% 0.73/1.09 Z := Z
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 1 ==> 1
% 0.73/1.09 2 ==> 2
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ),
% 0.73/1.09 subset( X, Y ) }.
% 0.73/1.09 parent0: (1604) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset
% 0.73/1.09 ( X, Y ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 Y := Y
% 0.73/1.09 Z := Z
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 1 ==> 1
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.73/1.09 ( X, Y ) }.
% 0.73/1.09 parent0: (1605) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset(
% 0.73/1.09 X, Y ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 Y := Y
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 1 ==> 1
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (29) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.73/1.09 parent0: (1632) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol6 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 *** allocated 113905 integers for clauses
% 0.73/1.09 subsumption: (30) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.73/1.09 parent0: (1633) {G0,W3,D2,L1,V0,M1} { subset( skol6, skol5 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (31) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.73/1.09 parent0: (1634) {G0,W3,D2,L1,V0,M1} { ! subset( skol4, skol5 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 resolution: (1674) {G1,W6,D2,L2,V1,M2} { ! member( X, skol4 ), member( X,
% 0.73/1.09 skol6 ) }.
% 0.73/1.09 parent0[0]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.73/1.09 , member( Z, Y ) }.
% 0.73/1.09 parent1[0]: (29) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := skol4
% 0.73/1.09 Y := skol6
% 0.73/1.09 Z := X
% 0.73/1.09 end
% 0.73/1.09 substitution1:
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (44) {G1,W6,D2,L2,V1,M2} R(0,29) { ! member( X, skol4 ),
% 0.73/1.09 member( X, skol6 ) }.
% 0.73/1.09 parent0: (1674) {G1,W6,D2,L2,V1,M2} { ! member( X, skol4 ), member( X,
% 0.73/1.09 skol6 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 1 ==> 1
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 resolution: (1675) {G1,W6,D2,L2,V1,M2} { ! member( X, skol6 ), member( X,
% 0.73/1.09 skol5 ) }.
% 0.73/1.09 parent0[0]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.73/1.09 , member( Z, Y ) }.
% 0.73/1.09 parent1[0]: (30) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := skol6
% 0.73/1.09 Y := skol5
% 0.73/1.09 Z := X
% 0.73/1.09 end
% 0.73/1.09 substitution1:
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (45) {G1,W6,D2,L2,V1,M2} R(0,30) { ! member( X, skol6 ),
% 0.73/1.09 member( X, skol5 ) }.
% 0.73/1.09 parent0: (1675) {G1,W6,D2,L2,V1,M2} { ! member( X, skol6 ), member( X,
% 0.73/1.09 skol5 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 1 ==> 1
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 resolution: (1676) {G1,W5,D3,L1,V1,M1} { ! member( skol1( X, skol5 ),
% 0.73/1.09 skol5 ) }.
% 0.73/1.09 parent0[0]: (31) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.73/1.09 parent1[1]: (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ),
% 0.73/1.09 subset( X, Y ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 substitution1:
% 0.73/1.09 X := skol4
% 0.73/1.09 Y := skol5
% 0.73/1.09 Z := X
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (54) {G1,W5,D3,L1,V1,M1} R(1,31) { ! member( skol1( X, skol5 )
% 0.73/1.09 , skol5 ) }.
% 0.73/1.09 parent0: (1676) {G1,W5,D3,L1,V1,M1} { ! member( skol1( X, skol5 ), skol5 )
% 0.73/1.09 }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 resolution: (1677) {G1,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ),
% 0.73/1.09 skol4 ) }.
% 0.73/1.09 parent0[0]: (31) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 0.73/1.09 parent1[1]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.73/1.09 ( X, Y ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 substitution1:
% 0.73/1.09 X := skol4
% 0.73/1.09 Y := skol5
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (69) {G1,W5,D3,L1,V0,M1} R(2,31) { member( skol1( skol4, skol5
% 0.73/1.09 ), skol4 ) }.
% 0.73/1.09 parent0: (1677) {G1,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ), skol4
% 0.73/1.09 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 resolution: (1678) {G2,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ),
% 0.73/1.09 skol6 ) }.
% 0.73/1.09 parent0[0]: (44) {G1,W6,D2,L2,V1,M2} R(0,29) { ! member( X, skol4 ), member
% 0.73/1.09 ( X, skol6 ) }.
% 0.73/1.09 parent1[0]: (69) {G1,W5,D3,L1,V0,M1} R(2,31) { member( skol1( skol4, skol5
% 0.73/1.09 ), skol4 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := skol1( skol4, skol5 )
% 0.73/1.09 end
% 0.73/1.09 substitution1:
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (563) {G2,W5,D3,L1,V0,M1} R(44,69) { member( skol1( skol4,
% 0.73/1.09 skol5 ), skol6 ) }.
% 0.73/1.09 parent0: (1678) {G2,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ), skol6
% 0.73/1.09 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 resolution: (1679) {G2,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ),
% 0.73/1.09 skol5 ) }.
% 0.73/1.09 parent0[0]: (45) {G1,W6,D2,L2,V1,M2} R(0,30) { ! member( X, skol6 ), member
% 0.73/1.09 ( X, skol5 ) }.
% 0.73/1.09 parent1[0]: (563) {G2,W5,D3,L1,V0,M1} R(44,69) { member( skol1( skol4,
% 0.73/1.09 skol5 ), skol6 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := skol1( skol4, skol5 )
% 0.73/1.09 end
% 0.73/1.09 substitution1:
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 resolution: (1680) {G2,W0,D0,L0,V0,M0} { }.
% 0.73/1.09 parent0[0]: (54) {G1,W5,D3,L1,V1,M1} R(1,31) { ! member( skol1( X, skol5 )
% 0.73/1.09 , skol5 ) }.
% 0.73/1.09 parent1[0]: (1679) {G2,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ),
% 0.73/1.09 skol5 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := skol4
% 0.73/1.09 end
% 0.73/1.09 substitution1:
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (1601) {G3,W0,D0,L0,V0,M0} R(45,563);r(54) { }.
% 0.73/1.09 parent0: (1680) {G2,W0,D0,L0,V0,M0} { }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 Proof check complete!
% 0.73/1.09
% 0.73/1.09 Memory use:
% 0.73/1.09
% 0.73/1.09 space for terms: 20434
% 0.73/1.09 space for clauses: 74718
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 clauses generated: 2254
% 0.73/1.09 clauses kept: 1602
% 0.73/1.09 clauses selected: 92
% 0.73/1.09 clauses deleted: 7
% 0.73/1.09 clauses inuse deleted: 0
% 0.73/1.09
% 0.73/1.09 subsentry: 4145
% 0.73/1.09 literals s-matched: 2796
% 0.73/1.09 literals matched: 2699
% 0.73/1.09 full subsumption: 1350
% 0.73/1.09
% 0.73/1.09 checksum: 1207135320
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Bliksem ended
%------------------------------------------------------------------------------