TSTP Solution File: SET589+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET589+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n016.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:29 EDT 2022
% Result : Theorem 0.69s 1.09s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET589+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n016.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 : Sun Jul 10 13:09:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.69/1.09 *** allocated 10000 integers for termspace/termends
% 0.69/1.09 *** allocated 10000 integers for clauses
% 0.69/1.09 *** allocated 10000 integers for justifications
% 0.69/1.09 Bliksem 1.12
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Automatic Strategy Selection
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Clauses:
% 0.69/1.09
% 0.69/1.09 { ! subset( X, Z ), ! subset( Z, Y ), subset( X, Y ) }.
% 0.69/1.09 { ! subset( X, Y ), subset( difference( X, Z ), difference( Y, Z ) ) }.
% 0.69/1.09 { ! subset( X, Y ), subset( difference( Z, Y ), difference( Z, X ) ) }.
% 0.69/1.09 { ! member( Z, difference( X, Y ) ), member( Z, X ) }.
% 0.69/1.09 { ! member( Z, difference( X, Y ) ), ! member( Z, Y ) }.
% 0.69/1.09 { ! member( Z, X ), member( Z, Y ), member( Z, difference( X, Y ) ) }.
% 0.69/1.09 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.69/1.09 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.69/1.09 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.69/1.09 { subset( X, X ) }.
% 0.69/1.09 { subset( skol2, skol3 ) }.
% 0.69/1.09 { subset( skol4, skol5 ) }.
% 0.69/1.09 { ! subset( difference( skol2, skol5 ), difference( skol3, skol4 ) ) }.
% 0.69/1.09
% 0.69/1.09 percentage equality = 0.000000, percentage horn = 0.846154
% 0.69/1.09 This a non-horn, non-equality problem
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Options Used:
% 0.69/1.09
% 0.69/1.09 useres = 1
% 0.69/1.09 useparamod = 0
% 0.69/1.09 useeqrefl = 0
% 0.69/1.09 useeqfact = 0
% 0.69/1.09 usefactor = 1
% 0.69/1.09 usesimpsplitting = 0
% 0.69/1.09 usesimpdemod = 0
% 0.69/1.09 usesimpres = 3
% 0.69/1.09
% 0.69/1.09 resimpinuse = 1000
% 0.69/1.09 resimpclauses = 20000
% 0.69/1.09 substype = standard
% 0.69/1.09 backwardsubs = 1
% 0.69/1.09 selectoldest = 5
% 0.69/1.09
% 0.69/1.09 litorderings [0] = split
% 0.69/1.09 litorderings [1] = liftord
% 0.69/1.09
% 0.69/1.09 termordering = none
% 0.69/1.09
% 0.69/1.09 litapriori = 1
% 0.69/1.09 termapriori = 0
% 0.69/1.09 litaposteriori = 0
% 0.69/1.09 termaposteriori = 0
% 0.69/1.09 demodaposteriori = 0
% 0.69/1.09 ordereqreflfact = 0
% 0.69/1.09
% 0.69/1.09 litselect = none
% 0.69/1.09
% 0.69/1.09 maxweight = 15
% 0.69/1.09 maxdepth = 30000
% 0.69/1.09 maxlength = 115
% 0.69/1.09 maxnrvars = 195
% 0.69/1.09 excuselevel = 1
% 0.69/1.09 increasemaxweight = 1
% 0.69/1.09
% 0.69/1.09 maxselected = 10000000
% 0.69/1.09 maxnrclauses = 10000000
% 0.69/1.09
% 0.69/1.09 showgenerated = 0
% 0.69/1.09 showkept = 0
% 0.69/1.09 showselected = 0
% 0.69/1.09 showdeleted = 0
% 0.69/1.09 showresimp = 1
% 0.69/1.09 showstatus = 2000
% 0.69/1.09
% 0.69/1.09 prologoutput = 0
% 0.69/1.09 nrgoals = 5000000
% 0.69/1.09 totalproof = 1
% 0.69/1.09
% 0.69/1.09 Symbols occurring in the translation:
% 0.69/1.09
% 0.69/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.09 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.69/1.09 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.69/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 subset [38, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.69/1.09 difference [39, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.69/1.09 member [40, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.69/1.09 skol1 [42, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.69/1.09 skol2 [43, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.69/1.09 skol3 [44, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.69/1.09 skol4 [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.69/1.09 skol5 [46, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Starting Search:
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksems!, er is een bewijs:
% 0.69/1.09 % SZS status Theorem
% 0.69/1.09 % SZS output start Refutation
% 0.69/1.09
% 0.69/1.09 (0) {G0,W9,D2,L3,V3,M3} I { ! subset( Z, Y ), subset( X, Y ), ! subset( X,
% 0.69/1.09 Z ) }.
% 0.69/1.09 (1) {G0,W10,D3,L2,V3,M2} I { subset( difference( X, Z ), difference( Y, Z )
% 0.69/1.09 ), ! subset( X, Y ) }.
% 0.69/1.09 (2) {G0,W10,D3,L2,V3,M2} I { subset( difference( Z, Y ), difference( Z, X )
% 0.69/1.09 ), ! subset( X, Y ) }.
% 0.69/1.09 (10) {G0,W3,D2,L1,V0,M1} I { subset( skol2, skol3 ) }.
% 0.69/1.09 (11) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol5 ) }.
% 0.69/1.09 (12) {G0,W7,D3,L1,V0,M1} I { ! subset( difference( skol2, skol5 ),
% 0.69/1.09 difference( skol3, skol4 ) ) }.
% 0.69/1.09 (14) {G1,W10,D3,L2,V1,M2} R(0,12) { ! subset( difference( skol2, skol5 ), X
% 0.69/1.09 ), ! subset( X, difference( skol3, skol4 ) ) }.
% 0.69/1.09 (33) {G1,W7,D3,L1,V1,M1} R(1,10) { subset( difference( skol2, X ),
% 0.69/1.09 difference( skol3, X ) ) }.
% 0.69/1.09 (62) {G1,W7,D3,L1,V1,M1} R(2,11) { subset( difference( X, skol5 ),
% 0.69/1.09 difference( X, skol4 ) ) }.
% 0.69/1.09 (195) {G2,W0,D0,L0,V0,M0} R(14,62);r(33) { }.
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 % SZS output end Refutation
% 0.69/1.09 found a proof!
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Unprocessed initial clauses:
% 0.69/1.09
% 0.69/1.09 (197) {G0,W9,D2,L3,V3,M3} { ! subset( X, Z ), ! subset( Z, Y ), subset( X
% 0.69/1.09 , Y ) }.
% 0.69/1.09 (198) {G0,W10,D3,L2,V3,M2} { ! subset( X, Y ), subset( difference( X, Z )
% 0.69/1.09 , difference( Y, Z ) ) }.
% 0.69/1.09 (199) {G0,W10,D3,L2,V3,M2} { ! subset( X, Y ), subset( difference( Z, Y )
% 0.69/1.09 , difference( Z, X ) ) }.
% 0.69/1.09 (200) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), member( Z,
% 0.69/1.09 X ) }.
% 0.69/1.09 (201) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), ! member( Z
% 0.69/1.09 , Y ) }.
% 0.69/1.09 (202) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), member( Z, Y ), member( Z,
% 0.69/1.09 difference( X, Y ) ) }.
% 0.69/1.09 (203) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.69/1.09 , Y ) }.
% 0.69/1.09 (204) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.69/1.09 }.
% 0.69/1.09 (205) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.69/1.09 (206) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.69/1.09 (207) {G0,W3,D2,L1,V0,M1} { subset( skol2, skol3 ) }.
% 0.69/1.09 (208) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol5 ) }.
% 0.69/1.09 (209) {G0,W7,D3,L1,V0,M1} { ! subset( difference( skol2, skol5 ),
% 0.69/1.09 difference( skol3, skol4 ) ) }.
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Total Proof:
% 0.69/1.09
% 0.69/1.09 subsumption: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( Z, Y ), subset( X, Y ),
% 0.69/1.09 ! subset( X, Z ) }.
% 0.69/1.09 parent0: (197) {G0,W9,D2,L3,V3,M3} { ! subset( X, Z ), ! subset( Z, Y ),
% 0.69/1.09 subset( X, Y ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 Z := Z
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 2
% 0.69/1.09 1 ==> 0
% 0.69/1.09 2 ==> 1
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (1) {G0,W10,D3,L2,V3,M2} I { subset( difference( X, Z ),
% 0.69/1.09 difference( Y, Z ) ), ! subset( X, Y ) }.
% 0.69/1.09 parent0: (198) {G0,W10,D3,L2,V3,M2} { ! subset( X, Y ), subset( difference
% 0.69/1.09 ( X, Z ), difference( Y, Z ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 Z := Z
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 1
% 0.69/1.09 1 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (2) {G0,W10,D3,L2,V3,M2} I { subset( difference( Z, Y ),
% 0.69/1.09 difference( Z, X ) ), ! subset( X, Y ) }.
% 0.69/1.09 parent0: (199) {G0,W10,D3,L2,V3,M2} { ! subset( X, Y ), subset( difference
% 0.69/1.09 ( Z, Y ), difference( Z, X ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 Y := Y
% 0.69/1.09 Z := Z
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 1
% 0.69/1.09 1 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (10) {G0,W3,D2,L1,V0,M1} I { subset( skol2, skol3 ) }.
% 0.69/1.09 parent0: (207) {G0,W3,D2,L1,V0,M1} { subset( skol2, skol3 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (11) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol5 ) }.
% 0.69/1.09 parent0: (208) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (12) {G0,W7,D3,L1,V0,M1} I { ! subset( difference( skol2,
% 0.69/1.09 skol5 ), difference( skol3, skol4 ) ) }.
% 0.69/1.09 parent0: (209) {G0,W7,D3,L1,V0,M1} { ! subset( difference( skol2, skol5 )
% 0.69/1.09 , difference( skol3, skol4 ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (216) {G1,W10,D3,L2,V1,M2} { ! subset( X, difference( skol3,
% 0.69/1.09 skol4 ) ), ! subset( difference( skol2, skol5 ), X ) }.
% 0.69/1.09 parent0[0]: (12) {G0,W7,D3,L1,V0,M1} I { ! subset( difference( skol2, skol5
% 0.69/1.09 ), difference( skol3, skol4 ) ) }.
% 0.69/1.09 parent1[1]: (0) {G0,W9,D2,L3,V3,M3} I { ! subset( Z, Y ), subset( X, Y ), !
% 0.69/1.09 subset( X, Z ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 X := difference( skol2, skol5 )
% 0.69/1.09 Y := difference( skol3, skol4 )
% 0.69/1.09 Z := X
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (14) {G1,W10,D3,L2,V1,M2} R(0,12) { ! subset( difference(
% 0.69/1.09 skol2, skol5 ), X ), ! subset( X, difference( skol3, skol4 ) ) }.
% 0.69/1.09 parent0: (216) {G1,W10,D3,L2,V1,M2} { ! subset( X, difference( skol3,
% 0.69/1.09 skol4 ) ), ! subset( difference( skol2, skol5 ), X ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 1
% 0.69/1.09 1 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 *** allocated 15000 integers for clauses
% 0.69/1.09 resolution: (217) {G1,W7,D3,L1,V1,M1} { subset( difference( skol2, X ),
% 0.69/1.09 difference( skol3, X ) ) }.
% 0.69/1.09 parent0[1]: (1) {G0,W10,D3,L2,V3,M2} I { subset( difference( X, Z ),
% 0.69/1.09 difference( Y, Z ) ), ! subset( X, Y ) }.
% 0.69/1.09 parent1[0]: (10) {G0,W3,D2,L1,V0,M1} I { subset( skol2, skol3 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol2
% 0.69/1.09 Y := skol3
% 0.69/1.09 Z := X
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (33) {G1,W7,D3,L1,V1,M1} R(1,10) { subset( difference( skol2,
% 0.69/1.09 X ), difference( skol3, X ) ) }.
% 0.69/1.09 parent0: (217) {G1,W7,D3,L1,V1,M1} { subset( difference( skol2, X ),
% 0.69/1.09 difference( skol3, X ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (218) {G1,W7,D3,L1,V1,M1} { subset( difference( X, skol5 ),
% 0.69/1.09 difference( X, skol4 ) ) }.
% 0.69/1.09 parent0[1]: (2) {G0,W10,D3,L2,V3,M2} I { subset( difference( Z, Y ),
% 0.69/1.09 difference( Z, X ) ), ! subset( X, Y ) }.
% 0.69/1.09 parent1[0]: (11) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol5 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol4
% 0.69/1.09 Y := skol5
% 0.69/1.09 Z := X
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (62) {G1,W7,D3,L1,V1,M1} R(2,11) { subset( difference( X,
% 0.69/1.09 skol5 ), difference( X, skol4 ) ) }.
% 0.69/1.09 parent0: (218) {G1,W7,D3,L1,V1,M1} { subset( difference( X, skol5 ),
% 0.69/1.09 difference( X, skol4 ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := X
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (219) {G2,W7,D3,L1,V0,M1} { ! subset( difference( skol2, skol4
% 0.69/1.09 ), difference( skol3, skol4 ) ) }.
% 0.69/1.09 parent0[0]: (14) {G1,W10,D3,L2,V1,M2} R(0,12) { ! subset( difference( skol2
% 0.69/1.09 , skol5 ), X ), ! subset( X, difference( skol3, skol4 ) ) }.
% 0.69/1.09 parent1[0]: (62) {G1,W7,D3,L1,V1,M1} R(2,11) { subset( difference( X, skol5
% 0.69/1.09 ), difference( X, skol4 ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := difference( skol2, skol4 )
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 X := skol2
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (221) {G2,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 parent0[0]: (219) {G2,W7,D3,L1,V0,M1} { ! subset( difference( skol2, skol4
% 0.69/1.09 ), difference( skol3, skol4 ) ) }.
% 0.69/1.09 parent1[0]: (33) {G1,W7,D3,L1,V1,M1} R(1,10) { subset( difference( skol2, X
% 0.69/1.09 ), difference( skol3, X ) ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 X := skol4
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (195) {G2,W0,D0,L0,V0,M0} R(14,62);r(33) { }.
% 0.69/1.09 parent0: (221) {G2,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 Proof check complete!
% 0.69/1.09
% 0.69/1.09 Memory use:
% 0.69/1.09
% 0.69/1.09 space for terms: 2605
% 0.69/1.09 space for clauses: 9570
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 clauses generated: 380
% 0.69/1.09 clauses kept: 196
% 0.69/1.09 clauses selected: 36
% 0.69/1.09 clauses deleted: 0
% 0.69/1.09 clauses inuse deleted: 0
% 0.69/1.09
% 0.69/1.09 subsentry: 1306
% 0.69/1.09 literals s-matched: 699
% 0.69/1.09 literals matched: 695
% 0.69/1.09 full subsumption: 392
% 0.69/1.09
% 0.69/1.09 checksum: -6696533
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksem ended
%------------------------------------------------------------------------------