TSTP Solution File: SET095+4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET095+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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:46:58 EDT 2022
% Result : Theorem 0.75s 1.55s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET095+4 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Mon Jul 11 00:05:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.55 *** allocated 10000 integers for termspace/termends
% 0.75/1.55 *** allocated 10000 integers for clauses
% 0.75/1.55 *** allocated 10000 integers for justifications
% 0.75/1.55 Bliksem 1.12
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 Automatic Strategy Selection
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 Clauses:
% 0.75/1.55
% 0.75/1.55 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.75/1.55 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.75/1.55 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.75/1.55 { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.75/1.55 { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.75/1.55 { ! subset( X, Y ), ! subset( Y, X ), equal_set( X, Y ) }.
% 0.75/1.55 { ! member( X, power_set( Y ) ), subset( X, Y ) }.
% 0.75/1.55 { ! subset( X, Y ), member( X, power_set( Y ) ) }.
% 0.75/1.55 { ! member( X, intersection( Y, Z ) ), member( X, Y ) }.
% 0.75/1.55 { ! member( X, intersection( Y, Z ) ), member( X, Z ) }.
% 0.75/1.55 { ! member( X, Y ), ! member( X, Z ), member( X, intersection( Y, Z ) ) }.
% 0.75/1.55 { ! member( X, union( Y, Z ) ), member( X, Y ), member( X, Z ) }.
% 0.75/1.55 { ! member( X, Y ), member( X, union( Y, Z ) ) }.
% 0.75/1.55 { ! member( X, Z ), member( X, union( Y, Z ) ) }.
% 0.75/1.55 { ! member( X, empty_set ) }.
% 0.75/1.55 { ! member( X, difference( Z, Y ) ), member( X, Z ) }.
% 0.75/1.55 { ! member( X, difference( Z, Y ) ), ! member( X, Y ) }.
% 0.75/1.55 { ! member( X, Z ), member( X, Y ), member( X, difference( Z, Y ) ) }.
% 0.75/1.55 { ! member( X, singleton( Y ) ), X = Y }.
% 0.75/1.55 { ! X = Y, member( X, singleton( Y ) ) }.
% 0.75/1.55 { ! member( X, unordered_pair( Y, Z ) ), X = Y, X = Z }.
% 0.75/1.55 { ! X = Y, member( X, unordered_pair( Y, Z ) ) }.
% 0.75/1.55 { ! X = Z, member( X, unordered_pair( Y, Z ) ) }.
% 0.75/1.55 { ! member( X, sum( Y ) ), member( skol2( Z, Y ), Y ) }.
% 0.75/1.55 { ! member( X, sum( Y ) ), member( X, skol2( X, Y ) ) }.
% 0.75/1.55 { ! member( Z, Y ), ! member( X, Z ), member( X, sum( Y ) ) }.
% 0.75/1.55 { ! member( X, product( Y ) ), ! member( Z, Y ), member( X, Z ) }.
% 0.75/1.55 { member( skol3( Z, Y ), Y ), member( X, product( Y ) ) }.
% 0.75/1.55 { ! member( X, skol3( X, Y ) ), member( X, product( Y ) ) }.
% 0.75/1.55 { member( skol5, skol4 ) }.
% 0.75/1.55 { ! subset( singleton( skol5 ), skol4 ) }.
% 0.75/1.55
% 0.75/1.55 percentage equality = 0.089552, percentage horn = 0.838710
% 0.75/1.55 This is a problem with some equality
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 Options Used:
% 0.75/1.55
% 0.75/1.55 useres = 1
% 0.75/1.55 useparamod = 1
% 0.75/1.55 useeqrefl = 1
% 0.75/1.55 useeqfact = 1
% 0.75/1.55 usefactor = 1
% 0.75/1.55 usesimpsplitting = 0
% 0.75/1.55 usesimpdemod = 5
% 0.75/1.55 usesimpres = 3
% 0.75/1.55
% 0.75/1.55 resimpinuse = 1000
% 0.75/1.55 resimpclauses = 20000
% 0.75/1.55 substype = eqrewr
% 0.75/1.55 backwardsubs = 1
% 0.75/1.55 selectoldest = 5
% 0.75/1.55
% 0.75/1.55 litorderings [0] = split
% 0.75/1.55 litorderings [1] = extend the termordering, first sorting on arguments
% 0.75/1.55
% 0.75/1.55 termordering = kbo
% 0.75/1.55
% 0.75/1.55 litapriori = 0
% 0.75/1.55 termapriori = 1
% 0.75/1.55 litaposteriori = 0
% 0.75/1.55 termaposteriori = 0
% 0.75/1.55 demodaposteriori = 0
% 0.75/1.55 ordereqreflfact = 0
% 0.75/1.55
% 0.75/1.55 litselect = negord
% 0.75/1.55
% 0.75/1.55 maxweight = 15
% 0.75/1.55 maxdepth = 30000
% 0.75/1.55 maxlength = 115
% 0.75/1.55 maxnrvars = 195
% 0.75/1.55 excuselevel = 1
% 0.75/1.55 increasemaxweight = 1
% 0.75/1.55
% 0.75/1.55 maxselected = 10000000
% 0.75/1.55 maxnrclauses = 10000000
% 0.75/1.55
% 0.75/1.55 showgenerated = 0
% 0.75/1.55 showkept = 0
% 0.75/1.55 showselected = 0
% 0.75/1.55 showdeleted = 0
% 0.75/1.55 showresimp = 1
% 0.75/1.55 showstatus = 2000
% 0.75/1.55
% 0.75/1.55 prologoutput = 0
% 0.75/1.55 nrgoals = 5000000
% 0.75/1.55 totalproof = 1
% 0.75/1.55
% 0.75/1.55 Symbols occurring in the translation:
% 0.75/1.55
% 0.75/1.55 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.75/1.55 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.75/1.55 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.75/1.55 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.55 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.55 subset [37, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.75/1.55 member [39, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.75/1.55 equal_set [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.75/1.55 power_set [41, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.75/1.55 intersection [42, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.75/1.55 union [43, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.75/1.55 empty_set [44, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.75/1.55 difference [46, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.75/1.55 singleton [47, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.75/1.55 unordered_pair [48, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.75/1.55 sum [49, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.75/1.55 product [51, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.75/1.55 skol1 [52, 2] (w:1, o:54, a:1, s:1, b:1),
% 0.75/1.55 skol2 [53, 2] (w:1, o:55, a:1, s:1, b:1),
% 0.75/1.55 skol3 [54, 2] (w:1, o:56, a:1, s:1, b:1),
% 0.75/1.55 skol4 [55, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.75/1.55 skol5 [56, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 Starting Search:
% 0.75/1.55
% 0.75/1.55 *** allocated 15000 integers for clauses
% 0.75/1.55 *** allocated 22500 integers for clauses
% 0.75/1.55 *** allocated 33750 integers for clauses
% 0.75/1.55 *** allocated 50625 integers for clauses
% 0.75/1.55 *** allocated 15000 integers for termspace/termends
% 0.75/1.55 *** allocated 75937 integers for clauses
% 0.75/1.55 *** allocated 22500 integers for termspace/termends
% 0.75/1.55 *** allocated 113905 integers for clauses
% 0.75/1.55 Resimplifying inuse:
% 0.75/1.55 Done
% 0.75/1.55
% 0.75/1.55 *** allocated 33750 integers for termspace/termends
% 0.75/1.55
% 0.75/1.55 Intermediate Status:
% 0.75/1.55 Generated: 2799
% 0.75/1.55 Kept: 2012
% 0.75/1.55 Inuse: 110
% 0.75/1.55 Deleted: 4
% 0.75/1.55 Deletedinuse: 1
% 0.75/1.55
% 0.75/1.55 *** allocated 170857 integers for clauses
% 0.75/1.55 *** allocated 50625 integers for termspace/termends
% 0.75/1.55 Resimplifying inuse:
% 0.75/1.55 Done
% 0.75/1.55
% 0.75/1.55 Resimplifying inuse:
% 0.75/1.55 Done
% 0.75/1.55
% 0.75/1.55 *** allocated 256285 integers for clauses
% 0.75/1.55 *** allocated 75937 integers for termspace/termends
% 0.75/1.55
% 0.75/1.55 Intermediate Status:
% 0.75/1.55 Generated: 6519
% 0.75/1.55 Kept: 4467
% 0.75/1.55 Inuse: 157
% 0.75/1.55 Deleted: 5
% 0.75/1.55 Deletedinuse: 1
% 0.75/1.55
% 0.75/1.55 Resimplifying inuse:
% 0.75/1.55 Done
% 0.75/1.55
% 0.75/1.55 *** allocated 113905 integers for termspace/termends
% 0.75/1.55 *** allocated 384427 integers for clauses
% 0.75/1.55 Resimplifying inuse:
% 0.75/1.55 Done
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 Intermediate Status:
% 0.75/1.55 Generated: 10357
% 0.75/1.55 Kept: 6504
% 0.75/1.55 Inuse: 192
% 0.75/1.55 Deleted: 5
% 0.75/1.55 Deletedinuse: 1
% 0.75/1.55
% 0.75/1.55 Resimplifying inuse:
% 0.75/1.55 Done
% 0.75/1.55
% 0.75/1.55 Resimplifying inuse:
% 0.75/1.55 Done
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 Intermediate Status:
% 0.75/1.55 Generated: 14524
% 0.75/1.55 Kept: 8542
% 0.75/1.55 Inuse: 231
% 0.75/1.55 Deleted: 12
% 0.75/1.55 Deletedinuse: 7
% 0.75/1.55
% 0.75/1.55 *** allocated 170857 integers for termspace/termends
% 0.75/1.55 *** allocated 576640 integers for clauses
% 0.75/1.55 Resimplifying inuse:
% 0.75/1.55 Done
% 0.75/1.55
% 0.75/1.55 Resimplifying inuse:
% 0.75/1.55 Done
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 Intermediate Status:
% 0.75/1.55 Generated: 19188
% 0.75/1.55 Kept: 10553
% 0.75/1.55 Inuse: 280
% 0.75/1.55 Deleted: 14
% 0.75/1.55 Deletedinuse: 8
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 Bliksems!, er is een bewijs:
% 0.75/1.55 % SZS status Theorem
% 0.75/1.55 % SZS output start Refutation
% 0.75/1.55
% 0.75/1.55 (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.75/1.55 Y ) }.
% 0.75/1.55 (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.75/1.55 }.
% 0.75/1.55 (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.75/1.55 (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.75/1.55 (18) {G0,W7,D3,L2,V2,M2} I { ! member( X, singleton( Y ) ), X = Y }.
% 0.75/1.55 (20) {G0,W11,D3,L3,V3,M3} I { ! member( X, unordered_pair( Y, Z ) ), X = Y
% 0.75/1.55 , X = Z }.
% 0.75/1.55 (21) {G0,W8,D3,L2,V3,M2} I { ! X = Y, member( X, unordered_pair( Y, Z ) )
% 0.75/1.55 }.
% 0.75/1.55 (29) {G0,W3,D2,L1,V0,M1} I { member( skol5, skol4 ) }.
% 0.75/1.55 (30) {G0,W4,D3,L1,V0,M1} I { ! subset( singleton( skol5 ), skol4 ) }.
% 0.75/1.55 (37) {G1,W11,D3,L3,V3,M3} E(20) { ! X = Y, ! member( Z, unordered_pair( Y,
% 0.75/1.55 X ) ), Z = Y }.
% 0.75/1.55 (38) {G1,W5,D3,L1,V2,M1} Q(21) { member( X, unordered_pair( X, Y ) ) }.
% 0.75/1.55 (45) {G1,W6,D2,L2,V2,M2} R(0,14) { ! subset( X, empty_set ), ! member( Y, X
% 0.75/1.55 ) }.
% 0.75/1.55 (47) {G2,W5,D3,L1,V2,M1} R(45,38) { ! subset( unordered_pair( X, Y ),
% 0.75/1.55 empty_set ) }.
% 0.75/1.55 (53) {G1,W5,D3,L1,V1,M1} R(1,30) { ! member( skol1( X, skol4 ), skol4 ) }.
% 0.75/1.55 (54) {G2,W8,D3,L2,V2,M2} R(53,0) { ! subset( X, skol4 ), ! member( skol1( Y
% 0.75/1.55 , skol4 ), X ) }.
% 0.75/1.55 (62) {G3,W9,D4,L1,V2,M1} R(2,47) { member( skol1( unordered_pair( X, Y ),
% 0.75/1.55 empty_set ), unordered_pair( X, Y ) ) }.
% 0.75/1.55 (63) {G1,W6,D2,L2,V2,M2} R(2,1) { subset( X, X ), subset( Y, X ) }.
% 0.75/1.55 (72) {G2,W3,D2,L1,V1,M1} F(63) { subset( X, X ) }.
% 0.75/1.55 (7497) {G4,W10,D4,L2,V2,M2} R(62,37) { ! X = Y, skol1( unordered_pair( Y, X
% 0.75/1.55 ), empty_set ) ==> Y }.
% 0.75/1.55 (7503) {G4,W14,D4,L2,V2,M2} R(62,20) { skol1( unordered_pair( X, Y ),
% 0.75/1.55 empty_set ) ==> X, skol1( unordered_pair( X, Y ), empty_set ) ==> Y }.
% 0.75/1.55 (7519) {G5,W6,D2,L2,V2,M2} E(7503);d(7497) { ! X = Y, X = Y }.
% 0.75/1.55 (8082) {G6,W6,D2,L2,V1,M2} P(7519,29) { member( X, skol4 ), ! skol5 = X }.
% 0.75/1.55 (9996) {G7,W5,D3,L1,V1,M1} R(8082,54);r(72) { ! skol1( X, skol4 ) ==> skol5
% 0.75/1.55 }.
% 0.75/1.55 (10047) {G8,W9,D3,L2,V2,M2} P(18,9996) { ! Y = skol5, ! member( skol1( X,
% 0.75/1.55 skol4 ), singleton( Y ) ) }.
% 0.75/1.55 (10050) {G9,W6,D3,L1,V1,M1} Q(10047) { ! member( skol1( X, skol4 ),
% 0.75/1.55 singleton( skol5 ) ) }.
% 0.75/1.55 (11074) {G10,W0,D0,L0,V0,M0} R(10050,2);r(30) { }.
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 % SZS output end Refutation
% 0.75/1.55 found a proof!
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 Unprocessed initial clauses:
% 0.75/1.55
% 0.75/1.55 (11076) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member(
% 0.75/1.55 Z, Y ) }.
% 0.75/1.55 (11077) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.75/1.55 }.
% 0.75/1.55 (11078) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y )
% 0.75/1.55 }.
% 0.75/1.55 (11079) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.75/1.55 (11080) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.75/1.55 (11081) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ),
% 0.75/1.55 equal_set( X, Y ) }.
% 0.75/1.55 (11082) {G0,W7,D3,L2,V2,M2} { ! member( X, power_set( Y ) ), subset( X, Y
% 0.75/1.55 ) }.
% 0.75/1.55 (11083) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), member( X, power_set( Y )
% 0.75/1.55 ) }.
% 0.75/1.55 (11084) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member
% 0.75/1.55 ( X, Y ) }.
% 0.75/1.55 (11085) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member
% 0.75/1.55 ( X, Z ) }.
% 0.75/1.55 (11086) {G0,W11,D3,L3,V3,M3} { ! member( X, Y ), ! member( X, Z ), member
% 0.75/1.55 ( X, intersection( Y, Z ) ) }.
% 0.75/1.55 (11087) {G0,W11,D3,L3,V3,M3} { ! member( X, union( Y, Z ) ), member( X, Y
% 0.75/1.55 ), member( X, Z ) }.
% 0.75/1.55 (11088) {G0,W8,D3,L2,V3,M2} { ! member( X, Y ), member( X, union( Y, Z ) )
% 0.75/1.55 }.
% 0.75/1.55 (11089) {G0,W8,D3,L2,V3,M2} { ! member( X, Z ), member( X, union( Y, Z ) )
% 0.75/1.55 }.
% 0.75/1.55 (11090) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.75/1.55 (11091) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), member( X
% 0.75/1.55 , Z ) }.
% 0.75/1.55 (11092) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), ! member
% 0.75/1.55 ( X, Y ) }.
% 0.75/1.55 (11093) {G0,W11,D3,L3,V3,M3} { ! member( X, Z ), member( X, Y ), member( X
% 0.75/1.55 , difference( Z, Y ) ) }.
% 0.75/1.55 (11094) {G0,W7,D3,L2,V2,M2} { ! member( X, singleton( Y ) ), X = Y }.
% 0.75/1.55 (11095) {G0,W7,D3,L2,V2,M2} { ! X = Y, member( X, singleton( Y ) ) }.
% 0.75/1.55 (11096) {G0,W11,D3,L3,V3,M3} { ! member( X, unordered_pair( Y, Z ) ), X =
% 0.75/1.55 Y, X = Z }.
% 0.75/1.55 (11097) {G0,W8,D3,L2,V3,M2} { ! X = Y, member( X, unordered_pair( Y, Z ) )
% 0.75/1.55 }.
% 0.75/1.55 (11098) {G0,W8,D3,L2,V3,M2} { ! X = Z, member( X, unordered_pair( Y, Z ) )
% 0.75/1.55 }.
% 0.75/1.55 (11099) {G0,W9,D3,L2,V3,M2} { ! member( X, sum( Y ) ), member( skol2( Z, Y
% 0.75/1.55 ), Y ) }.
% 0.75/1.55 (11100) {G0,W9,D3,L2,V2,M2} { ! member( X, sum( Y ) ), member( X, skol2( X
% 0.75/1.55 , Y ) ) }.
% 0.75/1.55 (11101) {G0,W10,D3,L3,V3,M3} { ! member( Z, Y ), ! member( X, Z ), member
% 0.75/1.55 ( X, sum( Y ) ) }.
% 0.75/1.55 (11102) {G0,W10,D3,L3,V3,M3} { ! member( X, product( Y ) ), ! member( Z, Y
% 0.75/1.55 ), member( X, Z ) }.
% 0.75/1.55 (11103) {G0,W9,D3,L2,V3,M2} { member( skol3( Z, Y ), Y ), member( X,
% 0.75/1.55 product( Y ) ) }.
% 0.75/1.55 (11104) {G0,W9,D3,L2,V2,M2} { ! member( X, skol3( X, Y ) ), member( X,
% 0.75/1.55 product( Y ) ) }.
% 0.75/1.55 (11105) {G0,W3,D2,L1,V0,M1} { member( skol5, skol4 ) }.
% 0.75/1.55 (11106) {G0,W4,D3,L1,V0,M1} { ! subset( singleton( skol5 ), skol4 ) }.
% 0.75/1.55
% 0.75/1.55
% 0.75/1.55 Total Proof:
% 0.75/1.55
% 0.75/1.55 subsumption: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.75/1.55 , member( Z, Y ) }.
% 0.75/1.55 parent0: (11076) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X )
% 0.75/1.55 , member( Z, Y ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 Z := Z
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 1
% 0.75/1.55 2 ==> 2
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ),
% 0.75/1.55 subset( X, Y ) }.
% 0.75/1.55 parent0: (11077) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ),
% 0.75/1.55 subset( X, Y ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 Z := Z
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 1
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.75/1.55 ( X, Y ) }.
% 0.75/1.55 parent0: (11078) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset
% 0.75/1.55 ( X, Y ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 1
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.75/1.55 parent0: (11090) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (18) {G0,W7,D3,L2,V2,M2} I { ! member( X, singleton( Y ) ), X
% 0.75/1.55 = Y }.
% 0.75/1.55 parent0: (11094) {G0,W7,D3,L2,V2,M2} { ! member( X, singleton( Y ) ), X =
% 0.75/1.55 Y }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 1
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (20) {G0,W11,D3,L3,V3,M3} I { ! member( X, unordered_pair( Y,
% 0.75/1.55 Z ) ), X = Y, X = Z }.
% 0.75/1.55 parent0: (11096) {G0,W11,D3,L3,V3,M3} { ! member( X, unordered_pair( Y, Z
% 0.75/1.55 ) ), X = Y, X = Z }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 Z := Z
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 1
% 0.75/1.55 2 ==> 2
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (21) {G0,W8,D3,L2,V3,M2} I { ! X = Y, member( X,
% 0.75/1.55 unordered_pair( Y, Z ) ) }.
% 0.75/1.55 parent0: (11097) {G0,W8,D3,L2,V3,M2} { ! X = Y, member( X, unordered_pair
% 0.75/1.55 ( Y, Z ) ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 Z := Z
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 1
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (29) {G0,W3,D2,L1,V0,M1} I { member( skol5, skol4 ) }.
% 0.75/1.55 parent0: (11105) {G0,W3,D2,L1,V0,M1} { member( skol5, skol4 ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (30) {G0,W4,D3,L1,V0,M1} I { ! subset( singleton( skol5 ),
% 0.75/1.55 skol4 ) }.
% 0.75/1.55 parent0: (11106) {G0,W4,D3,L1,V0,M1} { ! subset( singleton( skol5 ), skol4
% 0.75/1.55 ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 eqfact: (11179) {G0,W11,D3,L3,V3,M3} { ! X = Y, ! member( Z,
% 0.75/1.55 unordered_pair( Y, X ) ), Z = Y }.
% 0.75/1.55 parent0[2, 1]: (20) {G0,W11,D3,L3,V3,M3} I { ! member( X, unordered_pair( Y
% 0.75/1.55 , Z ) ), X = Y, X = Z }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := Z
% 0.75/1.55 Y := Y
% 0.75/1.55 Z := X
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (37) {G1,W11,D3,L3,V3,M3} E(20) { ! X = Y, ! member( Z,
% 0.75/1.55 unordered_pair( Y, X ) ), Z = Y }.
% 0.75/1.55 parent0: (11179) {G0,W11,D3,L3,V3,M3} { ! X = Y, ! member( Z,
% 0.75/1.55 unordered_pair( Y, X ) ), Z = Y }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 Z := Z
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 1
% 0.75/1.55 2 ==> 2
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 eqswap: (11186) {G0,W8,D3,L2,V3,M2} { ! Y = X, member( X, unordered_pair(
% 0.75/1.55 Y, Z ) ) }.
% 0.75/1.55 parent0[0]: (21) {G0,W8,D3,L2,V3,M2} I { ! X = Y, member( X, unordered_pair
% 0.75/1.55 ( Y, Z ) ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 Z := Z
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 eqrefl: (11187) {G0,W5,D3,L1,V2,M1} { member( X, unordered_pair( X, Y ) )
% 0.75/1.55 }.
% 0.75/1.55 parent0[0]: (11186) {G0,W8,D3,L2,V3,M2} { ! Y = X, member( X,
% 0.75/1.55 unordered_pair( Y, Z ) ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := X
% 0.75/1.55 Z := Y
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (38) {G1,W5,D3,L1,V2,M1} Q(21) { member( X, unordered_pair( X
% 0.75/1.55 , Y ) ) }.
% 0.75/1.55 parent0: (11187) {G0,W5,D3,L1,V2,M1} { member( X, unordered_pair( X, Y ) )
% 0.75/1.55 }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 resolution: (11188) {G1,W6,D2,L2,V2,M2} { ! subset( Y, empty_set ), !
% 0.75/1.55 member( X, Y ) }.
% 0.75/1.55 parent0[0]: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.75/1.55 parent1[2]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.75/1.55 , member( Z, Y ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 end
% 0.75/1.55 substitution1:
% 0.75/1.55 X := Y
% 0.75/1.55 Y := empty_set
% 0.75/1.55 Z := X
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (45) {G1,W6,D2,L2,V2,M2} R(0,14) { ! subset( X, empty_set ), !
% 0.75/1.55 member( Y, X ) }.
% 0.75/1.55 parent0: (11188) {G1,W6,D2,L2,V2,M2} { ! subset( Y, empty_set ), ! member
% 0.75/1.55 ( X, Y ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := Y
% 0.75/1.55 Y := X
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 1
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 resolution: (11189) {G2,W5,D3,L1,V2,M1} { ! subset( unordered_pair( X, Y )
% 0.75/1.55 , empty_set ) }.
% 0.75/1.55 parent0[1]: (45) {G1,W6,D2,L2,V2,M2} R(0,14) { ! subset( X, empty_set ), !
% 0.75/1.55 member( Y, X ) }.
% 0.75/1.55 parent1[0]: (38) {G1,W5,D3,L1,V2,M1} Q(21) { member( X, unordered_pair( X,
% 0.75/1.55 Y ) ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := unordered_pair( X, Y )
% 0.75/1.55 Y := X
% 0.75/1.55 end
% 0.75/1.55 substitution1:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (47) {G2,W5,D3,L1,V2,M1} R(45,38) { ! subset( unordered_pair(
% 0.75/1.55 X, Y ), empty_set ) }.
% 0.75/1.55 parent0: (11189) {G2,W5,D3,L1,V2,M1} { ! subset( unordered_pair( X, Y ),
% 0.75/1.55 empty_set ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 resolution: (11190) {G1,W5,D3,L1,V1,M1} { ! member( skol1( X, skol4 ),
% 0.75/1.55 skol4 ) }.
% 0.75/1.55 parent0[0]: (30) {G0,W4,D3,L1,V0,M1} I { ! subset( singleton( skol5 ),
% 0.75/1.55 skol4 ) }.
% 0.75/1.55 parent1[1]: (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ),
% 0.75/1.55 subset( X, Y ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 end
% 0.75/1.55 substitution1:
% 0.75/1.55 X := singleton( skol5 )
% 0.75/1.55 Y := skol4
% 0.75/1.55 Z := X
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (53) {G1,W5,D3,L1,V1,M1} R(1,30) { ! member( skol1( X, skol4 )
% 0.75/1.55 , skol4 ) }.
% 0.75/1.55 parent0: (11190) {G1,W5,D3,L1,V1,M1} { ! member( skol1( X, skol4 ), skol4
% 0.75/1.55 ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 resolution: (11191) {G1,W8,D3,L2,V2,M2} { ! subset( Y, skol4 ), ! member(
% 0.75/1.55 skol1( X, skol4 ), Y ) }.
% 0.75/1.55 parent0[0]: (53) {G1,W5,D3,L1,V1,M1} R(1,30) { ! member( skol1( X, skol4 )
% 0.75/1.55 , skol4 ) }.
% 0.75/1.55 parent1[2]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.75/1.55 , member( Z, Y ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 end
% 0.75/1.55 substitution1:
% 0.75/1.55 X := Y
% 0.75/1.55 Y := skol4
% 0.75/1.55 Z := skol1( X, skol4 )
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (54) {G2,W8,D3,L2,V2,M2} R(53,0) { ! subset( X, skol4 ), !
% 0.75/1.55 member( skol1( Y, skol4 ), X ) }.
% 0.75/1.55 parent0: (11191) {G1,W8,D3,L2,V2,M2} { ! subset( Y, skol4 ), ! member(
% 0.75/1.55 skol1( X, skol4 ), Y ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := Y
% 0.75/1.55 Y := X
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 1
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 resolution: (11192) {G1,W9,D4,L1,V2,M1} { member( skol1( unordered_pair( X
% 0.75/1.55 , Y ), empty_set ), unordered_pair( X, Y ) ) }.
% 0.75/1.55 parent0[0]: (47) {G2,W5,D3,L1,V2,M1} R(45,38) { ! subset( unordered_pair( X
% 0.75/1.55 , Y ), empty_set ) }.
% 0.75/1.55 parent1[1]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.75/1.55 ( X, Y ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 end
% 0.75/1.55 substitution1:
% 0.75/1.55 X := unordered_pair( X, Y )
% 0.75/1.55 Y := empty_set
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (62) {G3,W9,D4,L1,V2,M1} R(2,47) { member( skol1(
% 0.75/1.55 unordered_pair( X, Y ), empty_set ), unordered_pair( X, Y ) ) }.
% 0.75/1.55 parent0: (11192) {G1,W9,D4,L1,V2,M1} { member( skol1( unordered_pair( X, Y
% 0.75/1.55 ), empty_set ), unordered_pair( X, Y ) ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 resolution: (11193) {G1,W6,D2,L2,V2,M2} { subset( Y, X ), subset( X, X )
% 0.75/1.55 }.
% 0.75/1.55 parent0[0]: (1) {G0,W8,D3,L2,V3,M2} I { ! member( skol1( Z, Y ), Y ),
% 0.75/1.55 subset( X, Y ) }.
% 0.75/1.55 parent1[0]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.75/1.55 ( X, Y ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := Y
% 0.75/1.55 Y := X
% 0.75/1.55 Z := X
% 0.75/1.55 end
% 0.75/1.55 substitution1:
% 0.75/1.55 X := X
% 0.75/1.55 Y := X
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (63) {G1,W6,D2,L2,V2,M2} R(2,1) { subset( X, X ), subset( Y, X
% 0.75/1.55 ) }.
% 0.75/1.55 parent0: (11193) {G1,W6,D2,L2,V2,M2} { subset( Y, X ), subset( X, X ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := X
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 0
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 factor: (11195) {G1,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.75/1.55 parent0[0, 1]: (63) {G1,W6,D2,L2,V2,M2} R(2,1) { subset( X, X ), subset( Y
% 0.75/1.55 , X ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := X
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (72) {G2,W3,D2,L1,V1,M1} F(63) { subset( X, X ) }.
% 0.75/1.55 parent0: (11195) {G1,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 eqswap: (11196) {G1,W11,D3,L3,V3,M3} { ! Y = X, ! member( Z,
% 0.75/1.55 unordered_pair( Y, X ) ), Z = Y }.
% 0.75/1.55 parent0[0]: (37) {G1,W11,D3,L3,V3,M3} E(20) { ! X = Y, ! member( Z,
% 0.75/1.55 unordered_pair( Y, X ) ), Z = Y }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 Z := Z
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 resolution: (11199) {G2,W10,D4,L2,V2,M2} { ! X = Y, skol1( unordered_pair
% 0.75/1.55 ( X, Y ), empty_set ) = X }.
% 0.75/1.55 parent0[1]: (11196) {G1,W11,D3,L3,V3,M3} { ! Y = X, ! member( Z,
% 0.75/1.55 unordered_pair( Y, X ) ), Z = Y }.
% 0.75/1.55 parent1[0]: (62) {G3,W9,D4,L1,V2,M1} R(2,47) { member( skol1(
% 0.75/1.55 unordered_pair( X, Y ), empty_set ), unordered_pair( X, Y ) ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := Y
% 0.75/1.55 Y := X
% 0.75/1.55 Z := skol1( unordered_pair( X, Y ), empty_set )
% 0.75/1.55 end
% 0.75/1.55 substitution1:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 eqswap: (11200) {G2,W10,D4,L2,V2,M2} { ! Y = X, skol1( unordered_pair( X,
% 0.75/1.55 Y ), empty_set ) = X }.
% 0.75/1.55 parent0[0]: (11199) {G2,W10,D4,L2,V2,M2} { ! X = Y, skol1( unordered_pair
% 0.75/1.55 ( X, Y ), empty_set ) = X }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 subsumption: (7497) {G4,W10,D4,L2,V2,M2} R(62,37) { ! X = Y, skol1(
% 0.75/1.55 unordered_pair( Y, X ), empty_set ) ==> Y }.
% 0.75/1.55 parent0: (11200) {G2,W10,D4,L2,V2,M2} { ! Y = X, skol1( unordered_pair( X
% 0.75/1.55 , Y ), empty_set ) = X }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := Y
% 0.75/1.55 Y := X
% 0.75/1.55 end
% 0.75/1.55 permutation0:
% 0.75/1.55 0 ==> 0
% 0.75/1.55 1 ==> 1
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 eqswap: (11203) {G0,W11,D3,L3,V3,M3} { Y = X, ! member( X, unordered_pair
% 0.75/1.55 ( Y, Z ) ), X = Z }.
% 0.75/1.55 parent0[1]: (20) {G0,W11,D3,L3,V3,M3} I { ! member( X, unordered_pair( Y, Z
% 0.75/1.55 ) ), X = Y, X = Z }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 Z := Z
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 resolution: (11206) {G1,W14,D4,L2,V2,M2} { X = skol1( unordered_pair( X, Y
% 0.75/1.55 ), empty_set ), skol1( unordered_pair( X, Y ), empty_set ) = Y }.
% 0.75/1.55 parent0[1]: (11203) {G0,W11,D3,L3,V3,M3} { Y = X, ! member( X,
% 0.75/1.55 unordered_pair( Y, Z ) ), X = Z }.
% 0.75/1.55 parent1[0]: (62) {G3,W9,D4,L1,V2,M1} R(2,47) { member( skol1(
% 0.75/1.55 unordered_pair( X, Y ), empty_set ), unordered_pair( X, Y ) ) }.
% 0.75/1.55 substitution0:
% 0.75/1.55 X := skol1( unordered_pair( X, Y ), empty_set )
% 0.75/1.55 Y := X
% 0.75/1.55 Z := Y
% 0.75/1.55 end
% 0.75/1.55 substitution1:
% 0.75/1.55 X := X
% 0.75/1.55 Y := Y
% 0.75/1.55 end
% 0.75/1.55
% 0.75/1.55 eqswap: (11207) {G1,W14,D4,L2,V2,M2} { skol1( unordered_pair( X, Y ),
% 0.75/1.55 empty_set ) = X, skol1( unordered_pair( X, Y ), empty_set ) = Y }.Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------