TSTP Solution File: SET978+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET978+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:44 EDT 2022
% Result : Theorem 0.44s 1.05s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET978+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sat Jul 9 16:04:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.05 *** allocated 10000 integers for termspace/termends
% 0.44/1.05 *** allocated 10000 integers for clauses
% 0.44/1.05 *** allocated 10000 integers for justifications
% 0.44/1.05 Bliksem 1.12
% 0.44/1.05
% 0.44/1.05
% 0.44/1.05 Automatic Strategy Selection
% 0.44/1.05
% 0.44/1.05
% 0.44/1.05 Clauses:
% 0.44/1.05
% 0.44/1.05 { empty( skol1 ) }.
% 0.44/1.05 { ! empty( skol2 ) }.
% 0.44/1.05 { ! disjoint( X, Y ), disjoint( Y, X ) }.
% 0.44/1.05 { ! disjoint( X, Y ), disjoint( cartesian_product2( X, Z ),
% 0.44/1.05 cartesian_product2( Y, T ) ) }.
% 0.44/1.05 { ! disjoint( Z, T ), disjoint( cartesian_product2( X, Z ),
% 0.44/1.05 cartesian_product2( Y, T ) ) }.
% 0.44/1.05 { ! skol3 = skol4 }.
% 0.44/1.05 { ! disjoint( cartesian_product2( singleton( skol3 ), skol5 ),
% 0.44/1.05 cartesian_product2( singleton( skol4 ), skol6 ) ), ! disjoint(
% 0.44/1.05 cartesian_product2( skol5, singleton( skol3 ) ), cartesian_product2(
% 0.44/1.05 skol6, singleton( skol4 ) ) ) }.
% 0.44/1.05 { X = Y, disjoint( singleton( X ), singleton( Y ) ) }.
% 0.44/1.05
% 0.44/1.05 percentage equality = 0.153846, percentage horn = 0.875000
% 0.44/1.05 This is a problem with some equality
% 0.44/1.05
% 0.44/1.05
% 0.44/1.05
% 0.44/1.05 Options Used:
% 0.44/1.05
% 0.44/1.05 useres = 1
% 0.44/1.05 useparamod = 1
% 0.44/1.05 useeqrefl = 1
% 0.44/1.05 useeqfact = 1
% 0.44/1.05 usefactor = 1
% 0.44/1.05 usesimpsplitting = 0
% 0.44/1.05 usesimpdemod = 5
% 0.44/1.05 usesimpres = 3
% 0.44/1.05
% 0.44/1.05 resimpinuse = 1000
% 0.44/1.05 resimpclauses = 20000
% 0.44/1.05 substype = eqrewr
% 0.44/1.05 backwardsubs = 1
% 0.44/1.05 selectoldest = 5
% 0.44/1.05
% 0.44/1.05 litorderings [0] = split
% 0.44/1.05 litorderings [1] = extend the termordering, first sorting on arguments
% 0.44/1.05
% 0.44/1.05 termordering = kbo
% 0.44/1.05
% 0.44/1.05 litapriori = 0
% 0.44/1.05 termapriori = 1
% 0.44/1.05 litaposteriori = 0
% 0.44/1.05 termaposteriori = 0
% 0.44/1.05 demodaposteriori = 0
% 0.44/1.05 ordereqreflfact = 0
% 0.44/1.05
% 0.44/1.05 litselect = negord
% 0.44/1.05
% 0.44/1.05 maxweight = 15
% 0.44/1.05 maxdepth = 30000
% 0.44/1.05 maxlength = 115
% 0.44/1.05 maxnrvars = 195
% 0.44/1.05 excuselevel = 1
% 0.44/1.05 increasemaxweight = 1
% 0.44/1.05
% 0.44/1.05 maxselected = 10000000
% 0.44/1.05 maxnrclauses = 10000000
% 0.44/1.05
% 0.44/1.05 showgenerated = 0
% 0.44/1.05 showkept = 0
% 0.44/1.05 showselected = 0
% 0.44/1.05 showdeleted = 0
% 0.44/1.05 showresimp = 1
% 0.44/1.05 showstatus = 2000
% 0.44/1.05
% 0.44/1.05 prologoutput = 0
% 0.44/1.05 nrgoals = 5000000
% 0.44/1.05 totalproof = 1
% 0.44/1.05
% 0.44/1.05 Symbols occurring in the translation:
% 0.44/1.05
% 0.44/1.05 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.05 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.44/1.05 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.44/1.05 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.05 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.05 empty [36, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.44/1.05 disjoint [38, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.44/1.05 cartesian_product2 [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.44/1.05 singleton [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.44/1.05 skol1 [43, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.44/1.05 skol2 [44, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.44/1.05 skol3 [45, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.44/1.05 skol4 [46, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.44/1.05 skol5 [47, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.44/1.05 skol6 [48, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.44/1.05
% 0.44/1.05
% 0.44/1.05 Starting Search:
% 0.44/1.05
% 0.44/1.05
% 0.44/1.05 Bliksems!, er is een bewijs:
% 0.44/1.05 % SZS status Theorem
% 0.44/1.05 % SZS output start Refutation
% 0.44/1.05
% 0.44/1.05 (3) {G0,W10,D3,L2,V4,M2} I { ! disjoint( X, Y ), disjoint(
% 0.44/1.05 cartesian_product2( X, Z ), cartesian_product2( Y, T ) ) }.
% 0.44/1.05 (4) {G0,W10,D3,L2,V4,M2} I { ! disjoint( Z, T ), disjoint(
% 0.44/1.05 cartesian_product2( X, Z ), cartesian_product2( Y, T ) ) }.
% 0.44/1.05 (5) {G0,W3,D2,L1,V0,M1} I { ! skol4 ==> skol3 }.
% 0.44/1.05 (6) {G0,W18,D4,L2,V0,M2} I { ! disjoint( cartesian_product2( singleton(
% 0.44/1.05 skol3 ), skol5 ), cartesian_product2( singleton( skol4 ), skol6 ) ), !
% 0.44/1.05 disjoint( cartesian_product2( skol5, singleton( skol3 ) ),
% 0.44/1.05 cartesian_product2( skol6, singleton( skol4 ) ) ) }.
% 0.44/1.05 (7) {G0,W8,D3,L2,V2,M2} I { X = Y, disjoint( singleton( X ), singleton( Y )
% 0.44/1.05 ) }.
% 0.44/1.05 (13) {G1,W8,D3,L2,V1,M2} P(7,5) { ! X = skol3, disjoint( singleton( X ),
% 0.44/1.05 singleton( skol4 ) ) }.
% 0.44/1.05 (18) {G2,W5,D3,L1,V0,M1} Q(13) { disjoint( singleton( skol3 ), singleton(
% 0.44/1.05 skol4 ) ) }.
% 0.44/1.05 (37) {G3,W9,D4,L1,V2,M1} R(18,3) { disjoint( cartesian_product2( singleton
% 0.44/1.05 ( skol3 ), X ), cartesian_product2( singleton( skol4 ), Y ) ) }.
% 0.44/1.05 (63) {G3,W9,D4,L1,V2,M1} R(4,18) { disjoint( cartesian_product2( X,
% 0.44/1.05 singleton( skol3 ) ), cartesian_product2( Y, singleton( skol4 ) ) ) }.
% 0.44/1.05 (104) {G4,W0,D0,L0,V0,M0} S(6);r(37);r(63) { }.
% 0.44/1.05
% 0.44/1.05
% 0.44/1.05 % SZS output end Refutation
% 0.44/1.05 found a proof!
% 0.44/1.05
% 0.44/1.05
% 0.44/1.05 Unprocessed initial clauses:
% 0.44/1.05
% 0.44/1.05 (106) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.44/1.05 (107) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.44/1.05 (108) {G0,W6,D2,L2,V2,M2} { ! disjoint( X, Y ), disjoint( Y, X ) }.
% 19.45/19.84 (109) {G0,W10,D3,L2,V4,M2} { ! disjoint( X, Y ), disjoint(
% 19.45/19.84 cartesian_product2( X, Z ), cartesian_product2( Y, T ) ) }.
% 19.45/19.84 (110) {G0,W10,D3,L2,V4,M2} { ! disjoint( Z, T ), disjoint(
% 19.45/19.84 cartesian_product2( X, Z ), cartesian_product2( Y, T ) ) }.
% 19.45/19.84 (111) {G0,W3,D2,L1,V0,M1} { ! skol3 = skol4 }.
% 19.45/19.84 (112) {G0,W18,D4,L2,V0,M2} { ! disjoint( cartesian_product2( singleton(
% 19.45/19.84 skol3 ), skol5 ), cartesian_product2( singleton( skol4 ), skol6 ) ), !
% 19.45/19.84 disjoint( cartesian_product2( skol5, singleton( skol3 ) ),
% 19.45/19.84 cartesian_product2( skol6, singleton( skol4 ) ) ) }.
% 19.45/19.84 (113) {G0,W8,D3,L2,V2,M2} { X = Y, disjoint( singleton( X ), singleton( Y
% 19.45/19.84 ) ) }.
% 19.45/19.84
% 19.45/19.84
% 19.45/19.84 Total Proof:
% 19.45/19.84
% 19.45/19.84 subsumption: (3) {G0,W10,D3,L2,V4,M2} I { ! disjoint( X, Y ), disjoint(
% 19.45/19.84 cartesian_product2( X, Z ), cartesian_product2( Y, T ) ) }.
% 19.45/19.84 parent0: (109) {G0,W10,D3,L2,V4,M2} { ! disjoint( X, Y ), disjoint(
% 19.45/19.84 cartesian_product2( X, Z ), cartesian_product2( Y, T ) ) }.
% 19.45/19.84 substitution0:
% 19.45/19.84 X := X
% 19.45/19.84 Y := Y
% 19.45/19.84 Z := Z
% 19.45/19.84 T := T
% 19.45/19.84 end
% 19.45/19.84 permutation0:
% 19.45/19.84 0 ==> 0
% 19.45/19.84 1 ==> 1
% 19.45/19.84 end
% 19.45/19.84
% 19.45/19.84 subsumption: (4) {G0,W10,D3,L2,V4,M2} I { ! disjoint( Z, T ), disjoint(
% 19.45/19.84 cartesian_product2( X, Z ), cartesian_product2( Y, T ) ) }.
% 19.45/19.84 parent0: (110) {G0,W10,D3,L2,V4,M2} { ! disjoint( Z, T ), disjoint(
% 19.45/19.84 cartesian_product2( X, Z ), cartesian_product2( Y, T ) ) }.
% 19.45/19.84 substitution0:
% 19.45/19.84 X := X
% 19.45/19.84 Y := Y
% 19.45/19.84 Z := Z
% 19.45/19.84 T := T
% 19.45/19.84 end
% 19.45/19.84 permutation0:
% 19.45/19.84 0 ==> 0
% 19.45/19.84 1 ==> 1
% 19.45/19.84 end
% 19.45/19.84
% 19.45/19.84 eqswap: (114) {G0,W3,D2,L1,V0,M1} { ! skol4 = skol3 }.
% 19.45/19.84 parent0[0]: (111) {G0,W3,D2,L1,V0,M1} { ! skol3 = skol4 }.
% 19.45/19.84 substitution0:
% 19.45/19.84 end
% 19.45/19.84
% 19.45/19.84 subsumption: (5) {G0,W3,D2,L1,V0,M1} I { ! skol4 ==> skol3 }.
% 19.45/19.84 parent0: (114) {G0,W3,D2,L1,V0,M1} { ! skol4 = skol3 }.
% 19.45/19.84 substitution0:
% 19.45/19.84 end
% 19.45/19.84 permutation0:
% 19.45/19.84 0 ==> 0
% 19.45/19.84 end
% 19.45/19.84
% 19.45/19.84 subsumption: (6) {G0,W18,D4,L2,V0,M2} I { ! disjoint( cartesian_product2(
% 19.45/19.84 singleton( skol3 ), skol5 ), cartesian_product2( singleton( skol4 ),
% 19.45/19.84 skol6 ) ), ! disjoint( cartesian_product2( skol5, singleton( skol3 ) ),
% 19.45/19.84 cartesian_product2( skol6, singleton( skol4 ) ) ) }.
% 19.45/19.84 parent0: (112) {G0,W18,D4,L2,V0,M2} { ! disjoint( cartesian_product2(
% 19.45/19.84 singleton( skol3 ), skol5 ), cartesian_product2( singleton( skol4 ),
% 19.45/19.84 skol6 ) ), ! disjoint( cartesian_product2( skol5, singleton( skol3 ) ),
% 19.45/19.84 cartesian_product2( skol6, singleton( skol4 ) ) ) }.
% 19.45/19.84 substitution0:
% 19.45/19.84 end
% 19.45/19.84 permutation0:
% 19.45/19.84 0 ==> 0
% 19.45/19.84 1 ==> 1
% 19.45/19.84 end
% 19.45/19.84
% 19.45/19.84 subsumption: (7) {G0,W8,D3,L2,V2,M2} I { X = Y, disjoint( singleton( X ),
% 19.45/19.84 singleton( Y ) ) }.
% 19.45/19.84 parent0: (113) {G0,W8,D3,L2,V2,M2} { X = Y, disjoint( singleton( X ),
% 19.45/19.84 singleton( Y ) ) }.
% 19.45/19.84 substitution0:
% 19.45/19.84 X := X
% 19.45/19.84 Y := Y
% 19.45/19.84 end
% 19.45/19.84 permutation0:
% 19.45/19.84 0 ==> 0
% 19.45/19.84 1 ==> 1
% 19.45/19.84 end
% 19.45/19.84
% 19.45/19.84 *** allocated 15000 integers for clauses
% 19.45/19.84 *** allocated 15000 integers for termspace/termends
% 19.45/19.84 *** allocated 15000 integers for justifications
% 19.45/19.84 *** allocated 22500 integers for clauses
% 19.45/19.84 *** allocated 22500 integers for termspace/termends
% 19.45/19.84 *** allocated 22500 integers for justifications
% 19.45/19.84 *** allocated 33750 integers for termspace/termends
% 19.45/19.84 *** allocated 33750 integers for clauses
% 19.45/19.84 *** allocated 33750 integers for justifications
% 19.45/19.84 *** allocated 50625 integers for termspace/termends
% 19.45/19.84 *** allocated 50625 integers for clauses
% 19.45/19.84 *** allocated 50625 integers for justifications
% 19.45/19.84 *** allocated 75937 integers for termspace/termends
% 19.45/19.84 *** allocated 75937 integers for clauses
% 19.45/19.84 *** allocated 75937 integers for justifications
% 19.45/19.84 *** allocated 113905 integers for termspace/termends
% 19.45/19.84 *** allocated 113905 integers for justifications
% 19.45/19.84 *** allocated 113905 integers for clauses
% 19.45/19.84 *** allocated 170857 integers for termspace/termends
% 19.45/19.84 *** allocated 170857 integers for justifications
% 19.45/19.84 *** allocated 170857 integers for clauses
% 19.45/19.84 *** allocated 256285 integers for termspace/termends
% 19.45/19.84 *** allocated 256285 integers for justifications
% 19.45/19.84 *** allocated 384427 integers for termspace/termends
% 19.45/19.84 *** allocated 256285 integers for clauses
% 19.45/19.84 *** allocated 576640 integers for termspace/termends
% 19.45/19.84 *** allocated 384427 integers for justifications
% 19.45/19.84 *** allocated 384427 integers for clauses
% 19.45/19.84 *** allocated 864960 integers for termspace/termends
% 19.45/19.84 *** allocated 576640 integers for justifications
% 19.45/19.84 *** allocatedCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------