TSTP Solution File: SET923+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET923+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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:22 EDT 2022
% Result : Theorem 0.71s 1.08s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET923+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : bliksem %s
% 0.12/0.33 % Computer : n013.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 : Mon Jul 11 09:13:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.08 *** allocated 10000 integers for termspace/termends
% 0.71/1.08 *** allocated 10000 integers for clauses
% 0.71/1.08 *** allocated 10000 integers for justifications
% 0.71/1.08 Bliksem 1.12
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Automatic Strategy Selection
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Clauses:
% 0.71/1.08
% 0.71/1.08 { empty( empty_set ) }.
% 0.71/1.08 { ! subset( X, singleton( Y ) ), X = empty_set, X = singleton( Y ) }.
% 0.71/1.08 { ! X = empty_set, subset( X, singleton( Y ) ) }.
% 0.71/1.08 { ! X = singleton( Y ), subset( X, singleton( Y ) ) }.
% 0.71/1.08 { empty( skol1 ) }.
% 0.71/1.08 { ! empty( skol2 ) }.
% 0.71/1.08 { subset( X, X ) }.
% 0.71/1.08 { ! set_difference( X, Y ) = empty_set, subset( X, Y ) }.
% 0.71/1.08 { ! subset( X, Y ), set_difference( X, Y ) = empty_set }.
% 0.71/1.08 { set_difference( skol3, singleton( skol4 ) ) = empty_set }.
% 0.71/1.08 { ! skol3 = empty_set }.
% 0.71/1.08 { ! skol3 = singleton( skol4 ) }.
% 0.71/1.08
% 0.71/1.08 percentage equality = 0.500000, percentage horn = 0.916667
% 0.71/1.08 This is a problem with some equality
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Options Used:
% 0.71/1.08
% 0.71/1.08 useres = 1
% 0.71/1.08 useparamod = 1
% 0.71/1.08 useeqrefl = 1
% 0.71/1.08 useeqfact = 1
% 0.71/1.08 usefactor = 1
% 0.71/1.08 usesimpsplitting = 0
% 0.71/1.08 usesimpdemod = 5
% 0.71/1.08 usesimpres = 3
% 0.71/1.08
% 0.71/1.08 resimpinuse = 1000
% 0.71/1.08 resimpclauses = 20000
% 0.71/1.08 substype = eqrewr
% 0.71/1.08 backwardsubs = 1
% 0.71/1.08 selectoldest = 5
% 0.71/1.08
% 0.71/1.08 litorderings [0] = split
% 0.71/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.08
% 0.71/1.08 termordering = kbo
% 0.71/1.08
% 0.71/1.08 litapriori = 0
% 0.71/1.08 termapriori = 1
% 0.71/1.08 litaposteriori = 0
% 0.71/1.08 termaposteriori = 0
% 0.71/1.08 demodaposteriori = 0
% 0.71/1.08 ordereqreflfact = 0
% 0.71/1.08
% 0.71/1.08 litselect = negord
% 0.71/1.08
% 0.71/1.08 maxweight = 15
% 0.71/1.08 maxdepth = 30000
% 0.71/1.08 maxlength = 115
% 0.71/1.08 maxnrvars = 195
% 0.71/1.08 excuselevel = 1
% 0.71/1.08 increasemaxweight = 1
% 0.71/1.08
% 0.71/1.08 maxselected = 10000000
% 0.71/1.08 maxnrclauses = 10000000
% 0.71/1.08
% 0.71/1.08 showgenerated = 0
% 0.71/1.08 showkept = 0
% 0.71/1.08 showselected = 0
% 0.71/1.08 showdeleted = 0
% 0.71/1.08 showresimp = 1
% 0.71/1.08 showstatus = 2000
% 0.71/1.08
% 0.71/1.08 prologoutput = 0
% 0.71/1.08 nrgoals = 5000000
% 0.71/1.08 totalproof = 1
% 0.71/1.08
% 0.71/1.08 Symbols occurring in the translation:
% 0.71/1.08
% 0.71/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.08 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.08 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.71/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.08 empty_set [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.71/1.08 empty [36, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.08 singleton [39, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.08 subset [40, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.71/1.08 set_difference [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.71/1.08 skol1 [42, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.71/1.08 skol2 [43, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.71/1.08 skol3 [44, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.71/1.08 skol4 [45, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Starting Search:
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Bliksems!, er is een bewijs:
% 0.71/1.08 % SZS status Theorem
% 0.71/1.08 % SZS output start Refutation
% 0.71/1.08
% 0.71/1.08 (1) {G0,W11,D3,L3,V2,M3} I { ! subset( X, singleton( Y ) ), X = empty_set,
% 0.71/1.08 X = singleton( Y ) }.
% 0.71/1.08 (7) {G0,W8,D3,L2,V2,M2} I { ! set_difference( X, Y ) ==> empty_set, subset
% 0.71/1.08 ( X, Y ) }.
% 0.71/1.08 (9) {G0,W6,D4,L1,V0,M1} I { set_difference( skol3, singleton( skol4 ) ) ==>
% 0.71/1.08 empty_set }.
% 0.71/1.08 (10) {G0,W3,D2,L1,V0,M1} I { ! skol3 ==> empty_set }.
% 0.71/1.08 (11) {G0,W4,D3,L1,V0,M1} I { ! singleton( skol4 ) ==> skol3 }.
% 0.71/1.08 (33) {G1,W10,D3,L3,V1,M3} P(1,11) { ! X = skol3, ! subset( X, singleton(
% 0.71/1.08 skol4 ) ), X = empty_set }.
% 0.71/1.08 (35) {G2,W7,D3,L2,V0,M2} Q(33) { ! subset( skol3, singleton( skol4 ) ),
% 0.71/1.08 skol3 ==> empty_set }.
% 0.71/1.08 (45) {G3,W4,D3,L1,V0,M1} S(35);r(10) { ! subset( skol3, singleton( skol4 )
% 0.71/1.08 ) }.
% 0.71/1.08 (55) {G4,W0,D0,L0,V0,M0} R(7,45);d(9);q { }.
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 % SZS output end Refutation
% 0.71/1.08 found a proof!
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Unprocessed initial clauses:
% 0.71/1.08
% 0.71/1.08 (57) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.71/1.08 (58) {G0,W11,D3,L3,V2,M3} { ! subset( X, singleton( Y ) ), X = empty_set,
% 0.71/1.08 X = singleton( Y ) }.
% 0.71/1.08 (59) {G0,W7,D3,L2,V2,M2} { ! X = empty_set, subset( X, singleton( Y ) )
% 0.71/1.08 }.
% 0.71/1.08 (60) {G0,W8,D3,L2,V2,M2} { ! X = singleton( Y ), subset( X, singleton( Y )
% 0.71/1.08 ) }.
% 0.71/1.08 (61) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.71/1.08 (62) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.71/1.08 (63) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.71/1.08 (64) {G0,W8,D3,L2,V2,M2} { ! set_difference( X, Y ) = empty_set, subset( X
% 0.71/1.08 , Y ) }.
% 0.71/1.08 (65) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), set_difference( X, Y ) =
% 0.71/1.08 empty_set }.
% 0.71/1.08 (66) {G0,W6,D4,L1,V0,M1} { set_difference( skol3Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------