TSTP Solution File: SET602+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET602+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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:38 EDT 2022
% Result : Theorem 0.72s 1.11s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET602+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n011.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 : Sat Jul 9 23:20:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.11 *** allocated 10000 integers for termspace/termends
% 0.72/1.11 *** allocated 10000 integers for clauses
% 0.72/1.11 *** allocated 10000 integers for justifications
% 0.72/1.11 Bliksem 1.12
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Automatic Strategy Selection
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Clauses:
% 0.72/1.11
% 0.72/1.11 { ! difference( X, Y ) = empty_set, subset( X, Y ) }.
% 0.72/1.11 { ! subset( X, Y ), difference( X, Y ) = empty_set }.
% 0.72/1.11 { ! member( X, empty_set ) }.
% 0.72/1.11 { ! member( Z, difference( X, Y ) ), member( Z, X ) }.
% 0.72/1.11 { ! member( Z, difference( X, Y ) ), ! member( Z, Y ) }.
% 0.72/1.11 { ! member( Z, X ), member( Z, Y ), member( Z, difference( X, Y ) ) }.
% 0.72/1.11 { ! X = Y, subset( X, Y ) }.
% 0.72/1.11 { ! X = Y, subset( Y, X ) }.
% 0.72/1.11 { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.72/1.11 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.72/1.11 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.72/1.11 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.72/1.11 { subset( X, X ) }.
% 0.72/1.11 { ! empty( X ), ! member( Y, X ) }.
% 0.72/1.11 { member( skol2( X ), X ), empty( X ) }.
% 0.72/1.11 { ! difference( skol3, skol3 ) = empty_set }.
% 0.72/1.11
% 0.72/1.11 percentage equality = 0.187500, percentage horn = 0.812500
% 0.72/1.11 This is a problem with some equality
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Options Used:
% 0.72/1.11
% 0.72/1.11 useres = 1
% 0.72/1.11 useparamod = 1
% 0.72/1.11 useeqrefl = 1
% 0.72/1.11 useeqfact = 1
% 0.72/1.11 usefactor = 1
% 0.72/1.11 usesimpsplitting = 0
% 0.72/1.11 usesimpdemod = 5
% 0.72/1.11 usesimpres = 3
% 0.72/1.11
% 0.72/1.11 resimpinuse = 1000
% 0.72/1.11 resimpclauses = 20000
% 0.72/1.11 substype = eqrewr
% 0.72/1.11 backwardsubs = 1
% 0.72/1.11 selectoldest = 5
% 0.72/1.11
% 0.72/1.11 litorderings [0] = split
% 0.72/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.11
% 0.72/1.11 termordering = kbo
% 0.72/1.11
% 0.72/1.11 litapriori = 0
% 0.72/1.11 termapriori = 1
% 0.72/1.11 litaposteriori = 0
% 0.72/1.11 termaposteriori = 0
% 0.72/1.11 demodaposteriori = 0
% 0.72/1.11 ordereqreflfact = 0
% 0.72/1.11
% 0.72/1.11 litselect = negord
% 0.72/1.11
% 0.72/1.11 maxweight = 15
% 0.72/1.11 maxdepth = 30000
% 0.72/1.11 maxlength = 115
% 0.72/1.11 maxnrvars = 195
% 0.72/1.11 excuselevel = 1
% 0.72/1.11 increasemaxweight = 1
% 0.72/1.11
% 0.72/1.11 maxselected = 10000000
% 0.72/1.11 maxnrclauses = 10000000
% 0.72/1.11
% 0.72/1.11 showgenerated = 0
% 0.72/1.11 showkept = 0
% 0.72/1.11 showselected = 0
% 0.72/1.11 showdeleted = 0
% 0.72/1.11 showresimp = 1
% 0.72/1.11 showstatus = 2000
% 0.72/1.11
% 0.72/1.11 prologoutput = 0
% 0.72/1.11 nrgoals = 5000000
% 0.72/1.11 totalproof = 1
% 0.72/1.11
% 0.72/1.11 Symbols occurring in the translation:
% 0.72/1.11
% 0.72/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.11 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.72/1.11 ! [4, 1] (w:0, o:11, a:1, s:1, b:0),
% 0.72/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.11 difference [37, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.72/1.11 empty_set [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.72/1.11 subset [39, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.72/1.11 member [40, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.72/1.11 empty [42, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.72/1.11 skol1 [43, 2] (w:1, o:45, a:1, s:1, b:1),
% 0.72/1.11 skol2 [44, 1] (w:1, o:17, a:1, s:1, b:1),
% 0.72/1.11 skol3 [45, 0] (w:1, o:10, a:1, s:1, b:1).
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Starting Search:
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Bliksems!, er is een bewijs:
% 0.72/1.11 % SZS status Theorem
% 0.72/1.11 % SZS output start Refutation
% 0.72/1.11
% 0.72/1.11 (1) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), difference( X, Y ) ==>
% 0.72/1.11 empty_set }.
% 0.72/1.11 (11) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.72/1.11 (14) {G0,W5,D3,L1,V0,M1} I { ! difference( skol3, skol3 ) ==> empty_set }.
% 0.72/1.11 (19) {G1,W0,D0,L0,V0,M0} R(1,14);r(11) { }.
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 % SZS output end Refutation
% 0.72/1.11 found a proof!
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Unprocessed initial clauses:
% 0.72/1.11
% 0.72/1.11 (21) {G0,W8,D3,L2,V2,M2} { ! difference( X, Y ) = empty_set, subset( X, Y
% 0.72/1.11 ) }.
% 0.72/1.11 (22) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), difference( X, Y ) =
% 0.72/1.11 empty_set }.
% 0.72/1.11 (23) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.72/1.11 (24) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), member( Z, X
% 0.72/1.11 ) }.
% 0.72/1.11 (25) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), ! member( Z
% 0.72/1.11 , Y ) }.
% 0.72/1.11 (26) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), member( Z, Y ), member( Z,
% 0.72/1.11 difference( X, Y ) ) }.
% 0.72/1.11 (27) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.72/1.11 (28) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( Y, X ) }.
% 0.72/1.11 (29) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.72/1.11 (30) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.72/1.11 Y ) }.
% 0.72/1.11 (31) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.72/1.11 }.
% 0.72/1.11 (32) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.72/1.11 (33) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.72/1.11 (34) {G0,W5,D2,L2,V2,M2} { ! empty( X ), ! member( Y, X ) }.
% 0.72/1.11 (35) {G0,W6,D3,L2,V1,M2} { member( skol2( X ), X ), empty( X ) }.
% 0.72/1.11 (36) {G0,W5,D3,L1,V0,M1} { ! difference( skol3, skol3 ) = empty_set }.
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Total Proof:
% 0.72/1.11
% 0.72/1.11 subsumption: (1) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), difference( X, Y
% 0.72/1.11 ) ==> empty_set }.
% 0.72/1.11 parent0: (22) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), difference( X, Y ) =
% 0.72/1.11 empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (11) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.72/1.11 parent0: (33) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (14) {G0,W5,D3,L1,V0,M1} I { ! difference( skol3, skol3 ) ==>
% 0.72/1.11 empty_set }.
% 0.72/1.11 parent0: (36) {G0,W5,D3,L1,V0,M1} { ! difference( skol3, skol3 ) =
% 0.72/1.11 empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 eqswap: (50) {G0,W8,D3,L2,V2,M2} { empty_set ==> difference( X, Y ), !
% 0.72/1.11 subset( X, Y ) }.
% 0.72/1.11 parent0[1]: (1) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), difference( X, Y
% 0.72/1.12 ) ==> empty_set }.
% 0.72/1.12 substitution0:
% 0.72/1.12 X := X
% 0.72/1.12 Y := Y
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 eqswap: (51) {G0,W5,D3,L1,V0,M1} { ! empty_set ==> difference( skol3,
% 0.72/1.12 skol3 ) }.
% 0.72/1.12 parent0[0]: (14) {G0,W5,D3,L1,V0,M1} I { ! difference( skol3, skol3 ) ==>
% 0.72/1.12 empty_set }.
% 0.72/1.12 substitution0:
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 resolution: (52) {G1,W3,D2,L1,V0,M1} { ! subset( skol3, skol3 ) }.
% 0.72/1.12 parent0[0]: (51) {G0,W5,D3,L1,V0,M1} { ! empty_set ==> difference( skol3,
% 0.72/1.12 skol3 ) }.
% 0.72/1.12 parent1[0]: (50) {G0,W8,D3,L2,V2,M2} { empty_set ==> difference( X, Y ), !
% 0.72/1.12 subset( X, Y ) }.
% 0.72/1.12 substitution0:
% 0.72/1.12 end
% 0.72/1.12 substitution1:
% 0.72/1.12 X := skol3
% 0.72/1.12 Y := skol3
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 resolution: (53) {G1,W0,D0,L0,V0,M0} { }.
% 0.72/1.12 parent0[0]: (52) {G1,W3,D2,L1,V0,M1} { ! subset( skol3, skol3 ) }.
% 0.72/1.12 parent1[0]: (11) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.72/1.12 substitution0:
% 0.72/1.12 end
% 0.72/1.12 substitution1:
% 0.72/1.12 X := skol3
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 subsumption: (19) {G1,W0,D0,L0,V0,M0} R(1,14);r(11) { }.
% 0.72/1.12 parent0: (53) {G1,W0,D0,L0,V0,M0} { }.
% 0.72/1.12 substitution0:
% 0.72/1.12 end
% 0.72/1.12 permutation0:
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 Proof check complete!
% 0.72/1.12
% 0.72/1.12 Memory use:
% 0.72/1.12
% 0.72/1.12 space for terms: 423
% 0.72/1.12 space for clauses: 1150
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 clauses generated: 32
% 0.72/1.12 clauses kept: 20
% 0.72/1.12 clauses selected: 11
% 0.72/1.12 clauses deleted: 0
% 0.72/1.12 clauses inuse deleted: 0
% 0.72/1.12
% 0.72/1.12 subsentry: 87
% 0.72/1.12 literals s-matched: 61
% 0.72/1.12 literals matched: 61
% 0.72/1.12 full subsumption: 7
% 0.72/1.12
% 0.72/1.12 checksum: 674060
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Bliksem ended
%------------------------------------------------------------------------------