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