TSTP Solution File: SEU123+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU123+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n004.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 : Tue Jul 19 07:10:44 EDT 2022
% Result : Theorem 0.70s 1.09s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU123+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n004.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 : Mon Jun 20 05:34:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.09 *** allocated 10000 integers for termspace/termends
% 0.70/1.09 *** allocated 10000 integers for clauses
% 0.70/1.09 *** allocated 10000 integers for justifications
% 0.70/1.09 Bliksem 1.12
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Automatic Strategy Selection
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Clauses:
% 0.70/1.09
% 0.70/1.09 { ! in( X, Y ), ! in( Y, X ) }.
% 0.70/1.09 { ! X = Y, subset( X, Y ) }.
% 0.70/1.09 { ! X = Y, subset( Y, X ) }.
% 0.70/1.09 { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.70/1.09 { && }.
% 0.70/1.09 { empty( empty_set ) }.
% 0.70/1.09 { empty( skol1 ) }.
% 0.70/1.09 { ! empty( skol2 ) }.
% 0.70/1.09 { subset( X, X ) }.
% 0.70/1.09 { subset( empty_set, X ) }.
% 0.70/1.09 { subset( skol3, empty_set ) }.
% 0.70/1.09 { ! skol3 = empty_set }.
% 0.70/1.09 { ! empty( X ), X = empty_set }.
% 0.70/1.09 { ! in( X, Y ), ! empty( Y ) }.
% 0.70/1.09 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.70/1.09
% 0.70/1.09 percentage equality = 0.250000, percentage horn = 1.000000
% 0.70/1.09 This is a problem with some equality
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Options Used:
% 0.70/1.09
% 0.70/1.09 useres = 1
% 0.70/1.09 useparamod = 1
% 0.70/1.09 useeqrefl = 1
% 0.70/1.09 useeqfact = 1
% 0.70/1.09 usefactor = 1
% 0.70/1.09 usesimpsplitting = 0
% 0.70/1.09 usesimpdemod = 5
% 0.70/1.09 usesimpres = 3
% 0.70/1.09
% 0.70/1.09 resimpinuse = 1000
% 0.70/1.09 resimpclauses = 20000
% 0.70/1.09 substype = eqrewr
% 0.70/1.09 backwardsubs = 1
% 0.70/1.09 selectoldest = 5
% 0.70/1.09
% 0.70/1.09 litorderings [0] = split
% 0.70/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.09
% 0.70/1.09 termordering = kbo
% 0.70/1.09
% 0.70/1.09 litapriori = 0
% 0.70/1.09 termapriori = 1
% 0.70/1.09 litaposteriori = 0
% 0.70/1.09 termaposteriori = 0
% 0.70/1.09 demodaposteriori = 0
% 0.70/1.09 ordereqreflfact = 0
% 0.70/1.09
% 0.70/1.09 litselect = negord
% 0.70/1.09
% 0.70/1.09 maxweight = 15
% 0.70/1.09 maxdepth = 30000
% 0.70/1.09 maxlength = 115
% 0.70/1.09 maxnrvars = 195
% 0.70/1.09 excuselevel = 1
% 0.70/1.09 increasemaxweight = 1
% 0.70/1.09
% 0.70/1.09 maxselected = 10000000
% 0.70/1.09 maxnrclauses = 10000000
% 0.70/1.09
% 0.70/1.09 showgenerated = 0
% 0.70/1.09 showkept = 0
% 0.70/1.09 showselected = 0
% 0.70/1.09 showdeleted = 0
% 0.70/1.09 showresimp = 1
% 0.70/1.09 showstatus = 2000
% 0.70/1.09
% 0.70/1.09 prologoutput = 0
% 0.70/1.09 nrgoals = 5000000
% 0.70/1.09 totalproof = 1
% 0.70/1.09
% 0.70/1.09 Symbols occurring in the translation:
% 0.70/1.09
% 0.70/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.09 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.70/1.09 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.70/1.09 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.70/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 in [37, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.70/1.09 subset [38, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.70/1.09 empty_set [39, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.70/1.09 empty [40, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.70/1.09 skol1 [41, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.70/1.09 skol2 [42, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.70/1.09 skol3 [43, 0] (w:1, o:11, a:1, s:1, b:1).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Starting Search:
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksems!, er is een bewijs:
% 0.70/1.09 % SZS status Theorem
% 0.70/1.09 % SZS output start Refutation
% 0.70/1.09
% 0.70/1.09 (1) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.70/1.09 (2) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.70/1.09 (7) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.70/1.09 (8) {G0,W3,D2,L1,V1,M1} I { subset( empty_set, X ) }.
% 0.70/1.09 (9) {G0,W3,D2,L1,V0,M1} I { subset( skol3, empty_set ) }.
% 0.70/1.09 (10) {G0,W3,D2,L1,V0,M1} I { ! skol3 ==> empty_set }.
% 0.70/1.09 (23) {G1,W3,D2,L1,V0,M1} R(2,9);r(8) { skol3 ==> empty_set }.
% 0.70/1.09 (28) {G2,W6,D2,L2,V1,M2} P(2,10);d(23);d(23);r(1) { ! X = empty_set, !
% 0.70/1.09 subset( empty_set, X ) }.
% 0.70/1.09 (32) {G3,W0,D0,L0,V0,M0} Q(28);r(7) { }.
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 % SZS output end Refutation
% 0.70/1.09 found a proof!
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Unprocessed initial clauses:
% 0.70/1.09
% 0.70/1.09 (34) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.70/1.09 (35) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.70/1.09 (36) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( Y, X ) }.
% 0.70/1.09 (37) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.70/1.09 (38) {G0,W1,D1,L1,V0,M1} { && }.
% 0.70/1.09 (39) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.70/1.09 (40) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.70/1.09 (41) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.70/1.09 (42) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.70/1.09 (43) {G0,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 0.70/1.09 (44) {G0,W3,D2,L1,V0,M1} { subset( skol3, empty_set ) }.
% 0.70/1.09 (45) {G0,W3,D2,L1,V0,M1} { ! skol3 = empty_set }.
% 0.70/1.09 (46) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.70/1.09 (47) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.70/1.09 (48) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Total Proof:
% 0.70/1.09
% 0.70/1.09 subsumption: (1) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.70/1.09 parent0: (35) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutationCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------