TSTP Solution File: SET590+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET590+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:30 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.07/0.12 % Problem : SET590+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.33 % Computer : n027.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:23:32 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 { ! member( Z, difference( X, Y ) ), member( Z, X ) }.
% 0.44/1.07 { ! member( Z, difference( X, Y ) ), ! member( Z, Y ) }.
% 0.44/1.07 { ! member( Z, X ), member( Z, Y ), member( Z, difference( X, Y ) ) }.
% 0.44/1.07 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.44/1.07 { ! member( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.44/1.07 { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.44/1.07 { subset( X, X ) }.
% 0.44/1.07 { ! subset( difference( skol2, skol3 ), skol2 ) }.
% 0.44/1.07
% 0.44/1.07 percentage equality = 0.000000, percentage horn = 0.750000
% 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:16, a:1, s:1, b:0),
% 0.44/1.07 ! [4, 1] (w:0, o:11, 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 difference [38, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.44/1.07 member [39, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.44/1.07 subset [40, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.44/1.07 skol1 [41, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.44/1.07 skol2 [42, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.44/1.07 skol3 [43, 0] (w:1, o:10, 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 (0) {G0,W8,D3,L2,V3,M2} I { member( Z, X ), ! member( Z, difference( X, Y )
% 0.44/1.07 ) }.
% 0.44/1.07 (4) {G0,W8,D3,L2,V3,M1} I { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.44/1.07 }.
% 0.44/1.07 (5) {G0,W8,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.44/1.07 (7) {G0,W5,D3,L1,V0,M1} I { ! subset( difference( skol2, skol3 ), skol2 )
% 0.44/1.07 }.
% 0.44/1.07 (8) {G1,W5,D3,L1,V1,M1} R(4,7) { ! member( skol1( X, skol2 ), skol2 ) }.
% 0.44/1.07 (12) {G2,W7,D3,L1,V2,M1} R(0,8) { ! member( skol1( X, skol2 ), difference(
% 0.44/1.07 skol2, Y ) ) }.
% 0.44/1.07 (17) {G3,W0,D0,L0,V0,M0} R(5,7);r(12) { }.
% 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 (19) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), member( Z, X
% 0.44/1.07 ) }.
% 0.44/1.07 (20) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ), ! member( Z
% 0.44/1.07 , Y ) }.
% 0.44/1.07 (21) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), member( Z, Y ), member( Z,
% 0.44/1.07 difference( X, Y ) ) }.
% 0.44/1.07 (22) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z,
% 0.44/1.07 Y ) }.
% 0.44/1.07 (23) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset( X, Y )
% 0.44/1.07 }.
% 0.44/1.07 (24) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.44/1.07 (25) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.44/1.07 (26) {G0,W5,D3,L1,V0,M1} { ! subset( difference( skol2, skol3 ), skol2 )
% 0.44/1.07 }.
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Total Proof:
% 0.44/1.07
% 0.44/1.07 subsumption: (0) {G0,W8,D3,L2,V3,M2} I { member( Z, X ), ! member( Z,
% 0.44/1.07 difference( X, Y ) ) }.
% 0.44/1.07 parent0: (19) {G0,W8,D3,L2,V3,M2} { ! member( Z, difference( X, Y ) ),
% 0.44/1.07 member( Z, X ) }.
% 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 ==> 1
% 0.44/1.07 1 ==> 0
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (4) {G0,W8,D3,L2,V3,M1} I { ! member( skol1( Z, Y ), Y ),
% 0.44/1.07 subset( X, Y ) }.
% 0.44/1.07 parent0: (23) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subset(
% 0.44/1.07 X, Y ) }.
% 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 ==> 1
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (5) {G0,W8,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), subset
% 0.44/1.07 ( X, Y ) }.
% 0.44/1.07 parent0: (24) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subset( X
% 0.44/1.07 , Y ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 X := X
% 0.44/1.07 Y := Y
% 0.44/1.07 end
% 0.44/1.07 permutation0:
% 0.44/1.07 0 ==> 0
% 0.44/1.07 1 ==> 1
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (7) {G0,W5,D3,L1,V0,M1} I { ! subset( difference( skol2, skol3
% 0.44/1.07 ), skol2 ) }.
% 0.44/1.07 parent0: (26) {G0,W5,D3,L1,V0,M1} { ! subset( difference( skol2, skol3 ),
% 0.44/1.07 skol2 ) }.
% 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 resolution: (27) {G1,W5,D3,L1,V1,M1} { ! member( skol1( X, skol2 ), skol2
% 0.44/1.07 ) }.
% 0.44/1.07 parent0[0]: (7) {G0,W5,D3,L1,V0,M1} I { ! subset( difference( skol2, skol3
% 0.44/1.07 ), skol2 ) }.
% 0.44/1.07 parent1[1]: (4) {G0,W8,D3,L2,V3,M1} I { ! member( skol1( Z, Y ), Y ),
% 0.44/1.07 subset( X, Y ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 X := difference( skol2, skol3 )
% 0.44/1.07 Y := skol2
% 0.44/1.07 Z := X
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (8) {G1,W5,D3,L1,V1,M1} R(4,7) { ! member( skol1( X, skol2 ),
% 0.44/1.07 skol2 ) }.
% 0.44/1.07 parent0: (27) {G1,W5,D3,L1,V1,M1} { ! member( skol1( X, skol2 ), skol2 )
% 0.44/1.07 }.
% 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 ==> 0
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 resolution: (28) {G1,W7,D3,L1,V2,M1} { ! member( skol1( X, skol2 ),
% 0.44/1.07 difference( skol2, Y ) ) }.
% 0.44/1.07 parent0[0]: (8) {G1,W5,D3,L1,V1,M1} R(4,7) { ! member( skol1( X, skol2 ),
% 0.44/1.07 skol2 ) }.
% 0.44/1.07 parent1[0]: (0) {G0,W8,D3,L2,V3,M2} I { member( Z, X ), ! member( Z,
% 0.44/1.07 difference( X, Y ) ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 X := X
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 X := skol2
% 0.44/1.07 Y := Y
% 0.44/1.07 Z := skol1( X, skol2 )
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (12) {G2,W7,D3,L1,V2,M1} R(0,8) { ! member( skol1( X, skol2 )
% 0.44/1.07 , difference( skol2, Y ) ) }.
% 0.44/1.07 parent0: (28) {G1,W7,D3,L1,V2,M1} { ! member( skol1( X, skol2 ),
% 0.44/1.07 difference( skol2, Y ) ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 X := X
% 0.44/1.07 Y := Y
% 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 resolution: (29) {G1,W9,D4,L1,V0,M1} { member( skol1( difference( skol2,
% 0.44/1.07 skol3 ), skol2 ), difference( skol2, skol3 ) ) }.
% 0.44/1.07 parent0[0]: (7) {G0,W5,D3,L1,V0,M1} I { ! subset( difference( skol2, skol3
% 0.44/1.07 ), skol2 ) }.
% 0.44/1.07 parent1[1]: (5) {G0,W8,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), subset
% 0.44/1.07 ( X, Y ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 X := difference( skol2, skol3 )
% 0.44/1.07 Y := skol2
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 resolution: (30) {G2,W0,D0,L0,V0,M0} { }.
% 0.44/1.07 parent0[0]: (12) {G2,W7,D3,L1,V2,M1} R(0,8) { ! member( skol1( X, skol2 ),
% 0.44/1.07 difference( skol2, Y ) ) }.
% 0.44/1.07 parent1[0]: (29) {G1,W9,D4,L1,V0,M1} { member( skol1( difference( skol2,
% 0.44/1.07 skol3 ), skol2 ), difference( skol2, skol3 ) ) }.
% 0.44/1.07 substitution0:
% 0.44/1.07 X := difference( skol2, skol3 )
% 0.44/1.07 Y := skol3
% 0.44/1.07 end
% 0.44/1.07 substitution1:
% 0.44/1.07 end
% 0.44/1.07
% 0.44/1.07 subsumption: (17) {G3,W0,D0,L0,V0,M0} R(5,7);r(12) { }.
% 0.44/1.07 parent0: (30) {G2,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: 296
% 0.44/1.07 space for clauses: 1028
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 clauses generated: 19
% 0.44/1.07 clauses kept: 18
% 0.44/1.07 clauses selected: 10
% 0.44/1.07 clauses deleted: 0
% 0.44/1.07 clauses inuse deleted: 0
% 0.44/1.07
% 0.44/1.07 subsentry: 30
% 0.44/1.07 literals s-matched: 10
% 0.44/1.07 literals matched: 10
% 0.44/1.07 full subsumption: 3
% 0.44/1.07
% 0.44/1.07 checksum: 1344538464
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Bliksem ended
%------------------------------------------------------------------------------