TSTP Solution File: SET900+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET900+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n018.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:13 EDT 2022
% Result : Theorem 0.45s 1.06s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET900+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n018.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 00:56:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.06 *** allocated 10000 integers for termspace/termends
% 0.45/1.06 *** allocated 10000 integers for clauses
% 0.45/1.06 *** allocated 10000 integers for justifications
% 0.45/1.06 Bliksem 1.12
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06 Automatic Strategy Selection
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06 Clauses:
% 0.45/1.06
% 0.45/1.06 { ! in( X, Y ), ! in( Y, X ) }.
% 0.45/1.06 { empty( empty_set ) }.
% 0.45/1.06 { empty( skol1 ) }.
% 0.45/1.06 { ! empty( skol2 ) }.
% 0.45/1.06 { ! skol3 = singleton( skol5 ) }.
% 0.45/1.06 { ! skol3 = empty_set }.
% 0.45/1.06 { ! in( X, skol3 ), X = skol5 }.
% 0.45/1.06 { X = singleton( Y ), X = empty_set, ! skol4( Z, Y ) = Y }.
% 0.45/1.06 { X = singleton( Y ), X = empty_set, in( skol4( X, Y ), X ) }.
% 0.45/1.06
% 0.45/1.06 percentage equality = 0.533333, percentage horn = 0.777778
% 0.45/1.06 This is a problem with some equality
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06 Options Used:
% 0.45/1.06
% 0.45/1.06 useres = 1
% 0.45/1.06 useparamod = 1
% 0.45/1.06 useeqrefl = 1
% 0.45/1.06 useeqfact = 1
% 0.45/1.06 usefactor = 1
% 0.45/1.06 usesimpsplitting = 0
% 0.45/1.06 usesimpdemod = 5
% 0.45/1.06 usesimpres = 3
% 0.45/1.06
% 0.45/1.06 resimpinuse = 1000
% 0.45/1.06 resimpclauses = 20000
% 0.45/1.06 substype = eqrewr
% 0.45/1.06 backwardsubs = 1
% 0.45/1.06 selectoldest = 5
% 0.45/1.06
% 0.45/1.06 litorderings [0] = split
% 0.45/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.45/1.06
% 0.45/1.06 termordering = kbo
% 0.45/1.06
% 0.45/1.06 litapriori = 0
% 0.45/1.06 termapriori = 1
% 0.45/1.06 litaposteriori = 0
% 0.45/1.06 termaposteriori = 0
% 0.45/1.06 demodaposteriori = 0
% 0.45/1.06 ordereqreflfact = 0
% 0.45/1.06
% 0.45/1.06 litselect = negord
% 0.45/1.06
% 0.45/1.06 maxweight = 15
% 0.45/1.06 maxdepth = 30000
% 0.45/1.06 maxlength = 115
% 0.45/1.06 maxnrvars = 195
% 0.45/1.06 excuselevel = 1
% 0.45/1.06 increasemaxweight = 1
% 0.45/1.06
% 0.45/1.06 maxselected = 10000000
% 0.45/1.06 maxnrclauses = 10000000
% 0.45/1.06
% 0.45/1.06 showgenerated = 0
% 0.45/1.06 showkept = 0
% 0.45/1.06 showselected = 0
% 0.45/1.06 showdeleted = 0
% 0.45/1.06 showresimp = 1
% 0.45/1.06 showstatus = 2000
% 0.45/1.06
% 0.45/1.06 prologoutput = 0
% 0.45/1.06 nrgoals = 5000000
% 0.45/1.06 totalproof = 1
% 0.45/1.06
% 0.45/1.06 Symbols occurring in the translation:
% 0.45/1.06
% 0.45/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.06 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.45/1.06 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.45/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.06 in [37, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.45/1.06 empty_set [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.45/1.06 empty [39, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.45/1.06 singleton [40, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.45/1.06 skol1 [42, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.45/1.06 skol2 [43, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.45/1.06 skol3 [44, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.45/1.06 skol4 [45, 2] (w:1, o:46, a:1, s:1, b:1),
% 0.45/1.06 skol5 [46, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06 Starting Search:
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06 Bliksems!, er is een bewijs:
% 0.45/1.06 % SZS status Theorem
% 0.45/1.06 % SZS output start Refutation
% 0.45/1.06
% 0.45/1.06 (4) {G0,W4,D3,L1,V0,M1} I { ! singleton( skol5 ) ==> skol3 }.
% 0.45/1.06 (5) {G0,W3,D2,L1,V0,M1} I { ! skol3 ==> empty_set }.
% 0.45/1.06 (6) {G0,W6,D2,L2,V1,M2} I { ! in( X, skol3 ), X = skol5 }.
% 0.45/1.06 (7) {G0,W12,D3,L3,V3,M3} I { X = singleton( Y ), X = empty_set, ! skol4( Z
% 0.45/1.06 , Y ) ==> Y }.
% 0.45/1.06 (8) {G0,W12,D3,L3,V2,M3} I { X = singleton( Y ), X = empty_set, in( skol4(
% 0.45/1.06 X, Y ), X ) }.
% 0.45/1.06 (41) {G1,W11,D3,L3,V2,M3} P(7,4) { ! X = skol3, X = empty_set, ! skol4( Y,
% 0.45/1.06 skol5 ) ==> skol5 }.
% 0.45/1.06 (49) {G2,W8,D3,L2,V1,M2} Q(41) { skol3 ==> empty_set, ! skol4( X, skol5 )
% 0.45/1.06 ==> skol5 }.
% 0.45/1.06 (152) {G3,W5,D3,L1,V1,M1} S(49);r(5) { ! skol4( X, skol5 ) ==> skol5 }.
% 0.45/1.06 (155) {G4,W5,D3,L1,V1,M1} P(6,152);q { ! in( skol4( X, skol5 ), skol3 ) }.
% 0.45/1.06 (156) {G5,W7,D3,L2,V0,M2} R(155,8) { singleton( skol5 ) ==> skol3, skol3
% 0.45/1.06 ==> empty_set }.
% 0.45/1.06 (160) {G6,W0,D0,L0,V0,M0} S(156);r(4);r(5) { }.
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06 % SZS output end Refutation
% 0.45/1.06 found a proof!
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06 Unprocessed initial clauses:
% 0.45/1.06
% 0.45/1.06 (162) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.45/1.06 (163) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.45/1.06 (164) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.45/1.06 (165) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.45/1.06 (166) {G0,W4,D3,L1,V0,M1} { ! skol3 = singleton( skol5 ) }.
% 0.45/1.06 (167) {G0,W3,D2,L1,V0,M1} { ! skol3 = empty_set }.
% 0.45/1.06 (168) {G0,W6,D2,L2,V1,M2} { ! in( X, skol3 ), X = skol5 }.
% 0.45/1.06 (169) {G0,W12,D3,L3,V3,M3} { X = singleton( Y ), X = empty_set, ! skol4( Z
% 0.45/1.06 , Y ) = Y }.
% 0.45/1.06 (170) {G0,W12,D3,L3,V2,M3} { X = singleton( Y ), X = empty_set, in( skol4
% 0.45/1.06 ( X, Y ), X ) }.
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06 Total Proof:
% 0.45/1.06
% 0.45/1.06 eqswap: (172) {G0,W4,D3,L1,V0,M1} { ! singleton( skol5 ) = skol3 }.
% 0.45/1.06 parent0[0]: (166) {G0,W4,D3,L1,V0,M1} { ! skol3 = singleton( skol5 ) }.
% 0.45/1.06 substitution0:
% 0.45/1.06 end
% 0.45/1.06
% 0.45/1.06 subsumption: (4) {G0,WCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------