TSTP Solution File: SET689+4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET689+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n005.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:51:25 EDT 2022
% Result : Theorem 0.74s 1.11s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET689+4 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Sat Jul 9 23:29:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.11 *** allocated 10000 integers for termspace/termends
% 0.74/1.11 *** allocated 10000 integers for clauses
% 0.74/1.11 *** allocated 10000 integers for justifications
% 0.74/1.11 Bliksem 1.12
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Automatic Strategy Selection
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Clauses:
% 0.74/1.11
% 0.74/1.11 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.74/1.11 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.74/1.11 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.74/1.11 { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.74/1.11 { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.74/1.11 { ! subset( X, Y ), ! subset( Y, X ), equal_set( X, Y ) }.
% 0.74/1.11 { ! member( X, power_set( Y ) ), subset( X, Y ) }.
% 0.74/1.11 { ! subset( X, Y ), member( X, power_set( Y ) ) }.
% 0.74/1.11 { ! member( X, intersection( Y, Z ) ), member( X, Y ) }.
% 0.74/1.11 { ! member( X, intersection( Y, Z ) ), member( X, Z ) }.
% 0.74/1.11 { ! member( X, Y ), ! member( X, Z ), member( X, intersection( Y, Z ) ) }.
% 0.74/1.11 { ! member( X, union( Y, Z ) ), member( X, Y ), member( X, Z ) }.
% 0.74/1.11 { ! member( X, Y ), member( X, union( Y, Z ) ) }.
% 0.74/1.11 { ! member( X, Z ), member( X, union( Y, Z ) ) }.
% 0.74/1.11 { ! member( X, empty_set ) }.
% 0.74/1.11 { ! member( X, difference( Z, Y ) ), member( X, Z ) }.
% 0.74/1.11 { ! member( X, difference( Z, Y ) ), ! member( X, Y ) }.
% 0.74/1.11 { ! member( X, Z ), member( X, Y ), member( X, difference( Z, Y ) ) }.
% 0.74/1.11 { ! member( X, singleton( Y ) ), X = Y }.
% 0.74/1.11 { ! X = Y, member( X, singleton( Y ) ) }.
% 0.74/1.11 { ! member( X, unordered_pair( Y, Z ) ), X = Y, X = Z }.
% 0.74/1.11 { ! X = Y, member( X, unordered_pair( Y, Z ) ) }.
% 0.74/1.11 { ! X = Z, member( X, unordered_pair( Y, Z ) ) }.
% 0.74/1.11 { ! member( X, sum( Y ) ), member( skol2( Z, Y ), Y ) }.
% 0.74/1.11 { ! member( X, sum( Y ) ), member( X, skol2( X, Y ) ) }.
% 0.74/1.11 { ! member( Z, Y ), ! member( X, Z ), member( X, sum( Y ) ) }.
% 0.74/1.11 { ! member( X, product( Y ) ), ! member( Z, Y ), member( X, Z ) }.
% 0.74/1.11 { member( skol3( Z, Y ), Y ), member( X, product( Y ) ) }.
% 0.74/1.11 { ! member( X, skol3( X, Y ) ), member( X, product( Y ) ) }.
% 0.74/1.11 { subset( skol4, skol6 ) }.
% 0.74/1.11 { subset( skol6, skol5 ) }.
% 0.74/1.11 { subset( skol5, skol4 ) }.
% 0.74/1.11 { ! equal_set( skol4, skol5 ) }.
% 0.74/1.11
% 0.74/1.11 percentage equality = 0.086957, percentage horn = 0.848485
% 0.74/1.11 This is a problem with some equality
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Options Used:
% 0.74/1.11
% 0.74/1.11 useres = 1
% 0.74/1.11 useparamod = 1
% 0.74/1.11 useeqrefl = 1
% 0.74/1.11 useeqfact = 1
% 0.74/1.11 usefactor = 1
% 0.74/1.11 usesimpsplitting = 0
% 0.74/1.11 usesimpdemod = 5
% 0.74/1.11 usesimpres = 3
% 0.74/1.11
% 0.74/1.11 resimpinuse = 1000
% 0.74/1.11 resimpclauses = 20000
% 0.74/1.11 substype = eqrewr
% 0.74/1.11 backwardsubs = 1
% 0.74/1.11 selectoldest = 5
% 0.74/1.11
% 0.74/1.11 litorderings [0] = split
% 0.74/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.11
% 0.74/1.11 termordering = kbo
% 0.74/1.11
% 0.74/1.11 litapriori = 0
% 0.74/1.11 termapriori = 1
% 0.74/1.11 litaposteriori = 0
% 0.74/1.11 termaposteriori = 0
% 0.74/1.11 demodaposteriori = 0
% 0.74/1.11 ordereqreflfact = 0
% 0.74/1.11
% 0.74/1.11 litselect = negord
% 0.74/1.11
% 0.74/1.11 maxweight = 15
% 0.74/1.11 maxdepth = 30000
% 0.74/1.11 maxlength = 115
% 0.74/1.11 maxnrvars = 195
% 0.74/1.11 excuselevel = 1
% 0.74/1.11 increasemaxweight = 1
% 0.74/1.11
% 0.74/1.11 maxselected = 10000000
% 0.74/1.11 maxnrclauses = 10000000
% 0.74/1.11
% 0.74/1.11 showgenerated = 0
% 0.74/1.11 showkept = 0
% 0.74/1.11 showselected = 0
% 0.74/1.11 showdeleted = 0
% 0.74/1.11 showresimp = 1
% 0.74/1.11 showstatus = 2000
% 0.74/1.11
% 0.74/1.11 prologoutput = 0
% 0.74/1.11 nrgoals = 5000000
% 0.74/1.11 totalproof = 1
% 0.74/1.11
% 0.74/1.11 Symbols occurring in the translation:
% 0.74/1.11
% 0.74/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.11 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.74/1.11 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.74/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.11 subset [37, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.74/1.11 member [39, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.74/1.11 equal_set [40, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.74/1.11 power_set [41, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.74/1.11 intersection [42, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.74/1.11 union [43, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.74/1.11 empty_set [44, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.74/1.11 difference [46, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.74/1.11 singleton [47, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.74/1.11 unordered_pair [48, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.74/1.11 sum [49, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.74/1.11 product [51, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.74/1.11 skol1 [53, 2] (w:1, o:56, a:1, s:1, b:1),
% 0.74/1.11 skol2 [54, 2] (w:1, o:57, a:1, s:1, b:1),
% 0.74/1.11 skol3 [55, 2] (w:1, o:58, a:1, s:1, b:1),
% 0.74/1.11 skol4 [56, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.74/1.11 skol5 [57, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.74/1.11 skol6 [58, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Starting Search:
% 0.74/1.11
% 0.74/1.11 *** allocated 15000 integers for clauses
% 0.74/1.11 *** allocated 22500 integers for clauses
% 0.74/1.11 *** allocated 33750 integers for clauses
% 0.74/1.11 *** allocated 50625 integers for clauses
% 0.74/1.11 *** allocated 15000 integers for termspace/termends
% 0.74/1.11 *** allocated 75937 integers for clauses
% 0.74/1.11 *** allocated 22500 integers for termspace/termends
% 0.74/1.11 *** allocated 113905 integers for clauses
% 0.74/1.11 Resimplifying inuse:
% 0.74/1.11 Done
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Bliksems!, er is een bewijs:
% 0.74/1.11 % SZS status Theorem
% 0.74/1.11 % SZS output start Refutation
% 0.74/1.11
% 0.74/1.11 (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.74/1.11 Y ) }.
% 0.74/1.11 (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.74/1.11 }.
% 0.74/1.11 (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.74/1.11 (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X ), equal_set(
% 0.74/1.11 X, Y ) }.
% 0.74/1.11 (29) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.74/1.11 (30) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.74/1.11 (31) {G0,W3,D2,L1,V0,M1} I { subset( skol5, skol4 ) }.
% 0.74/1.11 (32) {G0,W3,D2,L1,V0,M1} I { ! equal_set( skol4, skol5 ) }.
% 0.74/1.11 (44) {G1,W6,D2,L2,V1,M2} R(0,29) { ! member( X, skol4 ), member( X, skol6 )
% 0.74/1.11 }.
% 0.74/1.11 (45) {G1,W6,D2,L2,V1,M2} R(0,30) { ! member( X, skol6 ), member( X, skol5 )
% 0.74/1.11 }.
% 0.74/1.11 (90) {G1,W3,D2,L1,V0,M1} R(5,31);r(32) { ! subset( skol4, skol5 ) }.
% 0.74/1.11 (92) {G2,W5,D3,L1,V0,M1} R(90,2) { member( skol1( skol4, skol5 ), skol4 )
% 0.74/1.11 }.
% 0.74/1.11 (94) {G2,W5,D3,L1,V1,M1} R(90,1) { ! member( skol1( X, skol5 ), skol5 ) }.
% 0.74/1.11 (566) {G3,W5,D3,L1,V0,M1} R(44,92) { member( skol1( skol4, skol5 ), skol6 )
% 0.74/1.11 }.
% 0.74/1.11 (1644) {G4,W0,D0,L0,V0,M0} R(45,566);r(94) { }.
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 % SZS output end Refutation
% 0.74/1.11 found a proof!
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Unprocessed initial clauses:
% 0.74/1.11
% 0.74/1.11 (1646) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.74/1.11 , Y ) }.
% 0.74/1.11 (1647) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.74/1.11 }.
% 0.74/1.11 (1648) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y )
% 0.74/1.11 }.
% 0.74/1.11 (1649) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.74/1.11 (1650) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.74/1.11 (1651) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), equal_set
% 0.74/1.11 ( X, Y ) }.
% 0.74/1.11 (1652) {G0,W7,D3,L2,V2,M2} { ! member( X, power_set( Y ) ), subset( X, Y )
% 0.74/1.11 }.
% 0.74/1.11 (1653) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), member( X, power_set( Y ) )
% 0.74/1.11 }.
% 0.74/1.11 (1654) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member(
% 0.74/1.11 X, Y ) }.
% 0.74/1.11 (1655) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member(
% 0.74/1.11 X, Z ) }.
% 0.74/1.11 (1656) {G0,W11,D3,L3,V3,M3} { ! member( X, Y ), ! member( X, Z ), member(
% 0.74/1.11 X, intersection( Y, Z ) ) }.
% 0.74/1.11 (1657) {G0,W11,D3,L3,V3,M3} { ! member( X, union( Y, Z ) ), member( X, Y )
% 0.74/1.11 , member( X, Z ) }.
% 0.74/1.11 (1658) {G0,W8,D3,L2,V3,M2} { ! member( X, Y ), member( X, union( Y, Z ) )
% 0.74/1.11 }.
% 0.74/1.11 (1659) {G0,W8,D3,L2,V3,M2} { ! member( X, Z ), member( X, union( Y, Z ) )
% 0.74/1.11 }.
% 0.74/1.11 (1660) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.74/1.11 (1661) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), member( X
% 0.74/1.11 , Z ) }.
% 0.74/1.11 (1662) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), ! member(
% 0.74/1.11 X, Y ) }.
% 0.74/1.11 (1663) {G0,W11,D3,L3,V3,M3} { ! member( X, Z ), member( X, Y ), member( X
% 0.74/1.11 , difference( Z, Y ) ) }.
% 0.74/1.11 (1664) {G0,W7,D3,L2,V2,M2} { ! member( X, singleton( Y ) ), X = Y }.
% 0.74/1.11 (1665) {G0,W7,D3,L2,V2,M2} { ! X = Y, member( X, singleton( Y ) ) }.
% 0.74/1.11 (1666) {G0,W11,D3,L3,V3,M3} { ! member( X, unordered_pair( Y, Z ) ), X = Y
% 0.74/1.11 , X = Z }.
% 0.74/1.11 (1667) {G0,W8,D3,L2,V3,M2} { ! X = Y, member( X, unordered_pair( Y, Z ) )
% 0.74/1.11 }.
% 0.74/1.11 (1668) {G0,W8,D3,L2,V3,M2} { ! X = Z, member( X, unordered_pair( Y, Z ) )
% 0.74/1.11 }.
% 0.74/1.11 (1669) {G0,W9,D3,L2,V3,M2} { ! member( X, sum( Y ) ), member( skol2( Z, Y
% 0.74/1.11 ), Y ) }.
% 0.74/1.11 (1670) {G0,W9,D3,L2,V2,M2} { ! member( X, sum( Y ) ), member( X, skol2( X
% 0.74/1.11 , Y ) ) }.
% 0.74/1.11 (1671) {G0,W10,D3,L3,V3,M3} { ! member( Z, Y ), ! member( X, Z ), member(
% 0.74/1.11 X, sum( Y ) ) }.
% 0.74/1.11 (1672) {G0,W10,D3,L3,V3,M3} { ! member( X, product( Y ) ), ! member( Z, Y
% 0.74/1.11 ), member( X, Z ) }.
% 0.74/1.11 (1673) {G0,W9,D3,L2,V3,M2} { member( skol3( Z, Y ), Y ), member( X,
% 0.74/1.11 product( Y ) ) }.
% 0.74/1.11 (1674) {G0,W9,D3,L2,V2,M2} { ! member( X, skol3( X, Y ) ), member( X,
% 0.74/1.11 product( Y ) ) }.
% 0.74/1.11 (1675) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol6 ) }.
% 0.74/1.11 (1676) {G0,W3,D2,L1,V0,M1} { subset( skol6, skol5 ) }.
% 0.74/1.11 (1677) {G0,W3,D2,L1,V0,M1} { subset( skol5, skol4 ) }.
% 0.74/1.11 (1678) {G0,W3,D2,L1,V0,M1} { ! equal_set( skol4, skol5 ) }.
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Total Proof:
% 0.74/1.11
% 0.74/1.11 subsumption: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.74/1.11 , member( Z, Y ) }.
% 0.74/1.11 parent0: (1646) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ),
% 0.74/1.11 member( Z, Y ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := X
% 0.74/1.11 Y := Y
% 0.74/1.11 Z := Z
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 1 ==> 1
% 0.74/1.11 2 ==> 2
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ),
% 0.74/1.11 subset( X, Y ) }.
% 0.74/1.11 parent0: (1647) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset
% 0.74/1.11 ( X, Y ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := X
% 0.74/1.11 Y := Y
% 0.74/1.11 Z := Z
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 1 ==> 1
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.74/1.11 ( X, Y ) }.
% 0.74/1.11 parent0: (1648) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset(
% 0.74/1.11 X, Y ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := X
% 0.74/1.11 Y := Y
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 1 ==> 1
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.74/1.11 , equal_set( X, Y ) }.
% 0.74/1.11 parent0: (1651) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ),
% 0.74/1.11 equal_set( X, Y ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := X
% 0.74/1.11 Y := Y
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 1 ==> 1
% 0.74/1.11 2 ==> 2
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (29) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.74/1.11 parent0: (1675) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol6 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (30) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.74/1.11 parent0: (1676) {G0,W3,D2,L1,V0,M1} { subset( skol6, skol5 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (31) {G0,W3,D2,L1,V0,M1} I { subset( skol5, skol4 ) }.
% 0.74/1.11 parent0: (1677) {G0,W3,D2,L1,V0,M1} { subset( skol5, skol4 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (32) {G0,W3,D2,L1,V0,M1} I { ! equal_set( skol4, skol5 ) }.
% 0.74/1.11 parent0: (1678) {G0,W3,D2,L1,V0,M1} { ! equal_set( skol4, skol5 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 resolution: (1732) {G1,W6,D2,L2,V1,M2} { ! member( X, skol4 ), member( X,
% 0.74/1.11 skol6 ) }.
% 0.74/1.11 parent0[0]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.74/1.11 , member( Z, Y ) }.
% 0.74/1.11 parent1[0]: (29) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := skol4
% 0.74/1.11 Y := skol6
% 0.74/1.11 Z := X
% 0.74/1.11 end
% 0.74/1.11 substitution1:
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (44) {G1,W6,D2,L2,V1,M2} R(0,29) { ! member( X, skol4 ),
% 0.74/1.11 member( X, skol6 ) }.
% 0.74/1.11 parent0: (1732) {G1,W6,D2,L2,V1,M2} { ! member( X, skol4 ), member( X,
% 0.74/1.11 skol6 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := X
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 1 ==> 1
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 resolution: (1733) {G1,W6,D2,L2,V1,M2} { ! member( X, skol6 ), member( X,
% 0.74/1.11 skol5 ) }.
% 0.74/1.11 parent0[0]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.74/1.11 , member( Z, Y ) }.
% 0.74/1.11 parent1[0]: (30) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := skol6
% 0.74/1.11 Y := skol5
% 0.74/1.11 Z := X
% 0.74/1.11 end
% 0.74/1.11 substitution1:
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (45) {G1,W6,D2,L2,V1,M2} R(0,30) { ! member( X, skol6 ),
% 0.74/1.11 member( X, skol5 ) }.
% 0.74/1.11 parent0: (1733) {G1,W6,D2,L2,V1,M2} { ! member( X, skol6 ), member( X,
% 0.74/1.11 skol5 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := X
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 1 ==> 1
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 resolution: (1735) {G1,W6,D2,L2,V0,M2} { ! subset( skol4, skol5 ),
% 0.74/1.11 equal_set( skol4, skol5 ) }.
% 0.74/1.11 parent0[1]: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.74/1.11 , equal_set( X, Y ) }.
% 0.74/1.11 parent1[0]: (31) {G0,W3,D2,L1,V0,M1} I { subset( skol5, skol4 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := skol4
% 0.74/1.11 Y := skol5
% 0.74/1.11 end
% 0.74/1.11 substitution1:
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 resolution: (1736) {G1,W3,D2,L1,V0,M1} { ! subset( skol4, skol5 ) }.
% 0.74/1.11 parent0[0]: (32) {G0,W3,D2,L1,V0,M1} I { ! equal_set( skol4, skol5 ) }.
% 0.74/1.11 parent1[1]: (1735) {G1,W6,D2,L2,V0,M2} { ! subset( skol4, skol5 ),
% 0.74/1.11 equal_set( skol4, skol5 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 substitution1:
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (90) {G1,W3,D2,L1,V0,M1} R(5,31);r(32) { ! subset( skol4,
% 0.74/1.11 skol5 ) }.
% 0.74/1.11 parent0: (1736) {G1,W3,D2,L1,V0,M1} { ! subset( skol4, skol5 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 resolution: (1737) {G1,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ),
% 0.74/1.11 skol4 ) }.
% 0.74/1.11 parent0[0]: (90) {G1,W3,D2,L1,V0,M1} R(5,31);r(32) { ! subset( skol4, skol5
% 0.74/1.11 ) }.
% 0.74/1.11 parent1[1]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.74/1.11 ( X, Y ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 substitution1:
% 0.74/1.11 X := skol4
% 0.74/1.11 Y := skol5
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (92) {G2,W5,D3,L1,V0,M1} R(90,2) { member( skol1( skol4, skol5
% 0.74/1.11 ), skol4 ) }.
% 0.74/1.11 parent0: (1737) {G1,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ), skol4
% 0.74/1.11 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 resolution: (1738) {G1,W5,D3,L1,V1,M1} { ! member( skol1( X, skol5 ),
% 0.74/1.11 skol5 ) }.
% 0.74/1.11 parent0[0]: (90) {G1,W3,D2,L1,V0,M1} R(5,31);r(32) { ! subset( skol4, skol5
% 0.74/1.11 ) }.
% 0.74/1.11 parent1[1]: (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ),
% 0.74/1.11 subset( X, Y ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 substitution1:
% 0.74/1.11 X := skol4
% 0.74/1.11 Y := skol5
% 0.74/1.11 Z := X
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (94) {G2,W5,D3,L1,V1,M1} R(90,1) { ! member( skol1( X, skol5 )
% 0.74/1.11 , skol5 ) }.
% 0.74/1.11 parent0: (1738) {G1,W5,D3,L1,V1,M1} { ! member( skol1( X, skol5 ), skol5 )
% 0.74/1.11 }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := X
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 resolution: (1739) {G2,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ),
% 0.74/1.11 skol6 ) }.
% 0.74/1.11 parent0[0]: (44) {G1,W6,D2,L2,V1,M2} R(0,29) { ! member( X, skol4 ), member
% 0.74/1.11 ( X, skol6 ) }.
% 0.74/1.11 parent1[0]: (92) {G2,W5,D3,L1,V0,M1} R(90,2) { member( skol1( skol4, skol5
% 0.74/1.11 ), skol4 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := skol1( skol4, skol5 )
% 0.74/1.11 end
% 0.74/1.11 substitution1:
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (566) {G3,W5,D3,L1,V0,M1} R(44,92) { member( skol1( skol4,
% 0.74/1.11 skol5 ), skol6 ) }.
% 0.74/1.11 parent0: (1739) {G2,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ), skol6
% 0.74/1.11 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 0 ==> 0
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 resolution: (1740) {G2,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ),
% 0.74/1.11 skol5 ) }.
% 0.74/1.11 parent0[0]: (45) {G1,W6,D2,L2,V1,M2} R(0,30) { ! member( X, skol6 ), member
% 0.74/1.11 ( X, skol5 ) }.
% 0.74/1.11 parent1[0]: (566) {G3,W5,D3,L1,V0,M1} R(44,92) { member( skol1( skol4,
% 0.74/1.11 skol5 ), skol6 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := skol1( skol4, skol5 )
% 0.74/1.11 end
% 0.74/1.11 substitution1:
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 resolution: (1741) {G3,W0,D0,L0,V0,M0} { }.
% 0.74/1.11 parent0[0]: (94) {G2,W5,D3,L1,V1,M1} R(90,1) { ! member( skol1( X, skol5 )
% 0.74/1.11 , skol5 ) }.
% 0.74/1.11 parent1[0]: (1740) {G2,W5,D3,L1,V0,M1} { member( skol1( skol4, skol5 ),
% 0.74/1.11 skol5 ) }.
% 0.74/1.11 substitution0:
% 0.74/1.11 X := skol4
% 0.74/1.11 end
% 0.74/1.11 substitution1:
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 subsumption: (1644) {G4,W0,D0,L0,V0,M0} R(45,566);r(94) { }.
% 0.74/1.11 parent0: (1741) {G3,W0,D0,L0,V0,M0} { }.
% 0.74/1.11 substitution0:
% 0.74/1.11 end
% 0.74/1.11 permutation0:
% 0.74/1.11 end
% 0.74/1.11
% 0.74/1.11 Proof check complete!
% 0.74/1.11
% 0.74/1.11 Memory use:
% 0.74/1.11
% 0.74/1.11 space for terms: 20876
% 0.74/1.11 space for clauses: 76828
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 clauses generated: 2302
% 0.74/1.11 clauses kept: 1645
% 0.74/1.11 clauses selected: 94
% 0.74/1.11 clauses deleted: 6
% 0.74/1.11 clauses inuse deleted: 0
% 0.74/1.11
% 0.74/1.11 subsentry: 4203
% 0.74/1.11 literals s-matched: 2878
% 0.74/1.11 literals matched: 2787
% 0.74/1.11 full subsumption: 1408
% 0.74/1.11
% 0.74/1.11 checksum: 1672180254
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 Bliksem ended
%------------------------------------------------------------------------------