TSTP Solution File: SEU134+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU134+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 07:10:49 EDT 2022
% Result : Theorem 0.72s 1.08s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU134+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n010.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 Jun 20 11:57:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.07 *** allocated 10000 integers for termspace/termends
% 0.72/1.07 *** allocated 10000 integers for clauses
% 0.72/1.07 *** allocated 10000 integers for justifications
% 0.72/1.07 Bliksem 1.12
% 0.72/1.07
% 0.72/1.07
% 0.72/1.07 Automatic Strategy Selection
% 0.72/1.07
% 0.72/1.07
% 0.72/1.07 Clauses:
% 0.72/1.07
% 0.72/1.07 { ! in( X, Y ), ! in( Y, X ) }.
% 0.72/1.07 { empty( skol1 ) }.
% 0.72/1.07 { ! empty( skol2 ) }.
% 0.72/1.07 { ! in( X, Y ), ! empty( Y ) }.
% 0.72/1.07 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.72/1.07 { subset( X, X ) }.
% 0.72/1.07 { && }.
% 0.72/1.07 { && }.
% 0.72/1.07 { empty( empty_set ) }.
% 0.72/1.07 { set_difference( X, empty_set ) = X }.
% 0.72/1.07 { set_difference( empty_set, X ) = empty_set }.
% 0.72/1.07 { ! empty( X ), X = empty_set }.
% 0.72/1.07 { alpha1( skol3, skol4 ), subset( skol3, skol4 ) }.
% 0.72/1.07 { alpha1( skol3, skol4 ), ! set_difference( skol3, skol4 ) = empty_set }.
% 0.72/1.07 { ! alpha1( X, Y ), set_difference( X, Y ) = empty_set }.
% 0.72/1.07 { ! alpha1( X, Y ), ! subset( X, Y ) }.
% 0.72/1.07 { ! set_difference( X, Y ) = empty_set, subset( X, Y ), alpha1( X, Y ) }.
% 0.72/1.07 { ! set_difference( X, Y ) = empty_set, subset( X, Y ) }.
% 0.72/1.07 { ! subset( X, Y ), set_difference( X, Y ) = empty_set }.
% 0.72/1.07
% 0.72/1.07 percentage equality = 0.290323, percentage horn = 0.888889
% 0.72/1.07 This is a problem with some equality
% 0.72/1.07
% 0.72/1.07
% 0.72/1.07
% 0.72/1.07 Options Used:
% 0.72/1.07
% 0.72/1.07 useres = 1
% 0.72/1.07 useparamod = 1
% 0.72/1.07 useeqrefl = 1
% 0.72/1.07 useeqfact = 1
% 0.72/1.07 usefactor = 1
% 0.72/1.07 usesimpsplitting = 0
% 0.72/1.07 usesimpdemod = 5
% 0.72/1.07 usesimpres = 3
% 0.72/1.07
% 0.72/1.07 resimpinuse = 1000
% 0.72/1.07 resimpclauses = 20000
% 0.72/1.07 substype = eqrewr
% 0.72/1.07 backwardsubs = 1
% 0.72/1.07 selectoldest = 5
% 0.72/1.07
% 0.72/1.07 litorderings [0] = split
% 0.72/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.07
% 0.72/1.07 termordering = kbo
% 0.72/1.07
% 0.72/1.07 litapriori = 0
% 0.72/1.07 termapriori = 1
% 0.72/1.07 litaposteriori = 0
% 0.72/1.07 termaposteriori = 0
% 0.72/1.07 demodaposteriori = 0
% 0.72/1.07 ordereqreflfact = 0
% 0.72/1.07
% 0.72/1.07 litselect = negord
% 0.72/1.07
% 0.72/1.07 maxweight = 15
% 0.72/1.07 maxdepth = 30000
% 0.72/1.07 maxlength = 115
% 0.72/1.07 maxnrvars = 195
% 0.72/1.07 excuselevel = 1
% 0.72/1.07 increasemaxweight = 1
% 0.72/1.07
% 0.72/1.07 maxselected = 10000000
% 0.72/1.07 maxnrclauses = 10000000
% 0.72/1.07
% 0.72/1.07 showgenerated = 0
% 0.72/1.07 showkept = 0
% 0.72/1.07 showselected = 0
% 0.72/1.07 showdeleted = 0
% 0.72/1.07 showresimp = 1
% 0.72/1.07 showstatus = 2000
% 0.72/1.07
% 0.72/1.07 prologoutput = 0
% 0.72/1.07 nrgoals = 5000000
% 0.72/1.07 totalproof = 1
% 0.72/1.07
% 0.72/1.07 Symbols occurring in the translation:
% 0.72/1.08
% 0.72/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.08 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.72/1.08 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.72/1.08 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.72/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.08 in [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.72/1.08 empty [38, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.72/1.08 subset [39, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.72/1.08 empty_set [40, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.72/1.08 set_difference [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.72/1.08 alpha1 [42, 2] (w:1, o:46, a:1, s:1, b:1),
% 0.72/1.08 skol1 [43, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.72/1.08 skol2 [44, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.72/1.08 skol3 [45, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.72/1.08 skol4 [46, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Starting Search:
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Bliksems!, er is een bewijs:
% 0.72/1.08 % SZS status Theorem
% 0.72/1.08 % SZS output start Refutation
% 0.72/1.08
% 0.72/1.08 (11) {G0,W6,D2,L2,V0,M2} I { alpha1( skol3, skol4 ), subset( skol3, skol4 )
% 0.72/1.08 }.
% 0.72/1.08 (12) {G0,W8,D3,L2,V0,M2} I { alpha1( skol3, skol4 ), ! set_difference(
% 0.72/1.08 skol3, skol4 ) ==> empty_set }.
% 0.72/1.08 (13) {G0,W8,D3,L2,V2,M2} I { ! alpha1( X, Y ), set_difference( X, Y ) ==>
% 0.72/1.08 empty_set }.
% 0.72/1.08 (14) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), ! subset( X, Y ) }.
% 0.72/1.08 (16) {G0,W8,D3,L2,V2,M2} I { ! set_difference( X, Y ) ==> empty_set, subset
% 0.72/1.08 ( X, Y ) }.
% 0.72/1.08 (17) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_difference( X, Y ) ==>
% 0.72/1.08 empty_set }.
% 0.72/1.08 (30) {G1,W3,D2,L1,V0,M1} R(12,14);d(17);q { ! subset( skol3, skol4 ) }.
% 0.72/1.08 (38) {G2,W3,D2,L1,V0,M1} R(30,11) { alpha1( skol3, skol4 ) }.
% 0.72/1.08 (44) {G3,W5,D3,L1,V0,M1} R(13,38) { set_difference( skol3, skol4 ) ==>
% 0.72/1.08 empty_set }.
% 0.72/1.08 (62) {G4,W0,D0,L0,V0,M0} R(16,44);r(30) { }.
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 % SZS output end Refutation
% 0.72/1.08 found a proof!
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Unprocessed initial clauses:
% 0.72/1.08
% 0.72/1.08 (64) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.72/1.08 (65) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.72/1.08 (66) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.72/1.08 (67) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.72/1.08 (68) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.72/1.08 (69) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.72/1.08 (70) {G0,W1,D1,L1,V0,M1} { && }.
% 0.72/1.08 (71) {G0,W1,D1,L1,V0,M1} { && }.
% 0.72/1.08 (72) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.72/1.08 (73) {G0,W5,D3,L1,V1,M1} { set_difference( X, empty_set ) = X }.
% 0.72/1.08 (74) {G0,W5,D3,L1,V1,M1} { set_difference( empty_set, X ) = empty_set }.
% 0.72/1.08 (75) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.72/1.08 (76) {G0,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), subset( skol3, skol4 )
% 0.72/1.08 }.
% 0.72/1.08 (77) {G0,W8,D3,L2,V0,M2} { alpha1( skol3, skol4 ), ! set_difference( skol3
% 0.72/1.08 , skol4 ) = empty_set }.
% 0.72/1.08 (78) {G0,W8,D3,L2,V2,M2} { ! alpha1( X, Y ), set_difference( X, Y ) =
% 0.72/1.08 empty_set }.
% 0.72/1.08 (79) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! subset( X, Y ) }.
% 0.72/1.08 (80) {G0,W11,D3,L3,V2,M3} { ! set_difference( X, Y ) = empty_set, subset(
% 0.72/1.08 X, Y ), alpha1( X, Y ) }.
% 0.72/1.08 (81) {G0,W8,D3,L2,V2,M2} { ! set_difference( X, Y ) = empty_set, subset( X
% 0.72/1.08 , Y ) }.
% 0.72/1.08 (82) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), set_difference( X, Y ) =
% 0.72/1.08 empty_set }.
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Total Proof:
% 0.72/1.08
% 0.72/1.08 subsumption: (11) {G0,W6,D2,L2,V0,M2} I { alpha1( skol3, skol4 ), subset(
% 0.72/1.08 skol3, skol4 ) }.
% 0.72/1.08 parent0: (76) {G0,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), subset( skol3
% 0.72/1.08 , skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 0 ==> 0
% 0.72/1.08 1 ==> 1
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 subsumption: (12) {G0,W8,D3,L2,V0,M2} I { alpha1( skol3, skol4 ), !
% 0.72/1.08 set_difference( skol3, skol4 ) ==> empty_set }.
% 0.72/1.08 parent0: (77) {G0,W8,D3,L2,V0,M2} { alpha1( skol3, skol4 ), !
% 0.72/1.08 set_difference( skol3, skol4 ) = empty_set }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 0 ==> 0
% 0.72/1.08 1 ==> 1
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 subsumption: (13) {G0,W8,D3,L2,V2,M2} I { ! alpha1( X, Y ), set_difference
% 0.72/1.08 ( X, Y ) ==> empty_set }.
% 0.72/1.08 parent0: (78) {G0,W8,D3,L2,V2,M2} { ! alpha1( X, Y ), set_difference( X, Y
% 0.72/1.08 ) = empty_set }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := X
% 0.72/1.08 Y := Y
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 0 ==> 0
% 0.72/1.08 1 ==> 1
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 subsumption: (14) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), ! subset( X, Y
% 0.72/1.08 ) }.
% 0.72/1.08 parent0: (79) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! subset( X, Y ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := X
% 0.72/1.08 Y := Y
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 0 ==> 0
% 0.72/1.08 1 ==> 1
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 subsumption: (16) {G0,W8,D3,L2,V2,M2} I { ! set_difference( X, Y ) ==>
% 0.72/1.08 empty_set, subset( X, Y ) }.
% 0.72/1.08 parent0: (81) {G0,W8,D3,L2,V2,M2} { ! set_difference( X, Y ) = empty_set,
% 0.72/1.08 subset( X, Y ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := X
% 0.72/1.08 Y := Y
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 0 ==> 0
% 0.72/1.08 1 ==> 1
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 subsumption: (17) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_difference
% 0.72/1.08 ( X, Y ) ==> empty_set }.
% 0.72/1.08 parent0: (82) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), set_difference( X, Y
% 0.72/1.08 ) = empty_set }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := X
% 0.72/1.08 Y := Y
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 0 ==> 0
% 0.72/1.08 1 ==> 1
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 eqswap: (127) {G0,W8,D3,L2,V0,M2} { ! empty_set ==> set_difference( skol3
% 0.72/1.08 , skol4 ), alpha1( skol3, skol4 ) }.
% 0.72/1.08 parent0[1]: (12) {G0,W8,D3,L2,V0,M2} I { alpha1( skol3, skol4 ), !
% 0.72/1.08 set_difference( skol3, skol4 ) ==> empty_set }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 resolution: (129) {G1,W8,D3,L2,V0,M2} { ! subset( skol3, skol4 ), !
% 0.72/1.08 empty_set ==> set_difference( skol3, skol4 ) }.
% 0.72/1.08 parent0[0]: (14) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), ! subset( X, Y )
% 0.72/1.08 }.
% 0.72/1.08 parent1[1]: (127) {G0,W8,D3,L2,V0,M2} { ! empty_set ==> set_difference(
% 0.72/1.08 skol3, skol4 ), alpha1( skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := skol3
% 0.72/1.08 Y := skol4
% 0.72/1.08 end
% 0.72/1.08 substitution1:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 paramod: (130) {G1,W9,D2,L3,V0,M3} { ! empty_set ==> empty_set, ! subset(
% 0.72/1.08 skol3, skol4 ), ! subset( skol3, skol4 ) }.
% 0.72/1.08 parent0[1]: (17) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_difference(
% 0.72/1.08 X, Y ) ==> empty_set }.
% 0.72/1.08 parent1[1; 3]: (129) {G1,W8,D3,L2,V0,M2} { ! subset( skol3, skol4 ), !
% 0.72/1.08 empty_set ==> set_difference( skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := skol3
% 0.72/1.08 Y := skol4
% 0.72/1.08 end
% 0.72/1.08 substitution1:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 factor: (131) {G1,W6,D2,L2,V0,M2} { ! empty_set ==> empty_set, ! subset(
% 0.72/1.08 skol3, skol4 ) }.
% 0.72/1.08 parent0[1, 2]: (130) {G1,W9,D2,L3,V0,M3} { ! empty_set ==> empty_set, !
% 0.72/1.08 subset( skol3, skol4 ), ! subset( skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 eqrefl: (132) {G0,W3,D2,L1,V0,M1} { ! subset( skol3, skol4 ) }.
% 0.72/1.08 parent0[0]: (131) {G1,W6,D2,L2,V0,M2} { ! empty_set ==> empty_set, !
% 0.72/1.08 subset( skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 subsumption: (30) {G1,W3,D2,L1,V0,M1} R(12,14);d(17);q { ! subset( skol3,
% 0.72/1.08 skol4 ) }.
% 0.72/1.08 parent0: (132) {G0,W3,D2,L1,V0,M1} { ! subset( skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 0 ==> 0
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 resolution: (133) {G1,W3,D2,L1,V0,M1} { alpha1( skol3, skol4 ) }.
% 0.72/1.08 parent0[0]: (30) {G1,W3,D2,L1,V0,M1} R(12,14);d(17);q { ! subset( skol3,
% 0.72/1.08 skol4 ) }.
% 0.72/1.08 parent1[1]: (11) {G0,W6,D2,L2,V0,M2} I { alpha1( skol3, skol4 ), subset(
% 0.72/1.08 skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08 substitution1:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 subsumption: (38) {G2,W3,D2,L1,V0,M1} R(30,11) { alpha1( skol3, skol4 ) }.
% 0.72/1.08 parent0: (133) {G1,W3,D2,L1,V0,M1} { alpha1( skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 0 ==> 0
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 eqswap: (134) {G0,W8,D3,L2,V2,M2} { empty_set ==> set_difference( X, Y ),
% 0.72/1.08 ! alpha1( X, Y ) }.
% 0.72/1.08 parent0[1]: (13) {G0,W8,D3,L2,V2,M2} I { ! alpha1( X, Y ), set_difference(
% 0.72/1.08 X, Y ) ==> empty_set }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := X
% 0.72/1.08 Y := Y
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 resolution: (135) {G1,W5,D3,L1,V0,M1} { empty_set ==> set_difference(
% 0.72/1.08 skol3, skol4 ) }.
% 0.72/1.08 parent0[1]: (134) {G0,W8,D3,L2,V2,M2} { empty_set ==> set_difference( X, Y
% 0.72/1.08 ), ! alpha1( X, Y ) }.
% 0.72/1.08 parent1[0]: (38) {G2,W3,D2,L1,V0,M1} R(30,11) { alpha1( skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := skol3
% 0.72/1.08 Y := skol4
% 0.72/1.08 end
% 0.72/1.08 substitution1:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 eqswap: (136) {G1,W5,D3,L1,V0,M1} { set_difference( skol3, skol4 ) ==>
% 0.72/1.08 empty_set }.
% 0.72/1.08 parent0[0]: (135) {G1,W5,D3,L1,V0,M1} { empty_set ==> set_difference(
% 0.72/1.08 skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 subsumption: (44) {G3,W5,D3,L1,V0,M1} R(13,38) { set_difference( skol3,
% 0.72/1.08 skol4 ) ==> empty_set }.
% 0.72/1.08 parent0: (136) {G1,W5,D3,L1,V0,M1} { set_difference( skol3, skol4 ) ==>
% 0.72/1.08 empty_set }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 0 ==> 0
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 eqswap: (137) {G0,W8,D3,L2,V2,M2} { ! empty_set ==> set_difference( X, Y )
% 0.72/1.08 , subset( X, Y ) }.
% 0.72/1.08 parent0[0]: (16) {G0,W8,D3,L2,V2,M2} I { ! set_difference( X, Y ) ==>
% 0.72/1.08 empty_set, subset( X, Y ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := X
% 0.72/1.08 Y := Y
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 eqswap: (138) {G3,W5,D3,L1,V0,M1} { empty_set ==> set_difference( skol3,
% 0.72/1.08 skol4 ) }.
% 0.72/1.08 parent0[0]: (44) {G3,W5,D3,L1,V0,M1} R(13,38) { set_difference( skol3,
% 0.72/1.08 skol4 ) ==> empty_set }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 resolution: (139) {G1,W3,D2,L1,V0,M1} { subset( skol3, skol4 ) }.
% 0.72/1.08 parent0[0]: (137) {G0,W8,D3,L2,V2,M2} { ! empty_set ==> set_difference( X
% 0.72/1.08 , Y ), subset( X, Y ) }.
% 0.72/1.08 parent1[0]: (138) {G3,W5,D3,L1,V0,M1} { empty_set ==> set_difference(
% 0.72/1.08 skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 X := skol3
% 0.72/1.08 Y := skol4
% 0.72/1.08 end
% 0.72/1.08 substitution1:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 resolution: (140) {G2,W0,D0,L0,V0,M0} { }.
% 0.72/1.08 parent0[0]: (30) {G1,W3,D2,L1,V0,M1} R(12,14);d(17);q { ! subset( skol3,
% 0.72/1.08 skol4 ) }.
% 0.72/1.08 parent1[0]: (139) {G1,W3,D2,L1,V0,M1} { subset( skol3, skol4 ) }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08 substitution1:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 subsumption: (62) {G4,W0,D0,L0,V0,M0} R(16,44);r(30) { }.
% 0.72/1.08 parent0: (140) {G2,W0,D0,L0,V0,M0} { }.
% 0.72/1.08 substitution0:
% 0.72/1.08 end
% 0.72/1.08 permutation0:
% 0.72/1.08 end
% 0.72/1.08
% 0.72/1.08 Proof check complete!
% 0.72/1.08
% 0.72/1.08 Memory use:
% 0.72/1.08
% 0.72/1.08 space for terms: 716
% 0.72/1.08 space for clauses: 3214
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 clauses generated: 310
% 0.72/1.08 clauses kept: 63
% 0.72/1.08 clauses selected: 33
% 0.72/1.08 clauses deleted: 3
% 0.72/1.08 clauses inuse deleted: 0
% 0.72/1.08
% 0.72/1.08 subsentry: 479
% 0.72/1.08 literals s-matched: 312
% 0.72/1.08 literals matched: 312
% 0.72/1.08 full subsumption: 49
% 0.72/1.08
% 0.72/1.08 checksum: 1149243464
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Bliksem ended
%------------------------------------------------------------------------------