TSTP Solution File: SET591+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET591+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n007.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:31 EDT 2022
% Result : Theorem 0.42s 1.06s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET591+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n007.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 12:26:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.06 *** allocated 10000 integers for termspace/termends
% 0.42/1.06 *** allocated 10000 integers for clauses
% 0.42/1.06 *** allocated 10000 integers for justifications
% 0.42/1.06 Bliksem 1.12
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Automatic Strategy Selection
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Clauses:
% 0.42/1.06
% 0.42/1.06 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.42/1.06 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.42/1.06 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.42/1.06 { ! member( Z, difference( X, Y ) ), member( Z, X ) }.
% 0.42/1.06 { ! member( Z, difference( X, Y ) ), ! member( Z, Y ) }.
% 0.42/1.06 { ! member( Z, X ), member( Z, Y ), member( Z, difference( X, Y ) ) }.
% 0.42/1.06 { ! member( X, empty_set ) }.
% 0.42/1.06 { ! X = Y, subset( X, Y ) }.
% 0.42/1.06 { ! X = Y, subset( Y, X ) }.
% 0.42/1.06 { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.42/1.06 { subset( X, X ) }.
% 0.42/1.06 { ! empty( X ), ! member( Y, X ) }.
% 0.42/1.06 { member( skol2( X ), X ), empty( X ) }.
% 0.42/1.06 { subset( skol3, difference( skol4, skol3 ) ) }.
% 0.42/1.06 { ! skol3 = empty_set }.
% 0.42/1.06
% 0.42/1.06 percentage equality = 0.137931, percentage horn = 0.800000
% 0.42/1.06 This is a problem with some equality
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Options Used:
% 0.42/1.06
% 0.42/1.06 useres = 1
% 0.42/1.06 useparamod = 1
% 0.42/1.06 useeqrefl = 1
% 0.42/1.06 useeqfact = 1
% 0.42/1.06 usefactor = 1
% 0.42/1.06 usesimpsplitting = 0
% 0.42/1.06 usesimpdemod = 5
% 0.42/1.06 usesimpres = 3
% 0.42/1.06
% 0.42/1.06 resimpinuse = 1000
% 0.42/1.06 resimpclauses = 20000
% 0.42/1.06 substype = eqrewr
% 0.42/1.06 backwardsubs = 1
% 0.42/1.06 selectoldest = 5
% 0.42/1.06
% 0.42/1.06 litorderings [0] = split
% 0.42/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.42/1.06
% 0.42/1.06 termordering = kbo
% 0.42/1.06
% 0.42/1.06 litapriori = 0
% 0.42/1.06 termapriori = 1
% 0.42/1.06 litaposteriori = 0
% 0.42/1.06 termaposteriori = 0
% 0.42/1.06 demodaposteriori = 0
% 0.42/1.06 ordereqreflfact = 0
% 0.42/1.06
% 0.42/1.06 litselect = negord
% 0.42/1.06
% 0.42/1.06 maxweight = 15
% 0.42/1.06 maxdepth = 30000
% 0.42/1.06 maxlength = 115
% 0.42/1.06 maxnrvars = 195
% 0.42/1.06 excuselevel = 1
% 0.42/1.06 increasemaxweight = 1
% 0.42/1.06
% 0.42/1.06 maxselected = 10000000
% 0.42/1.06 maxnrclauses = 10000000
% 0.42/1.06
% 0.42/1.06 showgenerated = 0
% 0.42/1.06 showkept = 0
% 0.42/1.06 showselected = 0
% 0.42/1.06 showdeleted = 0
% 0.42/1.06 showresimp = 1
% 0.42/1.06 showstatus = 2000
% 0.42/1.06
% 0.42/1.06 prologoutput = 0
% 0.42/1.06 nrgoals = 5000000
% 0.42/1.06 totalproof = 1
% 0.42/1.06
% 0.42/1.06 Symbols occurring in the translation:
% 0.42/1.06
% 0.42/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.06 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.06 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.42/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 subset [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.42/1.06 member [39, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.42/1.06 difference [40, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.42/1.06 empty_set [41, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.42/1.06 empty [42, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.42/1.06 skol1 [43, 2] (w:1, o:46, a:1, s:1, b:1),
% 0.42/1.06 skol2 [44, 1] (w:1, o:18, a:1, s:1, b:1),
% 0.42/1.06 skol3 [45, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.42/1.06 skol4 [46, 0] (w:1, o:11, a:1, s:1, b:1).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Starting Search:
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksems!, er is een bewijs:
% 0.42/1.06 % SZS status Theorem
% 0.42/1.06 % SZS output start Refutation
% 0.42/1.06
% 0.42/1.06 (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.42/1.06 Y ) }.
% 0.42/1.06 (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.42/1.06 (4) {G0,W8,D3,L2,V3,M2} I { ! member( Z, difference( X, Y ) ), ! member( Z
% 0.42/1.06 , Y ) }.
% 0.42/1.06 (6) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.42/1.06 (7) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.42/1.06 (8) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.42/1.06 (12) {G0,W5,D3,L1,V0,M1} I { subset( skol3, difference( skol4, skol3 ) )
% 0.42/1.06 }.
% 0.42/1.06 (13) {G0,W3,D2,L1,V0,M1} I { ! skol3 ==> empty_set }.
% 0.42/1.06 (15) {G1,W3,D2,L1,V1,M1} R(0,12);r(4) { ! member( X, skol3 ) }.
% 0.42/1.06 (17) {G1,W6,D2,L2,V2,M2} R(0,6) { ! subset( X, empty_set ), ! member( Y, X
% 0.42/1.06 ) }.
% 0.42/1.06 (21) {G2,W6,D2,L2,V2,M2} R(7,17) { ! X = empty_set, ! member( Y, X ) }.
% 0.42/1.06 (37) {G3,W6,D2,L2,V2,M2} R(2,21) { subset( X, Y ), ! X = empty_set }.
% 0.42/1.06 (42) {G2,W3,D2,L1,V1,M1} R(2,15) { subset( skol3, X ) }.
% 0.42/1.06 (147) {G4,W6,D2,L2,V1,M2} P(8,13);r(37) { ! X = empty_set, ! subset( skol3
% 0.42/1.06 , X ) }.
% 0.42/1.06 (148) {G5,W0,D0,L0,V0,M0} Q(147);r(42) { }.
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 % SZS output end Refutation
% 0.42/1.06 found a proof!
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Unprocessed initial clauses:
% 0.42/1.06
% 0.42/1.06 (150) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.42/1.06 , Y ) }.
% 0.42/1.06 (151) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.42/1.06 }.
% 0.42/1.06 (152) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.42/1.06 (153) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), member( Z,
% 0.42/1.06 X ) }.
% 0.42/1.06 (154) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), ! member( Z
% 0.42/1.06 , Y ) }.
% 0.42/1.06 (155) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), member( Z, Y ), member( Z,
% 0.42/1.06 difference( X, Y ) ) }.
% 0.42/1.06 (156) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.42/1.06 (157) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.42/1.06 (158) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( Y, X ) }.
% 0.42/1.06 (159) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.42/1.06 (160) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.42/1.06 (161) {G0,W5,D2,L2,V2,M2} { ! empty( X ), ! member( Y, X ) }.
% 0.42/1.06 (162) {G0,W6,D3,L2,V1,M2} { member( skol2( X ), X ), empty( X ) }.
% 0.42/1.06 (163) {G0,W5,D3,L1,V0,M1} { subset( skol3, difference( skol4, skol3 ) )
% 0.42/1.06 }.
% 0.42/1.06 (164) {G0,W3,D2,L1,V0,M1} { ! skol3 = empty_set }.
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Total Proof:
% 0.42/1.06
% 0.42/1.06 subsumption: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.42/1.06 , member( Z, Y ) }.
% 0.42/1.06 parent0: (150) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ),
% 0.42/1.06 member( Z, Y ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 Y := Y
% 0.42/1.06 Z := Z
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 1 ==> 1
% 0.42/1.06 2 ==> 2
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.42/1.06 ( X, Y ) }.
% 0.42/1.06 parent0: (152) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X
% 0.42/1.06 , Y ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 Y := Y
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 1 ==> 1
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (4) {G0,W8,D3,L2,V3,M2} I { ! member( Z, difference( X, Y ) )
% 0.42/1.06 , ! member( Z, Y ) }.
% 0.42/1.06 parent0: (154) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), !
% 0.42/1.06 member( Z, Y ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 Y := Y
% 0.42/1.06 Z := Z
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 1 ==> 1
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (6) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.42/1.06 parent0: (156) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (7) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.42/1.06 parent0: (157) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 Y := Y
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 1 ==> 1
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (8) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.42/1.06 , X = Y }.
% 0.42/1.06 parent0: (159) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), X
% 0.42/1.06 = Y }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 Y := Y
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 1 ==> 1
% 0.42/1.06 2 ==> 2
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (12) {G0,W5,D3,L1,V0,M1} I { subset( skol3, difference( skol4
% 0.42/1.06 , skol3 ) ) }.
% 0.42/1.06 parent0: (163) {G0,W5,D3,L1,V0,M1} { subset( skol3, difference( skol4,
% 0.42/1.06 skol3 ) ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (13) {G0,W3,D2,L1,V0,M1} I { ! skol3 ==> empty_set }.
% 0.42/1.06 parent0: (164) {G0,W3,D2,L1,V0,M1} { ! skol3 = empty_set }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 resolution: (176) {G1,W8,D3,L2,V1,M2} { ! member( X, skol3 ), member( X,
% 0.42/1.06 difference( skol4, skol3 ) ) }.
% 0.42/1.06 parent0[0]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 0.42/1.06 , member( Z, Y ) }.
% 0.42/1.06 parent1[0]: (12) {G0,W5,D3,L1,V0,M1} I { subset( skol3, difference( skol4,
% 0.42/1.06 skol3 ) ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := skol3
% 0.42/1.06 Y := difference( skol4, skol3 )
% 0.42/1.06 Z := X
% 0.42/1.06 end
% 0.42/1.06 substitution1:
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 resolution: (177) {G1,W6,D2,L2,V1,M2} { ! member( X, skol3 ), ! member( X
% 0.42/1.06 , skol3 ) }.
% 0.42/1.06 parent0[0]: (4) {G0,W8,D3,L2,V3,M2} I { ! member( Z, difference( X, Y ) ),
% 0.42/1.06 ! member( Z, Y ) }.
% 0.42/1.06 parent1[1]: (176) {G1,W8,D3,L2,V1,M2} { ! member( X, skol3 ), member( X,
% 0.42/1.06 difference( skol4, skol3 ) ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := skol4
% 0.42/1.06 Y := skol3
% 0.42/1.06 Z := X
% 0.42/1.06 end
% 0.42/1.06 substitution1:
% 0.42/1.06 X := X
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 factor: (178) {G1,W3,D2,L1,V1,M1} { ! member( X, skol3 ) }.
% 0.42/1.06 parent0[0, 1]: (177) {G1,W6,D2,L2,V1,M2} { ! member( X, skol3 ), ! member
% 0.42/1.06 ( X, skol3 ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (15) {G1,W3,D2,L1,V1,M1} R(0,12);r(4) { ! member( X, skol3 )
% 0.42/1.06 }.
% 0.42/1.06 parent0: (178) {G1,W3,D2,L1,V1,M1} { ! member( X, skol3 ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 resolution: (179) {G1,W6,D2,L2,V2,M2} { ! subset( Y, empty_set ), ! member
% 0.42/1.06 ( X, Y ) }.
% 0.42/1.06 parent0[0]: (6) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.42/1.06 parent1[2]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( X, Y ), ! member( Z, X )
% 64.82/65.20 , member( Z, Y ) }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := X
% 64.82/65.20 end
% 64.82/65.20 substitution1:
% 64.82/65.20 X := Y
% 64.82/65.20 Y := empty_set
% 64.82/65.20 Z := X
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 subsumption: (17) {G1,W6,D2,L2,V2,M2} R(0,6) { ! subset( X, empty_set ), !
% 64.82/65.20 member( Y, X ) }.
% 64.82/65.20 parent0: (179) {G1,W6,D2,L2,V2,M2} { ! subset( Y, empty_set ), ! member( X
% 64.82/65.20 , Y ) }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := Y
% 64.82/65.20 Y := X
% 64.82/65.20 end
% 64.82/65.20 permutation0:
% 64.82/65.20 0 ==> 0
% 64.82/65.20 1 ==> 1
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 eqswap: (180) {G0,W6,D2,L2,V2,M2} { ! Y = X, subset( X, Y ) }.
% 64.82/65.20 parent0[0]: (7) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := X
% 64.82/65.20 Y := Y
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 resolution: (181) {G1,W6,D2,L2,V2,M2} { ! member( Y, X ), ! empty_set = X
% 64.82/65.20 }.
% 64.82/65.20 parent0[0]: (17) {G1,W6,D2,L2,V2,M2} R(0,6) { ! subset( X, empty_set ), !
% 64.82/65.20 member( Y, X ) }.
% 64.82/65.20 parent1[1]: (180) {G0,W6,D2,L2,V2,M2} { ! Y = X, subset( X, Y ) }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := X
% 64.82/65.20 Y := Y
% 64.82/65.20 end
% 64.82/65.20 substitution1:
% 64.82/65.20 X := X
% 64.82/65.20 Y := empty_set
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 eqswap: (182) {G1,W6,D2,L2,V2,M2} { ! X = empty_set, ! member( Y, X ) }.
% 64.82/65.20 parent0[1]: (181) {G1,W6,D2,L2,V2,M2} { ! member( Y, X ), ! empty_set = X
% 64.82/65.20 }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := X
% 64.82/65.20 Y := Y
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 subsumption: (21) {G2,W6,D2,L2,V2,M2} R(7,17) { ! X = empty_set, ! member(
% 64.82/65.20 Y, X ) }.
% 64.82/65.20 parent0: (182) {G1,W6,D2,L2,V2,M2} { ! X = empty_set, ! member( Y, X ) }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := X
% 64.82/65.20 Y := Y
% 64.82/65.20 end
% 64.82/65.20 permutation0:
% 64.82/65.20 0 ==> 0
% 64.82/65.20 1 ==> 1
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 eqswap: (183) {G2,W6,D2,L2,V2,M2} { ! empty_set = X, ! member( Y, X ) }.
% 64.82/65.20 parent0[0]: (21) {G2,W6,D2,L2,V2,M2} R(7,17) { ! X = empty_set, ! member( Y
% 64.82/65.20 , X ) }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := X
% 64.82/65.20 Y := Y
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 resolution: (184) {G1,W6,D2,L2,V2,M2} { ! empty_set = X, subset( X, Y )
% 64.82/65.20 }.
% 64.82/65.20 parent0[1]: (183) {G2,W6,D2,L2,V2,M2} { ! empty_set = X, ! member( Y, X )
% 64.82/65.20 }.
% 64.82/65.20 parent1[0]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 64.82/65.20 ( X, Y ) }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := X
% 64.82/65.20 Y := skol1( X, Y )
% 64.82/65.20 end
% 64.82/65.20 substitution1:
% 64.82/65.20 X := X
% 64.82/65.20 Y := Y
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 eqswap: (185) {G1,W6,D2,L2,V2,M2} { ! X = empty_set, subset( X, Y ) }.
% 64.82/65.20 parent0[0]: (184) {G1,W6,D2,L2,V2,M2} { ! empty_set = X, subset( X, Y )
% 64.82/65.20 }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := X
% 64.82/65.20 Y := Y
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 subsumption: (37) {G3,W6,D2,L2,V2,M2} R(2,21) { subset( X, Y ), ! X =
% 64.82/65.20 empty_set }.
% 64.82/65.20 parent0: (185) {G1,W6,D2,L2,V2,M2} { ! X = empty_set, subset( X, Y ) }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := X
% 64.82/65.20 Y := Y
% 64.82/65.20 end
% 64.82/65.20 permutation0:
% 64.82/65.20 0 ==> 1
% 64.82/65.20 1 ==> 0
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 resolution: (186) {G1,W3,D2,L1,V1,M1} { subset( skol3, X ) }.
% 64.82/65.20 parent0[0]: (15) {G1,W3,D2,L1,V1,M1} R(0,12);r(4) { ! member( X, skol3 )
% 64.82/65.20 }.
% 64.82/65.20 parent1[0]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 64.82/65.20 ( X, Y ) }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := skol1( skol3, X )
% 64.82/65.20 end
% 64.82/65.20 substitution1:
% 64.82/65.20 X := skol3
% 64.82/65.20 Y := X
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 subsumption: (42) {G2,W3,D2,L1,V1,M1} R(2,15) { subset( skol3, X ) }.
% 64.82/65.20 parent0: (186) {G1,W3,D2,L1,V1,M1} { subset( skol3, X ) }.
% 64.82/65.20 substitution0:
% 64.82/65.20 X := X
% 64.82/65.20 end
% 64.82/65.20 permutation0:
% 64.82/65.20 0 ==> 0
% 64.82/65.20 end
% 64.82/65.20
% 64.82/65.20 *** allocated 15000 integers for clauses
% 64.82/65.20 *** allocated 15000 integers for termspace/termends
% 64.82/65.20 *** allocated 22500 integers for clauses
% 64.82/65.20 *** allocated 22500 integers for termspace/termends
% 64.82/65.20 *** allocated 15000 integers for justifications
% 64.82/65.20 *** allocated 33750 integers for clauses
% 64.82/65.20 *** allocated 33750 integers for termspace/termends
% 64.82/65.20 *** allocated 22500 integers for justifications
% 64.82/65.20 *** allocated 50625 integers for termspace/termends
% 64.82/65.20 *** allocated 50625 integers for clauses
% 64.82/65.20 *** allocated 33750 integers for justifications
% 64.82/65.20 *** allocated 75937 integers for termspace/termends
% 64.82/65.20 *** allocated 50625 integers for justifications
% 64.82/65.20 *** allocated 75937 integers for clauses
% 64.82/65.20 *** allocated 113905 integers for termspace/termends
% 64.82/65.20 *** allocated 75937 integers for justifications
% 64.82/65.20 *** allocated 113905 integers for clauses
% 64.82/65.20 *** allocated 170857 integers for termspace/termends
% 64.82/65.20 *** allocated 113905 integers for justifications
% 64.82/65.20 *** allocated 170857 integers for clauses
% 64.82/65.20 *** allocated 256285 integers for termspace/termends
% 64.82/65.20 *** allocated 170857 integers for justifications
% 64.82/65.20 *** allocated 256285 integers for clauses
% 64.82/65.20 *** allocated 384427 integers for termspace/termends
% 64.82/65.20 *** allocated 256285 integers for justifications
% 64.82/65.20 *** allocated 576640 integers for termspaCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------