TSTP Solution File: SEU161+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU161+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n012.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:11:03 EDT 2022
% Result : Theorem 0.75s 1.14s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU161+3 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Sun Jun 19 17:17:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.75/1.14 *** allocated 10000 integers for termspace/termends
% 0.75/1.14 *** allocated 10000 integers for clauses
% 0.75/1.14 *** allocated 10000 integers for justifications
% 0.75/1.14 Bliksem 1.12
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Automatic Strategy Selection
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Clauses:
% 0.75/1.14
% 0.75/1.14 { empty( X ), ! empty( set_union2( X, Y ) ) }.
% 0.75/1.14 { empty( X ), ! empty( set_union2( Y, X ) ) }.
% 0.75/1.14 { set_union2( X, Y ) = set_union2( Y, X ) }.
% 0.75/1.14 { set_union2( X, X ) = X }.
% 0.75/1.14 { ! in( X, Y ), ! in( Y, X ) }.
% 0.75/1.14 { empty( skol1 ) }.
% 0.75/1.14 { ! empty( skol2 ) }.
% 0.75/1.14 { in( skol3, skol4 ) }.
% 0.75/1.14 { ! set_union2( singleton( skol3 ), skol4 ) = skol4 }.
% 0.75/1.14 { ! in( X, Y ), set_union2( singleton( X ), Y ) = Y }.
% 0.75/1.14
% 0.75/1.14 percentage equality = 0.285714, percentage horn = 1.000000
% 0.75/1.14 This is a problem with some equality
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Options Used:
% 0.75/1.14
% 0.75/1.14 useres = 1
% 0.75/1.14 useparamod = 1
% 0.75/1.14 useeqrefl = 1
% 0.75/1.14 useeqfact = 1
% 0.75/1.14 usefactor = 1
% 0.75/1.14 usesimpsplitting = 0
% 0.75/1.14 usesimpdemod = 5
% 0.75/1.14 usesimpres = 3
% 0.75/1.14
% 0.75/1.14 resimpinuse = 1000
% 0.75/1.14 resimpclauses = 20000
% 0.75/1.14 substype = eqrewr
% 0.75/1.14 backwardsubs = 1
% 0.75/1.14 selectoldest = 5
% 0.75/1.14
% 0.75/1.14 litorderings [0] = split
% 0.75/1.14 litorderings [1] = extend the termordering, first sorting on arguments
% 0.75/1.14
% 0.75/1.14 termordering = kbo
% 0.75/1.14
% 0.75/1.14 litapriori = 0
% 0.75/1.14 termapriori = 1
% 0.75/1.14 litaposteriori = 0
% 0.75/1.14 termaposteriori = 0
% 0.75/1.14 demodaposteriori = 0
% 0.75/1.14 ordereqreflfact = 0
% 0.75/1.14
% 0.75/1.14 litselect = negord
% 0.75/1.14
% 0.75/1.14 maxweight = 15
% 0.75/1.14 maxdepth = 30000
% 0.75/1.14 maxlength = 115
% 0.75/1.14 maxnrvars = 195
% 0.75/1.14 excuselevel = 1
% 0.75/1.14 increasemaxweight = 1
% 0.75/1.14
% 0.75/1.14 maxselected = 10000000
% 0.75/1.14 maxnrclauses = 10000000
% 0.75/1.14
% 0.75/1.14 showgenerated = 0
% 0.75/1.14 showkept = 0
% 0.75/1.14 showselected = 0
% 0.75/1.14 showdeleted = 0
% 0.75/1.14 showresimp = 1
% 0.75/1.14 showstatus = 2000
% 0.75/1.14
% 0.75/1.14 prologoutput = 0
% 0.75/1.14 nrgoals = 5000000
% 0.75/1.14 totalproof = 1
% 0.75/1.14
% 0.75/1.14 Symbols occurring in the translation:
% 0.75/1.14
% 0.75/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.75/1.14 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.75/1.14 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.75/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.14 empty [37, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.75/1.14 set_union2 [38, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.75/1.14 in [39, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.75/1.14 singleton [40, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.75/1.14 skol1 [41, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.75/1.14 skol2 [42, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.75/1.14 skol3 [43, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.75/1.14 skol4 [44, 0] (w:1, o:11, a:1, s:1, b:1).
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Starting Search:
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Bliksems!, er is een bewijs:
% 0.75/1.14 % SZS status Theorem
% 0.75/1.14 % SZS output start Refutation
% 0.75/1.14
% 0.75/1.14 (7) {G0,W3,D2,L1,V0,M1} I { in( skol3, skol4 ) }.
% 0.75/1.14 (8) {G0,W6,D4,L1,V0,M1} I { ! set_union2( singleton( skol3 ), skol4 ) ==>
% 0.75/1.14 skol4 }.
% 0.75/1.14 (9) {G0,W9,D4,L2,V2,M2} I { ! in( X, Y ), set_union2( singleton( X ), Y )
% 0.75/1.14 ==> Y }.
% 0.75/1.14 (49) {G1,W0,D0,L0,V0,M0} R(9,8);r(7) { }.
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 % SZS output end Refutation
% 0.75/1.14 found a proof!
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Unprocessed initial clauses:
% 0.75/1.14
% 0.75/1.14 (51) {G0,W6,D3,L2,V2,M2} { empty( X ), ! empty( set_union2( X, Y ) ) }.
% 0.75/1.14 (52) {G0,W6,D3,L2,V2,M2} { empty( X ), ! empty( set_union2( Y, X ) ) }.
% 0.75/1.14 (53) {G0,W7,D3,L1,V2,M1} { set_union2( X, Y ) = set_union2( Y, X ) }.
% 0.75/1.14 (54) {G0,W5,D3,L1,V1,M1} { set_union2( X, X ) = X }.
% 0.75/1.14 (55) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.75/1.14 (56) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.75/1.14 (57) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.75/1.14 (58) {G0,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.75/1.14 (59) {G0,W6,D4,L1,V0,M1} { ! set_union2( singleton( skol3 ), skol4 ) =
% 0.75/1.14 skol4 }.
% 0.75/1.14 (60) {G0,W9,D4,L2,V2,M2} { ! in( X, Y ), set_union2( singleton( X ), Y ) =
% 0.75/1.14 Y }.
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Total Proof:
% 0.75/1.14
% 0.75/1.14 subsumption: (7) {G0,W3,D2,L1,V0,M1} I { in( skol3, skol4 ) }.
% 0.75/1.14 parent0: (58) {G0,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (8) {G0,W6,D4,L1,V0,M1} I { ! set_union2( singleton( skol3 ),
% 0.75/1.14 skol4 ) ==> skol4 }.
% 0.75/1.14 parent0: (59) {G0,W6,D4,L1,V0,M1} { ! set_union2( singleton( skol3 ),
% 0.75/1.14 skol4 ) = skol4 }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (9) {G0,W9,D4,L2,V2,M2} I { ! in( X, Y ), set_union2(
% 0.75/1.14 singleton( X ), Y ) ==> Y }.
% 0.75/1.14 parent0: (60) {G0,W9,D4,L2,V2,M2} { ! in( X, Y ), set_union2( singleton( X
% 0.75/1.14 ), Y ) = Y }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := X
% 0.75/1.14 Y := Y
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 0 ==> 0
% 0.75/1.14 1 ==> 1
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 eqswap: (70) {G0,W9,D4,L2,V2,M2} { Y ==> set_union2( singleton( X ), Y ),
% 0.75/1.14 ! in( X, Y ) }.
% 0.75/1.14 parent0[1]: (9) {G0,W9,D4,L2,V2,M2} I { ! in( X, Y ), set_union2( singleton
% 0.75/1.14 ( X ), Y ) ==> Y }.
% 0.75/1.14 substitution0:
% 0.75/1.14 X := X
% 0.75/1.14 Y := Y
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 eqswap: (71) {G0,W6,D4,L1,V0,M1} { ! skol4 ==> set_union2( singleton(
% 0.75/1.14 skol3 ), skol4 ) }.
% 0.75/1.14 parent0[0]: (8) {G0,W6,D4,L1,V0,M1} I { ! set_union2( singleton( skol3 ),
% 0.75/1.14 skol4 ) ==> skol4 }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 resolution: (72) {G1,W3,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.75/1.14 parent0[0]: (71) {G0,W6,D4,L1,V0,M1} { ! skol4 ==> set_union2( singleton(
% 0.75/1.14 skol3 ), skol4 ) }.
% 0.75/1.14 parent1[0]: (70) {G0,W9,D4,L2,V2,M2} { Y ==> set_union2( singleton( X ), Y
% 0.75/1.14 ), ! in( X, Y ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 substitution1:
% 0.75/1.14 X := skol3
% 0.75/1.14 Y := skol4
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 resolution: (73) {G1,W0,D0,L0,V0,M0} { }.
% 0.75/1.14 parent0[0]: (72) {G1,W3,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.75/1.14 parent1[0]: (7) {G0,W3,D2,L1,V0,M1} I { in( skol3, skol4 ) }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 substitution1:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 subsumption: (49) {G1,W0,D0,L0,V0,M0} R(9,8);r(7) { }.
% 0.75/1.14 parent0: (73) {G1,W0,D0,L0,V0,M0} { }.
% 0.75/1.14 substitution0:
% 0.75/1.14 end
% 0.75/1.14 permutation0:
% 0.75/1.14 end
% 0.75/1.14
% 0.75/1.14 Proof check complete!
% 0.75/1.14
% 0.75/1.14 Memory use:
% 0.75/1.14
% 0.75/1.14 space for terms: 606
% 0.75/1.14 space for clauses: 2953
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 clauses generated: 128
% 0.75/1.14 clauses kept: 50
% 0.75/1.14 clauses selected: 21
% 0.75/1.14 clauses deleted: 0
% 0.75/1.14 clauses inuse deleted: 0
% 0.75/1.14
% 0.75/1.14 subsentry: 229
% 0.75/1.14 literals s-matched: 202
% 0.75/1.14 literals matched: 202
% 0.75/1.14 full subsumption: 0
% 0.75/1.14
% 0.75/1.14 checksum: 64861014
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 Bliksem ended
%------------------------------------------------------------------------------