TSTP Solution File: SET912+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n024.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:18 EDT 2022
% Result : Theorem 0.67s 1.06s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.10 % Command : bliksem %s
% 0.09/0.30 % Computer : n024.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % DateTime : Sun Jul 10 05:03:43 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.67/1.06 *** allocated 10000 integers for termspace/termends
% 0.67/1.06 *** allocated 10000 integers for clauses
% 0.67/1.06 *** allocated 10000 integers for justifications
% 0.67/1.06 Bliksem 1.12
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Automatic Strategy Selection
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Clauses:
% 0.67/1.06
% 0.67/1.06 { ! in( X, Y ), ! in( Y, X ) }.
% 0.67/1.06 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.67/1.06 { set_intersection2( X, Y ) = set_intersection2( Y, X ) }.
% 0.67/1.06 { set_intersection2( X, X ) = X }.
% 0.67/1.06 { empty( skol1 ) }.
% 0.67/1.06 { ! empty( skol2 ) }.
% 0.67/1.06 { subset( X, X ) }.
% 0.67/1.06 { ! subset( X, Y ), set_intersection2( X, Y ) = X }.
% 0.67/1.06 { ! subset( unordered_pair( X, Y ), Z ), in( X, Z ) }.
% 0.67/1.06 { ! subset( unordered_pair( X, Y ), Z ), in( Y, Z ) }.
% 0.67/1.06 { ! in( X, Z ), ! in( Y, Z ), subset( unordered_pair( X, Y ), Z ) }.
% 0.67/1.06 { in( skol3, skol4 ) }.
% 0.67/1.06 { in( skol5, skol4 ) }.
% 0.67/1.06 { ! set_intersection2( unordered_pair( skol3, skol5 ), skol4 ) =
% 0.67/1.06 unordered_pair( skol3, skol5 ) }.
% 0.67/1.06
% 0.67/1.06 percentage equality = 0.250000, percentage horn = 1.000000
% 0.67/1.06 This is a problem with some equality
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Options Used:
% 0.67/1.06
% 0.67/1.06 useres = 1
% 0.67/1.06 useparamod = 1
% 0.67/1.06 useeqrefl = 1
% 0.67/1.06 useeqfact = 1
% 0.67/1.06 usefactor = 1
% 0.67/1.06 usesimpsplitting = 0
% 0.67/1.06 usesimpdemod = 5
% 0.67/1.06 usesimpres = 3
% 0.67/1.06
% 0.67/1.06 resimpinuse = 1000
% 0.67/1.06 resimpclauses = 20000
% 0.67/1.06 substype = eqrewr
% 0.67/1.06 backwardsubs = 1
% 0.67/1.06 selectoldest = 5
% 0.67/1.06
% 0.67/1.06 litorderings [0] = split
% 0.67/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.67/1.06
% 0.67/1.06 termordering = kbo
% 0.67/1.06
% 0.67/1.06 litapriori = 0
% 0.67/1.06 termapriori = 1
% 0.67/1.06 litaposteriori = 0
% 0.67/1.06 termaposteriori = 0
% 0.67/1.06 demodaposteriori = 0
% 0.67/1.06 ordereqreflfact = 0
% 0.67/1.06
% 0.67/1.06 litselect = negord
% 0.67/1.06
% 0.67/1.06 maxweight = 15
% 0.67/1.06 maxdepth = 30000
% 0.67/1.06 maxlength = 115
% 0.67/1.06 maxnrvars = 195
% 0.67/1.06 excuselevel = 1
% 0.67/1.06 increasemaxweight = 1
% 0.67/1.06
% 0.67/1.06 maxselected = 10000000
% 0.67/1.06 maxnrclauses = 10000000
% 0.67/1.06
% 0.67/1.06 showgenerated = 0
% 0.67/1.06 showkept = 0
% 0.67/1.06 showselected = 0
% 0.67/1.06 showdeleted = 0
% 0.67/1.06 showresimp = 1
% 0.67/1.06 showstatus = 2000
% 0.67/1.06
% 0.67/1.06 prologoutput = 0
% 0.67/1.06 nrgoals = 5000000
% 0.67/1.06 totalproof = 1
% 0.67/1.06
% 0.67/1.06 Symbols occurring in the translation:
% 0.67/1.06
% 0.67/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.67/1.06 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.67/1.06 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.67/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.06 in [37, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.67/1.06 unordered_pair [38, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.67/1.06 set_intersection2 [39, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.67/1.06 empty [40, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.67/1.06 subset [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.67/1.06 skol1 [43, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.67/1.06 skol2 [44, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.67/1.06 skol3 [45, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.67/1.06 skol4 [46, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.67/1.06 skol5 [47, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Starting Search:
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Bliksems!, er is een bewijs:
% 0.67/1.06 % SZS status Theorem
% 0.67/1.06 % SZS output start Refutation
% 0.67/1.06
% 0.67/1.06 (7) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_intersection2( X, Y ) ==>
% 0.67/1.06 X }.
% 0.67/1.06 (10) {G0,W11,D3,L3,V3,M3} I { ! in( X, Z ), ! in( Y, Z ), subset(
% 0.67/1.06 unordered_pair( X, Y ), Z ) }.
% 0.67/1.06 (11) {G0,W3,D2,L1,V0,M1} I { in( skol3, skol4 ) }.
% 0.67/1.06 (12) {G0,W3,D2,L1,V0,M1} I { in( skol5, skol4 ) }.
% 0.67/1.06 (13) {G0,W9,D4,L1,V0,M1} I { ! set_intersection2( unordered_pair( skol3,
% 0.67/1.06 skol5 ), skol4 ) ==> unordered_pair( skol3, skol5 ) }.
% 0.67/1.06 (49) {G1,W5,D3,L1,V0,M1} R(13,7) { ! subset( unordered_pair( skol3, skol5 )
% 0.67/1.06 , skol4 ) }.
% 0.67/1.06 (52) {G2,W3,D2,L1,V0,M1} R(49,10);r(11) { ! in( skol5, skol4 ) }.
% 0.67/1.06 (54) {G3,W0,D0,L0,V0,M0} S(52);r(12) { }.
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 % SZS output end Refutation
% 0.67/1.06 found a proof!
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Unprocessed initial clauses:
% 0.67/1.06
% 0.67/1.06 (56) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.67/1.06 (57) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.67/1.06 }.
% 0.67/1.06 (58) {G0,W7,D3,L1,V2,M1} { set_intersection2( X, Y ) = set_intersection2(
% 0.67/1.06 Y, X ) }.
% 0.67/1.06 (59) {G0,W5,D3,L1,V1,M1} { set_intersection2( X, X ) = X }.
% 0.67/1.06 (60) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.67/1.06 (61) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.67/1.06 (62) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.67/1.06 (63) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), set_intersection2( X, Y ) = X
% 0.67/1.06 }.
% 0.67/1.06 (64) {G0,W8,D3,L2,V3,M2} { ! subset( unordered_pair( X, Y ), Z ), in( X, Z
% 0.67/1.06 ) }.
% 0.67/1.06 (65) {G0,W8,D3,L2,V3,M2} { ! subset( unordered_pair( X, Y ), Z ), in( Y, Z
% 0.67/1.06 ) }.
% 0.67/1.06 (66) {G0,W11,D3,L3,V3,M3} { ! in( X, Z ), ! in( Y, Z ), subset(
% 0.67/1.06 unordered_pair( X, Y ), Z ) }.
% 0.67/1.06 (67) {G0,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.67/1.06 (68) {G0,W3,D2,L1,V0,M1} { in( skol5, skol4 ) }.
% 0.67/1.06 (69) {G0,W9,D4,L1,V0,M1} { ! set_intersection2( unordered_pair( skol3,
% 0.67/1.06 skol5 ), skol4 ) = unordered_pair( skol3, skol5 ) }.
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Total Proof:
% 0.67/1.06
% 0.67/1.06 subsumption: (7) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ),
% 0.67/1.06 set_intersection2( X, Y ) ==> X }.
% 0.67/1.06 parent0: (63) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), set_intersection2( X
% 0.67/1.06 , Y ) = X }.
% 0.67/1.06 substitution0:
% 0.67/1.06 X := X
% 0.67/1.06 Y := Y
% 0.67/1.06 end
% 0.67/1.06 permutation0:
% 0.67/1.06 0 ==> 0
% 0.67/1.06 1 ==> 1
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 subsumption: (10) {G0,W11,D3,L3,V3,M3} I { ! in( X, Z ), ! in( Y, Z ),
% 0.67/1.06 subset( unordered_pair( X, Y ), Z ) }.
% 0.67/1.06 parent0: (66) {G0,W11,D3,L3,V3,M3} { ! in( X, Z ), ! in( Y, Z ), subset(
% 0.67/1.06 unordered_pair( X, Y ), Z ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 X := X
% 0.67/1.06 Y := Y
% 0.67/1.06 Z := Z
% 0.67/1.06 end
% 0.67/1.06 permutation0:
% 0.67/1.06 0 ==> 0
% 0.67/1.06 1 ==> 1
% 0.67/1.06 2 ==> 2
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 subsumption: (11) {G0,W3,D2,L1,V0,M1} I { in( skol3, skol4 ) }.
% 0.67/1.06 parent0: (67) {G0,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06 permutation0:
% 0.67/1.06 0 ==> 0
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 subsumption: (12) {G0,W3,D2,L1,V0,M1} I { in( skol5, skol4 ) }.
% 0.67/1.06 parent0: (68) {G0,W3,D2,L1,V0,M1} { in( skol5, skol4 ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06 permutation0:
% 0.67/1.06 0 ==> 0
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 subsumption: (13) {G0,W9,D4,L1,V0,M1} I { ! set_intersection2(
% 0.67/1.06 unordered_pair( skol3, skol5 ), skol4 ) ==> unordered_pair( skol3, skol5
% 0.67/1.06 ) }.
% 0.67/1.06 parent0: (69) {G0,W9,D4,L1,V0,M1} { ! set_intersection2( unordered_pair(
% 0.67/1.06 skol3, skol5 ), skol4 ) = unordered_pair( skol3, skol5 ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06 permutation0:
% 0.67/1.06 0 ==> 0
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 eqswap: (90) {G0,W9,D4,L1,V0,M1} { ! unordered_pair( skol3, skol5 ) ==>
% 0.67/1.06 set_intersection2( unordered_pair( skol3, skol5 ), skol4 ) }.
% 0.67/1.06 parent0[0]: (13) {G0,W9,D4,L1,V0,M1} I { ! set_intersection2(
% 0.67/1.06 unordered_pair( skol3, skol5 ), skol4 ) ==> unordered_pair( skol3, skol5
% 0.67/1.06 ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 eqswap: (91) {G0,W8,D3,L2,V2,M2} { X ==> set_intersection2( X, Y ), !
% 0.67/1.06 subset( X, Y ) }.
% 0.67/1.06 parent0[1]: (7) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_intersection2
% 0.67/1.06 ( X, Y ) ==> X }.
% 0.67/1.06 substitution0:
% 0.67/1.06 X := X
% 0.67/1.06 Y := Y
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 resolution: (92) {G1,W5,D3,L1,V0,M1} { ! subset( unordered_pair( skol3,
% 0.67/1.06 skol5 ), skol4 ) }.
% 0.67/1.06 parent0[0]: (90) {G0,W9,D4,L1,V0,M1} { ! unordered_pair( skol3, skol5 )
% 0.67/1.06 ==> set_intersection2( unordered_pair( skol3, skol5 ), skol4 ) }.
% 0.67/1.06 parent1[0]: (91) {G0,W8,D3,L2,V2,M2} { X ==> set_intersection2( X, Y ), !
% 0.67/1.06 subset( X, Y ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06 substitution1:
% 0.67/1.06 X := unordered_pair( skol3, skol5 )
% 0.67/1.06 Y := skol4
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 subsumption: (49) {G1,W5,D3,L1,V0,M1} R(13,7) { ! subset( unordered_pair(
% 0.67/1.06 skol3, skol5 ), skol4 ) }.
% 0.67/1.06 parent0: (92) {G1,W5,D3,L1,V0,M1} { ! subset( unordered_pair( skol3, skol5
% 0.67/1.06 ), skol4 ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06 permutation0:
% 0.67/1.06 0 ==> 0
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 resolution: (93) {G1,W6,D2,L2,V0,M2} { ! in( skol3, skol4 ), ! in( skol5,
% 0.67/1.06 skol4 ) }.
% 0.67/1.06 parent0[0]: (49) {G1,W5,D3,L1,V0,M1} R(13,7) { ! subset( unordered_pair(
% 0.67/1.06 skol3, skol5 ), skol4 ) }.
% 0.67/1.06 parent1[2]: (10) {G0,W11,D3,L3,V3,M3} I { ! in( X, Z ), ! in( Y, Z ),
% 0.67/1.06 subset( unordered_pair( X, Y ), Z ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06 substitution1:
% 0.67/1.06 X := skol3
% 0.67/1.06 Y := skol5
% 0.67/1.06 Z := skol4
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 resolution: (94) {G1,W3,D2,L1,V0,M1} { ! in( skol5, skol4 ) }.
% 0.67/1.06 parent0[0]: (93) {G1,W6,D2,L2,V0,M2} { ! in( skol3, skol4 ), ! in( skol5,
% 0.67/1.06 skol4 ) }.
% 0.67/1.06 parent1[0]: (11) {G0,W3,D2,L1,V0,M1} I { in( skol3, skol4 ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06 substitution1:
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 subsumption: (52) {G2,W3,D2,L1,V0,M1} R(49,10);r(11) { ! in( skol5, skol4 )
% 0.67/1.06 }.
% 0.67/1.06 parent0: (94) {G1,W3,D2,L1,V0,M1} { ! in( skol5, skol4 ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06 permutation0:
% 0.67/1.06 0 ==> 0
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 resolution: (95) {G1,W0,D0,L0,V0,M0} { }.
% 0.67/1.06 parent0[0]: (52) {G2,W3,D2,L1,V0,M1} R(49,10);r(11) { ! in( skol5, skol4 )
% 0.67/1.06 }.
% 0.67/1.06 parent1[0]: (12) {G0,W3,D2,L1,V0,M1} I { in( skol5, skol4 ) }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06 substitution1:
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 subsumption: (54) {G3,W0,D0,L0,V0,M0} S(52);r(12) { }.
% 0.67/1.06 parent0: (95) {G1,W0,D0,L0,V0,M0} { }.
% 0.67/1.06 substitution0:
% 0.67/1.06 end
% 0.67/1.06 permutation0:
% 0.67/1.06 end
% 0.67/1.06
% 0.67/1.06 Proof check complete!
% 0.67/1.06
% 0.67/1.06 Memory use:
% 0.67/1.06
% 0.67/1.06 space for terms: 686
% 0.67/1.06 space for clauses: 3285
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 clauses generated: 149
% 0.67/1.06 clauses kept: 55
% 0.67/1.06 clauses selected: 32
% 0.67/1.06 clauses deleted: 1
% 0.67/1.06 clauses inuse deleted: 0
% 0.67/1.06
% 0.67/1.06 subsentry: 247
% 0.67/1.06 literals s-matched: 180
% 0.67/1.06 literals matched: 180
% 0.67/1.06 full subsumption: 25
% 0.67/1.06
% 0.67/1.06 checksum: 1256832820
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Bliksem ended
%------------------------------------------------------------------------------