TSTP Solution File: SET987+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET987+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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:53:47 EDT 2022
% Result : Theorem 0.72s 1.12s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET987+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n020.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 : Sun Jul 10 11:57:28 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.72/1.12 *** allocated 10000 integers for termspace/termends
% 0.72/1.12 *** allocated 10000 integers for clauses
% 0.72/1.12 *** allocated 10000 integers for justifications
% 0.72/1.12 Bliksem 1.12
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Automatic Strategy Selection
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Clauses:
% 0.72/1.12
% 0.72/1.12 { ! in( X, Y ), ! in( Y, X ) }.
% 0.72/1.12 { set_union2( X, Y ) = set_union2( Y, X ) }.
% 0.72/1.12 { empty( X ), ! empty( set_union2( X, Y ) ) }.
% 0.72/1.12 { empty( X ), ! empty( set_union2( Y, X ) ) }.
% 0.72/1.12 { set_union2( X, X ) = X }.
% 0.72/1.12 { empty( skol1 ) }.
% 0.72/1.12 { ! empty( skol2 ) }.
% 0.72/1.12 { ! in( skol3, skol4 ) }.
% 0.72/1.12 { ! set_difference( set_union2( skol4, singleton( skol3 ) ), singleton(
% 0.72/1.12 skol3 ) ) = skol4 }.
% 0.72/1.12 { set_difference( set_union2( X, Y ), Y ) = set_difference( X, Y ) }.
% 0.72/1.12 { ! set_difference( X, singleton( Y ) ) = X, ! in( Y, X ) }.
% 0.72/1.12 { in( Y, X ), set_difference( X, singleton( Y ) ) = X }.
% 0.72/1.12
% 0.72/1.12 percentage equality = 0.352941, percentage horn = 0.916667
% 0.72/1.12 This is a problem with some equality
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Options Used:
% 0.72/1.12
% 0.72/1.12 useres = 1
% 0.72/1.12 useparamod = 1
% 0.72/1.12 useeqrefl = 1
% 0.72/1.12 useeqfact = 1
% 0.72/1.12 usefactor = 1
% 0.72/1.12 usesimpsplitting = 0
% 0.72/1.12 usesimpdemod = 5
% 0.72/1.12 usesimpres = 3
% 0.72/1.12
% 0.72/1.12 resimpinuse = 1000
% 0.72/1.12 resimpclauses = 20000
% 0.72/1.12 substype = eqrewr
% 0.72/1.12 backwardsubs = 1
% 0.72/1.12 selectoldest = 5
% 0.72/1.12
% 0.72/1.12 litorderings [0] = split
% 0.72/1.12 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.12
% 0.72/1.12 termordering = kbo
% 0.72/1.12
% 0.72/1.12 litapriori = 0
% 0.72/1.12 termapriori = 1
% 0.72/1.12 litaposteriori = 0
% 0.72/1.12 termaposteriori = 0
% 0.72/1.12 demodaposteriori = 0
% 0.72/1.12 ordereqreflfact = 0
% 0.72/1.12
% 0.72/1.12 litselect = negord
% 0.72/1.12
% 0.72/1.12 maxweight = 15
% 0.72/1.12 maxdepth = 30000
% 0.72/1.12 maxlength = 115
% 0.72/1.12 maxnrvars = 195
% 0.72/1.12 excuselevel = 1
% 0.72/1.12 increasemaxweight = 1
% 0.72/1.12
% 0.72/1.12 maxselected = 10000000
% 0.72/1.12 maxnrclauses = 10000000
% 0.72/1.12
% 0.72/1.12 showgenerated = 0
% 0.72/1.12 showkept = 0
% 0.72/1.12 showselected = 0
% 0.72/1.12 showdeleted = 0
% 0.72/1.12 showresimp = 1
% 0.72/1.12 showstatus = 2000
% 0.72/1.12
% 0.72/1.12 prologoutput = 0
% 0.72/1.12 nrgoals = 5000000
% 0.72/1.12 totalproof = 1
% 0.72/1.12
% 0.72/1.12 Symbols occurring in the translation:
% 0.72/1.12
% 0.72/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.12 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.72/1.12 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.72/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.12 in [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.72/1.12 set_union2 [38, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.72/1.12 empty [39, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.72/1.12 singleton [40, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.72/1.12 set_difference [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.72/1.12 skol1 [42, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.72/1.12 skol2 [43, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.72/1.12 skol3 [44, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.72/1.12 skol4 [45, 0] (w:1, o:11, a:1, s:1, b:1).
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Starting Search:
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Bliksems!, er is een bewijs:
% 0.72/1.12 % SZS status Theorem
% 0.72/1.12 % SZS output start Refutation
% 0.72/1.12
% 0.72/1.12 (7) {G0,W3,D2,L1,V0,M1} I { ! in( skol3, skol4 ) }.
% 0.72/1.12 (8) {G0,W9,D5,L1,V0,M1} I { ! set_difference( set_union2( skol4, singleton
% 0.72/1.12 ( skol3 ) ), singleton( skol3 ) ) ==> skol4 }.
% 0.72/1.12 (9) {G0,W9,D4,L1,V2,M1} I { set_difference( set_union2( X, Y ), Y ) ==>
% 0.72/1.12 set_difference( X, Y ) }.
% 0.72/1.12 (11) {G0,W9,D4,L2,V2,M2} I { in( Y, X ), set_difference( X, singleton( Y )
% 0.72/1.12 ) ==> X }.
% 0.72/1.12 (31) {G1,W6,D4,L1,V0,M1} S(8);d(9) { ! set_difference( skol4, singleton(
% 0.72/1.12 skol3 ) ) ==> skol4 }.
% 0.72/1.12 (102) {G2,W0,D0,L0,V0,M0} R(11,31);r(7) { }.
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 % SZS output end Refutation
% 0.72/1.12 found a proof!
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Unprocessed initial clauses:
% 0.72/1.12
% 0.72/1.12 (104) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.72/1.12 (105) {G0,W7,D3,L1,V2,M1} { set_union2( X, Y ) = set_union2( Y, X ) }.
% 0.72/1.12 (106) {G0,W6,D3,L2,V2,M2} { empty( X ), ! empty( set_union2( X, Y ) ) }.
% 0.72/1.12 (107) {G0,W6,D3,L2,V2,M2} { empty( X ), ! empty( set_union2( Y, X ) ) }.
% 0.72/1.12 (108) {G0,W5,D3,L1,V1,M1} { set_union2( X, X ) = X }.
% 0.72/1.12 (109) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.72/1.12 (110) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.72/1.12 (111) {G0,W3,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.72/1.12 (112) {G0,W9,D5,L1,V0,M1} { ! set_difference( set_union2( skol4, singleton
% 0.72/1.12 ( skol3 ) ), singleton( skol3 ) ) = skol4 }.
% 0.72/1.12 (113) {G0,W9,D4,L1,V2,M1} { set_difference( set_union2( X, Y ), Y ) =
% 0.72/1.12 set_difference( X, Y ) }.
% 0.72/1.12 (114) {G0,W9,D4,L2,V2,M2} { ! set_difference( X, singleton( Y ) ) = X, !
% 0.72/1.12 in( Y, X ) }.
% 0.72/1.12 (115) {G0,W9,D4,L2,V2,M2} { in( Y, X ), set_difference( X, singleton( Y )
% 0.72/1.12 ) = X }.
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Total Proof:
% 0.72/1.12
% 0.72/1.12 subsumption: (7) {G0,W3,D2,L1,V0,M1} I { ! in( skol3, skol4 ) }.
% 0.72/1.12 parent0: (111) {G0,W3,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.72/1.12 substitution0:
% 0.72/1.12 end
% 0.72/1.12 permutation0:
% 0.72/1.12 0 ==> 0
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 subsumption: (8) {G0,W9,D5,L1,V0,M1} I { ! set_difference( set_union2(
% 0.72/1.12 skol4, singleton( skol3 ) ), singleton( skol3 ) ) ==> skol4 }.
% 0.72/1.12 parent0: (112) {G0,W9,D5,L1,V0,M1} { ! set_difference( set_union2( skol4,
% 0.72/1.12 singleton( skol3 ) ), singleton( skol3 ) ) = skol4 }.
% 0.72/1.12 substitution0:
% 0.72/1.12 end
% 0.72/1.12 permutation0:
% 0.72/1.12 0 ==> 0
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 subsumption: (9) {G0,W9,D4,L1,V2,M1} I { set_difference( set_union2( X, Y )
% 0.72/1.12 , Y ) ==> set_difference( X, Y ) }.
% 0.72/1.12 parent0: (113) {G0,W9,D4,L1,V2,M1} { set_difference( set_union2( X, Y ), Y
% 0.72/1.12 ) = set_difference( X, Y ) }.
% 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 permutation0:
% 0.72/1.12 0 ==> 0
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 subsumption: (11) {G0,W9,D4,L2,V2,M2} I { in( Y, X ), set_difference( X,
% 0.72/1.12 singleton( Y ) ) ==> X }.
% 0.72/1.12 parent0: (115) {G0,W9,D4,L2,V2,M2} { in( Y, X ), set_difference( X,
% 0.72/1.12 singleton( Y ) ) = X }.
% 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 permutation0:
% 0.72/1.12 0 ==> 0
% 0.72/1.12 1 ==> 1
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 paramod: (133) {G1,W6,D4,L1,V0,M1} { ! set_difference( skol4, singleton(
% 0.72/1.12 skol3 ) ) ==> skol4 }.
% 0.72/1.12 parent0[0]: (9) {G0,W9,D4,L1,V2,M1} I { set_difference( set_union2( X, Y )
% 0.72/1.12 , Y ) ==> set_difference( X, Y ) }.
% 0.72/1.12 parent1[0; 2]: (8) {G0,W9,D5,L1,V0,M1} I { ! set_difference( set_union2(
% 0.72/1.12 skol4, singleton( skol3 ) ), singleton( skol3 ) ) ==> skol4 }.
% 0.72/1.12 substitution0:
% 0.72/1.12 X := skol4
% 0.72/1.12 Y := singleton( skol3 )
% 0.72/1.12 end
% 0.72/1.12 substitution1:
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 subsumption: (31) {G1,W6,D4,L1,V0,M1} S(8);d(9) { ! set_difference( skol4,
% 0.72/1.12 singleton( skol3 ) ) ==> skol4 }.
% 0.72/1.12 parent0: (133) {G1,W6,D4,L1,V0,M1} { ! set_difference( skol4, singleton(
% 0.72/1.12 skol3 ) ) ==> skol4 }.
% 0.72/1.12 substitution0:
% 0.72/1.12 end
% 0.72/1.12 permutation0:
% 0.72/1.12 0 ==> 0
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 eqswap: (135) {G0,W9,D4,L2,V2,M2} { X ==> set_difference( X, singleton( Y
% 0.72/1.12 ) ), in( Y, X ) }.
% 0.72/1.12 parent0[1]: (11) {G0,W9,D4,L2,V2,M2} I { in( Y, X ), set_difference( X,
% 0.72/1.12 singleton( Y ) ) ==> X }.
% 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: (136) {G1,W6,D4,L1,V0,M1} { ! skol4 ==> set_difference( skol4,
% 0.72/1.12 singleton( skol3 ) ) }.
% 0.72/1.12 parent0[0]: (31) {G1,W6,D4,L1,V0,M1} S(8);d(9) { ! set_difference( skol4,
% 0.72/1.12 singleton( skol3 ) ) ==> skol4 }.
% 0.72/1.12 substitution0:
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 resolution: (137) {G1,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.72/1.12 parent0[0]: (136) {G1,W6,D4,L1,V0,M1} { ! skol4 ==> set_difference( skol4
% 0.72/1.12 , singleton( skol3 ) ) }.
% 0.72/1.12 parent1[0]: (135) {G0,W9,D4,L2,V2,M2} { X ==> set_difference( X, singleton
% 0.72/1.12 ( Y ) ), in( Y, X ) }.
% 0.72/1.12 substitution0:
% 0.72/1.12 end
% 0.72/1.12 substitution1:
% 0.72/1.12 X := skol4
% 0.72/1.12 Y := skol3
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 resolution: (138) {G1,W0,D0,L0,V0,M0} { }.
% 0.72/1.12 parent0[0]: (7) {G0,W3,D2,L1,V0,M1} I { ! in( skol3, skol4 ) }.
% 0.72/1.12 parent1[0]: (137) {G1,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.72/1.12 substitution0:
% 0.72/1.12 end
% 0.72/1.12 substitution1:
% 0.72/1.12 end
% 0.72/1.12
% 0.72/1.12 subsumption: (102) {G2,W0,D0,L0,V0,M0} R(11,31);r(7) { }.
% 0.72/1.12 parent0: (138) {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: 1327
% 0.72/1.12 space for clauses: 6923
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 clauses generated: 286
% 0.72/1.12 clauses kept: 103
% 0.72/1.12 clauses selected: 30
% 0.72/1.12 clauses deleted: 1
% 0.72/1.12 clauses inuse deleted: 0
% 0.72/1.12
% 0.72/1.12 subsentry: 517
% 0.72/1.12 literals s-matched: 470
% 0.72/1.12 literals matched: 470
% 0.72/1.12 full subsumption: 0
% 0.72/1.12
% 0.72/1.12 checksum: 1199011659
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Bliksem ended
%------------------------------------------------------------------------------