TSTP Solution File: SWB015+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWB015+2 : TPTP v8.1.0. Released v5.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 18:47:36 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.00/0.12 % Problem : SWB015+2 : TPTP v8.1.0. Released v5.2.0.
% 0.12/0.12 % Command : bliksem %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Wed Jun 1 00:22:15 EDT 2022
% 0.19/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 { ! iext( uri_owl_sameAs, X, Y ), X = Y }.
% 0.71/1.08 { ! X = Y, iext( uri_owl_sameAs, X, Y ) }.
% 0.71/1.08 { ! iext( uri_owl_sameAs, uri_owl_sameAs, uri_owl_sameAs ) }.
% 0.71/1.08
% 0.71/1.08 percentage equality = 0.400000, percentage horn = 1.000000
% 0.71/1.08 This is a problem with some equality
% 0.71/1.08
% 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 = 1
% 0.71/1.08 useeqrefl = 1
% 0.71/1.08 useeqfact = 1
% 0.71/1.08 usefactor = 1
% 0.71/1.08 usesimpsplitting = 0
% 0.71/1.08 usesimpdemod = 5
% 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 = eqrewr
% 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] = extend the termordering, first sorting on arguments
% 0.71/1.08
% 0.71/1.08 termordering = kbo
% 0.71/1.08
% 0.71/1.08 litapriori = 0
% 0.71/1.08 termapriori = 1
% 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 = negord
% 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:14, a:1, s:1, b:0),
% 0.71/1.08 ! [4, 1] (w:0, o:9, 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 uri_owl_sameAs [37, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.71/1.08 iext [38, 3] (w:1, o:38, 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 (1) {G0,W7,D2,L2,V2,M2} I { ! X = Y, iext( uri_owl_sameAs, X, Y ) }.
% 0.71/1.08 (2) {G0,W4,D2,L1,V0,M1} I { ! iext( uri_owl_sameAs, uri_owl_sameAs,
% 0.71/1.08 uri_owl_sameAs ) }.
% 0.71/1.08 (3) {G1,W4,D2,L1,V1,M1} Q(1) { iext( uri_owl_sameAs, X, X ) }.
% 0.71/1.08 (4) {G2,W0,D0,L0,V0,M0} S(2);r(3) { }.
% 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 (6) {G0,W7,D2,L2,V2,M2} { ! iext( uri_owl_sameAs, X, Y ), X = Y }.
% 0.71/1.08 (7) {G0,W7,D2,L2,V2,M2} { ! X = Y, iext( uri_owl_sameAs, X, Y ) }.
% 0.71/1.08 (8) {G0,W4,D2,L1,V0,M1} { ! iext( uri_owl_sameAs, uri_owl_sameAs,
% 0.71/1.08 uri_owl_sameAs ) }.
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Total Proof:
% 0.71/1.08
% 0.71/1.08 subsumption: (1) {G0,W7,D2,L2,V2,M2} I { ! X = Y, iext( uri_owl_sameAs, X,
% 0.71/1.08 Y ) }.
% 0.71/1.08 parent0: (7) {G0,W7,D2,L2,V2,M2} { ! X = Y, iext( uri_owl_sameAs, X, Y )
% 0.71/1.08 }.
% 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: (2) {G0,W4,D2,L1,V0,M1} I { ! iext( uri_owl_sameAs,
% 0.71/1.08 uri_owl_sameAs, uri_owl_sameAs ) }.
% 0.71/1.08 parent0: (8) {G0,W4,D2,L1,V0,M1} { ! iext( uri_owl_sameAs, uri_owl_sameAs
% 0.71/1.08 , uri_owl_sameAs ) }.
% 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 eqswap: (13) {G0,W7,D2,L2,V2,M2} { ! Y = X, iext( uri_owl_sameAs, X, Y )
% 0.71/1.08 }.
% 0.71/1.08 parent0[0]: (1) {G0,W7,D2,L2,V2,M2} I { ! X = Y, iext( uri_owl_sameAs, X, Y
% 0.71/1.08 ) }.
% 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
% 0.71/1.08 eqrefl: (14) {G0,W4,D2,L1,V1,M1} { iext( uri_owl_sameAs, X, X ) }.
% 0.71/1.08 parent0[0]: (13) {G0,W7,D2,L2,V2,M2} { ! Y = X, iext( uri_owl_sameAs, X, Y
% 0.71/1.08 ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 X := X
% 0.71/1.08 Y := X
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (3) {G1,W4,D2,L1,V1,M1} Q(1) { iext( uri_owl_sameAs, X, X )
% 0.71/1.08 }.
% 0.71/1.08 parent0: (14) {G0,W4,D2,L1,V1,M1} { iext( uri_owl_sameAs, X, X ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 X := X
% 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: (15) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.08 parent0[0]: (2) {G0,W4,D2,L1,V0,M1} I { ! iext( uri_owl_sameAs,
% 0.71/1.08 uri_owl_sameAs, uri_owl_sameAs ) }.
% 0.71/1.08 parent1[0]: (3) {G1,W4,D2,L1,V1,M1} Q(1) { iext( uri_owl_sameAs, X, X ) }.
% 0.71/1.08 substitution0:
% 0.71/1.08 end
% 0.71/1.08 substitution1:
% 0.71/1.08 X := uri_owl_sameAs
% 0.71/1.08 end
% 0.71/1.08
% 0.71/1.08 subsumption: (4) {G2,W0,D0,L0,V0,M0} S(2);r(3) { }.
% 0.71/1.08 parent0: (15) {G1,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: 72
% 0.71/1.08 space for clauses: 298
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 clauses generated: 5
% 0.71/1.08 clauses kept: 5
% 0.71/1.08 clauses selected: 1
% 0.71/1.08 clauses deleted: 1
% 0.71/1.08 clauses inuse deleted: 0
% 0.71/1.08
% 0.71/1.08 subsentry: 27
% 0.71/1.08 literals s-matched: 27
% 0.71/1.08 literals matched: 27
% 0.71/1.08 full subsumption: 0
% 0.71/1.08
% 0.71/1.08 checksum: -1610752276
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Bliksem ended
%------------------------------------------------------------------------------