%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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 : Tue Jul 19 07:10:58 EDT 2022
% Result : Theorem 0.46s 1.10s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n010.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 : Mon Jun 20 02:36:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.10 *** allocated 10000 integers for termspace/termends
% 0.46/1.10 *** allocated 10000 integers for clauses
% 0.46/1.10 *** allocated 10000 integers for justifications
% 0.46/1.10 Bliksem 1.12
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Automatic Strategy Selection
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Clauses:
% 0.46/1.10
% 0.46/1.10 { ! in( X, Y ), ! in( Y, X ) }.
% 0.46/1.10 { set_union2( X, Y ) = set_union2( Y, X ) }.
% 0.46/1.10 { && }.
% 0.46/1.10 { && }.
% 0.46/1.10 { set_union2( X, X ) = X }.
% 0.46/1.10 { in( skol1, skol2 ) }.
% 0.46/1.10 { ! set_union2( singleton( skol1 ), skol2 ) = skol2 }.
% 0.46/1.10 { ! subset( singleton( X ), Y ), in( X, Y ) }.
% 0.46/1.10 { ! in( X, Y ), subset( singleton( X ), Y ) }.
% 0.46/1.10 { subset( X, X ) }.
% 0.46/1.10 { ! subset( X, Y ), set_union2( X, Y ) = Y }.
% 0.46/1.10
% 0.46/1.10 percentage equality = 0.285714, percentage horn = 1.000000
% 0.46/1.10 This is a problem with some equality
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Options Used:
% 0.46/1.10
% 0.46/1.10 useres = 1
% 0.46/1.10 useparamod = 1
% 0.46/1.10 useeqrefl = 1
% 0.46/1.10 useeqfact = 1
% 0.46/1.10 usefactor = 1
% 0.46/1.10 usesimpsplitting = 0
% 0.46/1.10 usesimpdemod = 5
% 0.46/1.10 usesimpres = 3
% 0.46/1.10
% 0.46/1.10 resimpinuse = 1000
% 0.46/1.10 resimpclauses = 20000
% 0.46/1.10 substype = eqrewr
% 0.46/1.10 backwardsubs = 1
% 0.46/1.10 selectoldest = 5
% 0.46/1.10
% 0.46/1.10 litorderings [0] = split
% 0.46/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.46/1.10
% 0.46/1.10 termordering = kbo
% 0.46/1.10
% 0.46/1.10 litapriori = 0
% 0.46/1.10 termapriori = 1
% 0.46/1.10 litaposteriori = 0
% 0.46/1.10 termaposteriori = 0
% 0.46/1.10 demodaposteriori = 0
% 0.46/1.10 ordereqreflfact = 0
% 0.46/1.10
% 0.46/1.10 litselect = negord
% 0.46/1.10
% 0.46/1.10 maxweight = 15
% 0.46/1.10 maxdepth = 30000
% 0.46/1.10 maxlength = 115
% 0.46/1.10 maxnrvars = 195
% 0.46/1.10 excuselevel = 1
% 0.46/1.10 increasemaxweight = 1
% 0.46/1.10
% 0.46/1.10 maxselected = 10000000
% 0.46/1.10 maxnrclauses = 10000000
% 0.46/1.10
% 0.46/1.10 showgenerated = 0
% 0.46/1.10 showkept = 0
% 0.46/1.10 showselected = 0
% 0.46/1.10 showdeleted = 0
% 0.46/1.10 showresimp = 1
% 0.46/1.10 showstatus = 2000
% 0.46/1.10
% 0.46/1.10 prologoutput = 0
% 0.46/1.10 nrgoals = 5000000
% 0.46/1.10 totalproof = 1
% 0.46/1.10
% 0.46/1.10 Symbols occurring in the translation:
% 0.46/1.10
% 0.46/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/1.10 . [1, 2] (w:1, o:16, a:1, s:1, b:0),
% 0.46/1.10 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.46/1.10 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.46/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.10 in [37, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.46/1.10 set_union2 [38, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.46/1.10 singleton [39, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.46/1.10 subset [40, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.46/1.10 skol1 [41, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.46/1.10 skol2 [42, 0] (w:1, o:9, a:1, s:1, b:1).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Starting Search:
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Bliksems!, er is een bewijs:
% 0.46/1.10 % SZS status Theorem
% 0.46/1.10 % SZS output start Refutation
% 0.46/1.10
% 0.46/1.10 (4) {G0,W3,D2,L1,V0,M1} I { in( skol1, skol2 ) }.
% 0.46/1.10 (5) {G0,W6,D4,L1,V0,M1} I { ! set_union2( singleton( skol1 ), skol2 ) ==>
% 0.46/1.10 skol2 }.
% 0.46/1.10 (7) {G0,W7,D3,L2,V2,M2} I { ! in( X, Y ), subset( singleton( X ), Y ) }.
% 0.46/1.10 (9) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_union2( X, Y ) ==> Y }.
% 0.46/1.10 (19) {G1,W4,D3,L1,V0,M1} R(7,4) { subset( singleton( skol1 ), skol2 ) }.
% 0.46/1.10 (21) {G2,W0,D0,L0,V0,M0} R(9,19);r(5) { }.
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 % SZS output end Refutation
% 0.46/1.10 found a proof!
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Unprocessed initial clauses:
% 0.46/1.10
% 0.46/1.10 (23) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.46/1.10 (24) {G0,W7,D3,L1,V2,M1} { set_union2( X, Y ) = set_union2( Y, X ) }.
% 0.46/1.10 (25) {G0,W1,D1,L1,V0,M1} { && }.
% 0.46/1.10 (26) {G0,W1,D1,L1,V0,M1} { && }.
% 0.46/1.10 (27) {G0,W5,D3,L1,V1,M1} { set_union2( X, X ) = X }.
% 0.46/1.10 (28) {G0,W3,D2,L1,V0,M1} { in( skol1, skol2 ) }.
% 0.46/1.10 (29) {G0,W6,D4,L1,V0,M1} { ! set_union2( singleton( skol1 ), skol2 ) =
% 0.46/1.10 skol2 }.
% 0.46/1.10 (30) {G0,W7,D3,L2,V2,M2} { ! subset( singleton( X ), Y ), in( X, Y ) }.
% 0.46/1.10 (31) {G0,W7,D3,L2,V2,M2} { ! in( X, Y ), subset( singleton( X ), Y ) }.
% 0.46/1.10 (32) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.46/1.10 (33) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), set_union2( X, Y ) = Y }.
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Total Proof:
% 0.46/1.10
% 0.46/1.10 subsumption: (4) {G0,W3,D2,L1,V0,M1} I { in( skol1, skol2 ) }.
% 0.46/1.10 parent0: (28) {G0,W3,D2,L1,V0,M1} { in( skol1, skol2 ) }.
% 0.46/1.10 substitution0:
% 0.46/1.10 end
% 0.46/1.10 permutation0:
% 0.46/1.10 0 ==> 0
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 subsumption: (5) {G0,W6,D4,L1,V0,M1} I { ! set_union2( singleton( skol1 ),
% 0.46/1.10 skol2 ) ==> skol2 }.
% 0.46/1.10 parent0: (29) {G0,W6,D4,L1,V0,M1} { ! set_union2( singleton( skol1 ),
% 0.46/1.10 skol2 ) = skol2 }.
% 0.46/1.10 substitution0:
% 0.46/1.10 end
% 0.46/1.10 permutation0:
% 0.46/1.10 0 ==> 0
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 subsumption: (7) {G0,W7,D3,L2,V2,M2} I { ! in( X, Y ), subset( singleton( X
% 0.46/1.10 ), Y ) }.
% 0.46/1.10 parent0: (31) {G0,W7,D3,L2,V2,M2} { ! in( X, Y ), subset( singleton( X ),
% 0.46/1.10 Y ) }.
% 0.46/1.10 substitution0:
% 0.46/1.10 X := X
% 0.46/1.10 Y := Y
% 0.46/1.10 end
% 0.46/1.10 permutation0:
% 0.46/1.10 0 ==> 0
% 0.46/1.10 1 ==> 1
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 subsumption: (9) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_union2( X, Y
% 0.46/1.10 ) ==> Y }.
% 0.46/1.10 parent0: (33) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), set_union2( X, Y ) =
% 0.46/1.10 Y }.
% 0.46/1.10 substitution0:
% 0.46/1.10 X := X
% 0.46/1.10 Y := Y
% 0.46/1.10 end
% 0.46/1.10 permutation0:
% 0.46/1.10 0 ==> 0
% 0.46/1.10 1 ==> 1
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 resolution: (46) {G1,W4,D3,L1,V0,M1} { subset( singleton( skol1 ), skol2 )
% 0.46/1.10 }.
% 0.46/1.10 parent0[0]: (7) {G0,W7,D3,L2,V2,M2} I { ! in( X, Y ), subset( singleton( X
% 0.46/1.10 ), Y ) }.
% 0.46/1.10 parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { in( skol1, skol2 ) }.
% 0.46/1.10 substitution0:
% 0.46/1.10 X := skol1
% 0.46/1.10 Y := skol2
% 0.46/1.10 end
% 0.46/1.10 substitution1:
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 subsumption: (19) {G1,W4,D3,L1,V0,M1} R(7,4) { subset( singleton( skol1 ),
% 0.46/1.10 skol2 ) }.
% 0.46/1.10 parent0: (46) {G1,W4,D3,L1,V0,M1} { subset( singleton( skol1 ), skol2 )
% 0.46/1.10 }.
% 0.46/1.10 substitution0:
% 0.46/1.10 end
% 0.46/1.10 permutation0:
% 0.46/1.10 0 ==> 0
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 eqswap: (47) {G0,W8,D3,L2,V2,M2} { Y ==> set_union2( X, Y ), ! subset( X,
% 0.46/1.10 Y ) }.
% 0.46/1.10 parent0[1]: (9) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_union2( X, Y
% 0.46/1.10 ) ==> Y }.
% 0.46/1.10 substitution0:
% 0.46/1.10 X := X
% 0.46/1.10 Y := Y
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 eqswap: (48) {G0,W6,D4,L1,V0,M1} { ! skol2 ==> set_union2( singleton(
% 0.46/1.10 skol1 ), skol2 ) }.
% 0.46/1.10 parent0[0]: (5) {G0,W6,D4,L1,V0,M1} I { ! set_union2( singleton( skol1 ),
% 0.46/1.10 skol2 ) ==> skol2 }.
% 0.46/1.10 substitution0:
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 resolution: (49) {G1,W6,D4,L1,V0,M1} { skol2 ==> set_union2( singleton(
% 0.46/1.10 skol1 ), skol2 ) }.
% 0.46/1.10 parent0[1]: (47) {G0,W8,D3,L2,V2,M2} { Y ==> set_union2( X, Y ), ! subset
% 0.46/1.10 ( X, Y ) }.
% 0.46/1.10 parent1[0]: (19) {G1,W4,D3,L1,V0,M1} R(7,4) { subset( singleton( skol1 ),
% 0.46/1.10 skol2 ) }.
% 0.46/1.10 substitution0:
% 0.46/1.10 X := singleton( skol1 )
% 0.46/1.10 Y := skol2
% 0.46/1.10 end
% 0.46/1.10 substitution1:
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 resolution: (50) {G1,W0,D0,L0,V0,M0} { }.
% 0.46/1.10 parent0[0]: (48) {G0,W6,D4,L1,V0,M1} { ! skol2 ==> set_union2( singleton(
% 0.46/1.10 skol1 ), skol2 ) }.
% 0.46/1.10 parent1[0]: (49) {G1,W6,D4,L1,V0,M1} { skol2 ==> set_union2( singleton(
% 0.46/1.10 skol1 ), skol2 ) }.
% 0.46/1.10 substitution0:
% 0.46/1.10 end
% 0.46/1.10 substitution1:
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 subsumption: (21) {G2,W0,D0,L0,V0,M0} R(9,19);r(5) { }.
% 0.46/1.10 parent0: (50) {G1,W0,D0,L0,V0,M0} { }.
% 0.46/1.10 substitution0:
% 0.46/1.10 end
% 0.46/1.10 permutation0:
% 0.46/1.10 end
% 0.46/1.10
% 0.46/1.10 Proof check complete!
% 0.46/1.10
% 0.46/1.10 Memory use:
% 0.46/1.10
% 0.46/1.10 space for terms: 290
% 0.46/1.10 space for clauses: 1287
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 clauses generated: 62
% 0.46/1.10 clauses kept: 22
% 0.46/1.10 clauses selected: 21
% 0.46/1.10 clauses deleted: 0
% 0.46/1.10 clauses inuse deleted: 0
% 0.46/1.10
% 0.46/1.10 subsentry: 109
% 0.46/1.10 literals s-matched: 62
% 0.46/1.10 literals matched: 62
% 0.46/1.10 full subsumption: 1
% 0.46/1.10
% 0.46/1.10 checksum: -546452617
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Bliksem ended
%------------------------------------------------------------------------------