%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU167+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 07:11:07 EDT 2022
% Result : Theorem 0.64s 1.04s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU167+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n027.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 : Sat Jun 18 20:09:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.64/1.04 *** allocated 10000 integers for termspace/termends
% 0.64/1.04 *** allocated 10000 integers for clauses
% 0.64/1.04 *** allocated 10000 integers for justifications
% 0.64/1.04 Bliksem 1.12
% 0.64/1.04
% 0.64/1.04
% 0.64/1.04 Automatic Strategy Selection
% 0.64/1.04
% 0.64/1.04
% 0.64/1.04 Clauses:
% 0.64/1.04
% 0.64/1.04 { && }.
% 0.64/1.04 { subset( X, X ) }.
% 0.64/1.04 { ! subset( X, Y ), subset( cartesian_product2( X, Z ), cartesian_product2
% 0.64/1.04 ( Y, Z ) ) }.
% 0.64/1.04 { ! subset( X, Y ), subset( cartesian_product2( Z, X ), cartesian_product2
% 0.64/1.04 ( Z, Y ) ) }.
% 0.64/1.04 { subset( skol1, skol2 ) }.
% 0.64/1.04 { subset( skol3, skol4 ) }.
% 0.64/1.04 { ! subset( cartesian_product2( skol1, skol3 ), cartesian_product2( skol2,
% 0.64/1.04 skol4 ) ) }.
% 0.64/1.04 { ! subset( X, Z ), ! subset( Z, Y ), subset( X, Y ) }.
% 0.64/1.04
% 0.64/1.04 percentage equality = 0.000000, percentage horn = 1.000000
% 0.64/1.04 This is a near-Horn, non-equality problem
% 0.64/1.04
% 0.64/1.04
% 0.64/1.04 Options Used:
% 0.64/1.04
% 0.64/1.04 useres = 1
% 0.64/1.04 useparamod = 0
% 0.64/1.04 useeqrefl = 0
% 0.64/1.04 useeqfact = 0
% 0.64/1.04 usefactor = 1
% 0.64/1.04 usesimpsplitting = 0
% 0.64/1.04 usesimpdemod = 0
% 0.64/1.04 usesimpres = 4
% 0.64/1.04
% 0.64/1.04 resimpinuse = 1000
% 0.64/1.04 resimpclauses = 20000
% 0.64/1.04 substype = standard
% 0.64/1.04 backwardsubs = 1
% 0.64/1.04 selectoldest = 5
% 0.64/1.04
% 0.64/1.04 litorderings [0] = split
% 0.64/1.04 litorderings [1] = liftord
% 0.64/1.04
% 0.64/1.04 termordering = none
% 0.64/1.04
% 0.64/1.04 litapriori = 1
% 0.64/1.04 termapriori = 0
% 0.64/1.04 litaposteriori = 0
% 0.64/1.04 termaposteriori = 0
% 0.64/1.04 demodaposteriori = 0
% 0.64/1.04 ordereqreflfact = 0
% 0.64/1.04
% 0.64/1.04 litselect = negative
% 0.64/1.04
% 0.64/1.04 maxweight = 30000
% 0.64/1.04 maxdepth = 30000
% 0.64/1.04 maxlength = 115
% 0.64/1.04 maxnrvars = 195
% 0.64/1.04 excuselevel = 0
% 0.64/1.04 increasemaxweight = 0
% 0.64/1.04
% 0.64/1.04 maxselected = 10000000
% 0.64/1.04 maxnrclauses = 10000000
% 0.64/1.04
% 0.64/1.04 showgenerated = 0
% 0.64/1.04 showkept = 0
% 0.64/1.04 showselected = 0
% 0.64/1.04 showdeleted = 0
% 0.64/1.04 showresimp = 1
% 0.64/1.04 showstatus = 2000
% 0.64/1.04
% 0.64/1.04 prologoutput = 0
% 0.64/1.04 nrgoals = 5000000
% 0.64/1.04 totalproof = 1
% 0.64/1.04
% 0.64/1.04 Symbols occurring in the translation:
% 0.64/1.04
% 0.64/1.04 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.64/1.04 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.64/1.04 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.64/1.04 ! [4, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.64/1.04 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.64/1.04 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.64/1.04 subset [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.64/1.04 cartesian_product2 [39, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.64/1.04 skol1 [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.64/1.04 skol2 [42, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.64/1.04 skol3 [43, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.64/1.04 skol4 [44, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.64/1.04
% 0.64/1.04
% 0.64/1.04 Starting Search:
% 0.64/1.04
% 0.64/1.04
% 0.64/1.04 Bliksems!, er is een bewijs:
% 0.64/1.04 % SZS status Theorem
% 0.64/1.04 % SZS output start Refutation
% 0.64/1.04
% 0.64/1.04 (2) {G0,W11,D3,L2,V3,M1} I { subset( cartesian_product2( X, Z ),
% 0.64/1.04 cartesian_product2( Y, Z ) ), ! subset( X, Y ) }.
% 0.64/1.04 (3) {G0,W11,D3,L2,V3,M1} I { subset( cartesian_product2( Z, X ),
% 0.64/1.04 cartesian_product2( Z, Y ) ), ! subset( X, Y ) }.
% 0.64/1.04 (4) {G0,W3,D2,L1,V0,M1} I { subset( skol1, skol2 ) }.
% 0.64/1.04 (5) {G0,W3,D2,L1,V0,M1} I { subset( skol3, skol4 ) }.
% 0.64/1.04 (6) {G0,W8,D3,L1,V0,M1} I { ! subset( cartesian_product2( skol1, skol3 ),
% 0.64/1.04 cartesian_product2( skol2, skol4 ) ) }.
% 0.64/1.04 (7) {G0,W11,D2,L3,V3,M1} I { ! subset( X, Z ), subset( X, Y ), ! subset( Z
% 0.64/1.04 , Y ) }.
% 0.64/1.04 (8) {G1,W7,D3,L1,V1,M1} R(2,4) { subset( cartesian_product2( skol1, X ),
% 0.64/1.04 cartesian_product2( skol2, X ) ) }.
% 0.64/1.04 (19) {G1,W7,D3,L1,V1,M1} R(3,5) { subset( cartesian_product2( X, skol3 ),
% 0.64/1.05 cartesian_product2( X, skol4 ) ) }.
% 0.64/1.05 (24) {G2,W11,D3,L2,V2,M1} R(19,7) { subset( X, cartesian_product2( Y, skol4
% 0.64/1.05 ) ), ! subset( X, cartesian_product2( Y, skol3 ) ) }.
% 0.64/1.05 (27) {G3,W0,D0,L0,V0,M0} R(24,8);r(6) { }.
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 % SZS output end Refutation
% 0.64/1.05 found a proof!
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 Unprocessed initial clauses:
% 0.64/1.05
% 0.64/1.05 (29) {G0,W1,D1,L1,V0,M1} { && }.
% 0.64/1.05 (30) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.64/1.05 (31) {G0,W11,D3,L2,V3,M2} { ! subset( X, Y ), subset( cartesian_product2(
% 0.64/1.05 X, Z ), cartesian_product2( Y, Z ) ) }.
% 0.64/1.05 (32) {G0,W11,D3,L2,V3,M2} { ! subset( X, Y ), subset( cartesian_product2(
% 0.64/1.05 Z, X ), cartesian_product2( Z, Y ) ) }.
% 0.64/1.05 (33) {G0,W3,D2,L1,V0,M1} { subset( skol1, skol2 ) }.
% 0.64/1.05 (34) {G0,W3,D2,L1,V0,M1} { subset( skol3, skol4 ) }.
% 0.64/1.05 (35) {G0,W8,D3,L1,V0,M1} { ! subset( cartesian_product2( skol1, skol3 ),
% 0.64/1.05 cartesian_product2( skol2, skol4 ) ) }.
% 0.64/1.05 (36) {G0,W11,D2,L3,V3,M3} { ! subset( X, Z ), ! subset( Z, Y ), subset( X
% 0.64/1.05 , Y ) }.
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 Total Proof:
% 0.64/1.05
% 0.64/1.05 subsumption: (2) {G0,W11,D3,L2,V3,M1} I { subset( cartesian_product2( X, Z
% 0.64/1.05 ), cartesian_product2( Y, Z ) ), ! subset( X, Y ) }.
% 0.64/1.05 parent0: (31) {G0,W11,D3,L2,V3,M2} { ! subset( X, Y ), subset(
% 0.64/1.05 cartesian_product2( X, Z ), cartesian_product2( Y, Z ) ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 X := X
% 0.64/1.05 Y := Y
% 0.64/1.05 Z := Z
% 0.64/1.05 end
% 0.64/1.05 permutation0:
% 0.64/1.05 0 ==> 1
% 0.64/1.05 1 ==> 0
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 subsumption: (3) {G0,W11,D3,L2,V3,M1} I { subset( cartesian_product2( Z, X
% 0.64/1.05 ), cartesian_product2( Z, Y ) ), ! subset( X, Y ) }.
% 0.64/1.05 parent0: (32) {G0,W11,D3,L2,V3,M2} { ! subset( X, Y ), subset(
% 0.64/1.05 cartesian_product2( Z, X ), cartesian_product2( Z, Y ) ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 X := X
% 0.64/1.05 Y := Y
% 0.64/1.05 Z := Z
% 0.64/1.05 end
% 0.64/1.05 permutation0:
% 0.64/1.05 0 ==> 1
% 0.64/1.05 1 ==> 0
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 subsumption: (4) {G0,W3,D2,L1,V0,M1} I { subset( skol1, skol2 ) }.
% 0.64/1.05 parent0: (33) {G0,W3,D2,L1,V0,M1} { subset( skol1, skol2 ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 end
% 0.64/1.05 permutation0:
% 0.64/1.05 0 ==> 0
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 subsumption: (5) {G0,W3,D2,L1,V0,M1} I { subset( skol3, skol4 ) }.
% 0.64/1.05 parent0: (34) {G0,W3,D2,L1,V0,M1} { subset( skol3, skol4 ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 end
% 0.64/1.05 permutation0:
% 0.64/1.05 0 ==> 0
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 subsumption: (6) {G0,W8,D3,L1,V0,M1} I { ! subset( cartesian_product2(
% 0.64/1.05 skol1, skol3 ), cartesian_product2( skol2, skol4 ) ) }.
% 0.64/1.05 parent0: (35) {G0,W8,D3,L1,V0,M1} { ! subset( cartesian_product2( skol1,
% 0.64/1.05 skol3 ), cartesian_product2( skol2, skol4 ) ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 end
% 0.64/1.05 permutation0:
% 0.64/1.05 0 ==> 0
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 subsumption: (7) {G0,W11,D2,L3,V3,M1} I { ! subset( X, Z ), subset( X, Y )
% 0.64/1.05 , ! subset( Z, Y ) }.
% 0.64/1.05 parent0: (36) {G0,W11,D2,L3,V3,M3} { ! subset( X, Z ), ! subset( Z, Y ),
% 0.64/1.05 subset( X, Y ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 X := X
% 0.64/1.05 Y := Y
% 0.64/1.05 Z := Z
% 0.64/1.05 end
% 0.64/1.05 permutation0:
% 0.64/1.05 0 ==> 0
% 0.64/1.05 1 ==> 2
% 0.64/1.05 2 ==> 1
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 resolution: (38) {G1,W7,D3,L1,V1,M1} { subset( cartesian_product2( skol1,
% 0.64/1.05 X ), cartesian_product2( skol2, X ) ) }.
% 0.64/1.05 parent0[1]: (2) {G0,W11,D3,L2,V3,M1} I { subset( cartesian_product2( X, Z )
% 0.64/1.05 , cartesian_product2( Y, Z ) ), ! subset( X, Y ) }.
% 0.64/1.05 parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { subset( skol1, skol2 ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 X := skol1
% 0.64/1.05 Y := skol2
% 0.64/1.05 Z := X
% 0.64/1.05 end
% 0.64/1.05 substitution1:
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 subsumption: (8) {G1,W7,D3,L1,V1,M1} R(2,4) { subset( cartesian_product2(
% 0.64/1.05 skol1, X ), cartesian_product2( skol2, X ) ) }.
% 0.64/1.05 parent0: (38) {G1,W7,D3,L1,V1,M1} { subset( cartesian_product2( skol1, X )
% 0.64/1.05 , cartesian_product2( skol2, X ) ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 X := X
% 0.64/1.05 end
% 0.64/1.05 permutation0:
% 0.64/1.05 0 ==> 0
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 resolution: (39) {G1,W7,D3,L1,V1,M1} { subset( cartesian_product2( X,
% 0.64/1.05 skol3 ), cartesian_product2( X, skol4 ) ) }.
% 0.64/1.05 parent0[1]: (3) {G0,W11,D3,L2,V3,M1} I { subset( cartesian_product2( Z, X )
% 0.64/1.05 , cartesian_product2( Z, Y ) ), ! subset( X, Y ) }.
% 0.64/1.05 parent1[0]: (5) {G0,W3,D2,L1,V0,M1} I { subset( skol3, skol4 ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 X := skol3
% 0.64/1.05 Y := skol4
% 0.64/1.05 Z := X
% 0.64/1.05 end
% 0.64/1.05 substitution1:
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 subsumption: (19) {G1,W7,D3,L1,V1,M1} R(3,5) { subset( cartesian_product2(
% 0.64/1.05 X, skol3 ), cartesian_product2( X, skol4 ) ) }.
% 0.64/1.05 parent0: (39) {G1,W7,D3,L1,V1,M1} { subset( cartesian_product2( X, skol3 )
% 0.64/1.05 , cartesian_product2( X, skol4 ) ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 X := X
% 0.64/1.05 end
% 0.64/1.05 permutation0:
% 0.64/1.05 0 ==> 0
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 resolution: (41) {G1,W11,D3,L2,V2,M2} { ! subset( X, cartesian_product2( Y
% 0.64/1.05 , skol3 ) ), subset( X, cartesian_product2( Y, skol4 ) ) }.
% 0.64/1.05 parent0[2]: (7) {G0,W11,D2,L3,V3,M1} I { ! subset( X, Z ), subset( X, Y ),
% 0.64/1.05 ! subset( Z, Y ) }.
% 0.64/1.05 parent1[0]: (19) {G1,W7,D3,L1,V1,M1} R(3,5) { subset( cartesian_product2( X
% 0.64/1.05 , skol3 ), cartesian_product2( X, skol4 ) ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 X := X
% 0.64/1.05 Y := cartesian_product2( Y, skol4 )
% 0.64/1.05 Z := cartesian_product2( Y, skol3 )
% 0.64/1.05 end
% 0.64/1.05 substitution1:
% 0.64/1.05 X := Y
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 subsumption: (24) {G2,W11,D3,L2,V2,M1} R(19,7) { subset( X,
% 0.64/1.05 cartesian_product2( Y, skol4 ) ), ! subset( X, cartesian_product2( Y,
% 0.64/1.05 skol3 ) ) }.
% 0.64/1.05 parent0: (41) {G1,W11,D3,L2,V2,M2} { ! subset( X, cartesian_product2( Y,
% 0.64/1.05 skol3 ) ), subset( X, cartesian_product2( Y, skol4 ) ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 X := X
% 0.64/1.05 Y := Y
% 0.64/1.05 end
% 0.64/1.05 permutation0:
% 0.64/1.05 0 ==> 1
% 0.64/1.05 1 ==> 0
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 resolution: (42) {G2,W7,D3,L1,V0,M1} { subset( cartesian_product2( skol1,
% 0.64/1.05 skol3 ), cartesian_product2( skol2, skol4 ) ) }.
% 0.64/1.05 parent0[1]: (24) {G2,W11,D3,L2,V2,M1} R(19,7) { subset( X,
% 0.64/1.05 cartesian_product2( Y, skol4 ) ), ! subset( X, cartesian_product2( Y,
% 0.64/1.05 skol3 ) ) }.
% 0.64/1.05 parent1[0]: (8) {G1,W7,D3,L1,V1,M1} R(2,4) { subset( cartesian_product2(
% 0.64/1.05 skol1, X ), cartesian_product2( skol2, X ) ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 X := cartesian_product2( skol1, skol3 )
% 0.64/1.05 Y := skol2
% 0.64/1.05 end
% 0.64/1.05 substitution1:
% 0.64/1.05 X := skol3
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 resolution: (43) {G1,W0,D0,L0,V0,M0} { }.
% 0.64/1.05 parent0[0]: (6) {G0,W8,D3,L1,V0,M1} I { ! subset( cartesian_product2( skol1
% 0.64/1.05 , skol3 ), cartesian_product2( skol2, skol4 ) ) }.
% 0.64/1.05 parent1[0]: (42) {G2,W7,D3,L1,V0,M1} { subset( cartesian_product2( skol1,
% 0.64/1.05 skol3 ), cartesian_product2( skol2, skol4 ) ) }.
% 0.64/1.05 substitution0:
% 0.64/1.05 end
% 0.64/1.05 substitution1:
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 subsumption: (27) {G3,W0,D0,L0,V0,M0} R(24,8);r(6) { }.
% 0.64/1.05 parent0: (43) {G1,W0,D0,L0,V0,M0} { }.
% 0.64/1.05 substitution0:
% 0.64/1.05 end
% 0.64/1.05 permutation0:
% 0.64/1.05 end
% 0.64/1.05
% 0.64/1.05 Proof check complete!
% 0.64/1.05
% 0.64/1.05 Memory use:
% 0.64/1.05
% 0.64/1.05 space for terms: 378
% 0.64/1.05 space for clauses: 1996
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 clauses generated: 34
% 0.64/1.05 clauses kept: 28
% 0.64/1.05 clauses selected: 15
% 0.64/1.05 clauses deleted: 0
% 0.64/1.05 clauses inuse deleted: 0
% 0.64/1.05
% 0.64/1.05 subsentry: 16
% 0.64/1.05 literals s-matched: 4
% 0.64/1.05 literals matched: 4
% 0.64/1.05 full subsumption: 0
% 0.64/1.05
% 0.64/1.05 checksum: 2038055306
% 0.64/1.05
% 0.64/1.05
% 0.64/1.05 Bliksem ended
%------------------------------------------------------------------------------