%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET883+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:07 EDT 2022
% Result : Theorem 0.44s 1.10s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET883+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n026.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 19:47:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.10 *** allocated 10000 integers for termspace/termends
% 0.44/1.10 *** allocated 10000 integers for clauses
% 0.44/1.10 *** allocated 10000 integers for justifications
% 0.44/1.10 Bliksem 1.12
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Automatic Strategy Selection
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Clauses:
% 0.44/1.10
% 0.44/1.10 { subset( X, X ) }.
% 0.44/1.10 { empty( skol1 ) }.
% 0.44/1.10 { ! empty( skol2 ) }.
% 0.44/1.10 { subset( singleton( skol3 ), singleton( skol4 ) ) }.
% 0.44/1.10 { ! skol3 = skol4 }.
% 0.44/1.10 { ! subset( singleton( X ), singleton( Y ) ), X = Y }.
% 0.44/1.10
% 0.44/1.10 percentage equality = 0.285714, percentage horn = 1.000000
% 0.44/1.10 This is a problem with some equality
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Options Used:
% 0.44/1.10
% 0.44/1.10 useres = 1
% 0.44/1.10 useparamod = 1
% 0.44/1.10 useeqrefl = 1
% 0.44/1.10 useeqfact = 1
% 0.44/1.10 usefactor = 1
% 0.44/1.10 usesimpsplitting = 0
% 0.44/1.10 usesimpdemod = 5
% 0.44/1.10 usesimpres = 3
% 0.44/1.10
% 0.44/1.10 resimpinuse = 1000
% 0.44/1.10 resimpclauses = 20000
% 0.44/1.10 substype = eqrewr
% 0.44/1.10 backwardsubs = 1
% 0.44/1.10 selectoldest = 5
% 0.44/1.10
% 0.44/1.10 litorderings [0] = split
% 0.44/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.44/1.10
% 0.44/1.10 termordering = kbo
% 0.44/1.10
% 0.44/1.10 litapriori = 0
% 0.44/1.10 termapriori = 1
% 0.44/1.10 litaposteriori = 0
% 0.44/1.10 termaposteriori = 0
% 0.44/1.10 demodaposteriori = 0
% 0.44/1.10 ordereqreflfact = 0
% 0.44/1.10
% 0.44/1.10 litselect = negord
% 0.44/1.10
% 0.44/1.10 maxweight = 15
% 0.44/1.10 maxdepth = 30000
% 0.44/1.10 maxlength = 115
% 0.44/1.10 maxnrvars = 195
% 0.44/1.10 excuselevel = 1
% 0.44/1.10 increasemaxweight = 1
% 0.44/1.10
% 0.44/1.10 maxselected = 10000000
% 0.44/1.10 maxnrclauses = 10000000
% 0.44/1.10
% 0.44/1.10 showgenerated = 0
% 0.44/1.10 showkept = 0
% 0.44/1.10 showselected = 0
% 0.44/1.10 showdeleted = 0
% 0.44/1.10 showresimp = 1
% 0.44/1.10 showstatus = 2000
% 0.44/1.10
% 0.44/1.10 prologoutput = 0
% 0.44/1.10 nrgoals = 5000000
% 0.44/1.10 totalproof = 1
% 0.44/1.10
% 0.44/1.10 Symbols occurring in the translation:
% 0.44/1.10
% 0.44/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.10 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.44/1.10 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.44/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.10 subset [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.44/1.10 empty [38, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.44/1.10 singleton [39, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.44/1.10 skol1 [40, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.44/1.10 skol2 [41, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.44/1.10 skol3 [42, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.44/1.10 skol4 [43, 0] (w:1, o:11, a:1, s:1, b:1).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Starting Search:
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Bliksems!, er is een bewijs:
% 0.44/1.10 % SZS status Theorem
% 0.44/1.10 % SZS output start Refutation
% 0.44/1.10
% 0.44/1.10 (0) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.44/1.10 (3) {G0,W5,D3,L1,V0,M1} I { subset( singleton( skol3 ), singleton( skol4 )
% 0.44/1.10 ) }.
% 0.44/1.10 (4) {G0,W3,D2,L1,V0,M1} I { ! skol4 ==> skol3 }.
% 0.44/1.10 (5) {G0,W8,D3,L2,V2,M2} I { ! subset( singleton( X ), singleton( Y ) ), X =
% 0.44/1.10 Y }.
% 0.44/1.10 (6) {G1,W3,D2,L1,V0,M1} R(5,3) { skol4 ==> skol3 }.
% 0.44/1.10 (18) {G2,W8,D3,L2,V1,M2} P(5,4);d(6) { ! X = skol3, ! subset( singleton( X
% 0.44/1.10 ), singleton( skol3 ) ) }.
% 0.44/1.10 (23) {G3,W0,D0,L0,V0,M0} Q(18);r(0) { }.
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 % SZS output end Refutation
% 0.44/1.10 found a proof!
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Unprocessed initial clauses:
% 0.44/1.10
% 0.44/1.10 (25) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.44/1.10 (26) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.44/1.10 (27) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.44/1.10 (28) {G0,W5,D3,L1,V0,M1} { subset( singleton( skol3 ), singleton( skol4 )
% 0.44/1.10 ) }.
% 0.44/1.10 (29) {G0,W3,D2,L1,V0,M1} { ! skol3 = skol4 }.
% 0.44/1.10 (30) {G0,W8,D3,L2,V2,M2} { ! subset( singleton( X ), singleton( Y ) ), X =
% 0.44/1.10 Y }.
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Total Proof:
% 0.44/1.10
% 0.44/1.10 subsumption: (0) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.44/1.10 parent0: (25) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (3) {G0,W5,D3,L1,V0,M1} I { subset( singleton( skol3 ),
% 0.44/1.10 singleton( skol4 ) ) }.
% 0.44/1.10 parent0: (28) {G0,W5,D3,L1,V0,M1} { subset( singleton( skol3 ), singleton
% 0.44/1.10 ( skol4 ) ) }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 eqswap: (31) {G0,W3,D2,L1,V0,M1} { ! skol4 = skol3 }.
% 0.44/1.10 parent0[0]: (29) {G0,W3,D2,L1,V0,M1} { ! skol3 = skol4 }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (4) {G0,W3,D2,L1,V0,M1} I { ! skol4 ==> skol3 }.
% 0.44/1.10 parent0: (31) {G0,W3,D2,L1,V0,M1} { ! skol4 = skol3 }.
% 0.44/1.10 substitution0:
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 subsumption: (5) {G0,W8,D3,L2,V2,M2} I { ! subset( singleton( X ),
% 0.44/1.10 singleton( Y ) ), X = Y }.
% 0.44/1.10 parent0: (30) {G0,W8,D3,L2,V2,M2} { ! subset( singleton( X ), singleton( Y
% 0.44/1.10 ) ), X = Y }.
% 0.44/1.10 substitution0:
% 0.44/1.10 X := X
% 0.44/1.10 Y := Y
% 0.44/1.10 end
% 0.44/1.10 permutation0:
% 0.44/1.10 0 ==> 0
% 0.44/1.10 1 ==> 1
% 0.44/1.10 end
% 0.44/1.10
% 0.44/1.10 eqswap: (Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------