TSTP Solution File: SET688+4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET688+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n028.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.70s 1.14s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET688+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n028.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 21:24:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.14 *** allocated 10000 integers for termspace/termends
% 0.70/1.14 *** allocated 10000 integers for clauses
% 0.70/1.14 *** allocated 10000 integers for justifications
% 0.70/1.14 Bliksem 1.12
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Automatic Strategy Selection
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Clauses:
% 0.70/1.14
% 0.70/1.14 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.70/1.14 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.70/1.14 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.70/1.14 { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.70/1.14 { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.70/1.14 { ! subset( X, Y ), ! subset( Y, X ), equal_set( X, Y ) }.
% 0.70/1.14 { ! member( X, power_set( Y ) ), subset( X, Y ) }.
% 0.70/1.14 { ! subset( X, Y ), member( X, power_set( Y ) ) }.
% 0.70/1.14 { ! member( X, intersection( Y, Z ) ), member( X, Y ) }.
% 0.70/1.14 { ! member( X, intersection( Y, Z ) ), member( X, Z ) }.
% 0.70/1.14 { ! member( X, Y ), ! member( X, Z ), member( X, intersection( Y, Z ) ) }.
% 0.70/1.14 { ! member( X, union( Y, Z ) ), member( X, Y ), member( X, Z ) }.
% 0.70/1.14 { ! member( X, Y ), member( X, union( Y, Z ) ) }.
% 0.70/1.14 { ! member( X, Z ), member( X, union( Y, Z ) ) }.
% 0.70/1.14 { ! member( X, empty_set ) }.
% 0.70/1.14 { ! member( X, difference( Z, Y ) ), member( X, Z ) }.
% 0.70/1.14 { ! member( X, difference( Z, Y ) ), ! member( X, Y ) }.
% 0.70/1.14 { ! member( X, Z ), member( X, Y ), member( X, difference( Z, Y ) ) }.
% 0.70/1.14 { ! member( X, singleton( Y ) ), X = Y }.
% 0.70/1.14 { ! X = Y, member( X, singleton( Y ) ) }.
% 0.70/1.14 { ! member( X, unordered_pair( Y, Z ) ), X = Y, X = Z }.
% 0.70/1.14 { ! X = Y, member( X, unordered_pair( Y, Z ) ) }.
% 0.70/1.14 { ! X = Z, member( X, unordered_pair( Y, Z ) ) }.
% 0.70/1.14 { ! member( X, sum( Y ) ), member( skol2( Z, Y ), Y ) }.
% 0.70/1.14 { ! member( X, sum( Y ) ), member( X, skol2( X, Y ) ) }.
% 0.70/1.14 { ! member( Z, Y ), ! member( X, Z ), member( X, sum( Y ) ) }.
% 0.70/1.14 { ! member( X, product( Y ) ), ! member( Z, Y ), member( X, Z ) }.
% 0.70/1.14 { member( skol3( Z, Y ), Y ), member( X, product( Y ) ) }.
% 0.70/1.14 { ! member( X, skol3( X, Y ) ), member( X, product( Y ) ) }.
% 0.70/1.14 { subset( skol4, skol6 ) }.
% 0.70/1.14 { ! equal_set( skol4, skol6 ) }.
% 0.70/1.14 { subset( skol6, skol5 ) }.
% 0.70/1.14 { ! equal_set( skol6, skol5 ) }.
% 0.70/1.14 { equal_set( skol4, skol5 ) }.
% 0.70/1.14
% 0.70/1.14 percentage equality = 0.085714, percentage horn = 0.852941
% 0.70/1.14 This is a problem with some equality
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Options Used:
% 0.70/1.14
% 0.70/1.14 useres = 1
% 0.70/1.14 useparamod = 1
% 0.70/1.14 useeqrefl = 1
% 0.70/1.14 useeqfact = 1
% 0.70/1.14 usefactor = 1
% 0.70/1.14 usesimpsplitting = 0
% 0.70/1.14 usesimpdemod = 5
% 0.70/1.14 usesimpres = 3
% 0.70/1.14
% 0.70/1.14 resimpinuse = 1000
% 0.70/1.14 resimpclauses = 20000
% 0.70/1.14 substype = eqrewr
% 0.70/1.14 backwardsubs = 1
% 0.70/1.14 selectoldest = 5
% 0.70/1.14
% 0.70/1.14 litorderings [0] = split
% 0.70/1.14 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.14
% 0.70/1.14 termordering = kbo
% 0.70/1.14
% 0.70/1.14 litapriori = 0
% 0.70/1.14 termapriori = 1
% 0.70/1.14 litaposteriori = 0
% 0.70/1.14 termaposteriori = 0
% 0.70/1.14 demodaposteriori = 0
% 0.70/1.14 ordereqreflfact = 0
% 0.70/1.14
% 0.70/1.14 litselect = negord
% 0.70/1.14
% 0.70/1.14 maxweight = 15
% 0.70/1.14 maxdepth = 30000
% 0.70/1.14 maxlength = 115
% 0.70/1.14 maxnrvars = 195
% 0.70/1.14 excuselevel = 1
% 0.70/1.14 increasemaxweight = 1
% 0.70/1.14
% 0.70/1.14 maxselected = 10000000
% 0.70/1.14 maxnrclauses = 10000000
% 0.70/1.14
% 0.70/1.14 showgenerated = 0
% 0.70/1.14 showkept = 0
% 0.70/1.14 showselected = 0
% 0.70/1.14 showdeleted = 0
% 0.70/1.14 showresimp = 1
% 0.70/1.14 showstatus = 2000
% 0.70/1.14
% 0.70/1.14 prologoutput = 0
% 0.70/1.14 nrgoals = 5000000
% 0.70/1.14 totalproof = 1
% 0.70/1.14
% 0.70/1.14 Symbols occurring in the translation:
% 0.70/1.14
% 0.70/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.14 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.70/1.14 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.70/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.14 subset [37, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.70/1.14 member [39, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.70/1.14 equal_set [40, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.70/1.14 power_set [41, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.70/1.14 intersection [42, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.70/1.14 union [43, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.70/1.14 empty_set [44, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.70/1.14 difference [46, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.70/1.14 singleton [47, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.70/1.14 unordered_pair [48, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.70/1.14 sum [49, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.70/1.14 product [51, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.70/1.14 skol1 [53, 2] (w:1, o:56, a:1, s:1, b:1),
% 0.70/1.14 skol2 [54, 2] (w:1, o:57, a:1, s:1, b:1),
% 0.70/1.14 skol3 [55, 2] (w:1, o:58, a:1, s:1, b:1),
% 0.70/1.14 skol4 [56, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.70/1.14 skol5 [57, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.70/1.14 skol6 [58, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Starting Search:
% 0.70/1.14
% 0.70/1.14 *** allocated 15000 integers for clauses
% 0.70/1.14 *** allocated 22500 integers for clauses
% 0.70/1.14 *** allocated 33750 integers for clauses
% 0.70/1.14 *** allocated 50625 integers for clauses
% 0.70/1.14 *** allocated 15000 integers for termspace/termends
% 0.70/1.14 *** allocated 75937 integers for clauses
% 0.70/1.14 *** allocated 22500 integers for termspace/termends
% 0.70/1.14 *** allocated 113905 integers for clauses
% 0.70/1.14 Resimplifying inuse:
% 0.70/1.14 Done
% 0.70/1.14
% 0.70/1.14 *** allocated 33750 integers for termspace/termends
% 0.70/1.14
% 0.70/1.14 Intermediate Status:
% 0.70/1.14 Generated: 2752
% 0.70/1.14 Kept: 2009
% 0.70/1.14 Inuse: 112
% 0.70/1.14 Deleted: 3
% 0.70/1.14 Deletedinuse: 0
% 0.70/1.14
% 0.70/1.14 *** allocated 170857 integers for clauses
% 0.70/1.14 Resimplifying inuse:
% 0.70/1.14 Done
% 0.70/1.14
% 0.70/1.14 *** allocated 50625 integers for termspace/termends
% 0.70/1.14 *** allocated 256285 integers for clauses
% 0.70/1.14 Resimplifying inuse:
% 0.70/1.14 Done
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Bliksems!, er is een bewijs:
% 0.70/1.14 % SZS status Theorem
% 0.70/1.14 % SZS output start Refutation
% 0.70/1.14
% 0.70/1.14 (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.70/1.14 Y ) }.
% 0.70/1.14 (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.70/1.14 }.
% 0.70/1.14 (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.70/1.14 (4) {G0,W6,D2,L2,V2,M2} I { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.70/1.14 (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X ), equal_set(
% 0.70/1.14 X, Y ) }.
% 0.70/1.14 (29) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.70/1.14 (31) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.70/1.14 (32) {G0,W3,D2,L1,V0,M1} I { ! equal_set( skol6, skol5 ) }.
% 0.70/1.14 (33) {G0,W3,D2,L1,V0,M1} I { equal_set( skol4, skol5 ) }.
% 0.70/1.14 (47) {G1,W6,D2,L2,V1,M2} R(29,0) { ! member( X, skol4 ), member( X, skol6 )
% 0.70/1.14 }.
% 0.70/1.14 (60) {G1,W3,D2,L1,V0,M1} R(4,33) { subset( skol5, skol4 ) }.
% 0.70/1.14 (70) {G2,W6,D2,L2,V1,M2} R(60,0) { ! member( X, skol5 ), member( X, skol4 )
% 0.70/1.14 }.
% 0.70/1.14 (87) {G1,W3,D2,L1,V0,M1} R(5,31);r(32) { ! subset( skol5, skol6 ) }.
% 0.70/1.14 (104) {G2,W5,D3,L1,V0,M1} R(87,2) { member( skol1( skol5, skol6 ), skol5 )
% 0.70/1.14 }.
% 0.70/1.14 (105) {G2,W5,D3,L1,V1,M1} R(87,1) { ! member( skol1( X, skol6 ), skol6 )
% 0.70/1.14 }.
% 0.70/1.14 (1807) {G3,W5,D3,L1,V0,M1} R(70,104) { member( skol1( skol5, skol6 ), skol4
% 0.70/1.14 ) }.
% 0.70/1.14 (3757) {G4,W0,D0,L0,V0,M0} R(47,1807);r(105) { }.
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 % SZS output end Refutation
% 0.70/1.14 found a proof!
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Unprocessed initial clauses:
% 0.70/1.14
% 0.70/1.14 (3759) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.70/1.14 , Y ) }.
% 0.70/1.14 (3760) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.70/1.14 }.
% 0.70/1.14 (3761) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y )
% 0.70/1.14 }.
% 0.70/1.14 (3762) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.70/1.14 (3763) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.70/1.14 (3764) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), equal_set
% 0.70/1.14 ( X, Y ) }.
% 0.70/1.14 (3765) {G0,W7,D3,L2,V2,M2} { ! member( X, power_set( Y ) ), subset( X, Y )
% 0.70/1.14 }.
% 0.70/1.14 (3766) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), member( X, power_set( Y ) )
% 0.70/1.14 }.
% 0.70/1.14 (3767) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member(
% 0.70/1.14 X, Y ) }.
% 0.70/1.14 (3768) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member(
% 0.70/1.14 X, Z ) }.
% 0.70/1.14 (3769) {G0,W11,D3,L3,V3,M3} { ! member( X, Y ), ! member( X, Z ), member(
% 0.70/1.14 X, intersection( Y, Z ) ) }.
% 0.70/1.14 (3770) {G0,W11,D3,L3,V3,M3} { ! member( X, union( Y, Z ) ), member( X, Y )
% 0.70/1.14 , member( X, Z ) }.
% 0.70/1.14 (3771) {G0,W8,D3,L2,V3,M2} { ! member( X, Y ), member( X, union( Y, Z ) )
% 0.70/1.14 }.
% 0.70/1.14 (3772) {G0,W8,D3,L2,V3,M2} { ! member( X, Z ), member( X, union( Y, Z ) )
% 0.70/1.14 }.
% 0.70/1.14 (3773) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.70/1.14 (3774) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), member( X
% 0.70/1.14 , Z ) }.
% 0.70/1.14 (3775) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), ! member(
% 0.70/1.14 X, Y ) }.
% 0.70/1.14 (3776) {G0,W11,D3,L3,V3,M3} { ! member( X, Z ), member( X, Y ), member( X
% 0.70/1.14 , difference( Z, Y ) ) }.
% 0.70/1.14 (3777) {G0,W7,D3,L2,V2,M2} { ! member( X, singleton( Y ) ), X = Y }.
% 0.70/1.14 (3778) {G0,W7,D3,L2,V2,M2} { ! X = Y, member( X, singleton( Y ) ) }.
% 0.70/1.14 (3779) {G0,W11,D3,L3,V3,M3} { ! member( X, unordered_pair( Y, Z ) ), X = Y
% 0.70/1.14 , X = Z }.
% 0.70/1.14 (3780) {G0,W8,D3,L2,V3,M2} { ! X = Y, member( X, unordered_pair( Y, Z ) )
% 0.70/1.14 }.
% 0.70/1.14 (3781) {G0,W8,D3,L2,V3,M2} { ! X = Z, member( X, unordered_pair( Y, Z ) )
% 0.70/1.14 }.
% 0.70/1.14 (3782) {G0,W9,D3,L2,V3,M2} { ! member( X, sum( Y ) ), member( skol2( Z, Y
% 0.70/1.14 ), Y ) }.
% 0.70/1.14 (3783) {G0,W9,D3,L2,V2,M2} { ! member( X, sum( Y ) ), member( X, skol2( X
% 0.70/1.14 , Y ) ) }.
% 0.70/1.14 (3784) {G0,W10,D3,L3,V3,M3} { ! member( Z, Y ), ! member( X, Z ), member(
% 0.70/1.14 X, sum( Y ) ) }.
% 0.70/1.14 (3785) {G0,W10,D3,L3,V3,M3} { ! member( X, product( Y ) ), ! member( Z, Y
% 0.70/1.14 ), member( X, Z ) }.
% 0.70/1.14 (3786) {G0,W9,D3,L2,V3,M2} { member( skol3( Z, Y ), Y ), member( X,
% 0.70/1.14 product( Y ) ) }.
% 0.70/1.14 (3787) {G0,W9,D3,L2,V2,M2} { ! member( X, skol3( X, Y ) ), member( X,
% 0.70/1.14 product( Y ) ) }.
% 0.70/1.14 (3788) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol6 ) }.
% 0.70/1.14 (3789) {G0,W3,D2,L1,V0,M1} { ! equal_set( skol4, skol6 ) }.
% 0.70/1.14 (3790) {G0,W3,D2,L1,V0,M1} { subset( skol6, skol5 ) }.
% 0.70/1.14 (3791) {G0,W3,D2,L1,V0,M1} { ! equal_set( skol6, skol5 ) }.
% 0.70/1.14 (3792) {G0,W3,D2,L1,V0,M1} { equal_set( skol4, skol5 ) }.
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Total Proof:
% 0.70/1.14
% 0.70/1.14 subsumption: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.70/1.14 , member( Z, Y ) }.
% 0.70/1.14 parent0: (3759) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ),
% 0.70/1.14 member( Z, Y ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 Y := Y
% 0.70/1.14 Z := Z
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 1 ==> 1
% 0.70/1.14 2 ==> 2
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ),
% 0.70/1.14 subset( X, Y ) }.
% 0.70/1.14 parent0: (3760) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset
% 0.70/1.14 ( X, Y ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 Y := Y
% 0.70/1.14 Z := Z
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 1 ==> 1
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.70/1.14 ( X, Y ) }.
% 0.70/1.14 parent0: (3761) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset(
% 0.70/1.14 X, Y ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 Y := Y
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 1 ==> 1
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (4) {G0,W6,D2,L2,V2,M2} I { ! equal_set( X, Y ), subset( Y, X
% 0.70/1.14 ) }.
% 0.70/1.14 parent0: (3763) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( Y, X )
% 0.70/1.14 }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 Y := Y
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 1 ==> 1
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.70/1.14 , equal_set( X, Y ) }.
% 0.70/1.14 parent0: (3764) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ),
% 0.70/1.14 equal_set( X, Y ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 Y := Y
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 1 ==> 1
% 0.70/1.14 2 ==> 2
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (29) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.70/1.14 parent0: (3788) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol6 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (31) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.70/1.14 parent0: (3790) {G0,W3,D2,L1,V0,M1} { subset( skol6, skol5 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (32) {G0,W3,D2,L1,V0,M1} I { ! equal_set( skol6, skol5 ) }.
% 0.70/1.14 parent0: (3791) {G0,W3,D2,L1,V0,M1} { ! equal_set( skol6, skol5 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (33) {G0,W3,D2,L1,V0,M1} I { equal_set( skol4, skol5 ) }.
% 0.70/1.14 parent0: (3792) {G0,W3,D2,L1,V0,M1} { equal_set( skol4, skol5 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (3846) {G1,W6,D2,L2,V1,M2} { ! member( X, skol4 ), member( X,
% 0.70/1.14 skol6 ) }.
% 0.70/1.14 parent0[0]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.70/1.14 , member( Z, Y ) }.
% 0.70/1.14 parent1[0]: (29) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := skol4
% 0.70/1.14 Y := skol6
% 0.70/1.14 Z := X
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (47) {G1,W6,D2,L2,V1,M2} R(29,0) { ! member( X, skol4 ),
% 0.70/1.14 member( X, skol6 ) }.
% 0.70/1.14 parent0: (3846) {G1,W6,D2,L2,V1,M2} { ! member( X, skol4 ), member( X,
% 0.70/1.14 skol6 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 1 ==> 1
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (3847) {G1,W3,D2,L1,V0,M1} { subset( skol5, skol4 ) }.
% 0.70/1.14 parent0[0]: (4) {G0,W6,D2,L2,V2,M2} I { ! equal_set( X, Y ), subset( Y, X )
% 0.70/1.14 }.
% 0.70/1.14 parent1[0]: (33) {G0,W3,D2,L1,V0,M1} I { equal_set( skol4, skol5 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := skol4
% 0.70/1.14 Y := skol5
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (60) {G1,W3,D2,L1,V0,M1} R(4,33) { subset( skol5, skol4 ) }.
% 0.70/1.14 parent0: (3847) {G1,W3,D2,L1,V0,M1} { subset( skol5, skol4 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (3848) {G1,W6,D2,L2,V1,M2} { ! member( X, skol5 ), member( X,
% 0.70/1.14 skol4 ) }.
% 0.70/1.14 parent0[0]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.70/1.14 , member( Z, Y ) }.
% 0.70/1.14 parent1[0]: (60) {G1,W3,D2,L1,V0,M1} R(4,33) { subset( skol5, skol4 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := skol5
% 0.70/1.14 Y := skol4
% 0.70/1.14 Z := X
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (70) {G2,W6,D2,L2,V1,M2} R(60,0) { ! member( X, skol5 ),
% 0.70/1.14 member( X, skol4 ) }.
% 0.70/1.14 parent0: (3848) {G1,W6,D2,L2,V1,M2} { ! member( X, skol5 ), member( X,
% 0.70/1.14 skol4 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 1 ==> 1
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (3849) {G1,W6,D2,L2,V0,M2} { ! subset( skol5, skol6 ),
% 0.70/1.14 equal_set( skol6, skol5 ) }.
% 0.70/1.14 parent0[0]: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.70/1.14 , equal_set( X, Y ) }.
% 0.70/1.14 parent1[0]: (31) {G0,W3,D2,L1,V0,M1} I { subset( skol6, skol5 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := skol6
% 0.70/1.14 Y := skol5
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (3851) {G1,W3,D2,L1,V0,M1} { ! subset( skol5, skol6 ) }.
% 0.70/1.14 parent0[0]: (32) {G0,W3,D2,L1,V0,M1} I { ! equal_set( skol6, skol5 ) }.
% 0.70/1.14 parent1[1]: (3849) {G1,W6,D2,L2,V0,M2} { ! subset( skol5, skol6 ),
% 0.70/1.14 equal_set( skol6, skol5 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (87) {G1,W3,D2,L1,V0,M1} R(5,31);r(32) { ! subset( skol5,
% 0.70/1.14 skol6 ) }.
% 0.70/1.14 parent0: (3851) {G1,W3,D2,L1,V0,M1} { ! subset( skol5, skol6 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (3852) {G1,W5,D3,L1,V0,M1} { member( skol1( skol5, skol6 ),
% 0.70/1.14 skol5 ) }.
% 0.70/1.14 parent0[0]: (87) {G1,W3,D2,L1,V0,M1} R(5,31);r(32) { ! subset( skol5, skol6
% 0.70/1.14 ) }.
% 0.70/1.14 parent1[1]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.70/1.14 ( X, Y ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 X := skol5
% 0.70/1.14 Y := skol6
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (104) {G2,W5,D3,L1,V0,M1} R(87,2) { member( skol1( skol5,
% 0.70/1.14 skol6 ), skol5 ) }.
% 0.70/1.14 parent0: (3852) {G1,W5,D3,L1,V0,M1} { member( skol1( skol5, skol6 ), skol5
% 0.70/1.14 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (3853) {G1,W5,D3,L1,V1,M1} { ! member( skol1( X, skol6 ),
% 0.70/1.14 skol6 ) }.
% 0.70/1.14 parent0[0]: (87) {G1,W3,D2,L1,V0,M1} R(5,31);r(32) { ! subset( skol5, skol6
% 0.70/1.14 ) }.
% 0.70/1.14 parent1[1]: (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ),
% 0.70/1.14 subset( X, Y ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 X := skol5
% 0.70/1.14 Y := skol6
% 0.70/1.14 Z := X
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (105) {G2,W5,D3,L1,V1,M1} R(87,1) { ! member( skol1( X, skol6
% 0.70/1.14 ), skol6 ) }.
% 0.70/1.14 parent0: (3853) {G1,W5,D3,L1,V1,M1} { ! member( skol1( X, skol6 ), skol6 )
% 0.70/1.14 }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (3854) {G3,W5,D3,L1,V0,M1} { member( skol1( skol5, skol6 ),
% 0.70/1.14 skol4 ) }.
% 0.70/1.14 parent0[0]: (70) {G2,W6,D2,L2,V1,M2} R(60,0) { ! member( X, skol5 ), member
% 0.70/1.14 ( X, skol4 ) }.
% 0.70/1.14 parent1[0]: (104) {G2,W5,D3,L1,V0,M1} R(87,2) { member( skol1( skol5, skol6
% 0.70/1.14 ), skol5 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := skol1( skol5, skol6 )
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (1807) {G3,W5,D3,L1,V0,M1} R(70,104) { member( skol1( skol5,
% 0.70/1.14 skol6 ), skol4 ) }.
% 0.70/1.14 parent0: (3854) {G3,W5,D3,L1,V0,M1} { member( skol1( skol5, skol6 ), skol4
% 0.70/1.14 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (3855) {G2,W5,D3,L1,V0,M1} { member( skol1( skol5, skol6 ),
% 0.70/1.14 skol6 ) }.
% 0.70/1.14 parent0[0]: (47) {G1,W6,D2,L2,V1,M2} R(29,0) { ! member( X, skol4 ), member
% 0.70/1.14 ( X, skol6 ) }.
% 0.70/1.14 parent1[0]: (1807) {G3,W5,D3,L1,V0,M1} R(70,104) { member( skol1( skol5,
% 0.70/1.14 skol6 ), skol4 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := skol1( skol5, skol6 )
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (3856) {G3,W0,D0,L0,V0,M0} { }.
% 0.70/1.14 parent0[0]: (105) {G2,W5,D3,L1,V1,M1} R(87,1) { ! member( skol1( X, skol6 )
% 0.70/1.14 , skol6 ) }.
% 0.70/1.14 parent1[0]: (3855) {G2,W5,D3,L1,V0,M1} { member( skol1( skol5, skol6 ),
% 0.70/1.14 skol6 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := skol5
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (3757) {G4,W0,D0,L0,V0,M0} R(47,1807);r(105) { }.
% 0.70/1.14 parent0: (3856) {G3,W0,D0,L0,V0,M0} { }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 Proof check complete!
% 0.70/1.14
% 0.70/1.14 Memory use:
% 0.70/1.14
% 0.70/1.14 space for terms: 46670
% 0.70/1.14 space for clauses: 171013
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 clauses generated: 4964
% 0.70/1.14 clauses kept: 3758
% 0.70/1.14 clauses selected: 153
% 0.70/1.14 clauses deleted: 7
% 0.70/1.14 clauses inuse deleted: 0
% 0.70/1.14
% 0.70/1.14 subsentry: 9810
% 0.70/1.14 literals s-matched: 6209
% 0.70/1.14 literals matched: 5956
% 0.70/1.14 full subsumption: 2792
% 0.70/1.14
% 0.70/1.14 checksum: 1814015864
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Bliksem ended
%------------------------------------------------------------------------------