TSTP Solution File: SET899+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET899+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:12 EDT 2022
% Result : Theorem 0.44s 1.07s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET899+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n017.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 : Sat Jul 9 23:04:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.07 *** allocated 10000 integers for termspace/termends
% 0.44/1.07 *** allocated 10000 integers for clauses
% 0.44/1.07 *** allocated 10000 integers for justifications
% 0.44/1.07 Bliksem 1.12
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Automatic Strategy Selection
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Clauses:
% 0.44/1.07
% 0.44/1.07 { subset( X, X ) }.
% 0.44/1.07 { ! in( X, Y ), ! in( Y, X ) }.
% 0.44/1.07 { empty( skol1 ) }.
% 0.44/1.07 { ! empty( skol2 ) }.
% 0.44/1.07 { subset( skol3, skol4 ) }.
% 0.44/1.07 { ! in( skol5, skol3 ) }.
% 0.44/1.07 { ! subset( skol3, set_difference( skol4, singleton( skol5 ) ) ) }.
% 0.44/1.07 { ! subset( X, Y ), in( Z, X ), subset( X, set_difference( Y, singleton( Z
% 0.44/1.07 ) ) ) }.
% 0.44/1.07
% 0.44/1.07 percentage equality = 0.000000, percentage horn = 0.875000
% 0.44/1.07 This a non-horn, non-equality problem
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Options Used:
% 0.44/1.07
% 0.44/1.07 useres = 1
% 0.44/1.07 useparamod = 0
% 0.44/1.07 useeqrefl = 0
% 0.44/1.07 useeqfact = 0
% 0.44/1.07 usefactor = 1
% 0.44/1.07 usesimpsplitting = 0
% 0.44/1.07 usesimpdemod = 0
% 0.44/1.07 usesimpres = 3
% 0.44/1.07
% 0.44/1.07 resimpinuse = 1000
% 0.44/1.07 resimpclauses = 20000
% 0.44/1.07 substype = standard
% 0.44/1.07 backwardsubs = 1
% 0.44/1.07 selectoldest = 5
% 0.44/1.07
% 0.44/1.07 litorderings [0] = split
% 0.44/1.07 litorderings [1] = liftord
% 0.44/1.07
% 0.44/1.07 termordering = none
% 0.44/1.07
% 0.44/1.07 litapriori = 1
% 0.44/1.07 termapriori = 0
% 0.44/1.07 litaposteriori = 0
% 0.44/1.07 termaposteriori = 0
% 0.44/1.07 demodaposteriori = 0
% 0.44/1.07 ordereqreflfact = 0
% 0.44/1.07
% 0.44/1.07 litselect = none
% 0.44/1.07
% 0.44/1.07 maxweight = 15
% 0.44/1.07 maxdepth = 30000
% 0.44/1.07 maxlength = 115
% 0.44/1.07 maxnrvars = 195
% 0.44/1.07 excuselevel = 1
% 0.44/1.07 increasemaxweight = 1
% 0.44/1.07
% 0.44/1.07 maxselected = 10000000
% 0.44/1.07 maxnrclauses = 10000000
% 0.44/1.07
% 0.44/1.07 showgenerated = 0
% 0.44/1.07 showkept = 0
% 0.44/1.07 showselected = 0
% 0.44/1.07 showdeleted = 0
% 0.44/1.07 showresimp = 1
% 0.44/1.07 showstatus = 2000
% 0.44/1.07
% 0.44/1.07 prologoutput = 0
% 0.44/1.07 nrgoals = 5000000
% 0.44/1.07 totalproof = 1
% 0.44/1.07
% 0.44/1.07 Symbols occurring in the translation:
% 0.44/1.07
% 0.44/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.07 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.44/1.07 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.44/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.07 subset [37, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.44/1.07 in [38, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.44/1.07 empty [39, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.44/1.07 singleton [41, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.44/1.07 set_difference [42, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.44/1.07 skol1 [43, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.44/1.07 skol2 [44, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.44/1.07 skol3 [45, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.44/1.07 skol4 [46, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.44/1.07 skol5 [47, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Starting Search:
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Bliksems!, er is een bewijs:
% 0.44/1.07 % SZS status Theorem
% 0.44/1.07 % SZS output start Refutation
% 0.44/1.07
% 0.44/1.07 (4) {G0,W3,D2,L1,V0,M1} I { subset( skol3, skol4 ) }.
% 0.44/1.07 (5) {G0,W3,D2,L1,V0,M1} I { ! in( skol5, skol3 ) }.
% 0.44/1.07 (6) {G0,W6,D4,L1,V0,M1} I { ! subset( skol3, set_difference( skol4,
% 0.44/1.07 singleton( skol5 ) ) ) }.
% 0.44/1.07 (7) {G0,W12,D4,L3,V3,M1} I { ! subset( X, Y ), subset( X, set_difference( Y
% 0.44/1.07 , singleton( Z ) ) ), in( Z, X ) }.
% 0.44/1.07 (10) {G1,W9,D4,L2,V1,M2} R(7,5) { subset( skol3, set_difference( X,
% 0.44/1.07 singleton( skol5 ) ) ), ! subset( skol3, X ) }.
% 0.44/1.07 (22) {G2,W0,D0,L0,V0,M0} R(10,6);r(4) { }.
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 % SZS output end Refutation
% 0.44/1.07 found a proof!
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Unprocessed initial clauses:
% 0.44/1.07
% 0.44/1.07 (24) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.44/1.07 (25) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.44/1.07 (26) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.44/1.07 (27) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.44/1.07 (28) {G0,W3,D2,L1,V0,M1} { subset( skol3, skol4 ) }.
% 0.44/1.07 (29) {G0,W3,D2,L1,V0,M1} { ! in( skol5, skol3 ) }.
% 0.44/1.07 (30) {G0,W6,D4,L1,V0,M1} { ! subset( skol3, set_difference( skol4,
% 0.44/1.07 singleton( skol5 ) ) ) }.
% 0.44/1.07 (31) {G0,W12,D4,L3,V3,M3} { ! subset( X, Y ), in( Z, X ), subset( X,
% 0.44/1.07 set_difference( Y, singleton( Z ) ) ) }.
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Total Proof:
% 0.44/1.07
% 0.44/1.07 subsumption: (4) {G0,W3,D2,L1,V0,M1} I { subset( skol3, skol4 ) }.
% 0.44/1.07 parent0: (28) {G0,W3,D2,L1,V0,M1} { subset( skol3, skol4 ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 0 ==> 0
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (5) {G0,W3,D2,L1,V0,M1} I { ! in( skol5, skol3 ) }.
% 0.44/1.07 parent0: (29) {G0,W3,D2,L1,V0,M1} { ! in( skol5, skol3 ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 0 ==> 0
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (6) {G0,W6,D4,L1,V0,M1} I { ! subset( skol3, set_difference(
% 0.44/1.07 skol4, singleton( skol5 ) ) ) }.
% 0.44/1.07 parent0: (30) {G0,W6,D4,L1,V0,M1} { ! subset( skol3, set_difference( skol4
% 0.44/1.07 , singleton( skol5 ) ) ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 0 ==> 0
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (7) {G0,W12,D4,L3,V3,M1} I { ! subset( X, Y ), subset( X,
% 0.44/1.07 set_difference( Y, singleton( Z ) ) ), in( Z, X ) }.
% 0.44/1.07 parent0: (31) {G0,W12,D4,L3,V3,M3} { ! subset( X, Y ), in( Z, X ), subset
% 0.44/1.07 ( X, set_difference( Y, singleton( Z ) ) ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 X := X
% 0.44/1.07 Y := Y
% 0.44/1.07 Z := Z
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 0 ==> 0
% 0.44/1.07 1 ==> 2
% 0.44/1.07 2 ==> 1
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 resolution: (36) {G1,W9,D4,L2,V1,M2} { ! subset( skol3, X ), subset( skol3
% 0.44/1.07 , set_difference( X, singleton( skol5 ) ) ) }.
% 0.44/1.07 parent0[0]: (5) {G0,W3,D2,L1,V0,M1} I { ! in( skol5, skol3 ) }.
% 0.44/1.07 parent1[2]: (7) {G0,W12,D4,L3,V3,M1} I { ! subset( X, Y ), subset( X,
% 0.44/1.07 set_difference( Y, singleton( Z ) ) ), in( Z, X ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 X := skol3
% 0.44/1.07 Y := X
% 0.44/1.07 Z := skol5
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (10) {G1,W9,D4,L2,V1,M2} R(7,5) { subset( skol3,
% 0.44/1.07 set_difference( X, singleton( skol5 ) ) ), ! subset( skol3, X ) }.
% 0.44/1.07 parent0: (36) {G1,W9,D4,L2,V1,M2} { ! subset( skol3, X ), subset( skol3,
% 0.44/1.07 set_difference( X, singleton( skol5 ) ) ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 X := X
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 0 ==> 1
% 0.44/1.07 1 ==> 0
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 resolution: (37) {G1,W3,D2,L1,V0,M1} { ! subset( skol3, skol4 ) }.
% 0.44/1.07 parent0[0]: (6) {G0,W6,D4,L1,V0,M1} I { ! subset( skol3, set_difference(
% 0.44/1.07 skol4, singleton( skol5 ) ) ) }.
% 0.44/1.07 parent1[0]: (10) {G1,W9,D4,L2,V1,M2} R(7,5) { subset( skol3, set_difference
% 0.44/1.07 ( X, singleton( skol5 ) ) ), ! subset( skol3, X ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 X := skol4
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 resolution: (38) {G1,W0,D0,L0,V0,M0} { }.
% 0.44/1.07 parent0[0]: (37) {G1,W3,D2,L1,V0,M1} { ! subset( skol3, skol4 ) }.
% 0.44/1.07 parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { subset( skol3, skol4 ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (22) {G2,W0,D0,L0,V0,M0} R(10,6);r(4) { }.
% 0.44/1.07 parent0: (38) {G1,W0,D0,L0,V0,M0} { }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 Proof check complete!
% 0.44/1.07
% 0.44/1.07 Memory use:
% 0.44/1.07
% 0.44/1.07 space for terms: 313
% 0.44/1.07 space for clauses: 1389
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 clauses generated: 27
% 0.44/1.07 clauses kept: 23
% 0.44/1.07 clauses selected: 14
% 0.44/1.07 clauses deleted: 0
% 0.44/1.07 clauses inuse deleted: 0
% 0.44/1.07
% 0.44/1.07 subsentry: 21
% 0.44/1.07 literals s-matched: 11
% 0.44/1.07 literals matched: 11
% 0.44/1.07 full subsumption: 0
% 0.44/1.07
% 0.44/1.07 checksum: 1409258298
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Bliksem ended
%------------------------------------------------------------------------------