%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET632+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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:59 EDT 2022
% Result : Theorem 0.74s 1.13s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET632+3 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.13 % Command : bliksem %s
% 0.14/0.33 % Computer : n015.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % DateTime : Sun Jul 10 13:25:38 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.74/1.13 *** allocated 10000 integers for termspace/termends
% 0.74/1.13 *** allocated 10000 integers for clauses
% 0.74/1.13 *** allocated 10000 integers for justifications
% 0.74/1.13 Bliksem 1.12
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Automatic Strategy Selection
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Clauses:
% 0.74/1.13
% 0.74/1.13 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.74/1.13 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.74/1.13 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.74/1.13 { ! intersect( X, Y ), member( skol2( Z, Y ), Y ) }.
% 0.74/1.13 { ! intersect( X, Y ), member( skol2( X, Y ), X ) }.
% 0.74/1.13 { ! member( Z, X ), ! member( Z, Y ), intersect( X, Y ) }.
% 0.74/1.13 { ! member( X, empty_set ) }.
% 0.74/1.13 { ! disjoint( X, Y ), ! intersect( X, Y ) }.
% 0.74/1.13 { intersect( X, Y ), disjoint( X, Y ) }.
% 0.74/1.13 { ! X = Y, subset( X, Y ) }.
% 0.74/1.13 { ! X = Y, subset( Y, X ) }.
% 0.74/1.13 { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.74/1.13 { ! intersect( X, Y ), intersect( Y, X ) }.
% 0.74/1.13 { subset( X, X ) }.
% 0.74/1.13 { ! empty( X ), ! member( Y, X ) }.
% 0.74/1.13 { member( skol3( X ), X ), empty( X ) }.
% 0.74/1.13 { subset( skol4, skol5 ) }.
% 0.74/1.13 { subset( skol4, skol6 ) }.
% 0.74/1.13 { disjoint( skol5, skol6 ) }.
% 0.74/1.13 { ! skol4 = empty_set }.
% 0.74/1.13
% 0.74/1.13 percentage equality = 0.108108, percentage horn = 0.850000
% 0.74/1.13 This is a problem with some equality
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Options Used:
% 0.74/1.13
% 0.74/1.13 useres = 1
% 0.74/1.13 useparamod = 1
% 0.74/1.13 useeqrefl = 1
% 0.74/1.13 useeqfact = 1
% 0.74/1.13 usefactor = 1
% 0.74/1.13 usesimpsplitting = 0
% 0.74/1.13 usesimpdemod = 5
% 0.74/1.13 usesimpres = 3
% 0.74/1.13
% 0.74/1.13 resimpinuse = 1000
% 0.74/1.13 resimpclauses = 20000
% 0.74/1.13 substype = eqrewr
% 0.74/1.13 backwardsubs = 1
% 0.74/1.13 selectoldest = 5
% 0.74/1.13
% 0.74/1.13 litorderings [0] = split
% 0.74/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.13
% 0.74/1.13 termordering = kbo
% 0.74/1.13
% 0.74/1.13 litapriori = 0
% 0.74/1.13 termapriori = 1
% 0.74/1.13 litaposteriori = 0
% 0.74/1.13 termaposteriori = 0
% 0.74/1.13 demodaposteriori = 0
% 0.74/1.13 ordereqreflfact = 0
% 0.74/1.13
% 0.74/1.13 litselect = negord
% 0.74/1.13
% 0.74/1.13 maxweight = 15
% 0.74/1.13 maxdepth = 30000
% 0.74/1.13 maxlength = 115
% 0.74/1.13 maxnrvars = 195
% 0.74/1.13 excuselevel = 1
% 0.74/1.13 increasemaxweight = 1
% 0.74/1.13
% 0.74/1.13 maxselected = 10000000
% 0.74/1.13 maxnrclauses = 10000000
% 0.74/1.13
% 0.74/1.13 showgenerated = 0
% 0.74/1.13 showkept = 0
% 0.74/1.13 showselected = 0
% 0.74/1.13 showdeleted = 0
% 0.74/1.13 showresimp = 1
% 0.74/1.13 showstatus = 2000
% 0.74/1.13
% 0.74/1.13 prologoutput = 0
% 0.74/1.13 nrgoals = 5000000
% 0.74/1.13 totalproof = 1
% 0.74/1.13
% 0.74/1.13 Symbols occurring in the translation:
% 0.74/1.13
% 0.74/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.13 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.74/1.13 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.74/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.13 subset [37, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.74/1.13 member [39, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.74/1.13 intersect [40, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.74/1.13 empty_set [41, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.74/1.13 disjoint [42, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.74/1.13 empty [43, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.74/1.13 skol1 [44, 2] (w:1, o:48, a:1, s:1, b:1),
% 0.74/1.13 skol2 [45, 2] (w:1, o:49, a:1, s:1, b:1),
% 0.74/1.13 skol3 [46, 1] (w:1, o:19, a:1, s:1, b:1),
% 0.74/1.13 skol4 [47, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.74/1.13 skol5 [48, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.74/1.13 skol6 [49, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Starting Search:
% 0.74/1.13
% 0.74/1.13 *** allocated 15000 integers for clauses
% 0.74/1.13 *** allocated 22500 integers for clauses
% 0.74/1.13 *** allocated 33750 integers for clauses
% 0.74/1.13 *** allocated 50625 integers for clauses
% 0.74/1.13 *** allocated 15000 integers for termspace/termends
% 0.74/1.13 Resimplifying inuse:
% 0.74/1.13 Done
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Bliksems!, er is een bewijs:
% 0.74/1.13 % SZS status Theorem
% 0.74/1.13 % SZS output start Refutation
% 0.74/1.13
% 0.74/1.13 (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.74/1.13 Y ) }.
% 0.74/1.13 (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.74/1.13 (3) {G0,W8,D3,L2,V3,M2} I { ! intersect( X, Y ), member( skol2( Z, Y ), Y )
% 0.74/1.13 }.
% 0.74/1.13 (4) {G0,W8,D3,L2,V2,M2} I { ! intersect( X, Y ), member( skol2( X, Y ), X )
% 0.74/1.13 }.
% 0.74/1.13 (5) {G0,W9,D2,L3,V3,M3} I { ! member( Z, X ), ! member( Z, Y ), intersect(
% 0.74/1.13 X, Y ) }.
% 0.74/1.13 (6) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.74/1.13 (7) {G0,W6,D2,L2,V2,M2} I { ! disjoint( X, Y ), ! intersect( X, Y ) }.
% 0.74/1.13 (9) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.74/1.13 (10) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.74/1.13 (11) {G0,W6,D2,L2,V2,M2} I { ! intersect( X, Y ), intersect( Y, X ) }.
% 0.74/1.13 (15) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol5 ) }.
% 0.74/1.13 (16) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.74/1.13 (17) {G0,W3,D2,L1,V0,M1} I { disjoint( skol5, skol6 ) }.
% 0.74/1.13 (18) {G0,W3,D2,L1,V0,M1} I { ! skol4 ==> empty_set }.
% 0.74/1.13 (21) {G1,W6,D2,L2,V1,M2} R(0,16) { ! member( X, skol4 ), member( X, skol6 )
% 0.74/1.13 }.
% 0.74/1.13 (22) {G1,W6,D2,L2,V2,M2} R(0,6) { ! subset( X, empty_set ), ! member( Y, X
% 0.74/1.13 ) }.
% 0.74/1.13 (23) {G1,W6,D2,L2,V1,M2} R(15,0) { ! member( X, skol4 ), member( X, skol5 )
% 0.74/1.13 }.
% 0.74/1.13 (28) {G2,W6,D2,L2,V2,M2} R(9,22) { ! X = empty_set, ! member( Y, X ) }.
% 0.74/1.13 (32) {G3,W6,D2,L2,V2,M2} R(2,28) { subset( X, Y ), ! X = empty_set }.
% 0.74/1.13 (54) {G1,W8,D3,L2,V2,M2} R(4,11) { member( skol2( X, Y ), X ), ! intersect
% 0.74/1.13 ( Y, X ) }.
% 0.74/1.13 (63) {G1,W11,D3,L3,V4,M3} R(5,3) { ! member( skol2( X, Y ), Z ), intersect
% 0.74/1.13 ( Y, Z ), ! intersect( T, Y ) }.
% 0.74/1.13 (81) {G1,W3,D2,L1,V0,M1} R(7,17) { ! intersect( skol5, skol6 ) }.
% 0.74/1.13 (122) {G4,W6,D2,L2,V1,M2} P(10,18);r(32) { ! X = empty_set, ! subset( skol4
% 0.74/1.13 , X ) }.
% 0.74/1.13 (123) {G5,W3,D2,L1,V0,M1} Q(122) { ! subset( skol4, empty_set ) }.
% 0.74/1.13 (125) {G6,W5,D3,L1,V0,M1} R(123,2) { member( skol1( skol4, empty_set ),
% 0.74/1.13 skol4 ) }.
% 0.74/1.13 (246) {G2,W9,D2,L3,V2,M3} R(23,5) { ! member( X, skol4 ), ! member( X, Y )
% 0.74/1.13 , intersect( skol5, Y ) }.
% 0.74/1.13 (253) {G3,W6,D2,L2,V1,M2} F(246) { ! member( X, skol4 ), intersect( skol5,
% 0.74/1.13 skol4 ) }.
% 0.74/1.13 (784) {G7,W3,D2,L1,V0,M1} R(253,125) { intersect( skol5, skol4 ) }.
% 0.74/1.13 (807) {G8,W5,D3,L1,V0,M1} R(784,54) { member( skol2( skol4, skol5 ), skol4
% 0.74/1.13 ) }.
% 0.74/1.13 (811) {G8,W3,D2,L1,V0,M1} R(784,11) { intersect( skol4, skol5 ) }.
% 0.74/1.13 (904) {G9,W5,D3,L1,V0,M1} R(807,21) { member( skol2( skol4, skol5 ), skol6
% 0.74/1.13 ) }.
% 0.74/1.13 (1026) {G10,W3,D2,L1,V1,M1} R(63,904);r(81) { ! intersect( X, skol5 ) }.
% 0.74/1.13 (1050) {G11,W0,D0,L0,V0,M0} R(1026,811) { }.
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 % SZS output end Refutation
% 0.74/1.13 found a proof!
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Unprocessed initial clauses:
% 0.74/1.13
% 0.74/1.13 (1052) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.74/1.13 , Y ) }.
% 0.74/1.13 (1053) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.74/1.13 }.
% 0.74/1.13 (1054) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y )
% 0.74/1.13 }.
% 0.74/1.13 (1055) {G0,W8,D3,L2,V3,M2} { ! intersect( X, Y ), member( skol2( Z, Y ), Y
% 0.74/1.13 ) }.
% 0.74/1.13 (1056) {G0,W8,D3,L2,V2,M2} { ! intersect( X, Y ), member( skol2( X, Y ), X
% 0.74/1.13 ) }.
% 0.74/1.13 (1057) {G0,W9,D2,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ), intersect
% 0.74/1.13 ( X, Y ) }.
% 0.74/1.13 (1058) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.74/1.13 (1059) {G0,W6,D2,L2,V2,M2} { ! disjoint( X, Y ), ! intersect( X, Y ) }.
% 0.74/1.13 (1060) {G0,W6,D2,L2,V2,M2} { intersect( X, Y ), disjoint( X, Y ) }.
% 0.74/1.13 (1061) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.74/1.13 (1062) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( Y, X ) }.
% 0.74/1.13 (1063) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.74/1.13 (1064) {G0,W6,D2,L2,V2,M2} { ! intersect( X, Y ), intersect( Y, X ) }.
% 0.74/1.13 (1065) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.74/1.13 (1066) {G0,W5,D2,L2,V2,M2} { ! empty( X ), ! member( Y, X ) }.
% 0.74/1.13 (1067) {G0,W6,D3,L2,V1,M2} { member( skol3( X ), X ), empty( X ) }.
% 0.74/1.13 (1068) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol5 ) }.
% 0.74/1.13 (1069) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol6 ) }.
% 0.74/1.13 (1070) {G0,W3,D2,L1,V0,M1} { disjoint( skol5, skol6 ) }.
% 0.74/1.13 (1071) {G0,W3,D2,L1,V0,M1} { ! skol4 = empty_set }.
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Total Proof:
% 0.74/1.13
% 0.74/1.13 subsumption: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.74/1.13 , member( Z, Y ) }.
% 0.74/1.13 parent0: (1052) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ),
% 0.74/1.13 member( Z, Y ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 Y := Y
% 0.74/1.13 Z := Z
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 2 ==> 2
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.74/1.13 ( X, Y ) }.
% 0.74/1.13 parent0: (1054) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset(
% 0.74/1.13 X, Y ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 Y := Y
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (3) {G0,W8,D3,L2,V3,M2} I { ! intersect( X, Y ), member( skol2
% 0.74/1.13 ( Z, Y ), Y ) }.
% 0.74/1.13 parent0: (1055) {G0,W8,D3,L2,V3,M2} { ! intersect( X, Y ), member( skol2(
% 0.74/1.13 Z, Y ), Y ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 Y := Y
% 0.74/1.13 Z := Z
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (4) {G0,W8,D3,L2,V2,M2} I { ! intersect( X, Y ), member( skol2
% 0.74/1.13 ( X, Y ), X ) }.
% 0.74/1.13 parent0: (1056) {G0,W8,D3,L2,V2,M2} { ! intersect( X, Y ), member( skol2(
% 0.74/1.13 X, Y ), X ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 Y := Y
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (5) {G0,W9,D2,L3,V3,M3} I { ! member( Z, X ), ! member( Z, Y )
% 0.74/1.13 , intersect( X, Y ) }.
% 0.74/1.13 parent0: (1057) {G0,W9,D2,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ),
% 0.74/1.13 intersect( X, Y ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 Y := Y
% 0.74/1.13 Z := Z
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 2 ==> 2
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (6) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.74/1.13 parent0: (1058) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (7) {G0,W6,D2,L2,V2,M2} I { ! disjoint( X, Y ), ! intersect( X
% 0.74/1.13 , Y ) }.
% 0.74/1.13 parent0: (1059) {G0,W6,D2,L2,V2,M2} { ! disjoint( X, Y ), ! intersect( X,
% 0.74/1.13 Y ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 Y := Y
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (9) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.74/1.13 parent0: (1061) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 Y := Y
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (10) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X
% 0.74/1.13 ), X = Y }.
% 0.74/1.13 parent0: (1063) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ),
% 0.74/1.13 X = Y }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 Y := Y
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 2 ==> 2
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (11) {G0,W6,D2,L2,V2,M2} I { ! intersect( X, Y ), intersect( Y
% 0.74/1.13 , X ) }.
% 0.74/1.13 parent0: (1064) {G0,W6,D2,L2,V2,M2} { ! intersect( X, Y ), intersect( Y, X
% 0.74/1.13 ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 Y := Y
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (15) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol5 ) }.
% 0.74/1.13 parent0: (1068) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol5 ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (16) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.74/1.13 parent0: (1069) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol6 ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (17) {G0,W3,D2,L1,V0,M1} I { disjoint( skol5, skol6 ) }.
% 0.74/1.13 parent0: (1070) {G0,W3,D2,L1,V0,M1} { disjoint( skol5, skol6 ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (18) {G0,W3,D2,L1,V0,M1} I { ! skol4 ==> empty_set }.
% 0.74/1.13 parent0: (1071) {G0,W3,D2,L1,V0,M1} { ! skol4 = empty_set }.
% 0.74/1.13 substitution0:
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 resolution: (1102) {G1,W6,D2,L2,V1,M2} { ! member( X, skol4 ), member( X,
% 0.74/1.13 skol6 ) }.
% 0.74/1.13 parent0[0]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.74/1.13 , member( Z, Y ) }.
% 0.74/1.13 parent1[0]: (16) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol6 ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := skol4
% 0.74/1.13 Y := skol6
% 0.74/1.13 Z := X
% 0.74/1.13 end
% 0.74/1.13 substitution1:
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (21) {G1,W6,D2,L2,V1,M2} R(0,16) { ! member( X, skol4 ),
% 0.74/1.13 member( X, skol6 ) }.
% 0.74/1.13 parent0: (1102) {G1,W6,D2,L2,V1,M2} { ! member( X, skol4 ), member( X,
% 0.74/1.13 skol6 ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 resolution: (1103) {G1,W6,D2,L2,V2,M2} { ! subset( Y, empty_set ), !
% 0.74/1.13 member( X, Y ) }.
% 0.74/1.13 parent0[0]: (6) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.74/1.13 parent1[2]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.74/1.13 , member( Z, Y ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 end
% 0.74/1.13 substitution1:
% 0.74/1.13 X := Y
% 0.74/1.13 Y := empty_set
% 0.74/1.13 Z := X
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (22) {G1,W6,D2,L2,V2,M2} R(0,6) { ! subset( X, empty_set ), !
% 0.74/1.13 member( Y, X ) }.
% 0.74/1.13 parent0: (1103) {G1,W6,D2,L2,V2,M2} { ! subset( Y, empty_set ), ! member(
% 0.74/1.13 X, Y ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := Y
% 0.74/1.13 Y := X
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 resolution: (1104) {G1,W6,D2,L2,V1,M2} { ! member( X, skol4 ), member( X,
% 0.74/1.13 skol5 ) }.
% 0.74/1.13 parent0[0]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.74/1.13 , member( Z, Y ) }.
% 0.74/1.13 parent1[0]: (15) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol5 ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := skol4
% 0.74/1.13 Y := skol5
% 0.74/1.13 Z := X
% 0.74/1.13 end
% 0.74/1.13 substitution1:
% 0.74/1.13 end
% 0.74/1.13
% 0.74/1.13 subsumption: (23) {G1,W6,D2,L2,V1,M2} R(15,0) { ! member( X, skol4 ),
% 0.74/1.13 member( X, skol5 ) }.
% 0.74/1.13 parent0: (1104) {G1,W6,D2,L2,V1,M2} { ! member( X, skol4 ), member( X,
% 0.74/1.13 skol5 ) }.
% 0.74/1.13 substitution0:
% 0.74/1.13 X := X
% 0.74/1.13 end
% 0.74/1.13 permutation0:
% 0.74/1.13 0 ==> 0
% 0.74/1.13 1 ==> 1
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 eqswap: (1105) {G0,W6,D2,L2,V2,M2} { ! Y = X, subset( X, Y ) }.
% 1.13/1.48 parent0[0]: (9) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 resolution: (1106) {G1,W6,D2,L2,V2,M2} { ! member( Y, X ), ! empty_set = X
% 1.13/1.48 }.
% 1.13/1.48 parent0[0]: (22) {G1,W6,D2,L2,V2,M2} R(0,6) { ! subset( X, empty_set ), !
% 1.13/1.48 member( Y, X ) }.
% 1.13/1.48 parent1[1]: (1105) {G0,W6,D2,L2,V2,M2} { ! Y = X, subset( X, Y ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 end
% 1.13/1.48 substitution1:
% 1.13/1.48 X := X
% 1.13/1.48 Y := empty_set
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 eqswap: (1107) {G1,W6,D2,L2,V2,M2} { ! X = empty_set, ! member( Y, X ) }.
% 1.13/1.48 parent0[1]: (1106) {G1,W6,D2,L2,V2,M2} { ! member( Y, X ), ! empty_set = X
% 1.13/1.48 }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 subsumption: (28) {G2,W6,D2,L2,V2,M2} R(9,22) { ! X = empty_set, ! member(
% 1.13/1.48 Y, X ) }.
% 1.13/1.48 parent0: (1107) {G1,W6,D2,L2,V2,M2} { ! X = empty_set, ! member( Y, X )
% 1.13/1.48 }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 end
% 1.13/1.48 permutation0:
% 1.13/1.48 0 ==> 0
% 1.13/1.48 1 ==> 1
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 eqswap: (1108) {G2,W6,D2,L2,V2,M2} { ! empty_set = X, ! member( Y, X ) }.
% 1.13/1.48 parent0[0]: (28) {G2,W6,D2,L2,V2,M2} R(9,22) { ! X = empty_set, ! member( Y
% 1.13/1.48 , X ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 resolution: (1109) {G1,W6,D2,L2,V2,M2} { ! empty_set = X, subset( X, Y )
% 1.13/1.48 }.
% 1.13/1.48 parent0[1]: (1108) {G2,W6,D2,L2,V2,M2} { ! empty_set = X, ! member( Y, X )
% 1.13/1.48 }.
% 1.13/1.48 parent1[0]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 1.13/1.48 ( X, Y ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := skol1( X, Y )
% 1.13/1.48 end
% 1.13/1.48 substitution1:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 eqswap: (1110) {G1,W6,D2,L2,V2,M2} { ! X = empty_set, subset( X, Y ) }.
% 1.13/1.48 parent0[0]: (1109) {G1,W6,D2,L2,V2,M2} { ! empty_set = X, subset( X, Y )
% 1.13/1.48 }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 subsumption: (32) {G3,W6,D2,L2,V2,M2} R(2,28) { subset( X, Y ), ! X =
% 1.13/1.48 empty_set }.
% 1.13/1.48 parent0: (1110) {G1,W6,D2,L2,V2,M2} { ! X = empty_set, subset( X, Y ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 end
% 1.13/1.48 permutation0:
% 1.13/1.48 0 ==> 1
% 1.13/1.48 1 ==> 0
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 resolution: (1111) {G1,W8,D3,L2,V2,M2} { member( skol2( X, Y ), X ), !
% 1.13/1.48 intersect( Y, X ) }.
% 1.13/1.48 parent0[0]: (4) {G0,W8,D3,L2,V2,M2} I { ! intersect( X, Y ), member( skol2
% 1.13/1.48 ( X, Y ), X ) }.
% 1.13/1.48 parent1[1]: (11) {G0,W6,D2,L2,V2,M2} I { ! intersect( X, Y ), intersect( Y
% 1.13/1.48 , X ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 end
% 1.13/1.48 substitution1:
% 1.13/1.48 X := Y
% 1.13/1.48 Y := X
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 subsumption: (54) {G1,W8,D3,L2,V2,M2} R(4,11) { member( skol2( X, Y ), X )
% 1.13/1.48 , ! intersect( Y, X ) }.
% 1.13/1.48 parent0: (1111) {G1,W8,D3,L2,V2,M2} { member( skol2( X, Y ), X ), !
% 1.13/1.48 intersect( Y, X ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 end
% 1.13/1.48 permutation0:
% 1.13/1.48 0 ==> 0
% 1.13/1.48 1 ==> 1
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 resolution: (1112) {G1,W11,D3,L3,V4,M3} { ! member( skol2( X, Y ), Z ),
% 1.13/1.48 intersect( Y, Z ), ! intersect( T, Y ) }.
% 1.13/1.48 parent0[0]: (5) {G0,W9,D2,L3,V3,M3} I { ! member( Z, X ), ! member( Z, Y )
% 1.13/1.48 , intersect( X, Y ) }.
% 1.13/1.48 parent1[1]: (3) {G0,W8,D3,L2,V3,M2} I { ! intersect( X, Y ), member( skol2
% 1.13/1.48 ( Z, Y ), Y ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := Y
% 1.13/1.48 Y := Z
% 1.13/1.48 Z := skol2( X, Y )
% 1.13/1.48 end
% 1.13/1.48 substitution1:
% 1.13/1.48 X := T
% 1.13/1.48 Y := Y
% 1.13/1.48 Z := X
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 subsumption: (63) {G1,W11,D3,L3,V4,M3} R(5,3) { ! member( skol2( X, Y ), Z
% 1.13/1.48 ), intersect( Y, Z ), ! intersect( T, Y ) }.
% 1.13/1.48 parent0: (1112) {G1,W11,D3,L3,V4,M3} { ! member( skol2( X, Y ), Z ),
% 1.13/1.48 intersect( Y, Z ), ! intersect( T, Y ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := X
% 1.13/1.48 Y := Y
% 1.13/1.48 Z := Z
% 1.13/1.48 T := T
% 1.13/1.48 end
% 1.13/1.48 permutation0:
% 1.13/1.48 0 ==> 0
% 1.13/1.48 1 ==> 1
% 1.13/1.48 2 ==> 2
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 resolution: (1114) {G1,W3,D2,L1,V0,M1} { ! intersect( skol5, skol6 ) }.
% 1.13/1.48 parent0[0]: (7) {G0,W6,D2,L2,V2,M2} I { ! disjoint( X, Y ), ! intersect( X
% 1.13/1.48 , Y ) }.
% 1.13/1.48 parent1[0]: (17) {G0,W3,D2,L1,V0,M1} I { disjoint( skol5, skol6 ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 X := skol5
% 1.13/1.48 Y := skol6
% 1.13/1.48 end
% 1.13/1.48 substitution1:
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 subsumption: (81) {G1,W3,D2,L1,V0,M1} R(7,17) { ! intersect( skol5, skol6 )
% 1.13/1.48 }.
% 1.13/1.48 parent0: (1114) {G1,W3,D2,L1,V0,M1} { ! intersect( skol5, skol6 ) }.
% 1.13/1.48 substitution0:
% 1.13/1.48 end
% 1.13/1.48 permutation0:
% 1.13/1.48 0 ==> 0
% 1.13/1.48 end
% 1.13/1.48
% 1.13/1.48 *** allocated 22500 integers for termspace/termends
% 1.13/1.48 *** allocated 75937 integers for clauses
% 1.13/1.48 *** allocated 33750 integers for termspace/termends
% 1.13/1.48 *** allocated 15000 integers for justifications
% 1.13/1.48 *** allocated 50625 integers for termspace/termends
% 1.13/1.48 *** allocated Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------