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