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