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