TSTP Solution File: SEU122+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU122+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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:10:44 EDT 2022
% Result : Theorem 0.67s 1.08s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU122+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n020.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 : Mon Jun 20 04:53:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/1.08 *** allocated 10000 integers for termspace/termends
% 0.67/1.08 *** allocated 10000 integers for clauses
% 0.67/1.08 *** allocated 10000 integers for justifications
% 0.67/1.08 Bliksem 1.12
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 Automatic Strategy Selection
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 Clauses:
% 0.67/1.08
% 0.67/1.08 { ! in( X, Y ), ! in( Y, X ) }.
% 0.67/1.08 { ! subset( X, Y ), ! in( Z, X ), in( Z, Y ) }.
% 0.67/1.08 { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.67/1.08 { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.67/1.08 { && }.
% 0.67/1.08 { empty( empty_set ) }.
% 0.67/1.08 { empty( skol2 ) }.
% 0.67/1.08 { ! empty( skol3 ) }.
% 0.67/1.08 { subset( X, X ) }.
% 0.67/1.08 { ! subset( empty_set, skol4 ) }.
% 0.67/1.08 { ! empty( X ), X = empty_set }.
% 0.67/1.08 { ! in( X, Y ), ! empty( Y ) }.
% 0.67/1.08 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.67/1.08
% 0.67/1.08 percentage equality = 0.090909, percentage horn = 0.923077
% 0.67/1.08 This is a problem with some equality
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 Options Used:
% 0.67/1.08
% 0.67/1.08 useres = 1
% 0.67/1.08 useparamod = 1
% 0.67/1.08 useeqrefl = 1
% 0.67/1.08 useeqfact = 1
% 0.67/1.08 usefactor = 1
% 0.67/1.08 usesimpsplitting = 0
% 0.67/1.08 usesimpdemod = 5
% 0.67/1.08 usesimpres = 3
% 0.67/1.08
% 0.67/1.08 resimpinuse = 1000
% 0.67/1.08 resimpclauses = 20000
% 0.67/1.08 substype = eqrewr
% 0.67/1.08 backwardsubs = 1
% 0.67/1.08 selectoldest = 5
% 0.67/1.08
% 0.67/1.08 litorderings [0] = split
% 0.67/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.67/1.08
% 0.67/1.08 termordering = kbo
% 0.67/1.08
% 0.67/1.08 litapriori = 0
% 0.67/1.08 termapriori = 1
% 0.67/1.08 litaposteriori = 0
% 0.67/1.08 termaposteriori = 0
% 0.67/1.08 demodaposteriori = 0
% 0.67/1.08 ordereqreflfact = 0
% 0.67/1.08
% 0.67/1.08 litselect = negord
% 0.67/1.08
% 0.67/1.08 maxweight = 15
% 0.67/1.08 maxdepth = 30000
% 0.67/1.08 maxlength = 115
% 0.67/1.08 maxnrvars = 195
% 0.67/1.08 excuselevel = 1
% 0.67/1.08 increasemaxweight = 1
% 0.67/1.08
% 0.67/1.08 maxselected = 10000000
% 0.67/1.08 maxnrclauses = 10000000
% 0.67/1.08
% 0.67/1.08 showgenerated = 0
% 0.67/1.08 showkept = 0
% 0.67/1.08 showselected = 0
% 0.67/1.08 showdeleted = 0
% 0.67/1.08 showresimp = 1
% 0.67/1.08 showstatus = 2000
% 0.67/1.08
% 0.67/1.08 prologoutput = 0
% 0.67/1.08 nrgoals = 5000000
% 0.67/1.08 totalproof = 1
% 0.67/1.08
% 0.67/1.08 Symbols occurring in the translation:
% 0.67/1.08
% 0.67/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.67/1.08 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.67/1.08 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.67/1.08 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.67/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.08 in [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.67/1.08 subset [38, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.67/1.08 empty_set [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.67/1.08 empty [41, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.67/1.08 skol1 [42, 2] (w:1, o:45, a:1, s:1, b:1),
% 0.67/1.08 skol2 [43, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.67/1.08 skol3 [44, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.67/1.08 skol4 [45, 0] (w:1, o:12, a:1, s:1, b:1).
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 Starting Search:
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 Bliksems!, er is een bewijs:
% 0.67/1.08 % SZS status Theorem
% 0.67/1.08 % SZS output start Refutation
% 0.67/1.08
% 0.67/1.08 (3) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.67/1.08 (5) {G0,W2,D2,L1,V0,M1} I { empty( empty_set ) }.
% 0.67/1.08 (9) {G0,W3,D2,L1,V0,M1} I { ! subset( empty_set, skol4 ) }.
% 0.67/1.08 (11) {G0,W5,D2,L2,V2,M2} I { ! in( X, Y ), ! empty( Y ) }.
% 0.67/1.08 (14) {G1,W3,D2,L1,V1,M1} R(11,5) { ! in( X, empty_set ) }.
% 0.67/1.08 (38) {G2,W0,D0,L0,V0,M0} R(3,9);r(14) { }.
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 % SZS output end Refutation
% 0.67/1.08 found a proof!
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 Unprocessed initial clauses:
% 0.67/1.08
% 0.67/1.08 (40) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.67/1.08 (41) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! in( Z, X ), in( Z, Y ) }.
% 0.67/1.08 (42) {G0,W8,D3,L2,V3,M2} { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 0.67/1.08 (43) {G0,W8,D3,L2,V2,M2} { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 0.67/1.08 (44) {G0,W1,D1,L1,V0,M1} { && }.
% 0.67/1.08 (45) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.67/1.08 (46) {G0,W2,D2,L1,V0,M1} { empty( skol2 ) }.
% 0.67/1.08 (47) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 0.67/1.08 (48) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.67/1.08 (49) {G0,W3,D2,L1,V0,M1} { ! subset( empty_set, skol4 ) }.
% 0.67/1.08 (50) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.67/1.08 (51) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.67/1.08 (52) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 Total Proof:
% 0.67/1.08
% 0.67/1.08 subsumption: (3) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X
% 0.67/1.08 , Y ) }.
% 0.67/1.08 parent0: (43) {G0,W8,D3,L2,V2,M2} { in( skol1( X, Y ), X ), subset( X, Y )
% 0.67/1.08 }.
% 0.67/1.08 substitution0:
% 0.67/1.08 X := X
% 0.67/1.08 Y := Y
% 0.67/1.08 end
% 0.67/1.08 permutation0:
% 0.67/1.08 0 ==> 0
% 0.67/1.08 1 ==> 1
% 0.67/1.08 end
% 0.67/1.08
% 0.67/1.08 subsumption: (5) {G0,W2,D2,L1,V0,M1} I { empty( empty_set ) }.
% 0.67/1.08 parent0: (45) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.67/1.08 substitution0:
% 0.67/1.08 end
% 0.67/1.08 permutation0:
% 0.67/1.08 0 ==> 0
% 0.67/1.08 end
% 0.67/1.08
% 0.67/1.08 subsumption: (9) {G0,W3,D2,L1,V0,M1} I { ! subset( empty_set, skol4 ) }.
% 0.67/1.08 parent0: (49) {G0,W3,D2,L1,V0,M1} { ! subset( empty_set, skol4 ) }.
% 0.67/1.08 substitution0:
% 0.67/1.08 end
% 0.67/1.08 permutation0:
% 0.67/1.08 0 ==> 0
% 0.67/1.08 end
% 0.67/1.08
% 0.67/1.08 subsumption: (11) {G0,W5,D2,L2,V2,M2} I { ! in( X, Y ), ! empty( Y ) }.
% 0.67/1.08 parent0: (51) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.67/1.08 substitution0:
% 0.67/1.08 X := X
% 0.67/1.08 Y := Y
% 0.67/1.08 end
% 0.67/1.08 permutation0:
% 0.67/1.08 0 ==> 0
% 0.67/1.08 1 ==> 1
% 0.67/1.08 end
% 0.67/1.08
% 0.67/1.08 resolution: (58) {G1,W3,D2,L1,V1,M1} { ! in( X, empty_set ) }.
% 0.67/1.08 parent0[1]: (11) {G0,W5,D2,L2,V2,M2} I { ! in( X, Y ), ! empty( Y ) }.
% 0.67/1.08 parent1[0]: (5) {G0,W2,D2,L1,V0,M1} I { empty( empty_set ) }.
% 0.67/1.08 substitution0:
% 0.67/1.08 X := X
% 0.67/1.08 Y := empty_set
% 0.67/1.08 end
% 0.67/1.08 substitution1:
% 0.67/1.08 end
% 0.67/1.08
% 0.67/1.08 subsumption: (14) {G1,W3,D2,L1,V1,M1} R(11,5) { ! in( X, empty_set ) }.
% 0.67/1.08 parent0: (58) {G1,W3,D2,L1,V1,M1} { ! in( X, empty_set ) }.
% 0.67/1.08 substitution0:
% 0.67/1.08 X := X
% 0.67/1.08 end
% 0.67/1.08 permutation0:
% 0.67/1.08 0 ==> 0
% 0.67/1.08 end
% 0.67/1.08
% 0.67/1.08 resolution: (59) {G1,W5,D3,L1,V0,M1} { in( skol1( empty_set, skol4 ),
% 0.67/1.08 empty_set ) }.
% 0.67/1.08 parent0[0]: (9) {G0,W3,D2,L1,V0,M1} I { ! subset( empty_set, skol4 ) }.
% 0.67/1.08 parent1[1]: (3) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X,
% 0.67/1.08 Y ) }.
% 0.67/1.08 substitution0:
% 0.67/1.08 end
% 0.67/1.08 substitution1:
% 0.67/1.08 X := empty_set
% 0.67/1.08 Y := skol4
% 0.67/1.08 end
% 0.67/1.08
% 0.67/1.08 resolution: (60) {G2,W0,D0,L0,V0,M0} { }.
% 0.67/1.08 parent0[0]: (14) {G1,W3,D2,L1,V1,M1} R(11,5) { ! in( X, empty_set ) }.
% 0.67/1.08 parent1[0]: (59) {G1,W5,D3,L1,V0,M1} { in( skol1( empty_set, skol4 ),
% 0.67/1.08 empty_set ) }.
% 0.67/1.08 substitution0:
% 0.67/1.08 X := skol1( empty_set, skol4 )
% 0.67/1.08 end
% 0.67/1.08 substitution1:
% 0.67/1.08 end
% 0.67/1.08
% 0.67/1.08 subsumption: (38) {G2,W0,D0,L0,V0,M0} R(3,9);r(14) { }.
% 0.67/1.08 parent0: (60) {G2,W0,D0,L0,V0,M0} { }.
% 0.67/1.08 substitution0:
% 0.67/1.08 end
% 0.67/1.08 permutation0:
% 0.67/1.08 end
% 0.67/1.08
% 0.67/1.08 Proof check complete!
% 0.67/1.08
% 0.67/1.08 Memory use:
% 0.67/1.08
% 0.67/1.08 space for terms: 478
% 0.67/1.08 space for clauses: 1758
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 clauses generated: 81
% 0.67/1.08 clauses kept: 39
% 0.67/1.08 clauses selected: 20
% 0.67/1.08 clauses deleted: 1
% 0.67/1.08 clauses inuse deleted: 0
% 0.67/1.08
% 0.67/1.08 subsentry: 111
% 0.67/1.08 literals s-matched: 84
% 0.67/1.08 literals matched: 84
% 0.67/1.08 full subsumption: 19
% 0.67/1.08
% 0.67/1.08 checksum: -1078408346
% 0.67/1.08
% 0.67/1.08
% 0.67/1.08 Bliksem ended
%------------------------------------------------------------------------------