TSTP Solution File: SET913+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET913+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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.71s 1.09s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET913+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Sat Jul 9 23:08:22 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.71/1.09 *** allocated 10000 integers for termspace/termends
% 0.71/1.09 *** allocated 10000 integers for clauses
% 0.71/1.09 *** allocated 10000 integers for justifications
% 0.71/1.09 Bliksem 1.12
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Automatic Strategy Selection
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Clauses:
% 0.71/1.09
% 0.71/1.09 { ! disjoint( X, Y ), disjoint( Y, X ) }.
% 0.71/1.09 { ! in( X, Y ), ! in( Y, X ) }.
% 0.71/1.09 { empty( skol1 ) }.
% 0.71/1.09 { ! empty( skol2 ) }.
% 0.71/1.09 { disjoint( singleton( skol3 ), skol4 ) }.
% 0.71/1.09 { in( skol3, skol4 ) }.
% 0.71/1.09 { ! disjoint( singleton( X ), Y ), ! in( X, Y ) }.
% 0.71/1.09
% 0.71/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.71/1.09 This is a near-Horn, non-equality problem
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Options Used:
% 0.71/1.09
% 0.71/1.09 useres = 1
% 0.71/1.09 useparamod = 0
% 0.71/1.09 useeqrefl = 0
% 0.71/1.09 useeqfact = 0
% 0.71/1.09 usefactor = 1
% 0.71/1.09 usesimpsplitting = 0
% 0.71/1.09 usesimpdemod = 0
% 0.71/1.09 usesimpres = 4
% 0.71/1.09
% 0.71/1.09 resimpinuse = 1000
% 0.71/1.09 resimpclauses = 20000
% 0.71/1.09 substype = standard
% 0.71/1.09 backwardsubs = 1
% 0.71/1.09 selectoldest = 5
% 0.71/1.09
% 0.71/1.09 litorderings [0] = split
% 0.71/1.09 litorderings [1] = liftord
% 0.71/1.09
% 0.71/1.09 termordering = none
% 0.71/1.09
% 0.71/1.09 litapriori = 1
% 0.71/1.09 termapriori = 0
% 0.71/1.09 litaposteriori = 0
% 0.71/1.09 termaposteriori = 0
% 0.71/1.09 demodaposteriori = 0
% 0.71/1.09 ordereqreflfact = 0
% 0.71/1.09
% 0.71/1.09 litselect = negative
% 0.71/1.09
% 0.71/1.09 maxweight = 30000
% 0.71/1.09 maxdepth = 30000
% 0.71/1.09 maxlength = 115
% 0.71/1.09 maxnrvars = 195
% 0.71/1.09 excuselevel = 0
% 0.71/1.09 increasemaxweight = 0
% 0.71/1.09
% 0.71/1.09 maxselected = 10000000
% 0.71/1.09 maxnrclauses = 10000000
% 0.71/1.09
% 0.71/1.09 showgenerated = 0
% 0.71/1.09 showkept = 0
% 0.71/1.09 showselected = 0
% 0.71/1.09 showdeleted = 0
% 0.71/1.09 showresimp = 1
% 0.71/1.09 showstatus = 2000
% 0.71/1.09
% 0.71/1.09 prologoutput = 0
% 0.71/1.09 nrgoals = 5000000
% 0.71/1.09 totalproof = 1
% 0.71/1.09
% 0.71/1.09 Symbols occurring in the translation:
% 0.71/1.09
% 0.71/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.09 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.09 ! [4, 1] (w:1, o:12, a:1, s:1, b:0),
% 0.71/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 disjoint [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.71/1.09 in [38, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.71/1.09 empty [39, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.71/1.09 singleton [40, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.09 skol1 [41, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.71/1.09 skol2 [42, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.09 skol3 [43, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.71/1.09 skol4 [44, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Starting Search:
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksems!, er is een bewijs:
% 0.71/1.09 % SZS status Theorem
% 0.71/1.09 % SZS output start Refutation
% 0.71/1.09
% 0.71/1.09 (4) {G0,W4,D3,L1,V0,M1} I { disjoint( singleton( skol3 ), skol4 ) }.
% 0.71/1.09 (5) {G0,W3,D2,L1,V0,M1} I { in( skol3, skol4 ) }.
% 0.71/1.09 (6) {G0,W9,D3,L2,V2,M1} I { ! in( X, Y ), ! disjoint( singleton( X ), Y )
% 0.71/1.09 }.
% 0.71/1.09 (10) {G1,W0,D0,L0,V0,M0} R(6,4);r(5) { }.
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 % SZS output end Refutation
% 0.71/1.09 found a proof!
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Unprocessed initial clauses:
% 0.71/1.09
% 0.71/1.09 (12) {G0,W7,D2,L2,V2,M2} { ! disjoint( X, Y ), disjoint( Y, X ) }.
% 0.71/1.09 (13) {G0,W8,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.71/1.09 (14) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.71/1.09 (15) {G0,W3,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.71/1.09 (16) {G0,W4,D3,L1,V0,M1} { disjoint( singleton( skol3 ), skol4 ) }.
% 0.71/1.09 (17) {G0,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.71/1.09 (18) {G0,W9,D3,L2,V2,M2} { ! disjoint( singleton( X ), Y ), ! in( X, Y )
% 0.71/1.09 }.
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Total Proof:
% 0.71/1.09
% 0.71/1.09 subsumption: (4) {G0,W4,D3,L1,V0,M1} I { disjoint( singleton( skol3 ),
% 0.71/1.09 skol4 ) }.
% 0.71/1.09 parent0: (16) {G0,W4,D3,L1,V0,M1} { disjoint( singleton( skol3 ), skol4 )
% 0.71/1.09 }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 permutation0:
% 0.71/1.09 0 ==> 0
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 subsumption: (5) {G0,W3,D2,L1,V0,M1} I { in( skol3, skol4 ) }.
% 0.71/1.09 parent0: (17) {G0,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 permutation0:
% 0.71/1.09 0 ==> 0
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 subsumption: (6) {G0,W9,D3,L2,V2,M1} I { ! in( X, Y ), ! disjoint(
% 0.71/1.09 singleton( X ), Y ) }.
% 0.71/1.09 parent0: (18) {G0,W9,D3,L2,V2,M2} { ! disjoint( singleton( X ), Y ), ! in
% 0.71/1.09 ( X, Y ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 X := X
% 0.71/1.09 Y := Y
% 0.71/1.09 end
% 0.71/1.09 permutation0:
% 0.71/1.09 0 ==> 1
% 0.71/1.09 1 ==> 0
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 resolution: (22) {G1,W4,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.71/1.09 parent0[1]: (6) {G0,W9,D3,L2,V2,M1} I { ! in( X, Y ), ! disjoint( singleton
% 0.71/1.09 ( X ), Y ) }.
% 0.71/1.09 parent1[0]: (4) {G0,W4,D3,L1,V0,M1} I { disjoint( singleton( skol3 ), skol4
% 0.71/1.09 ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 X := skol3
% 0.71/1.09 Y := skol4
% 0.71/1.09 end
% 0.71/1.09 substitution1:
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 resolution: (23) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.09 parent0[0]: (22) {G1,W4,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.71/1.09 parent1[0]: (5) {G0,W3,D2,L1,V0,M1} I { in( skol3, skol4 ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 substitution1:
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 subsumption: (10) {G1,W0,D0,L0,V0,M0} R(6,4);r(5) { }.
% 0.71/1.09 parent0: (23) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 permutation0:
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 Proof check complete!
% 0.71/1.09
% 0.71/1.09 Memory use:
% 0.71/1.09
% 0.71/1.09 space for terms: 161
% 0.71/1.09 space for clauses: 597
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 clauses generated: 12
% 0.71/1.09 clauses kept: 11
% 0.71/1.09 clauses selected: 10
% 0.71/1.09 clauses deleted: 0
% 0.71/1.09 clauses inuse deleted: 0
% 0.71/1.09
% 0.71/1.09 subsentry: 7
% 0.71/1.09 literals s-matched: 3
% 0.71/1.09 literals matched: 3
% 0.71/1.09 full subsumption: 0
% 0.71/1.09
% 0.71/1.09 checksum: -553683208
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksem ended
%------------------------------------------------------------------------------