%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET575+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:22 EDT 2022
% Result : Theorem 0.49s 1.14s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET575+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.14 % Command : bliksem %s
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % DateTime : Sun Jul 10 14:34:37 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.49/1.14 *** allocated 10000 integers for termspace/termends
% 0.49/1.14 *** allocated 10000 integers for clauses
% 0.49/1.14 *** allocated 10000 integers for justifications
% 0.49/1.14 Bliksem 1.12
% 0.49/1.14
% 0.49/1.14
% 0.49/1.14 Automatic Strategy Selection
% 0.49/1.14
% 0.49/1.14
% 0.49/1.14 Clauses:
% 0.49/1.14
% 0.49/1.14 { ! intersect( X, Y ), member( skol1( Z, Y ), Y ) }.
% 0.49/1.14 { ! intersect( X, Y ), member( skol1( X, Y ), X ) }.
% 0.49/1.14 { ! member( Z, X ), ! member( Z, Y ), intersect( X, Y ) }.
% 0.49/1.14 { ! intersect( X, Y ), intersect( Y, X ) }.
% 0.49/1.14 { intersect( skol2, skol3 ) }.
% 0.49/1.14 { ! member( X, skol2 ), ! member( X, skol3 ) }.
% 0.49/1.14
% 0.49/1.14 percentage equality = 0.000000, percentage horn = 1.000000
% 0.49/1.14 This is a near-Horn, non-equality problem
% 0.49/1.14
% 0.49/1.14
% 0.49/1.14 Options Used:
% 0.49/1.14
% 0.49/1.14 useres = 1
% 0.49/1.14 useparamod = 0
% 0.49/1.14 useeqrefl = 0
% 0.49/1.14 useeqfact = 0
% 0.49/1.14 usefactor = 1
% 0.49/1.14 usesimpsplitting = 0
% 0.49/1.14 usesimpdemod = 0
% 0.49/1.14 usesimpres = 4
% 0.49/1.14
% 0.49/1.14 resimpinuse = 1000
% 0.49/1.14 resimpclauses = 20000
% 0.49/1.14 substype = standard
% 0.49/1.14 backwardsubs = 1
% 0.49/1.14 selectoldest = 5
% 0.49/1.14
% 0.49/1.14 litorderings [0] = split
% 0.49/1.14 litorderings [1] = liftord
% 0.49/1.14
% 0.49/1.14 termordering = none
% 0.49/1.14
% 0.49/1.14 litapriori = 1
% 0.49/1.14 termapriori = 0
% 0.49/1.14 litaposteriori = 0
% 0.49/1.14 termaposteriori = 0
% 0.49/1.14 demodaposteriori = 0
% 0.49/1.14 ordereqreflfact = 0
% 0.49/1.14
% 0.49/1.14 litselect = negative
% 0.49/1.14
% 0.49/1.14 maxweight = 30000
% 0.49/1.14 maxdepth = 30000
% 0.49/1.14 maxlength = 115
% 0.49/1.14 maxnrvars = 195
% 0.49/1.14 excuselevel = 0
% 0.49/1.14 increasemaxweight = 0
% 0.49/1.14
% 0.49/1.14 maxselected = 10000000
% 0.49/1.14 maxnrclauses = 10000000
% 0.49/1.14
% 0.49/1.14 showgenerated = 0
% 0.49/1.14 showkept = 0
% 0.49/1.14 showselected = 0
% 0.49/1.14 showdeleted = 0
% 0.49/1.14 showresimp = 1
% 0.49/1.14 showstatus = 2000
% 0.49/1.14
% 0.49/1.14 prologoutput = 0
% 0.49/1.14 nrgoals = 5000000
% 0.49/1.14 totalproof = 1
% 0.49/1.14
% 0.49/1.14 Symbols occurring in the translation:
% 0.49/1.14
% 0.49/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.49/1.14 . [1, 2] (w:1, o:16, a:1, s:1, b:0),
% 0.49/1.14 ! [4, 1] (w:1, o:11, a:1, s:1, b:0),
% 0.49/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.49/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.49/1.14 intersect [37, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.49/1.14 member [39, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.49/1.14 skol1 [40, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.49/1.14 skol2 [41, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.49/1.14 skol3 [42, 0] (w:1, o:10, a:1, s:1, b:0).
% 0.49/1.14
% 0.49/1.14
% 0.49/1.14 Starting Search:
% 0.49/1.14
% 0.49/1.14
% 0.49/1.14 Bliksems!, er is een bewijs:
% 0.49/1.14 % SZS status Theorem
% 0.49/1.14 % SZS output start Refutation
% 0.49/1.14
% 0.49/1.14 (0) {G0,W9,D3,L2,V3,M1} I { member( skol1( Z, Y ), Y ), ! intersect( X, Y )
% 0.49/1.14 }.
% 0.49/1.14 (1) {G0,W9,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), ! intersect( X, Y )
% 0.49/1.14 }.
% 0.49/1.14 (3) {G0,W7,D2,L2,V2,M1} I { intersect( Y, X ), ! intersect( X, Y ) }.
% 0.49/1.14 (4) {G0,W3,D2,L1,V0,M1} I { intersect( skol2, skol3 ) }.
% 0.49/1.14 (5) {G0,W8,D2,L2,V1,M1} I { ! member( X, skol3 ), ! member( X, skol2 ) }.
% 0.49/1.14 (7) {G1,W3,D2,L1,V0,M1} R(3,4) { intersect( skol3, skol2 ) }.
% 0.49/1.14 (8) {G2,W5,D3,L1,V1,M1} R(0,7) { member( skol1( X, skol2 ), skol2 ) }.
% 0.49/1.14 (10) {G3,W6,D3,L1,V1,M1} R(8,5) { ! member( skol1( X, skol2 ), skol3 ) }.
% 0.49/1.14 (13) {G4,W0,D0,L0,V0,M0} R(1,7);r(10) { }.
% 0.49/1.14
% 0.49/1.14
% 0.49/1.14 % SZS output end Refutation
% 0.49/1.14 found a proof!
% 0.49/1.14
% 0.49/1.14
% 0.49/1.14 Unprocessed initial clauses:
% 0.49/1.14
% 0.49/1.14 (15) {G0,W9,D3,L2,V3,M2} { ! intersect( X, Y ), member( skol1( Z, Y ), Y )
% 0.49/1.14 }.
% 0.49/1.14 (16) {G0,W9,D3,L2,V2,M2} { ! intersect( X, Y ), member( skol1( X, Y ), X )
% 0.49/1.14 }.
% 0.49/1.14 (17) {G0,W11,D2,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ), intersect
% 0.49/1.14 ( X, Y ) }.
% 0.49/1.14 (18) {G0,W7,D2,L2,V2,M2} { ! intersect( X, Y ), intersect( Y, X ) }.
% 0.49/1.14 (19) {G0,W3,D2,L1,V0,M1} { intersect( skol2, skol3 ) }.
% 0.49/1.14 (20) {G0,W8,D2,L2,V1,M2} { ! member( X, skol2 ), ! member( X, skol3 ) }.
% 0.49/1.14
% 0.49/1.14
% 0.49/1.14 Total Proof:
% 0.49/1.14
% 0.49/1.14 subsumption: (0) {G0,W9,D3,L2,V3,M1} I { member( skol1( Z, Y ), Y ), !
% 0.49/1.14 intersect( X, Y ) }.
% 0.49/1.14 parent0: (15) {G0,W9,D3,L2,V3,M2} { ! intersect( X, Y ), member( skol1( Z
% 0.49/1.14 , Y ), Y ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := X
% 0.49/1.14 Y := Y
% 0.49/1.14 Z := Z
% 0.49/1.14 end
% 0.49/1.14 permutation0:
% 0.49/1.14 0 ==> 1
% 0.49/1.14 1 ==> 0
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 subsumption: (1) {G0,W9,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), !
% 0.49/1.14 intersect( X, Y ) }.
% 0.49/1.14 parent0: (16) {G0,W9,D3,L2,V2,M2} { ! intersect( X, Y ), member( skol1( X
% 0.49/1.14 , Y ), X ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := X
% 0.49/1.14 Y := Y
% 0.49/1.14 end
% 0.49/1.14 permutation0:
% 0.49/1.14 0 ==> 1
% 0.49/1.14 1 ==> 0
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 subsumption: (3) {G0,W7,D2,L2,V2,M1} I { intersect( Y, X ), ! intersect( X
% 0.49/1.14 , Y ) }.
% 0.49/1.14 parent0: (18) {G0,W7,D2,L2,V2,M2} { ! intersect( X, Y ), intersect( Y, X )
% 0.49/1.14 }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := X
% 0.49/1.14 Y := Y
% 0.49/1.14 end
% 0.49/1.14 permutation0:
% 0.49/1.14 0 ==> 1
% 0.49/1.14 1 ==> 0
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 subsumption: (4) {G0,W3,D2,L1,V0,M1} I { intersect( skol2, skol3 ) }.
% 0.49/1.14 parent0: (19) {G0,W3,D2,L1,V0,M1} { intersect( skol2, skol3 ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 end
% 0.49/1.14 permutation0:
% 0.49/1.14 0 ==> 0
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 subsumption: (5) {G0,W8,D2,L2,V1,M1} I { ! member( X, skol3 ), ! member( X
% 0.49/1.14 , skol2 ) }.
% 0.49/1.14 parent0: (20) {G0,W8,D2,L2,V1,M2} { ! member( X, skol2 ), ! member( X,
% 0.49/1.14 skol3 ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := X
% 0.49/1.14 end
% 0.49/1.14 permutation0:
% 0.49/1.14 0 ==> 1
% 0.49/1.14 1 ==> 0
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 resolution: (24) {G1,W3,D2,L1,V0,M1} { intersect( skol3, skol2 ) }.
% 0.49/1.14 parent0[1]: (3) {G0,W7,D2,L2,V2,M1} I { intersect( Y, X ), ! intersect( X,
% 0.49/1.14 Y ) }.
% 0.49/1.14 parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { intersect( skol2, skol3 ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := skol2
% 0.49/1.14 Y := skol3
% 0.49/1.14 end
% 0.49/1.14 substitution1:
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 subsumption: (7) {G1,W3,D2,L1,V0,M1} R(3,4) { intersect( skol3, skol2 ) }.
% 0.49/1.14 parent0: (24) {G1,W3,D2,L1,V0,M1} { intersect( skol3, skol2 ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 end
% 0.49/1.14 permutation0:
% 0.49/1.14 0 ==> 0
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 resolution: (25) {G1,W5,D3,L1,V1,M1} { member( skol1( X, skol2 ), skol2 )
% 0.49/1.14 }.
% 0.49/1.14 parent0[1]: (0) {G0,W9,D3,L2,V3,M1} I { member( skol1( Z, Y ), Y ), !
% 0.49/1.14 intersect( X, Y ) }.
% 0.49/1.14 parent1[0]: (7) {G1,W3,D2,L1,V0,M1} R(3,4) { intersect( skol3, skol2 ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := skol3
% 0.49/1.14 Y := skol2
% 0.49/1.14 Z := X
% 0.49/1.14 end
% 0.49/1.14 substitution1:
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 subsumption: (8) {G2,W5,D3,L1,V1,M1} R(0,7) { member( skol1( X, skol2 ),
% 0.49/1.14 skol2 ) }.
% 0.49/1.14 parent0: (25) {G1,W5,D3,L1,V1,M1} { member( skol1( X, skol2 ), skol2 ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := X
% 0.49/1.14 end
% 0.49/1.14 permutation0:
% 0.49/1.14 0 ==> 0
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 resolution: (26) {G1,W6,D3,L1,V1,M1} { ! member( skol1( X, skol2 ), skol3
% 0.49/1.14 ) }.
% 0.49/1.14 parent0[1]: (5) {G0,W8,D2,L2,V1,M1} I { ! member( X, skol3 ), ! member( X,
% 0.49/1.14 skol2 ) }.
% 0.49/1.14 parent1[0]: (8) {G2,W5,D3,L1,V1,M1} R(0,7) { member( skol1( X, skol2 ),
% 0.49/1.14 skol2 ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := skol1( X, skol2 )
% 0.49/1.14 end
% 0.49/1.14 substitution1:
% 0.49/1.14 X := X
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 subsumption: (10) {G3,W6,D3,L1,V1,M1} R(8,5) { ! member( skol1( X, skol2 )
% 0.49/1.14 , skol3 ) }.
% 0.49/1.14 parent0: (26) {G1,W6,D3,L1,V1,M1} { ! member( skol1( X, skol2 ), skol3 )
% 0.49/1.14 }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := X
% 0.49/1.14 end
% 0.49/1.14 permutation0:
% 0.49/1.14 0 ==> 0
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 resolution: (27) {G1,W5,D3,L1,V0,M1} { member( skol1( skol3, skol2 ),
% 0.49/1.14 skol3 ) }.
% 0.49/1.14 parent0[1]: (1) {G0,W9,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), !
% 0.49/1.14 intersect( X, Y ) }.
% 0.49/1.14 parent1[0]: (7) {G1,W3,D2,L1,V0,M1} R(3,4) { intersect( skol3, skol2 ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := skol3
% 0.49/1.14 Y := skol2
% 0.49/1.14 end
% 0.49/1.14 substitution1:
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 resolution: (28) {G2,W0,D0,L0,V0,M0} { }.
% 0.49/1.14 parent0[0]: (10) {G3,W6,D3,L1,V1,M1} R(8,5) { ! member( skol1( X, skol2 ),
% 0.49/1.14 skol3 ) }.
% 0.49/1.14 parent1[0]: (27) {G1,W5,D3,L1,V0,M1} { member( skol1( skol3, skol2 ),
% 0.49/1.14 skol3 ) }.
% 0.49/1.14 substitution0:
% 0.49/1.14 X := skol3
% 0.49/1.14 end
% 0.49/1.14 substitution1:
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 subsumption: (13) {G4,W0,D0,L0,V0,M0} R(1,7);r(10) { }.
% 0.49/1.14 parent0: (28) {G2,W0,D0,L0,V0,M0} { }.
% 0.49/1.14 substitution0:
% 0.49/1.14 end
% 0.49/1.14 permutation0:
% 0.49/1.14 end
% 0.49/1.14
% 0.49/1.14 Proof check complete!
% 0.49/1.14
% 0.49/1.14 Memory use:
% 0.49/1.14
% 0.49/1.14 space for terms: 191
% 0.49/1.14 space for clauses: 717
% 0.49/1.14
% 0.49/1.14
% 0.49/1.14 clauses generated: 21
% 0.49/1.14 clauses kept: 14
% 0.49/1.14 clauses selected: 11
% 0.49/1.14 clauses deleted: 0
% 0.49/1.14 clauses inuse deleted: 0
% 0.49/1.14
% 0.49/1.14 subsentry: 9
% 0.49/1.14 literals s-matched: 7
% 0.49/1.14 literals matched: 7
% 0.49/1.14 full subsumption: 0
% 0.49/1.14
% 0.49/1.14 checksum: 25168873
% 0.49/1.14
% 0.49/1.14
% 0.49/1.14 Bliksem ended
%------------------------------------------------------------------------------