TSTP Solution File: SET904+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET904+1 : TPTP v8.1.0. Released v3.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:53:14 EDT 2022
% Result : Theorem 0.45s 1.11s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET904+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n013.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 07:31:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.11 *** allocated 10000 integers for termspace/termends
% 0.45/1.11 *** allocated 10000 integers for clauses
% 0.45/1.11 *** allocated 10000 integers for justifications
% 0.45/1.11 Bliksem 1.12
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Automatic Strategy Selection
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Clauses:
% 0.45/1.11
% 0.45/1.11 { empty( X ), ! empty( set_union2( X, Y ) ) }.
% 0.45/1.11 { empty( X ), ! empty( set_union2( Y, X ) ) }.
% 0.45/1.11 { set_union2( X, Y ) = set_union2( Y, X ) }.
% 0.45/1.11 { set_union2( X, X ) = X }.
% 0.45/1.11 { subset( X, X ) }.
% 0.45/1.11 { ! in( X, Y ), ! in( Y, X ) }.
% 0.45/1.11 { empty( skol1 ) }.
% 0.45/1.11 { ! empty( skol2 ) }.
% 0.45/1.11 { subset( set_union2( singleton( skol3 ), skol4 ), skol4 ) }.
% 0.45/1.11 { ! in( skol3, skol4 ) }.
% 0.45/1.11 { ! subset( set_union2( singleton( X ), Y ), Y ), in( X, Y ) }.
% 0.45/1.11
% 0.45/1.11 percentage equality = 0.133333, percentage horn = 1.000000
% 0.45/1.11 This is a problem with some equality
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Options Used:
% 0.45/1.11
% 0.45/1.11 useres = 1
% 0.45/1.11 useparamod = 1
% 0.45/1.11 useeqrefl = 1
% 0.45/1.11 useeqfact = 1
% 0.45/1.11 usefactor = 1
% 0.45/1.11 usesimpsplitting = 0
% 0.45/1.11 usesimpdemod = 5
% 0.45/1.11 usesimpres = 3
% 0.45/1.11
% 0.45/1.11 resimpinuse = 1000
% 0.45/1.11 resimpclauses = 20000
% 0.45/1.11 substype = eqrewr
% 0.45/1.11 backwardsubs = 1
% 0.45/1.11 selectoldest = 5
% 0.45/1.11
% 0.45/1.11 litorderings [0] = split
% 0.45/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.45/1.11
% 0.45/1.11 termordering = kbo
% 0.45/1.11
% 0.45/1.11 litapriori = 0
% 0.45/1.11 termapriori = 1
% 0.45/1.11 litaposteriori = 0
% 0.45/1.11 termaposteriori = 0
% 0.45/1.11 demodaposteriori = 0
% 0.45/1.11 ordereqreflfact = 0
% 0.45/1.11
% 0.45/1.11 litselect = negord
% 0.45/1.11
% 0.45/1.11 maxweight = 15
% 0.45/1.11 maxdepth = 30000
% 0.45/1.11 maxlength = 115
% 0.45/1.11 maxnrvars = 195
% 0.45/1.11 excuselevel = 1
% 0.45/1.11 increasemaxweight = 1
% 0.45/1.11
% 0.45/1.11 maxselected = 10000000
% 0.45/1.11 maxnrclauses = 10000000
% 0.45/1.11
% 0.45/1.11 showgenerated = 0
% 0.45/1.11 showkept = 0
% 0.45/1.11 showselected = 0
% 0.45/1.11 showdeleted = 0
% 0.45/1.11 showresimp = 1
% 0.45/1.11 showstatus = 2000
% 0.45/1.11
% 0.45/1.11 prologoutput = 0
% 0.45/1.11 nrgoals = 5000000
% 0.45/1.11 totalproof = 1
% 0.45/1.11
% 0.45/1.11 Symbols occurring in the translation:
% 0.45/1.11
% 0.45/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.11 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.45/1.11 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.45/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.11 empty [37, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.45/1.11 set_union2 [38, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.45/1.11 subset [39, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.45/1.11 in [40, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.45/1.11 singleton [41, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.45/1.11 skol1 [42, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.45/1.11 skol2 [43, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.45/1.11 skol3 [44, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.45/1.11 skol4 [45, 0] (w:1, o:11, a:1, s:1, b:1).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Starting Search:
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Bliksems!, er is een bewijs:
% 0.45/1.11 % SZS status Theorem
% 0.45/1.11 % SZS output start Refutation
% 0.45/1.11
% 0.45/1.11 (8) {G0,W6,D4,L1,V0,M1} I { subset( set_union2( singleton( skol3 ), skol4 )
% 0.45/1.11 , skol4 ) }.
% 0.45/1.11 (9) {G0,W3,D2,L1,V0,M1} I { ! in( skol3, skol4 ) }.
% 0.45/1.11 (10) {G0,W9,D4,L2,V2,M2} I { ! subset( set_union2( singleton( X ), Y ), Y )
% 0.45/1.11 , in( X, Y ) }.
% 0.45/1.11 (49) {G1,W0,D0,L0,V0,M0} R(10,8);r(9) { }.
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 % SZS output end Refutation
% 0.45/1.11 found a proof!
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Unprocessed initial clauses:
% 0.45/1.11
% 0.45/1.11 (51) {G0,W6,D3,L2,V2,M2} { empty( X ), ! empty( set_union2( X, Y ) ) }.
% 0.45/1.11 (52) {G0,W6,D3,L2,V2,M2} { empty( X ), ! empty( set_union2( Y, X ) ) }.
% 0.45/1.11 (53) {G0,W7,D3,L1,V2,M1} { set_union2( X, Y ) = set_union2( Y, X ) }.
% 0.45/1.11 (54) {G0,W5,D3,L1,V1,M1} { set_union2( X, X ) = X }.
% 0.45/1.11 (55) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.45/1.11 (56) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.45/1.11 (57) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.45/1.11 (58) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.45/1.11 (59) {G0,W6,D4,L1,V0,M1} { subset( set_union2( singleton( skol3 ), skol4 )
% 0.45/1.11 , skol4 ) }.
% 0.45/1.11 (60) {G0,W3,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.45/1.11 (61) {G0,W9,D4,L2,V2,M2} { ! subset( set_union2( singleton( X ), Y ), Y )
% 0.45/1.11 , in( X, Y ) }.
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Total Proof:
% 0.45/1.11
% 0.45/1.11 subsumption: (8) {G0,W6,D4,L1,V0,M1} I { subset( set_union2( singleton(
% 0.45/1.11 skol3 ), skol4 ), skol4 ) }.
% 0.45/1.11 parent0: (59) {G0,W6,D4,L1,V0,M1} { subset( set_union2( singleton( skol3 )
% 0.45/1.11 , skol4 ), skol4 ) }.
% 0.45/1.11 substitution0:
% 0.45/1.11 end
% 0.45/1.11 permutation0:
% 0.45/1.11 0 ==> 0
% 0.45/1.11 end
% 0.45/1.11
% 0.45/1.11 subsumption: (9) {G0,W3,D2,L1,V0,M1} I { ! in( skol3, skol4 ) }.
% 0.45/1.11 parent0: (60) {G0,W3,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.45/1.11 substitution0:
% 0.45/1.11 end
% 0.45/1.11 permutation0:
% 0.45/1.11 0 ==> 0
% 0.45/1.11 end
% 0.45/1.11
% 0.45/1.11 subsumption: (10) {G0,W9,D4,L2,V2,M2} I { ! subset( set_union2( singleton(
% 0.45/1.11 X ), Y ), Y ), in( X, Y ) }.
% 0.45/1.11 parent0: (61) {G0,W9,D4,L2,V2,M2} { ! subset( set_union2( singleton( X ),
% 0.45/1.11 Y ), Y ), in( X, Y ) }.
% 0.45/1.11 substitution0:
% 0.45/1.11 X := X
% 0.45/1.11 Y := Y
% 0.45/1.11 end
% 0.45/1.11 permutation0:
% 0.45/1.11 0 ==> 0
% 0.45/1.11 1 ==> 1
% 0.45/1.11 end
% 0.45/1.11
% 0.45/1.11 resolution: (68) {G1,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.45/1.11 parent0[0]: (10) {G0,W9,D4,L2,V2,M2} I { ! subset( set_union2( singleton( X
% 0.45/1.11 ), Y ), Y ), in( X, Y ) }.
% 0.45/1.11 parent1[0]: (8) {G0,W6,D4,L1,V0,M1} I { subset( set_union2( singleton(
% 0.45/1.11 skol3 ), skol4 ), skol4 ) }.
% 0.45/1.11 substitution0:
% 0.45/1.11 X := skol3
% 0.45/1.11 Y := skol4
% 0.45/1.11 end
% 0.45/1.11 substitution1:
% 0.45/1.11 end
% 0.45/1.11
% 0.45/1.11 resolution: (69) {G1,W0,D0,L0,V0,M0} { }.
% 0.45/1.11 parent0[0]: (9) {G0,W3,D2,L1,V0,M1} I { ! in( skol3, skol4 ) }.
% 0.45/1.11 parent1[0]: (68) {G1,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.45/1.11 substitution0:
% 0.45/1.11 end
% 0.45/1.11 substitution1:
% 0.45/1.11 end
% 0.45/1.11
% 0.45/1.11 subsumption: (49) {G1,W0,D0,L0,V0,M0} R(10,8);r(9) { }.
% 0.45/1.11 parent0: (69) {G1,W0,D0,L0,V0,M0} { }.
% 0.45/1.11 substitution0:
% 0.45/1.11 end
% 0.45/1.11 permutation0:
% 0.45/1.11 end
% 0.45/1.11
% 0.45/1.11 Proof check complete!
% 0.45/1.11
% 0.45/1.11 Memory use:
% 0.45/1.11
% 0.45/1.11 space for terms: 616
% 0.45/1.11 space for clauses: 2954
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 clauses generated: 127
% 0.45/1.11 clauses kept: 50
% 0.45/1.11 clauses selected: 21
% 0.45/1.11 clauses deleted: 0
% 0.45/1.11 clauses inuse deleted: 0
% 0.45/1.11
% 0.45/1.11 subsentry: 201
% 0.45/1.11 literals s-matched: 188
% 0.45/1.11 literals matched: 188
% 0.45/1.11 full subsumption: 0
% 0.45/1.11
% 0.45/1.11 checksum: 772327513
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Bliksem ended
%------------------------------------------------------------------------------