TSTP Solution File: SEU158+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU158+3 : TPTP v8.1.0. Released v3.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 : Tue Jul 19 07:11:01 EDT 2022
% Result : Theorem 0.71s 1.08s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU158+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n021.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 : Sun Jun 19 04:44:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.08 *** allocated 10000 integers for termspace/termends
% 0.71/1.08 *** allocated 10000 integers for clauses
% 0.71/1.08 *** allocated 10000 integers for justifications
% 0.71/1.08 Bliksem 1.12
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Automatic Strategy Selection
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Clauses:
% 0.71/1.08
% 0.71/1.08 { subset( X, X ) }.
% 0.71/1.08 { ! in( X, Y ), ! in( Y, X ) }.
% 0.71/1.08 { empty( skol1 ) }.
% 0.71/1.08 { ! empty( skol2 ) }.
% 0.71/1.08 { alpha1( skol3, skol4 ), in( skol3, skol4 ) }.
% 0.71/1.08 { alpha1( skol3, skol4 ), ! subset( singleton( skol3 ), skol4 ) }.
% 0.71/1.08 { ! alpha1( X, Y ), subset( singleton( X ), Y ) }.
% 0.71/1.08 { ! alpha1( X, Y ), ! in( X, Y ) }.
% 0.71/1.08 { ! subset( singleton( X ), Y ), in( X, Y ), alpha1( X, Y ) }.
% 0.71/1.08 { ! subset( singleton( X ), Y ), in( X, Y ) }.
% 0.71/1.08 { ! in( X, Y ), subset( singleton( X ), Y ) }.
% 0.71/1.08
% 0.71/1.08 percentage equality = 0.000000, percentage horn = 0.818182
% 0.71/1.08 This a non-horn, non-equality problem
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Options Used:
% 0.71/1.08
% 0.71/1.08 useres = 1
% 0.71/1.08 useparamod = 0
% 0.71/1.08 useeqrefl = 0
% 0.71/1.08 useeqfact = 0
% 0.71/1.08 usefactor = 1
% 0.71/1.08 usesimpsplitting = 0
% 0.71/1.08 usesimpdemod = 0
% 0.71/1.08 usesimpres = 3
% 0.71/1.08
% 0.71/1.08 resimpinuse = 1000
% 0.71/1.08 resimpclauses = 20000
% 0.71/1.08 substype = standard
% 0.71/1.08 backwardsubs = 1
% 0.71/1.08 selectoldest = 5
% 0.71/1.08
% 0.71/1.08 litorderings [0] = split
% 0.71/1.08 litorderings [1] = liftord
% 0.71/1.08
% 0.71/1.08 termordering = none
% 0.71/1.08
% 0.71/1.08 litapriori = 1
% 0.71/1.08 termapriori = 0
% 0.71/1.08 litaposteriori = 0
% 0.71/1.08 termaposteriori = 0
% 0.71/1.08 demodaposteriori = 0
% 0.71/1.08 ordereqreflfact = 0
% 0.71/1.08
% 0.71/1.08 litselect = none
% 0.71/1.08
% 0.71/1.08 maxweight = 15
% 0.71/1.08 maxdepth = 30000
% 0.71/1.08 maxlength = 115
% 0.71/1.08 maxnrvars = 195
% 0.71/1.08 excuselevel = 1
% 0.71/1.08 increasemaxweight = 1
% 0.71/1.08
% 0.71/1.08 maxselected = 10000000
% 0.71/1.08 maxnrclauses = 10000000
% 0.71/1.08
% 0.71/1.08 showgenerated = 0
% 0.71/1.08 showkept = 0
% 0.71/1.08 showselected = 0
% 0.71/1.08 showdeleted = 0
% 0.71/1.08 showresimp = 1
% 0.71/1.08 showstatus = 2000
% 0.71/1.08
% 0.71/1.08 prologoutput = 0
% 0.71/1.08 nrgoals = 5000000
% 0.71/1.08 totalproof = 1
% 0.71/1.08
% 0.71/1.08 Symbols occurring in the translation:
% 0.71/1.08
% 0.71/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.08 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.08 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.71/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.08 subset [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.71/1.08 in [38, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.71/1.08 empty [39, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.71/1.08 singleton [40, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.08 alpha1 [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.71/1.08 skol1 [42, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.71/1.08 skol2 [43, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.08 skol3 [44, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.71/1.08 skol4 [45, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Starting Search:
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Bliksems!, er is een bewijs:
% 0.71/1.08 % SZS status Theorem
% 0.71/1.08 % SZS output start Refutation
% 0.71/1.08
% 0.71/1.08 (4) {G0,W6,D2,L2,V0,M1} I { in( skol3, skol4 ), alpha1( skol3, skol4 ) }.
% 0.71/1.08 (5) {G0,W7,D3,L2,V0,M1} I { ! subset( singleton( skol3 ), skol4 ), alpha1(
% 0.71/1.08 skol3, skol4 ) }.
% 0.71/1.08 (6) {G0,W7,D3,L2,V2,M1} I { subset( singleton( X ), Y ), ! alpha1( X, Y )
% 0.71/1.08 }.
% 0.71/1.08 (7) {G0,W6,D2,L2,V2,M1} I { ! in( X, Y ), ! alpha1( X, Y ) }.
% 0.71/1.08 (9) {G0,W7,D3,L2,V2,M1} I { ! subset( singleton( X ), Y ), in( X, Y ) }.
% 0.71/1.08 (10) {G0,W7,D3,L2,V2,M1} I { subset( singleton( X ), Y ), ! in( X, Y ) }.
% 0.71/1.08 (14) {G1,W3,D2,L1,V0,M1} R(5,7);r(10) { ! in( skol3, skol4 ) }.
% 0.71/1.08 (15) {G2,W4,D3,L1,V0,M1} R(14,9) { ! subset( singleton( skol3 ), skol4 )
% 0.71/1.08 }.
% 0.71/1.08 (17) {G3,W3,D2,L1,V0,M1} R(6,4);r(15) { in( skol3, skol4 ) }.
% 0.71/1.08 (18) {G4,W0,D0,L0,V0,M0} S(17);r(14) { }.
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 % SZS output end Refutation
% 0.71/1.08 found a proof!
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Unprocessed initial clauses:
% 0.71/1.08
% 0.71/1.08 (20) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.71/1.08 (21) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.71/1.08 (22) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.71/1.08 (23) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.71/1.08 (24) {G0,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), in( skol3, skol4 ) }.
% 0.71/1.08 (25) {G0,W7,D3,L2,V0,M2} { alpha1( skol3, skol4 ), ! subset( singleton(
% 0.71/1.08 skol3 ), skol4 ) }.
% 0.71/1.08 (26) {G0,W7,D3,L2,V2,M2} { ! alpha1( X, Y ), subset( singleton( X ), Y )
% 0.71/1.08 }.
% 0.71/1.08 (27) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! in( X, Y ) }.
% 0.71/1.08 (28) {G0,W10,D3,L3,V2,M3} { ! subset( singleton( X ), Y ), in( X, Y ),
% 0.71/1.08 alpha1( X, Y ) }.
% 0.71/1.08 (29) {G0,W7,D3,L2,V2,M2} { ! subset( singleton( X ), Y ), in( X, Y ) }.
% 0.71/1.08 (30) {G0,W7,D3,L2,V2,M2} { ! in( X, Y ), subset( singleton( X ), Y ) }.
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Total Proof:
% 0.71/1.08
% 0.71/1.08 subsumption: (4) {G0,W6,D2,L2,V0,M1} I { in( skol3, skol4 ), alpha1( skol3
% 0.71/1.08 , skol4 ) }.
% 0.71/1.08 parent0: (24) {G0,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), in( skol3,
% 0.71/1.08 skol4 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 1
% 0.71/1.08 1 ==> 0
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (5) {G0,W7,D3,L2,V0,M1} I { ! subset( singleton( skol3 ),
% 0.71/1.08 skol4 ), alpha1( skol3, skol4 ) }.
% 0.71/1.08 parent0: (25) {G0,W7,D3,L2,V0,M2} { alpha1( skol3, skol4 ), ! subset(
% 0.71/1.08 singleton( skol3 ), skol4 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 1
% 0.71/1.08 1 ==> 0
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (6) {G0,W7,D3,L2,V2,M1} I { subset( singleton( X ), Y ), !
% 0.71/1.08 alpha1( X, Y ) }.
% 0.71/1.08 parent0: (26) {G0,W7,D3,L2,V2,M2} { ! alpha1( X, Y ), subset( singleton( X
% 0.71/1.08 ), Y ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 X := X
% 0.71/1.08 Y := Y
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 1
% 0.71/1.08 1 ==> 0
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (7) {G0,W6,D2,L2,V2,M1} I { ! in( X, Y ), ! alpha1( X, Y ) }.
% 0.71/1.08 parent0: (27) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! in( X, Y ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 X := X
% 0.71/1.08 Y := Y
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 1
% 0.71/1.08 1 ==> 0
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (9) {G0,W7,D3,L2,V2,M1} I { ! subset( singleton( X ), Y ), in
% 0.71/1.08 ( X, Y ) }.
% 0.71/1.08 parent0: (29) {G0,W7,D3,L2,V2,M2} { ! subset( singleton( X ), Y ), in( X,
% 0.71/1.08 Y ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 X := X
% 0.71/1.08 Y := Y
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 0
% 0.71/1.08 1 ==> 1
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (10) {G0,W7,D3,L2,V2,M1} I { subset( singleton( X ), Y ), ! in
% 0.71/1.08 ( X, Y ) }.
% 0.71/1.08 parent0: (30) {G0,W7,D3,L2,V2,M2} { ! in( X, Y ), subset( singleton( X ),
% 0.71/1.08 Y ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 X := X
% 0.71/1.08 Y := Y
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 1
% 0.71/1.08 1 ==> 0
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 resolution: (37) {G1,W7,D3,L2,V0,M2} { ! in( skol3, skol4 ), ! subset(
% 0.71/1.08 singleton( skol3 ), skol4 ) }.
% 0.71/1.08 parent0[1]: (7) {G0,W6,D2,L2,V2,M1} I { ! in( X, Y ), ! alpha1( X, Y ) }.
% 0.71/1.08 parent1[1]: (5) {G0,W7,D3,L2,V0,M1} I { ! subset( singleton( skol3 ), skol4
% 0.71/1.08 ), alpha1( skol3, skol4 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 X := skol3
% 0.71/1.08 Y := skol4
% 0.71/1.08 end
% 0.71/1.08 substitution1:
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 resolution: (38) {G1,W6,D2,L2,V0,M2} { ! in( skol3, skol4 ), ! in( skol3,
% 0.71/1.08 skol4 ) }.
% 0.71/1.08 parent0[1]: (37) {G1,W7,D3,L2,V0,M2} { ! in( skol3, skol4 ), ! subset(
% 0.71/1.08 singleton( skol3 ), skol4 ) }.
% 0.71/1.08 parent1[0]: (10) {G0,W7,D3,L2,V2,M1} I { subset( singleton( X ), Y ), ! in
% 0.71/1.08 ( X, Y ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 substitution1:
% 0.71/1.08 X := skol3
% 0.71/1.08 Y := skol4
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 factor: (39) {G1,W3,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.71/1.08 parent0[0, 1]: (38) {G1,W6,D2,L2,V0,M2} { ! in( skol3, skol4 ), ! in(
% 0.71/1.08 skol3, skol4 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (14) {G1,W3,D2,L1,V0,M1} R(5,7);r(10) { ! in( skol3, skol4 )
% 0.71/1.08 }.
% 0.71/1.08 parent0: (39) {G1,W3,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 0
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 resolution: (40) {G1,W4,D3,L1,V0,M1} { ! subset( singleton( skol3 ), skol4
% 0.71/1.08 ) }.
% 0.71/1.08 parent0[0]: (14) {G1,W3,D2,L1,V0,M1} R(5,7);r(10) { ! in( skol3, skol4 )
% 0.71/1.08 }.
% 0.71/1.08 parent1[1]: (9) {G0,W7,D3,L2,V2,M1} I { ! subset( singleton( X ), Y ), in(
% 0.71/1.08 X, Y ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 substitution1:
% 0.71/1.08 X := skol3
% 0.71/1.08 Y := skol4
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (15) {G2,W4,D3,L1,V0,M1} R(14,9) { ! subset( singleton( skol3
% 0.71/1.08 ), skol4 ) }.
% 0.71/1.08 parent0: (40) {G1,W4,D3,L1,V0,M1} { ! subset( singleton( skol3 ), skol4 )
% 0.71/1.08 }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 0
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 resolution: (41) {G1,W7,D3,L2,V0,M2} { subset( singleton( skol3 ), skol4 )
% 0.71/1.08 , in( skol3, skol4 ) }.
% 0.71/1.08 parent0[1]: (6) {G0,W7,D3,L2,V2,M1} I { subset( singleton( X ), Y ), !
% 0.71/1.08 alpha1( X, Y ) }.
% 0.71/1.08 parent1[1]: (4) {G0,W6,D2,L2,V0,M1} I { in( skol3, skol4 ), alpha1( skol3,
% 0.71/1.08 skol4 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 X := skol3
% 0.71/1.08 Y := skol4
% 0.71/1.08 end
% 0.71/1.08 substitution1:
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 resolution: (42) {G2,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.71/1.08 parent0[0]: (15) {G2,W4,D3,L1,V0,M1} R(14,9) { ! subset( singleton( skol3 )
% 0.71/1.08 , skol4 ) }.
% 0.71/1.08 parent1[0]: (41) {G1,W7,D3,L2,V0,M2} { subset( singleton( skol3 ), skol4 )
% 0.71/1.08 , in( skol3, skol4 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 substitution1:
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (17) {G3,W3,D2,L1,V0,M1} R(6,4);r(15) { in( skol3, skol4 ) }.
% 0.71/1.08 parent0: (42) {G2,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 0 ==> 0
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 resolution: (43) {G2,W0,D0,L0,V0,M0} { }.
% 0.71/1.08 parent0[0]: (14) {G1,W3,D2,L1,V0,M1} R(5,7);r(10) { ! in( skol3, skol4 )
% 0.71/1.08 }.
% 0.71/1.08 parent1[0]: (17) {G3,W3,D2,L1,V0,M1} R(6,4);r(15) { in( skol3, skol4 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 substitution1:
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (18) {G4,W0,D0,L0,V0,M0} S(17);r(14) { }.
% 0.71/1.08 parent0: (43) {G2,W0,D0,L0,V0,M0} { }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 permutation0:
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 Proof check complete!
% 0.71/1.08
% 0.71/1.08 Memory use:
% 0.71/1.08
% 0.71/1.08 space for terms: 271
% 0.71/1.08 space for clauses: 972
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 clauses generated: 24
% 0.71/1.08 clauses kept: 19
% 0.71/1.08 clauses selected: 15
% 0.71/1.08 clauses deleted: 2
% 0.71/1.08 clauses inuse deleted: 0
% 0.71/1.08
% 0.71/1.08 subsentry: 14
% 0.71/1.08 literals s-matched: 9
% 0.71/1.08 literals matched: 9
% 0.71/1.08 full subsumption: 0
% 0.71/1.08
% 0.71/1.08 checksum: 1107307389
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Bliksem ended
%------------------------------------------------------------------------------