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