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