TSTP Solution File: SET954+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET954+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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:35 EDT 2022
% Result : Theorem 0.44s 1.06s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET954+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : bliksem %s
% 0.14/0.33 % Computer : n017.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % DateTime : Sat Jul 9 16:59:32 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.44/1.06 *** allocated 10000 integers for termspace/termends
% 0.44/1.06 *** allocated 10000 integers for clauses
% 0.44/1.06 *** allocated 10000 integers for justifications
% 0.44/1.06 Bliksem 1.12
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06 Automatic Strategy Selection
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06 Clauses:
% 0.44/1.06
% 0.44/1.06 { ! in( X, Y ), ! in( Y, X ) }.
% 0.44/1.06 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.44/1.06 { ordered_pair( X, Y ) = unordered_pair( unordered_pair( X, Y ), singleton
% 0.44/1.06 ( X ) ) }.
% 0.44/1.06 { ! empty( ordered_pair( X, Y ) ) }.
% 0.44/1.06 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.44/1.06 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.44/1.06 { ! in( X, Z ), ! in( Y, T ), in( ordered_pair( X, Y ), cartesian_product2
% 0.44/1.06 ( Z, T ) ) }.
% 0.44/1.06 { empty( skol1 ) }.
% 0.44/1.06 { ! empty( skol2 ) }.
% 0.44/1.06 { in( ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }
% 0.44/1.06 .
% 0.44/1.06 { ! in( ordered_pair( skol4, skol3 ), cartesian_product2( skol6, skol5 ) )
% 0.44/1.06 }.
% 0.44/1.06
% 0.44/1.06 percentage equality = 0.125000, percentage horn = 1.000000
% 0.44/1.06 This is a problem with some equality
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06 Options Used:
% 0.44/1.06
% 0.44/1.06 useres = 1
% 0.44/1.06 useparamod = 1
% 0.44/1.06 useeqrefl = 1
% 0.44/1.06 useeqfact = 1
% 0.44/1.06 usefactor = 1
% 0.44/1.06 usesimpsplitting = 0
% 0.44/1.06 usesimpdemod = 5
% 0.44/1.06 usesimpres = 3
% 0.44/1.06
% 0.44/1.06 resimpinuse = 1000
% 0.44/1.06 resimpclauses = 20000
% 0.44/1.06 substype = eqrewr
% 0.44/1.06 backwardsubs = 1
% 0.44/1.06 selectoldest = 5
% 0.44/1.06
% 0.44/1.06 litorderings [0] = split
% 0.44/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.44/1.06
% 0.44/1.06 termordering = kbo
% 0.44/1.06
% 0.44/1.06 litapriori = 0
% 0.44/1.06 termapriori = 1
% 0.44/1.06 litaposteriori = 0
% 0.44/1.06 termaposteriori = 0
% 0.44/1.06 demodaposteriori = 0
% 0.44/1.06 ordereqreflfact = 0
% 0.44/1.06
% 0.44/1.06 litselect = negord
% 0.44/1.06
% 0.44/1.06 maxweight = 15
% 0.44/1.06 maxdepth = 30000
% 0.44/1.06 maxlength = 115
% 0.44/1.06 maxnrvars = 195
% 0.44/1.06 excuselevel = 1
% 0.44/1.06 increasemaxweight = 1
% 0.44/1.06
% 0.44/1.06 maxselected = 10000000
% 0.44/1.06 maxnrclauses = 10000000
% 0.44/1.06
% 0.44/1.06 showgenerated = 0
% 0.44/1.06 showkept = 0
% 0.44/1.06 showselected = 0
% 0.44/1.06 showdeleted = 0
% 0.44/1.06 showresimp = 1
% 0.44/1.06 showstatus = 2000
% 0.44/1.06
% 0.44/1.06 prologoutput = 0
% 0.44/1.06 nrgoals = 5000000
% 0.44/1.06 totalproof = 1
% 0.44/1.06
% 0.44/1.06 Symbols occurring in the translation:
% 0.44/1.06
% 0.44/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.06 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.44/1.06 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.44/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.06 in [37, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.44/1.06 unordered_pair [38, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.44/1.06 ordered_pair [39, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.44/1.06 singleton [40, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.44/1.06 empty [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.44/1.06 cartesian_product2 [44, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.44/1.06 skol1 [45, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.44/1.06 skol2 [46, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.44/1.06 skol3 [47, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.44/1.06 skol4 [48, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.44/1.06 skol5 [49, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.44/1.06 skol6 [50, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06 Starting Search:
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06 Bliksems!, er is een bewijs:
% 0.44/1.06 % SZS status Theorem
% 0.44/1.06 % SZS output start Refutation
% 0.44/1.06
% 0.44/1.06 (4) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ), cartesian_product2
% 0.44/1.06 ( Z, T ) ), in( X, Z ) }.
% 0.44/1.06 (5) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ), cartesian_product2
% 0.44/1.06 ( Z, T ) ), in( Y, T ) }.
% 0.44/1.06 (6) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in( ordered_pair(
% 0.44/1.06 X, Y ), cartesian_product2( Z, T ) ) }.
% 0.44/1.06 (9) {G0,W7,D3,L1,V0,M1} I { in( ordered_pair( skol3, skol4 ),
% 0.44/1.06 cartesian_product2( skol5, skol6 ) ) }.
% 0.44/1.06 (10) {G0,W7,D3,L1,V0,M1} I { ! in( ordered_pair( skol4, skol3 ),
% 0.44/1.06 cartesian_product2( skol6, skol5 ) ) }.
% 0.44/1.06 (16) {G1,W3,D2,L1,V0,M1} R(5,9) { in( skol4, skol6 ) }.
% 0.44/1.06 (34) {G1,W3,D2,L1,V0,M1} R(4,9) { in( skol3, skol5 ) }.
% 0.44/1.06 (57) {G2,W3,D2,L1,V0,M1} R(6,10);r(16) { ! in( skol3, skol5 ) }.
% 0.44/1.06 (60) {G3,W0,D0,L0,V0,M0} S(57);r(34) { }.
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06 % SZS output end Refutation
% 0.44/1.06 found a proof!
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06 Unprocessed initial clauses:
% 0.44/1.06
% 0.44/1.06 (62) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.44/1.06 (63) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.44/1.06 }.
% 0.44/1.06 (64) {G0,W10,D4,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 0.44/1.06 unordered_pair( X, Y ), singleton( X ) ) }.
% 0.44/1.06 (65) {G0,W4,D3,L1,V2,M1} { ! empty( ordered_pair( X, Y ) ) }.
% 0.44/1.06 (66) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ), cartesian_product2
% 0.44/1.06 ( Z, T ) ), in( X, Z ) }.
% 0.44/1.06 (67) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ), cartesian_product2
% 0.44/1.06 ( Z, T ) ), in( Y, T ) }.
% 0.44/1.06 (68) {G0,W13,D3,L3,V4,M3} { ! in( X, Z ), ! in( Y, T ), in( ordered_pair(
% 0.44/1.06 X, Y ), cartesian_product2( Z, T ) ) }.
% 0.44/1.06 (69) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.44/1.06 (70) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.44/1.06 (71) {G0,W7,D3,L1,V0,M1} { in( ordered_pair( skol3, skol4 ),
% 0.44/1.06 cartesian_product2( skol5, skol6 ) ) }.
% 0.44/1.06 (72) {G0,W7,D3,L1,V0,M1} { ! in( ordered_pair( skol4, skol3 ),
% 0.44/1.06 cartesian_product2( skol6, skol5 ) ) }.
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06 Total Proof:
% 0.44/1.06
% 0.44/1.06 subsumption: (4) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.44/1.06 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.44/1.06 parent0: (66) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 0.44/1.06 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 X := X
% 0.44/1.06 Y := Y
% 0.44/1.06 Z := Z
% 0.44/1.06 T := T
% 0.44/1.06 end
% 0.44/1.06 permutation0:
% 0.44/1.06 0 ==> 0
% 0.44/1.06 1 ==> 1
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 subsumption: (5) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.44/1.06 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.44/1.06 parent0: (67) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 0.44/1.06 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 X := X
% 0.44/1.06 Y := Y
% 0.44/1.06 Z := Z
% 0.44/1.06 T := T
% 0.44/1.06 end
% 0.44/1.06 permutation0:
% 0.44/1.06 0 ==> 0
% 0.44/1.06 1 ==> 1
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 subsumption: (6) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in(
% 0.44/1.06 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.44/1.06 parent0: (68) {G0,W13,D3,L3,V4,M3} { ! in( X, Z ), ! in( Y, T ), in(
% 0.44/1.06 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 X := X
% 0.44/1.06 Y := Y
% 0.44/1.06 Z := Z
% 0.44/1.06 T := T
% 0.44/1.06 end
% 0.44/1.06 permutation0:
% 0.44/1.06 0 ==> 0
% 0.44/1.06 1 ==> 1
% 0.44/1.06 2 ==> 2
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 subsumption: (9) {G0,W7,D3,L1,V0,M1} I { in( ordered_pair( skol3, skol4 ),
% 0.44/1.06 cartesian_product2( skol5, skol6 ) ) }.
% 0.44/1.06 parent0: (71) {G0,W7,D3,L1,V0,M1} { in( ordered_pair( skol3, skol4 ),
% 0.44/1.06 cartesian_product2( skol5, skol6 ) ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 end
% 0.44/1.06 permutation0:
% 0.44/1.06 0 ==> 0
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 subsumption: (10) {G0,W7,D3,L1,V0,M1} I { ! in( ordered_pair( skol4, skol3
% 0.44/1.06 ), cartesian_product2( skol6, skol5 ) ) }.
% 0.44/1.06 parent0: (72) {G0,W7,D3,L1,V0,M1} { ! in( ordered_pair( skol4, skol3 ),
% 0.44/1.06 cartesian_product2( skol6, skol5 ) ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 end
% 0.44/1.06 permutation0:
% 0.44/1.06 0 ==> 0
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 resolution: (86) {G1,W3,D2,L1,V0,M1} { in( skol4, skol6 ) }.
% 0.44/1.06 parent0[0]: (5) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.44/1.06 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.44/1.06 parent1[0]: (9) {G0,W7,D3,L1,V0,M1} I { in( ordered_pair( skol3, skol4 ),
% 0.44/1.06 cartesian_product2( skol5, skol6 ) ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 X := skol3
% 0.44/1.06 Y := skol4
% 0.44/1.06 Z := skol5
% 0.44/1.06 T := skol6
% 0.44/1.06 end
% 0.44/1.06 substitution1:
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 subsumption: (16) {G1,W3,D2,L1,V0,M1} R(5,9) { in( skol4, skol6 ) }.
% 0.44/1.06 parent0: (86) {G1,W3,D2,L1,V0,M1} { in( skol4, skol6 ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 end
% 0.44/1.06 permutation0:
% 0.44/1.06 0 ==> 0
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 resolution: (87) {G1,W3,D2,L1,V0,M1} { in( skol3, skol5 ) }.
% 0.44/1.06 parent0[0]: (4) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.44/1.06 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.44/1.06 parent1[0]: (9) {G0,W7,D3,L1,V0,M1} I { in( ordered_pair( skol3, skol4 ),
% 0.44/1.06 cartesian_product2( skol5, skol6 ) ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 X := skol3
% 0.44/1.06 Y := skol4
% 0.44/1.06 Z := skol5
% 0.44/1.06 T := skol6
% 0.44/1.06 end
% 0.44/1.06 substitution1:
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 subsumption: (34) {G1,W3,D2,L1,V0,M1} R(4,9) { in( skol3, skol5 ) }.
% 0.44/1.06 parent0: (87) {G1,W3,D2,L1,V0,M1} { in( skol3, skol5 ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 end
% 0.44/1.06 permutation0:
% 0.44/1.06 0 ==> 0
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 resolution: (88) {G1,W6,D2,L2,V0,M2} { ! in( skol4, skol6 ), ! in( skol3,
% 0.44/1.06 skol5 ) }.
% 0.44/1.06 parent0[0]: (10) {G0,W7,D3,L1,V0,M1} I { ! in( ordered_pair( skol4, skol3 )
% 0.44/1.06 , cartesian_product2( skol6, skol5 ) ) }.
% 0.44/1.06 parent1[2]: (6) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in(
% 0.44/1.06 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 end
% 0.44/1.06 substitution1:
% 0.44/1.06 X := skol4
% 0.44/1.06 Y := skol3
% 0.44/1.06 Z := skol6
% 0.44/1.06 T := skol5
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 resolution: (89) {G2,W3,D2,L1,V0,M1} { ! in( skol3, skol5 ) }.
% 0.44/1.06 parent0[0]: (88) {G1,W6,D2,L2,V0,M2} { ! in( skol4, skol6 ), ! in( skol3,
% 0.44/1.06 skol5 ) }.
% 0.44/1.06 parent1[0]: (16) {G1,W3,D2,L1,V0,M1} R(5,9) { in( skol4, skol6 ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 end
% 0.44/1.06 substitution1:
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 subsumption: (57) {G2,W3,D2,L1,V0,M1} R(6,10);r(16) { ! in( skol3, skol5 )
% 0.44/1.06 }.
% 0.44/1.06 parent0: (89) {G2,W3,D2,L1,V0,M1} { ! in( skol3, skol5 ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 end
% 0.44/1.06 permutation0:
% 0.44/1.06 0 ==> 0
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 resolution: (90) {G2,W0,D0,L0,V0,M0} { }.
% 0.44/1.06 parent0[0]: (57) {G2,W3,D2,L1,V0,M1} R(6,10);r(16) { ! in( skol3, skol5 )
% 0.44/1.06 }.
% 0.44/1.06 parent1[0]: (34) {G1,W3,D2,L1,V0,M1} R(4,9) { in( skol3, skol5 ) }.
% 0.44/1.06 substitution0:
% 0.44/1.06 end
% 0.44/1.06 substitution1:
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 subsumption: (60) {G3,W0,D0,L0,V0,M0} S(57);r(34) { }.
% 0.44/1.06 parent0: (90) {G2,W0,D0,L0,V0,M0} { }.
% 0.44/1.06 substitution0:
% 0.44/1.06 end
% 0.44/1.06 permutation0:
% 0.44/1.06 end
% 0.44/1.06
% 0.44/1.06 Proof check complete!
% 0.44/1.06
% 0.44/1.06 Memory use:
% 0.44/1.06
% 0.44/1.06 space for terms: 880
% 0.44/1.06 space for clauses: 4478
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06 clauses generated: 102
% 0.44/1.06 clauses kept: 61
% 0.44/1.06 clauses selected: 21
% 0.44/1.06 clauses deleted: 1
% 0.44/1.06 clauses inuse deleted: 0
% 0.44/1.06
% 0.44/1.06 subsentry: 246
% 0.44/1.06 literals s-matched: 151
% 0.44/1.06 literals matched: 151
% 0.44/1.06 full subsumption: 71
% 0.44/1.06
% 0.44/1.06 checksum: 1305072956
% 0.44/1.06
% 0.44/1.06
% 0.44/1.06 Bliksem ended
%------------------------------------------------------------------------------