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