TSTP Solution File: SET063+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET063+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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:46:22 EDT 2022
% Result : Theorem 0.41s 1.08s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET063+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n011.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 : Sun Jul 10 21:41:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.08 *** allocated 10000 integers for termspace/termends
% 0.41/1.08 *** allocated 10000 integers for clauses
% 0.41/1.08 *** allocated 10000 integers for justifications
% 0.41/1.08 Bliksem 1.12
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 Automatic Strategy Selection
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 Clauses:
% 0.41/1.08
% 0.41/1.08 { subset( empty_set, X ) }.
% 0.41/1.08 { ! member( X, empty_set ) }.
% 0.41/1.08 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.41/1.08 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.41/1.08 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.41/1.08 { ! X = Y, subset( X, Y ) }.
% 0.41/1.08 { ! X = Y, subset( Y, X ) }.
% 0.41/1.08 { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.41/1.08 { subset( X, X ) }.
% 0.41/1.08 { ! empty( X ), ! member( Y, X ) }.
% 0.41/1.08 { member( skol2( X ), X ), empty( X ) }.
% 0.41/1.08 { subset( skol3, empty_set ) }.
% 0.41/1.08 { ! skol3 = empty_set }.
% 0.41/1.08
% 0.41/1.08 percentage equality = 0.173913, percentage horn = 0.846154
% 0.41/1.08 This is a problem with some equality
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 Options Used:
% 0.41/1.08
% 0.41/1.08 useres = 1
% 0.41/1.08 useparamod = 1
% 0.41/1.08 useeqrefl = 1
% 0.41/1.08 useeqfact = 1
% 0.41/1.08 usefactor = 1
% 0.41/1.08 usesimpsplitting = 0
% 0.41/1.08 usesimpdemod = 5
% 0.41/1.08 usesimpres = 3
% 0.41/1.08
% 0.41/1.08 resimpinuse = 1000
% 0.41/1.08 resimpclauses = 20000
% 0.41/1.08 substype = eqrewr
% 0.41/1.08 backwardsubs = 1
% 0.41/1.08 selectoldest = 5
% 0.41/1.08
% 0.41/1.08 litorderings [0] = split
% 0.41/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.41/1.08
% 0.41/1.08 termordering = kbo
% 0.41/1.08
% 0.41/1.08 litapriori = 0
% 0.41/1.08 termapriori = 1
% 0.41/1.08 litaposteriori = 0
% 0.41/1.08 termaposteriori = 0
% 0.41/1.08 demodaposteriori = 0
% 0.41/1.08 ordereqreflfact = 0
% 0.41/1.08
% 0.41/1.08 litselect = negord
% 0.41/1.08
% 0.41/1.08 maxweight = 15
% 0.41/1.08 maxdepth = 30000
% 0.41/1.08 maxlength = 115
% 0.41/1.08 maxnrvars = 195
% 0.41/1.08 excuselevel = 1
% 0.41/1.08 increasemaxweight = 1
% 0.41/1.08
% 0.41/1.08 maxselected = 10000000
% 0.41/1.08 maxnrclauses = 10000000
% 0.41/1.08
% 0.41/1.08 showgenerated = 0
% 0.41/1.08 showkept = 0
% 0.41/1.08 showselected = 0
% 0.41/1.08 showdeleted = 0
% 0.41/1.08 showresimp = 1
% 0.41/1.08 showstatus = 2000
% 0.41/1.08
% 0.41/1.08 prologoutput = 0
% 0.41/1.08 nrgoals = 5000000
% 0.41/1.08 totalproof = 1
% 0.41/1.08
% 0.41/1.08 Symbols occurring in the translation:
% 0.41/1.08
% 0.41/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.08 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.41/1.08 ! [4, 1] (w:0, o:11, a:1, s:1, b:0),
% 0.41/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.08 empty_set [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.41/1.08 subset [37, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.41/1.08 member [38, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.41/1.08 empty [41, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.41/1.08 skol1 [42, 2] (w:1, o:44, a:1, s:1, b:1),
% 0.41/1.08 skol2 [43, 1] (w:1, o:17, a:1, s:1, b:1),
% 0.41/1.08 skol3 [44, 0] (w:1, o:10, a:1, s:1, b:1).
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 Starting Search:
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 Bliksems!, er is een bewijs:
% 0.41/1.08 % SZS status Theorem
% 0.41/1.08 % SZS output start Refutation
% 0.41/1.08
% 0.41/1.08 (0) {G0,W3,D2,L1,V1,M1} I { subset( empty_set, X ) }.
% 0.41/1.08 (5) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.41/1.08 (6) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.41/1.08 (10) {G0,W3,D2,L1,V0,M1} I { subset( skol3, empty_set ) }.
% 0.41/1.08 (11) {G0,W3,D2,L1,V0,M1} I { ! skol3 ==> empty_set }.
% 0.41/1.08 (50) {G1,W3,D2,L1,V0,M1} R(6,10);r(0) { skol3 ==> empty_set }.
% 0.41/1.08 (57) {G2,W6,D2,L2,V1,M2} P(6,11);d(50);d(50);r(5) { ! X = empty_set, !
% 0.41/1.08 subset( empty_set, X ) }.
% 0.41/1.08 (58) {G3,W0,D0,L0,V0,M0} Q(57);r(0) { }.
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 % SZS output end Refutation
% 0.41/1.08 found a proof!
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 Unprocessed initial clauses:
% 0.41/1.08
% 0.41/1.08 (60) {G0,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 0.41/1.08 (61) {G0,W3,D2,L1,V1,M1} { ! member( X, empty_set ) }.
% 0.41/1.08 (62) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.41/1.08 Y ) }.
% 0.41/1.08 (63) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.41/1.08 }.
% 0.41/1.08 (64) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.41/1.08 (65) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.41/1.08 (66) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( Y, X ) }.
% 0.41/1.08 (67) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.41/1.08 (68) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.41/1.08 (69) {G0,W5,D2,L2,V2,M2} { ! empty( X ), ! member( Y, X ) }.
% 0.41/1.08 (70) {G0,W6,D3,L2,V1,M2} { member( skol2( X ), X ), empty( X ) }.
% 0.41/1.08 (71) {G0,W3,D2,L1,V0,M1} { subset( skol3, empty_set ) }.
% 0.41/1.08 (72) {G0,W3,D2,L1,V0,M1} { ! skol3 = empty_set }.
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 Total Proof:
% 0.41/1.08
% 0.41/1.08 subsumption: (0) {G0,W3,D2,L1,V1,M1} I { subset( empty_set, X ) }.
% 0.41/1.08 parent0: (60) {G0,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 0.41/1.08 substitution0:
% 0.41/1.08 X := X
% 0.41/1.08 end
% 0.41/1.08 permutation0:
% 0.41/1.08 0 ==> 0
% 0.41/1.08 end
% 0.41/1.08
% 0.41/1.08 subsumption: (5) {G0Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------