TSTP Solution File: SET062+4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET062+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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:46:19 EDT 2022
% Result : Theorem 0.75s 1.13s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET062+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n013.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 10:18:29 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.12 *** allocated 10000 integers for termspace/termends
% 0.75/1.12 *** allocated 10000 integers for clauses
% 0.75/1.12 *** allocated 10000 integers for justifications
% 0.75/1.12 Bliksem 1.12
% 0.75/1.12
% 0.75/1.12
% 0.75/1.12 Automatic Strategy Selection
% 0.75/1.12
% 0.75/1.12
% 0.75/1.12 Clauses:
% 0.75/1.12
% 0.75/1.12 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.75/1.12 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.75/1.12 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.75/1.12 { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.75/1.12 { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.75/1.12 { ! subset( X, Y ), ! subset( Y, X ), equal_set( X, Y ) }.
% 0.75/1.12 { ! member( X, power_set( Y ) ), subset( X, Y ) }.
% 0.75/1.12 { ! subset( X, Y ), member( X, power_set( Y ) ) }.
% 0.75/1.12 { ! member( X, intersection( Y, Z ) ), member( X, Y ) }.
% 0.75/1.12 { ! member( X, intersection( Y, Z ) ), member( X, Z ) }.
% 0.75/1.12 { ! member( X, Y ), ! member( X, Z ), member( X, intersection( Y, Z ) ) }.
% 0.75/1.12 { ! member( X, union( Y, Z ) ), member( X, Y ), member( X, Z ) }.
% 0.75/1.12 { ! member( X, Y ), member( X, union( Y, Z ) ) }.
% 0.75/1.12 { ! member( X, Z ), member( X, union( Y, Z ) ) }.
% 0.75/1.12 { ! member( X, empty_set ) }.
% 0.75/1.12 { ! member( X, difference( Z, Y ) ), member( X, Z ) }.
% 0.75/1.13 { ! member( X, difference( Z, Y ) ), ! member( X, Y ) }.
% 0.75/1.13 { ! member( X, Z ), member( X, Y ), member( X, difference( Z, Y ) ) }.
% 0.75/1.13 { ! member( X, singleton( Y ) ), X = Y }.
% 0.75/1.13 { ! X = Y, member( X, singleton( Y ) ) }.
% 0.75/1.13 { ! member( X, unordered_pair( Y, Z ) ), X = Y, X = Z }.
% 0.75/1.13 { ! X = Y, member( X, unordered_pair( Y, Z ) ) }.
% 0.75/1.13 { ! X = Z, member( X, unordered_pair( Y, Z ) ) }.
% 0.75/1.13 { ! member( X, sum( Y ) ), member( skol2( Z, Y ), Y ) }.
% 0.75/1.13 { ! member( X, sum( Y ) ), member( X, skol2( X, Y ) ) }.
% 0.75/1.13 { ! member( Z, Y ), ! member( X, Z ), member( X, sum( Y ) ) }.
% 0.75/1.13 { ! member( X, product( Y ) ), ! member( Z, Y ), member( X, Z ) }.
% 0.75/1.13 { member( skol3( Z, Y ), Y ), member( X, product( Y ) ) }.
% 0.75/1.13 { ! member( X, skol3( X, Y ) ), member( X, product( Y ) ) }.
% 0.75/1.13 { ! subset( empty_set, skol4 ) }.
% 0.75/1.13
% 0.75/1.13 percentage equality = 0.090909, percentage horn = 0.833333
% 0.75/1.13 This is a problem with some equality
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 Options Used:
% 0.75/1.13
% 0.75/1.13 useres = 1
% 0.75/1.13 useparamod = 1
% 0.75/1.13 useeqrefl = 1
% 0.75/1.13 useeqfact = 1
% 0.75/1.13 usefactor = 1
% 0.75/1.13 usesimpsplitting = 0
% 0.75/1.13 usesimpdemod = 5
% 0.75/1.13 usesimpres = 3
% 0.75/1.13
% 0.75/1.13 resimpinuse = 1000
% 0.75/1.13 resimpclauses = 20000
% 0.75/1.13 substype = eqrewr
% 0.75/1.13 backwardsubs = 1
% 0.75/1.13 selectoldest = 5
% 0.75/1.13
% 0.75/1.13 litorderings [0] = split
% 0.75/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.75/1.13
% 0.75/1.13 termordering = kbo
% 0.75/1.13
% 0.75/1.13 litapriori = 0
% 0.75/1.13 termapriori = 1
% 0.75/1.13 litaposteriori = 0
% 0.75/1.13 termaposteriori = 0
% 0.75/1.13 demodaposteriori = 0
% 0.75/1.13 ordereqreflfact = 0
% 0.75/1.13
% 0.75/1.13 litselect = negord
% 0.75/1.13
% 0.75/1.13 maxweight = 15
% 0.75/1.13 maxdepth = 30000
% 0.75/1.13 maxlength = 115
% 0.75/1.13 maxnrvars = 195
% 0.75/1.13 excuselevel = 1
% 0.75/1.13 increasemaxweight = 1
% 0.75/1.13
% 0.75/1.13 maxselected = 10000000
% 0.75/1.13 maxnrclauses = 10000000
% 0.75/1.13
% 0.75/1.13 showgenerated = 0
% 0.75/1.13 showkept = 0
% 0.75/1.13 showselected = 0
% 0.75/1.13 showdeleted = 0
% 0.75/1.13 showresimp = 1
% 0.75/1.13 showstatus = 2000
% 0.75/1.13
% 0.75/1.13 prologoutput = 0
% 0.75/1.13 nrgoals = 5000000
% 0.75/1.13 totalproof = 1
% 0.75/1.13
% 0.75/1.13 Symbols occurring in the translation:
% 0.75/1.13
% 0.75/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.75/1.13 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.75/1.13 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.75/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.13 subset [37, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.75/1.13 member [39, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.75/1.13 equal_set [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.75/1.13 power_set [41, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.75/1.13 intersection [42, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.75/1.13 union [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.75/1.13 empty_set [44, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.75/1.13 difference [46, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.75/1.13 singleton [47, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.75/1.13 unordered_pair [48, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.75/1.13 sum [49, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.75/1.13 product [51, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.75/1.13 skol1 [52, 2] (w:1, o:53, a:1, s:1, b:1),
% 0.75/1.13 skol2 [53, 2] (w:1, o:54, a:1, s:1, b:1),
% 0.75/1.13 skol3 [54, 2] (w:1, o:55, a:1, s:1, b:1),
% 0.75/1.13 skol4 [55, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 Starting Search:
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 Bliksems!, er is een bewijs:
% 0.75/1.13 % SZS status Theorem
% 0.75/1.13 % SZS output start Refutation
% 0.75/1.13
% 0.75/1.13 (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.75/1.13 (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.75/1.13 (29) {G0,W3,D2,L1,V0,M1} I { ! subset( empty_set, skol4 ) }.
% 0.75/1.13 (65) {G1,W0,D0,L0,V0,M0} R(2,29);r(14) { }.
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 % SZS output end Refutation
% 0.75/1.13 found a proof!
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 Unprocessed initial clauses:
% 0.75/1.13
% 0.75/1.13 (67) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.75/1.13 Y ) }.
% 0.75/1.13 (68) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.75/1.13 }.
% 0.75/1.13 (69) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.75/1.13 (70) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( X, Y ) }.
% 0.75/1.13 (71) {G0,W6,D2,L2,V2,M2} { ! equal_set( X, Y ), subset( Y, X ) }.
% 0.75/1.13 (72) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), equal_set(
% 0.75/1.13 X, Y ) }.
% 0.75/1.13 (73) {G0,W7,D3,L2,V2,M2} { ! member( X, power_set( Y ) ), subset( X, Y )
% 0.75/1.13 }.
% 0.75/1.13 (74) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), member( X, power_set( Y ) )
% 0.75/1.13 }.
% 0.75/1.13 (75) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member( X
% 0.75/1.13 , Y ) }.
% 0.75/1.13 (76) {G0,W8,D3,L2,V3,M2} { ! member( X, intersection( Y, Z ) ), member( X
% 0.75/1.13 , Z ) }.
% 0.75/1.13 (77) {G0,W11,D3,L3,V3,M3} { ! member( X, Y ), ! member( X, Z ), member( X
% 0.75/1.13 , intersection( Y, Z ) ) }.
% 0.75/1.13 (78) {G0,W11,D3,L3,V3,M3} { ! member( X, union( Y, Z ) ), member( X, Y ),
% 0.75/1.13 member( X, Z ) }.
% 0.75/1.13 (79) {G0,W8,D3,L2,V3,M2} { ! member( X, Y ), member( X, union( Y, Z ) )
% 0.75/1.13 }.
% 0.75/1.13 (80) {G0,W8,D3,L2,V3,M2} { ! member( X, Z ), member( X, union( Y, Z ) )
% 0.75/1.13 }.
% 0.75/1.13 (81) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.75/1.13 (82) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), member( X, Z
% 0.75/1.13 ) }.
% 0.75/1.13 (83) {G0,W8,D3,L2,V3,M2} { ! member( X, difference( Z, Y ) ), ! member( X
% 0.75/1.13 , Y ) }.
% 0.75/1.13 (84) {G0,W11,D3,L3,V3,M3} { ! member( X, Z ), member( X, Y ), member( X,
% 0.75/1.13 difference( Z, Y ) ) }.
% 0.75/1.13 (85) {G0,W7,D3,L2,V2,M2} { ! member( X, singleton( Y ) ), X = Y }.
% 0.75/1.13 (86) {G0,W7,D3,L2,V2,M2} { ! X = Y, member( X, singleton( Y ) ) }.
% 0.75/1.13 (87) {G0,W11,D3,L3,V3,M3} { ! member( X, unordered_pair( Y, Z ) ), X = Y,
% 0.75/1.13 X = Z }.
% 0.75/1.13 (88) {G0,W8,D3,L2,V3,M2} { ! X = Y, member( X, unordered_pair( Y, Z ) )
% 0.75/1.13 }.
% 0.75/1.13 (89) {G0,W8,D3,L2,V3,M2} { ! X = Z, member( X, unordered_pair( Y, Z ) )
% 0.75/1.13 }.
% 0.75/1.13 (90) {G0,W9,D3,L2,V3,M2} { ! member( X, sum( Y ) ), member( skol2( Z, Y )
% 0.75/1.13 , Y ) }.
% 0.75/1.13 (91) {G0,W9,D3,L2,V2,M2} { ! member( X, sum( Y ) ), member( X, skol2( X, Y
% 0.75/1.13 ) ) }.
% 0.75/1.13 (92) {G0,W10,D3,L3,V3,M3} { ! member( Z, Y ), ! member( X, Z ), member( X
% 0.75/1.13 , sum( Y ) ) }.
% 0.75/1.13 (93) {G0,W10,D3,L3,V3,M3} { ! member( X, product( Y ) ), ! member( Z, Y )
% 0.75/1.13 , member( X, Z ) }.
% 0.75/1.13 (94) {G0,W9,D3,L2,V3,M2} { member( skol3( Z, Y ), Y ), member( X, product
% 0.75/1.13 ( Y ) ) }.
% 0.75/1.13 (95) {G0,W9,D3,L2,V2,M2} { ! member( X, skol3( X, Y ) ), member( X,
% 0.75/1.13 product( Y ) ) }.
% 0.75/1.13 (96) {G0,W3,D2,L1,V0,M1} { ! subset( empty_set, skol4 ) }.
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 Total Proof:
% 0.75/1.13
% 0.75/1.13 subsumption: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.75/1.13 ( X, Y ) }.
% 0.75/1.13 parent0: (69) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X
% 0.75/1.13 , Y ) }.
% 0.75/1.13 substitution0:
% 0.75/1.13 X := X
% 0.75/1.13 Y := Y
% 0.75/1.13 end
% 0.75/1.13 permutation0:
% 0.75/1.13 0 ==> 0
% 0.75/1.13 1 ==> 1
% 0.75/1.13 end
% 0.75/1.13
% 0.75/1.13 subsumption: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.75/1.13 parent0: (81) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.75/1.13 substitution0:
% 0.75/1.13 X := X
% 0.75/1.13 end
% 0.75/1.13 permutation0:
% 0.75/1.13 0 ==> 0
% 0.75/1.13 end
% 0.75/1.13
% 0.75/1.13 subsumption: (29) {G0,W3,D2,L1,V0,M1} I { ! subset( empty_set, skol4 ) }.
% 0.75/1.13 parent0: (96) {G0,W3,D2,L1,V0,M1} { ! subset( empty_set, skol4 ) }.
% 0.75/1.13 substitution0:
% 0.75/1.13 end
% 0.75/1.13 permutation0:
% 0.75/1.13 0 ==> 0
% 0.75/1.13 end
% 0.75/1.13
% 0.75/1.13 resolution: (113) {G1,W5,D3,L1,V0,M1} { member( skol1( empty_set, skol4 )
% 0.75/1.13 , empty_set ) }.
% 0.75/1.13 parent0[0]: (29) {G0,W3,D2,L1,V0,M1} I { ! subset( empty_set, skol4 ) }.
% 0.75/1.13 parent1[1]: (2) {G0,W8,D3,L2,V2,M2} I { member( skol1( X, Y ), X ), subset
% 0.75/1.13 ( X, Y ) }.
% 0.75/1.13 substitution0:
% 0.75/1.13 end
% 0.75/1.13 substitution1:
% 0.75/1.13 X := empty_set
% 0.75/1.13 Y := skol4
% 0.75/1.13 end
% 0.75/1.13
% 0.75/1.13 resolution: (114) {G1,W0,D0,L0,V0,M0} { }.
% 0.75/1.13 parent0[0]: (14) {G0,W3,D2,L1,V1,M1} I { ! member( X, empty_set ) }.
% 0.75/1.13 parent1[0]: (113) {G1,W5,D3,L1,V0,M1} { member( skol1( empty_set, skol4 )
% 0.75/1.13 , empty_set ) }.
% 0.75/1.13 substitution0:
% 0.75/1.13 X := skol1( empty_set, skol4 )
% 0.75/1.13 end
% 0.75/1.13 substitution1:
% 0.75/1.13 end
% 0.75/1.13
% 0.75/1.13 subsumption: (65) {G1,W0,D0,L0,V0,M0} R(2,29);r(14) { }.
% 0.75/1.13 parent0: (114) {G1,W0,D0,L0,V0,M0} { }.
% 0.75/1.13 substitution0:
% 0.75/1.13 end
% 0.75/1.13 permutation0:
% 0.75/1.13 end
% 0.75/1.13
% 0.75/1.13 Proof check complete!
% 0.75/1.13
% 0.75/1.13 Memory use:
% 0.75/1.13
% 0.75/1.13 space for terms: 1129
% 0.75/1.13 space for clauses: 3422
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 clauses generated: 82
% 0.75/1.13 clauses kept: 66
% 0.75/1.13 clauses selected: 16
% 0.75/1.13 clauses deleted: 0
% 0.75/1.13 clauses inuse deleted: 0
% 0.75/1.13
% 0.75/1.13 subsentry: 97
% 0.75/1.13 literals s-matched: 88
% 0.75/1.13 literals matched: 88
% 0.75/1.13 full subsumption: 46
% 0.75/1.13
% 0.75/1.13 checksum: 962070723
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 Bliksem ended
%------------------------------------------------------------------------------