TSTP Solution File: SET583+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET583+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n025.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:50:26 EDT 2022
% Result : Theorem 0.73s 1.14s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET583+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Sat Jul 9 16:41:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.14 *** allocated 10000 integers for termspace/termends
% 0.73/1.14 *** allocated 10000 integers for clauses
% 0.73/1.14 *** allocated 10000 integers for justifications
% 0.73/1.14 Bliksem 1.12
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 Automatic Strategy Selection
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 Clauses:
% 0.73/1.14
% 0.73/1.14 { ! X = Y, subset( X, Y ) }.
% 0.73/1.14 { ! X = Y, subset( Y, X ) }.
% 0.73/1.14 { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.73/1.14 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.73/1.14 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.73/1.14 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.73/1.14 { subset( X, X ) }.
% 0.73/1.14 { subset( skol2, skol3 ) }.
% 0.73/1.14 { subset( skol3, skol2 ) }.
% 0.73/1.14 { ! skol2 = skol3 }.
% 0.73/1.14
% 0.73/1.14 percentage equality = 0.222222, percentage horn = 0.900000
% 0.73/1.14 This is a problem with some equality
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 Options Used:
% 0.73/1.14
% 0.73/1.14 useres = 1
% 0.73/1.14 useparamod = 1
% 0.73/1.14 useeqrefl = 1
% 0.73/1.14 useeqfact = 1
% 0.73/1.14 usefactor = 1
% 0.73/1.14 usesimpsplitting = 0
% 0.73/1.14 usesimpdemod = 5
% 0.73/1.14 usesimpres = 3
% 0.73/1.14
% 0.73/1.14 resimpinuse = 1000
% 0.73/1.14 resimpclauses = 20000
% 0.73/1.14 substype = eqrewr
% 0.73/1.14 backwardsubs = 1
% 0.73/1.14 selectoldest = 5
% 0.73/1.14
% 0.73/1.14 litorderings [0] = split
% 0.73/1.14 litorderings [1] = extend the termordering, first sorting on arguments
% 0.73/1.14
% 0.73/1.14 termordering = kbo
% 0.73/1.14
% 0.73/1.14 litapriori = 0
% 0.73/1.14 termapriori = 1
% 0.73/1.14 litaposteriori = 0
% 0.73/1.14 termaposteriori = 0
% 0.73/1.14 demodaposteriori = 0
% 0.73/1.14 ordereqreflfact = 0
% 0.73/1.14
% 0.73/1.14 litselect = negord
% 0.73/1.14
% 0.73/1.14 maxweight = 15
% 0.73/1.14 maxdepth = 30000
% 0.73/1.14 maxlength = 115
% 0.73/1.14 maxnrvars = 195
% 0.73/1.14 excuselevel = 1
% 0.73/1.14 increasemaxweight = 1
% 0.73/1.14
% 0.73/1.14 maxselected = 10000000
% 0.73/1.14 maxnrclauses = 10000000
% 0.73/1.14
% 0.73/1.14 showgenerated = 0
% 0.73/1.14 showkept = 0
% 0.73/1.14 showselected = 0
% 0.73/1.14 showdeleted = 0
% 0.73/1.14 showresimp = 1
% 0.73/1.14 showstatus = 2000
% 0.73/1.14
% 0.73/1.14 prologoutput = 0
% 0.73/1.14 nrgoals = 5000000
% 0.73/1.14 totalproof = 1
% 0.73/1.14
% 0.73/1.14 Symbols occurring in the translation:
% 0.73/1.14
% 0.73/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.14 . [1, 2] (w:1, o:16, a:1, s:1, b:0),
% 0.73/1.14 ! [4, 1] (w:0, o:11, a:1, s:1, b:0),
% 0.73/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.14 subset [37, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.73/1.14 member [39, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.73/1.14 skol1 [40, 2] (w:1, o:42, a:1, s:1, b:1),
% 0.73/1.14 skol2 [41, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.73/1.14 skol3 [42, 0] (w:1, o:10, a:1, s:1, b:1).
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 Starting Search:
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 Bliksems!, er is een bewijs:
% 0.73/1.14 % SZS status Theorem
% 0.73/1.14 % SZS output start Refutation
% 0.73/1.14
% 0.73/1.14 (0) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.73/1.14 (1) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.73/1.14 (5) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.73/1.14 (6) {G0,W3,D2,L1,V0,M1} I { subset( skol2, skol3 ) }.
% 0.73/1.14 (7) {G0,W3,D2,L1,V0,M1} I { subset( skol3, skol2 ) }.
% 0.73/1.14 (8) {G0,W3,D2,L1,V0,M1} I { ! skol3 ==> skol2 }.
% 0.73/1.14 (10) {G1,W3,D2,L1,V0,M1} R(1,6);r(7) { skol3 ==> skol2 }.
% 0.73/1.14 (12) {G2,W6,D2,L2,V1,M2} P(1,8);d(10);d(10);r(0) { ! X = skol2, ! subset(
% 0.73/1.14 skol2, X ) }.
% 0.73/1.14 (13) {G3,W0,D0,L0,V0,M0} Q(12);r(5) { }.
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 % SZS output end Refutation
% 0.73/1.14 found a proof!
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 Unprocessed initial clauses:
% 0.73/1.14
% 0.73/1.14 (15) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.73/1.14 (16) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( Y, X ) }.
% 0.73/1.14 (17) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), X = Y }.
% 0.73/1.14 (18) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.73/1.14 Y ) }.
% 0.73/1.14 (19) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.73/1.14 }.
% 0.73/1.14 (20) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.73/1.14 (21) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.73/1.14 (22) {G0,W3,D2,L1,V0,M1} { subset( skol2, skol3 ) }.
% 0.73/1.14 (23) {G0,W3,D2,L1,V0,M1} { subset( skol3, skol2 ) }.
% 0.73/1.14 (24) {G0,W3,D2,L1,V0,M1} { ! skol2 = skol3 }.
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 Total Proof:
% 0.73/1.14
% 0.73/1.14 subsumption: (0) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subset( X, Y ) }.
% 0.73/1.14 parent0: (15) {G0,W6,D2,L2,V2,M2} { ! X = Y, subset( X, Y ) }.
% 0.73/1.14 substitution0:
% 0.73/1.14 X := X
% 0.73/1.14 Y := Y
% 0.73/1.14 end
% 0.73/1.14 permutation0:
% 0.73/1.14 0 ==> 0
% 0.73/1.14 1 ==> 1
% 0.73/1.14 end
% 0.73/1.14
% 0.73/1.14 subsumption: (1) {G0,W9,D2,L3,V2,M3} I { ! subset( X, Y ), ! subset( Y, X )
% 0.73/1.14 , X = Y }.
% 0.73/1.14 parent0: (17) {G0,W9,D2,L3,V2,M3} { ! subset( X, Y ), ! subset( Y, X ), X
% 0.73/1.14 = Y }.
% 0.73/1.14 substitution0:
% 0.73/1.14 X := X
% 0.73/1.14 Y := Y
% 0.73/1.14 end
% 0.73/1.14 permutation0:
% 0.73/1.14 0 ==> 0
% 0.73/1.14 1 ==> 1
% 0.73/1.14 2 ==> 2
% 0.73/1.14 end
% 0.73/1.14
% 0.73/1.14 subsumption: (5) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.73/1.14 parent0: (21) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.73/1.14 substiCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------