TSTP Solution File: SET347+4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET347+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.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:48:58 EDT 2022
% Result : Theorem 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : SET347+4 : TPTP v8.1.0. Released v2.2.0.
% 0.13/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Mon Jul 11 03:14:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.10 *** allocated 10000 integers for termspace/termends
% 0.71/1.10 *** allocated 10000 integers for clauses
% 0.71/1.10 *** allocated 10000 integers for justifications
% 0.71/1.10 Bliksem 1.12
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Automatic Strategy Selection
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Clauses:
% 0.71/1.10
% 0.71/1.10 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.71/1.10 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.71/1.10 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.71/1.10 { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.71/1.10 { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.71/1.10 { ! subset( X, Y ), ! subset( Y, X ), equal_set( X, Y ) }.
% 0.71/1.10 { ! member( X, power_set( Y ) ), subset( X, Y ) }.
% 0.71/1.10 { ! subset( X, Y ), member( X, power_set( Y ) ) }.
% 0.71/1.10 { ! member( X, intersection( Y, Z ) ), member( X, Y ) }.
% 0.71/1.10 { ! member( X, intersection( Y, Z ) ), member( X, Z ) }.
% 0.71/1.10 { ! member( X, Y ), ! member( X, Z ), member( X, intersection( Y, Z ) ) }.
% 0.71/1.10 { ! member( X, union( Y, Z ) ), member( X, Y ), member( X, Z ) }.
% 0.71/1.10 { ! member( X, Y ), member( X, union( Y, Z ) ) }.
% 0.71/1.10 { ! member( X, Z ), member( X, union( Y, Z ) ) }.
% 0.71/1.10 { ! member( X, empty_set ) }.
% 0.71/1.10 { ! member( X, difference( Z, Y ) ), member( X, Z ) }.
% 0.71/1.10 { ! member( X, difference( Z, Y ) ), ! member( X, Y ) }.
% 0.71/1.10 { ! member( X, Z ), member( X, Y ), member( X, difference( Z, Y ) ) }.
% 0.71/1.10 { ! member( X, singleton( Y ) ), X = Y }.
% 0.71/1.10 { ! X = Y, member( X, singleton( Y ) ) }.
% 0.71/1.10 { ! member( X, unordered_pair( Y, Z ) ), X = Y, X = Z }.
% 0.71/1.10 { ! X = Y, member( X, unordered_pair( Y, Z ) ) }.
% 0.71/1.10 { ! X = Z, member( X, unordered_pair( Y, Z ) ) }.
% 0.71/1.10 { ! member( X, sum( Y ) ), member( skol2( Z, Y ), Y ) }.
% 0.71/1.10 { ! member( X, sum( Y ) ), member( X, skol2( X, Y ) ) }.
% 0.71/1.10 { ! member( Z, Y ), ! member( X, Z ), member( X, sum( Y ) ) }.
% 0.71/1.10 { ! member( X, product( Y ) ), ! member( Z, Y ), member( X, Z ) }.
% 0.71/1.10 { member( skol3( Z, Y ), Y ), member( X, product( Y ) ) }.
% 0.71/1.10 { ! member( X, skol3( X, Y ) ), member( X, product( Y ) ) }.
% 0.71/1.10 { ! equal_set( sum( empty_set ), empty_set ) }.
% 0.71/1.10
% 0.71/1.10 percentage equality = 0.090909, percentage horn = 0.833333
% 0.71/1.10 This is a problem with some equality
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Options Used:
% 0.71/1.10
% 0.71/1.10 useres = 1
% 0.71/1.10 useparamod = 1
% 0.71/1.10 useeqrefl = 1
% 0.71/1.10 useeqfact = 1
% 0.71/1.10 usefactor = 1
% 0.71/1.10 usesimpsplitting = 0
% 0.71/1.10 usesimpdemod = 5
% 0.71/1.10 usesimpres = 3
% 0.71/1.10
% 0.71/1.10 resimpinuse = 1000
% 0.71/1.10 resimpclauses = 20000
% 0.71/1.10 substype = eqrewr
% 0.71/1.10 backwardsubs = 1
% 0.71/1.10 selectoldest = 5
% 0.71/1.10
% 0.71/1.10 litorderings [0] = split
% 0.71/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.10
% 0.71/1.10 termordering = kbo
% 0.71/1.10
% 0.71/1.10 litapriori = 0
% 0.71/1.10 termapriori = 1
% 0.71/1.10 litaposteriori = 0
% 0.71/1.10 termaposteriori = 0
% 0.71/1.10 demodaposteriori = 0
% 0.71/1.10 ordereqreflfact = 0
% 0.71/1.10
% 0.71/1.10 litselect = negord
% 0.71/1.10
% 0.71/1.10 maxweight = 15
% 0.71/1.10 maxdepth = 30000
% 0.71/1.10 maxlength = 115
% 0.71/1.10 maxnrvars = 195
% 0.71/1.10 excuselevel = 1
% 0.71/1.10 increasemaxweight = 1
% 0.71/1.10
% 0.71/1.10 maxselected = 10000000
% 0.71/1.10 maxnrclauses = 10000000
% 0.71/1.10
% 0.71/1.10 showgenerated = 0
% 0.71/1.10 showkept = 0
% 0.71/1.10 showselected = 0
% 0.71/1.10 showdeleted = 0
% 0.71/1.10 showresimp = 1
% 0.71/1.10 showstatus = 2000
% 0.71/1.10
% 0.71/1.10 prologoutput = 0
% 0.71/1.10 nrgoals = 5000000
% 0.71/1.10 totalproof = 1
% 0.71/1.10
% 0.71/1.10 Symbols occurring in the translation:
% 0.71/1.10
% 0.71/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.10 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.10 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.71/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 subset [37, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.71/1.10 member [39, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.71/1.10 equal_set [40, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.10 power_set [41, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.71/1.10 intersection [42, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.10 union [43, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.10 empty_set [44, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.10 difference [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.10 singleton [47, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.10 unordered_pair [48, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.71/1.10 sum [49, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.10 product [51, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.10 skol1 [52, 2] (w:1, o:52, a:1, s:1, b:1),
% 0.71/1.10 skol2 [53, 2] (w:1, o:53, a:1, s:1, b:1),
% 0.71/1.10 skol3 [54, 2] (w:1, o:54, a:1, s:1, b:1).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Starting Search:
% 0.71/1.10
% 0.71/1.10 *** allocated 15000 integers for clauses
% 0.71/1.10 *** allocated 22500 integers for clauses
% 0.71/1.10 *** allocated 33750 integers for clauses
% 0.71/1.10 *** allocated 50625 integers for clauses
% 0.71/1.10 *** allocated 15000 integers for termspace/termends
% 0.71/1.10 *** allocated 75937 integers for clauses
% 0.71/1.10 *** allocated 22500 integers for termspace/termends
% 0.71/1.10 Resimplifying inuse:
% 0.71/1.10 Done
% 0.71/1.10
% 0.71/1.10 *** allocated 113905 integers for clauses
% 0.71/1.10 *** allocated 33750 integers for termspace/termends
% 0.71/1.10
% 0.71/1.10 Bliksems!, er is een bewijs:
% 0.71/1.10 % SZS status Theorem
% 0.71/1.10 % SZS output start Refutation
% 0.71/1.10
% 0.71/1.10 (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.71/1.10 (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X ), equal_set(
% 0.71/1.10 X, Y ) }.
% 0.71/1.10 (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.71/1.10 (23) {G0,W9,D3,L2,V3,M2} I { ! member( X, sum( Y ) ), member( skol2( Z, Y )
% 0.71/1.10 , Y ) }.
% 0.71/1.10 (29) {G0,W4,D3,L1,V0,M1} I { ! equal_set( sum( empty_set ), empty_set ) }.
% 0.71/1.10 (67) {G1,W3,D2,L1,V1,M1} R(2,14) { subset( empty_set, X ) }.
% 0.71/1.10 (70) {G2,W6,D2,L2,V1,M2} R(5,67) { ! subset( X, empty_set ), equal_set( X,
% 0.71/1.10 empty_set ) }.
% 0.71/1.10 (1828) {G1,W4,D3,L1,V1,M1} R(23,14) { ! member( X, sum( empty_set ) ) }.
% 0.71/1.10 (1855) {G2,W4,D3,L1,V1,M1} R(1828,2) { subset( sum( empty_set ), X ) }.
% 0.71/1.10 (1872) {G3,W0,D0,L0,V0,M0} R(1855,70);r(29) { }.
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 % SZS output end Refutation
% 0.71/1.10 found a proof!
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Unprocessed initial clauses:
% 0.71/1.10
% 0.71/1.10 (1874) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.71/1.10 , Y ) }.
% 0.71/1.10 (1875) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.71/1.10 }.
% 0.71/1.10 (1876) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y )
% 0.71/1.10 }.
% 0.71/1.10 (1877) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.71/1.10 (1878) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.71/1.10 (1879) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), equal_set
% 0.71/1.10 ( X, Y ) }.
% 0.71/1.10 (1880) {G0,W7,D3,L2,V2,M2} { ! member( X, power_set( Y ) ), subset( X, Y )
% 0.71/1.10 }.
% 0.71/1.10 (1881) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), member( X, power_set( Y ) )
% 0.71/1.10 }.
% 0.71/1.10 (1882) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member(
% 0.71/1.10 X, Y ) }.
% 0.71/1.10 (1883) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member(
% 0.71/1.10 X, Z ) }.
% 0.71/1.10 (1884) {G0,W11,D3,L3,V3,M3} { ! member( X, Y ), ! member( X, Z ), member(
% 0.71/1.10 X, intersection( Y, Z ) ) }.
% 0.71/1.10 (1885) {G0,W11,D3,L3,V3,M3} { ! member( X, union( Y, Z ) ), member( X, Y )
% 0.71/1.10 , member( X, Z ) }.
% 0.71/1.10 (1886) {G0,W8,D3,L2,V3,M2} { ! member( X, Y ), member( X, union( Y, Z ) )
% 0.71/1.10 }.
% 0.71/1.10 (1887) {G0,W8,D3,L2,V3,M2} { ! member( X, Z ), member( X, union( Y, Z ) )
% 0.71/1.10 }.
% 0.71/1.10 (1888) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.71/1.10 (1889) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), member( X
% 0.71/1.10 , Z ) }.
% 0.71/1.10 (1890) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), ! member(
% 0.71/1.10 X, Y ) }.
% 0.71/1.10 (1891) {G0,W11,D3,L3,V3,M3} { ! member( X, Z ), member( X, Y ), member( X
% 0.71/1.10 , difference( Z, Y ) ) }.
% 0.71/1.10 (1892) {G0,W7,D3,L2,V2,M2} { ! member( X, singleton( Y ) ), X = Y }.
% 0.71/1.10 (1893) {G0,W7,D3,L2,V2,M2} { ! X = Y, member( X, singleton( Y ) ) }.
% 0.71/1.10 (1894) {G0,W11,D3,L3,V3,M3} { ! member( X, unordered_pair( Y, Z ) ), X = Y
% 0.71/1.10 , X = Z }.
% 0.71/1.10 (1895) {G0,W8,D3,L2,V3,M2} { ! X = Y, member( X, unordered_pair( Y, Z ) )
% 0.71/1.10 }.
% 0.71/1.10 (1896) {G0,W8,D3,L2,V3,M2} { ! X = Z, member( X, unordered_pair( Y, Z ) )
% 0.71/1.10 }.
% 0.71/1.10 (1897) {G0,W9,D3,L2,V3,M2} { ! member( X, sum( Y ) ), member( skol2( Z, Y
% 0.71/1.10 ), Y ) }.
% 0.71/1.10 (1898) {G0,W9,D3,L2,V2,M2} { ! member( X, sum( Y ) ), member( X, skol2( X
% 0.71/1.10 , Y ) ) }.
% 0.71/1.10 (1899) {G0,W10,D3,L3,V3,M3} { ! member( Z, Y ), ! member( X, Z ), member(
% 0.71/1.10 X, sum( Y ) ) }.
% 0.71/1.10 (1900) {G0,W10,D3,L3,V3,M3} { ! member( X, product( Y ) ), ! member( Z, Y
% 0.71/1.10 ), member( X, Z ) }.
% 0.71/1.10 (1901) {G0,W9,D3,L2,V3,M2} { member( skol3( Z, Y ), Y ), member( X,
% 0.71/1.10 product( Y ) ) }.
% 0.71/1.10 (1902) {G0,W9,D3,L2,V2,M2} { ! member( X, skol3( X, Y ) ), member( X,
% 0.71/1.10 product( Y ) ) }.
% 0.71/1.10 (1903) {G0,W4,D3,L1,V0,M1} { ! equal_set( sum( empty_set ), empty_set )
% 0.71/1.10 }.
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Total Proof:
% 0.71/1.10
% 0.71/1.10 subsumption: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.71/1.10 ( X, Y ) }.
% 0.71/1.10 parent0: (1876) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset(
% 0.71/1.10 X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.71/1.10 , equal_set( X, Y ) }.
% 0.71/1.10 parent0: (1879) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ),
% 0.71/1.10 equal_set( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 2 ==> 2
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.71/1.10 parent0: (1888) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (23) {G0,W9,D3,L2,V3,M2} I { ! member( X, sum( Y ) ), member(
% 0.71/1.10 skol2( Z, Y ), Y ) }.
% 0.71/1.10 parent0: (1897) {G0,W9,D3,L2,V3,M2} { ! member( X, sum( Y ) ), member(
% 0.71/1.10 skol2( Z, Y ), Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (29) {G0,W4,D3,L1,V0,M1} I { ! equal_set( sum( empty_set ),
% 0.71/1.10 empty_set ) }.
% 0.71/1.10 parent0: (1903) {G0,W4,D3,L1,V0,M1} { ! equal_set( sum( empty_set ),
% 0.71/1.10 empty_set ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (1933) {G1,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 0.71/1.10 parent0[0]: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.71/1.10 parent1[0]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.71/1.10 ( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol1( empty_set, X )
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := empty_set
% 0.71/1.10 Y := X
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (67) {G1,W3,D2,L1,V1,M1} R(2,14) { subset( empty_set, X ) }.
% 0.71/1.10 parent0: (1933) {G1,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (1935) {G1,W6,D2,L2,V1,M2} { ! subset( X, empty_set ),
% 0.71/1.10 equal_set( X, empty_set ) }.
% 0.71/1.10 parent0[1]: (5) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.71/1.10 , equal_set( X, Y ) }.
% 0.71/1.10 parent1[0]: (67) {G1,W3,D2,L1,V1,M1} R(2,14) { subset( empty_set, X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := empty_set
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (70) {G2,W6,D2,L2,V1,M2} R(5,67) { ! subset( X, empty_set ),
% 0.71/1.10 equal_set( X, empty_set ) }.
% 0.71/1.10 parent0: (1935) {G1,W6,D2,L2,V1,M2} { ! subset( X, empty_set ), equal_set
% 0.71/1.10 ( X, empty_set ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (1936) {G1,W4,D3,L1,V1,M1} { ! member( Y, sum( empty_set ) )
% 0.71/1.10 }.
% 0.71/1.10 parent0[0]: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.71/1.10 parent1[1]: (23) {G0,W9,D3,L2,V3,M2} I { ! member( X, sum( Y ) ), member(
% 0.71/1.10 skol2( Z, Y ), Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol2( X, empty_set )
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := Y
% 0.71/1.10 Y := empty_set
% 0.71/1.10 Z := X
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (1828) {G1,W4,D3,L1,V1,M1} R(23,14) { ! member( X, sum(
% 0.71/1.10 empty_set ) ) }.
% 0.71/1.10 parent0: (1936) {G1,W4,D3,L1,V1,M1} { ! member( Y, sum( empty_set ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := Y
% 0.71/1.10 Y := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (1937) {G1,W4,D3,L1,V1,M1} { subset( sum( empty_set ), X ) }.
% 0.71/1.10 parent0[0]: (1828) {G1,W4,D3,L1,V1,M1} R(23,14) { ! member( X, sum(
% 0.71/1.10 empty_set ) ) }.
% 0.71/1.10 parent1[0]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.71/1.10 ( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol1( sum( empty_set ), X )
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := sum( empty_set )
% 0.71/1.10 Y := X
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (1855) {G2,W4,D3,L1,V1,M1} R(1828,2) { subset( sum( empty_set
% 0.71/1.10 ), X ) }.
% 0.71/1.10 parent0: (1937) {G1,W4,D3,L1,V1,M1} { subset( sum( empty_set ), X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (1938) {G3,W4,D3,L1,V0,M1} { equal_set( sum( empty_set ),
% 0.71/1.10 empty_set ) }.
% 0.71/1.10 parent0[0]: (70) {G2,W6,D2,L2,V1,M2} R(5,67) { ! subset( X, empty_set ),
% 0.71/1.10 equal_set( X, empty_set ) }.
% 0.71/1.10 parent1[0]: (1855) {G2,W4,D3,L1,V1,M1} R(1828,2) { subset( sum( empty_set )
% 0.71/1.10 , X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := sum( empty_set )
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := empty_set
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (1939) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 parent0[0]: (29) {G0,W4,D3,L1,V0,M1} I { ! equal_set( sum( empty_set ),
% 0.71/1.10 empty_set ) }.
% 0.71/1.10 parent1[0]: (1938) {G3,W4,D3,L1,V0,M1} { equal_set( sum( empty_set ),
% 0.71/1.10 empty_set ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (1872) {G3,W0,D0,L0,V0,M0} R(1855,70);r(29) { }.
% 0.71/1.10 parent0: (1939) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 Proof check complete!
% 0.71/1.10
% 0.71/1.10 Memory use:
% 0.71/1.10
% 0.71/1.10 space for terms: 24838
% 0.71/1.10 space for clauses: 85522
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 clauses generated: 2715
% 0.71/1.10 clauses kept: 1873
% 0.71/1.10 clauses selected: 105
% 0.71/1.10 clauses deleted: 4
% 0.71/1.10 clauses inuse deleted: 1
% 0.71/1.10
% 0.71/1.10 subsentry: 5603
% 0.71/1.10 literals s-matched: 3837
% 0.71/1.10 literals matched: 3715
% 0.71/1.10 full subsumption: 1604
% 0.71/1.10
% 0.71/1.10 checksum: 109372401
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksem ended
%------------------------------------------------------------------------------