TSTP Solution File: SWB006+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n022.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:30 EDT 2022
% Result : Theorem 0.47s 1.10s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.14 % Command : bliksem %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % DateTime : Wed Jun 1 06:22:37 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.47/1.10 *** allocated 10000 integers for termspace/termends
% 0.47/1.10 *** allocated 10000 integers for clauses
% 0.47/1.10 *** allocated 10000 integers for justifications
% 0.47/1.10 Bliksem 1.12
% 0.47/1.10
% 0.47/1.10
% 0.47/1.10 Automatic Strategy Selection
% 0.47/1.10
% 0.47/1.10
% 0.47/1.10 Clauses:
% 0.47/1.10
% 0.47/1.10 { ! iext( uri_owl_sameAs, X, Y ), X = Y }.
% 0.47/1.10 { ! X = Y, iext( uri_owl_sameAs, X, Y ) }.
% 0.47/1.10 { ! iext( uri_owl_sameAs, uri_ex_u, uri_ex_w ) }.
% 0.47/1.10 { iext( uri_owl_sameAs, uri_ex_u, literal_plain( dat_str_abc ) ) }.
% 0.47/1.10 { iext( uri_owl_sameAs, skol1, literal_plain( dat_str_abc ) ) }.
% 0.47/1.10 { iext( uri_owl_sameAs, skol1, uri_ex_w ) }.
% 0.47/1.10
% 0.47/1.10 percentage equality = 0.250000, percentage horn = 1.000000
% 0.47/1.10 This is a problem with some equality
% 0.47/1.10
% 0.47/1.10
% 0.47/1.10
% 0.47/1.10 Options Used:
% 0.47/1.10
% 0.47/1.10 useres = 1
% 0.47/1.10 useparamod = 1
% 0.47/1.10 useeqrefl = 1
% 0.47/1.10 useeqfact = 1
% 0.47/1.10 usefactor = 1
% 0.47/1.10 usesimpsplitting = 0
% 0.47/1.10 usesimpdemod = 5
% 0.47/1.10 usesimpres = 3
% 0.47/1.10
% 0.47/1.10 resimpinuse = 1000
% 0.47/1.10 resimpclauses = 20000
% 0.47/1.10 substype = eqrewr
% 0.47/1.10 backwardsubs = 1
% 0.47/1.10 selectoldest = 5
% 0.47/1.10
% 0.47/1.10 litorderings [0] = split
% 0.47/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.47/1.10
% 0.47/1.10 termordering = kbo
% 0.47/1.10
% 0.47/1.10 litapriori = 0
% 0.47/1.10 termapriori = 1
% 0.47/1.10 litaposteriori = 0
% 0.47/1.10 termaposteriori = 0
% 0.47/1.10 demodaposteriori = 0
% 0.47/1.10 ordereqreflfact = 0
% 0.47/1.10
% 0.47/1.10 litselect = negord
% 0.47/1.10
% 0.47/1.10 maxweight = 15
% 0.47/1.10 maxdepth = 30000
% 0.47/1.10 maxlength = 115
% 0.47/1.10 maxnrvars = 195
% 0.47/1.10 excuselevel = 1
% 0.47/1.10 increasemaxweight = 1
% 0.47/1.10
% 0.47/1.10 maxselected = 10000000
% 0.47/1.10 maxnrclauses = 10000000
% 0.47/1.10
% 0.47/1.10 showgenerated = 0
% 0.47/1.10 showkept = 0
% 0.47/1.10 showselected = 0
% 0.47/1.10 showdeleted = 0
% 0.47/1.10 showresimp = 1
% 0.47/1.10 showstatus = 2000
% 0.47/1.10
% 0.47/1.10 prologoutput = 0
% 0.47/1.10 nrgoals = 5000000
% 0.47/1.10 totalproof = 1
% 0.47/1.10
% 0.47/1.10 Symbols occurring in the translation:
% 0.47/1.10
% 0.47/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.47/1.10 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.47/1.10 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.47/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.10 uri_owl_sameAs [37, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.47/1.10 iext [38, 3] (w:1, o:44, a:1, s:1, b:0),
% 0.47/1.10 uri_ex_u [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.47/1.10 uri_ex_w [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.47/1.10 dat_str_abc [42, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.47/1.10 literal_plain [43, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.47/1.10 skol1 [44, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.47/1.10
% 0.47/1.10
% 0.47/1.10 Starting Search:
% 0.47/1.10
% 0.47/1.10
% 0.47/1.10 Bliksems!, er is een bewijs:
% 0.47/1.10 % SZS status Theorem
% 0.47/1.10 % SZS output start Refutation
% 0.47/1.10
% 0.47/1.10 (0) {G0,W7,D2,L2,V2,M2} I { ! iext( uri_owl_sameAs, X, Y ), X = Y }.
% 0.47/1.10 (2) {G0,W4,D2,L1,V0,M1} I { ! iext( uri_owl_sameAs, uri_ex_u, uri_ex_w )
% 0.47/1.10 }.
% 0.47/1.10 (3) {G0,W5,D3,L1,V0,M1} I { iext( uri_owl_sameAs, uri_ex_u, literal_plain(
% 0.47/1.10 dat_str_abc ) ) }.
% 0.47/1.10 (4) {G0,W5,D3,L1,V0,M1} I { iext( uri_owl_sameAs, skol1, literal_plain(
% 0.47/1.10 dat_str_abc ) ) }.
% 0.47/1.10 (5) {G0,W4,D2,L1,V0,M1} I { iext( uri_owl_sameAs, skol1, uri_ex_w ) }.
% 0.47/1.10 (7) {G1,W4,D3,L1,V0,M1} R(0,3) { literal_plain( dat_str_abc ) ==> uri_ex_u
% 0.47/1.10 }.
% 0.47/1.10 (8) {G2,W3,D2,L1,V0,M1} R(0,4);d(7) { skol1 ==> uri_ex_u }.
% 0.47/1.10 (9) {G3,W3,D2,L1,V0,M1} R(0,5);d(8) { uri_ex_w ==> uri_ex_u }.
% 0.47/1.10 (15) {G2,W8,D2,L2,V1,M2} P(0,3);d(7) { iext( uri_owl_sameAs, uri_ex_u, X )
% 0.47/1.10 , ! iext( uri_owl_sameAs, X, uri_ex_u ) }.
% 0.47/1.10 (20) {G4,W4,D2,L1,V1,M1} P(0,2);d(9);r(15) { ! iext( uri_owl_sameAs, X,
% 0.47/1.10 uri_ex_u ) }.
% 0.47/1.10 (22) {G5,W0,D0,L0,V0,M0} P(8,4);d(7);r(20) { }.
% 0.47/1.10
% 0.47/1.10
% 0.47/1.10 % SZS output end Refutation
% 0.47/1.10 found a proof!
% 0.47/1.10
% 0.47/1.10
% 0.47/1.10 Unprocessed initial clauses:
% 0.47/1.10
% 0.47/1.10 (24) {G0,W7,D2,L2,V2,M2} { ! iext( uri_owl_sameAs, X, Y ), X = Y }.
% 0.47/1.10 (25) {G0,W7,D2,L2,V2,M2} { ! X = Y, iext( uri_owl_sameAs, X, Y ) }.
% 0.47/1.10 (26) {G0,W4,D2,L1,V0,M1} { ! iext( uri_owl_sameAs, uri_ex_u, uri_ex_w )
% 0.47/1.10 }.
% 0.47/1.10 (27) {G0,W5,D3,L1,V0,M1} { iext( uri_owl_sameAs, uri_ex_u, literal_plain(
% 0.47/1.10 dat_str_abc ) ) }.
% 0.47/1.10 (28) {G0,W5,D3,L1,V0,M1} { iext( uri_owl_sameAs, skol1, literal_plain(
% 0.47/1.10 dat_str_abc ) ) }.
% 0.47/1.10 (29) {G0,W4,D2,L1,V0,M1} { iext( uri_owl_sameAs, skol1, uri_ex_w ) }.
% 0.47/1.10
% 0.47/1.10
% 0.47/1.10 Total Proof:
% 0.47/1.10
% 0.47/1.10 subsumption: (0) {G0,W7,D2,L2,V2,M2} I { ! iext( uri_owl_sameAs, X, Y ), X
% 0.47/1.10 = Y }.
% 0.47/1.10 parent0: (24) {G0,W7,D2,L2,V2,M2} { ! iext( uri_owl_sameAs, X, Y ), X = Y
% 0.47/1.10 }.
% 0.47/1.10 substitution0:
% 0.47/1.10 X := X
% 0.47/1.10 Y := Y
% 0.47/1.10 end
% 0.47/1.10 permutation0:
% 0.47/1.10 0 ==> 0
% 0.47/1.10 1 ==> 1
% 0.47/1.10 end
% 0.47/1.10
% 0.47/1.10 subsumption: (2) {G0,W4,D2,L1,V0,M1} I { ! iext( uri_owl_sameAs, uri_ex_u,
% 0.85/1.21 uri_ex_w ) }.
% 0.85/1.21 parent0: (26) {G0,W4,D2,L1,V0,M1} { ! iext( uri_owl_sameAs, uri_ex_u,
% 0.85/1.21 uri_ex_w ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (3) {G0,W5,D3,L1,V0,M1} I { iext( uri_owl_sameAs, uri_ex_u,
% 0.85/1.21 literal_plain( dat_str_abc ) ) }.
% 0.85/1.21 parent0: (27) {G0,W5,D3,L1,V0,M1} { iext( uri_owl_sameAs, uri_ex_u,
% 0.85/1.21 literal_plain( dat_str_abc ) ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (4) {G0,W5,D3,L1,V0,M1} I { iext( uri_owl_sameAs, skol1,
% 0.85/1.21 literal_plain( dat_str_abc ) ) }.
% 0.85/1.21 parent0: (28) {G0,W5,D3,L1,V0,M1} { iext( uri_owl_sameAs, skol1,
% 0.85/1.21 literal_plain( dat_str_abc ) ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (5) {G0,W4,D2,L1,V0,M1} I { iext( uri_owl_sameAs, skol1,
% 0.85/1.21 uri_ex_w ) }.
% 0.85/1.21 parent0: (29) {G0,W4,D2,L1,V0,M1} { iext( uri_owl_sameAs, skol1, uri_ex_w
% 0.85/1.21 ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqswap: (39) {G0,W7,D2,L2,V2,M2} { Y = X, ! iext( uri_owl_sameAs, X, Y )
% 0.85/1.21 }.
% 0.85/1.21 parent0[1]: (0) {G0,W7,D2,L2,V2,M2} I { ! iext( uri_owl_sameAs, X, Y ), X =
% 0.85/1.21 Y }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 Y := Y
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 resolution: (40) {G1,W4,D3,L1,V0,M1} { literal_plain( dat_str_abc ) =
% 0.85/1.21 uri_ex_u }.
% 0.85/1.21 parent0[1]: (39) {G0,W7,D2,L2,V2,M2} { Y = X, ! iext( uri_owl_sameAs, X, Y
% 0.85/1.21 ) }.
% 0.85/1.21 parent1[0]: (3) {G0,W5,D3,L1,V0,M1} I { iext( uri_owl_sameAs, uri_ex_u,
% 0.85/1.21 literal_plain( dat_str_abc ) ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := uri_ex_u
% 0.85/1.21 Y := literal_plain( dat_str_abc )
% 0.85/1.21 end
% 0.85/1.21 substitution1:
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (7) {G1,W4,D3,L1,V0,M1} R(0,3) { literal_plain( dat_str_abc )
% 0.85/1.21 ==> uri_ex_u }.
% 0.85/1.21 parent0: (40) {G1,W4,D3,L1,V0,M1} { literal_plain( dat_str_abc ) =
% 0.85/1.21 uri_ex_u }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqswap: (42) {G0,W7,D2,L2,V2,M2} { Y = X, ! iext( uri_owl_sameAs, X, Y )
% 0.85/1.21 }.
% 0.85/1.21 parent0[1]: (0) {G0,W7,D2,L2,V2,M2} I { ! iext( uri_owl_sameAs, X, Y ), X =
% 0.85/1.21 Y }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 Y := Y
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 resolution: (44) {G1,W4,D3,L1,V0,M1} { literal_plain( dat_str_abc ) =
% 0.85/1.21 skol1 }.
% 0.85/1.21 parent0[1]: (42) {G0,W7,D2,L2,V2,M2} { Y = X, ! iext( uri_owl_sameAs, X, Y
% 0.85/1.21 ) }.
% 0.85/1.21 parent1[0]: (4) {G0,W5,D3,L1,V0,M1} I { iext( uri_owl_sameAs, skol1,
% 0.85/1.21 literal_plain( dat_str_abc ) ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := skol1
% 0.85/1.21 Y := literal_plain( dat_str_abc )
% 0.85/1.21 end
% 0.85/1.21 substitution1:
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 paramod: (45) {G2,W3,D2,L1,V0,M1} { uri_ex_u = skol1 }.
% 0.85/1.21 parent0[0]: (7) {G1,W4,D3,L1,V0,M1} R(0,3) { literal_plain( dat_str_abc )
% 0.85/1.21 ==> uri_ex_u }.
% 0.85/1.21 parent1[0; 1]: (44) {G1,W4,D3,L1,V0,M1} { literal_plain( dat_str_abc ) =
% 0.85/1.21 skol1 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 substitution1:
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqswap: (46) {G2,W3,D2,L1,V0,M1} { skol1 = uri_ex_u }.
% 0.85/1.21 parent0[0]: (45) {G2,W3,D2,L1,V0,M1} { uri_ex_u = skol1 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (8) {G2,W3,D2,L1,V0,M1} R(0,4);d(7) { skol1 ==> uri_ex_u }.
% 0.85/1.21 parent0: (46) {G2,W3,D2,L1,V0,M1} { skol1 = uri_ex_u }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqswap: (47) {G0,W7,D2,L2,V2,M2} { Y = X, ! iext( uri_owl_sameAs, X, Y )
% 0.85/1.21 }.
% 0.85/1.21 parent0[1]: (0) {G0,W7,D2,L2,V2,M2} I { ! iext( uri_owl_sameAs, X, Y ), X =
% 0.85/1.21 Y }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 Y := Y
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 resolution: (49) {G1,W3,D2,L1,V0,M1} { uri_ex_w = skol1 }.
% 0.85/1.21 parent0[1]: (47) {G0,W7,D2,L2,V2,M2} { Y = X, ! iext( uri_owl_sameAs, X, Y
% 0.85/1.21 ) }.
% 0.85/1.21 parent1[0]: (5) {G0,W4,D2,L1,V0,M1} I { iext( uri_owl_sameAs, skol1,
% 0.85/1.21 uri_ex_w ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := skol1
% 0.85/1.21 Y := uri_ex_w
% 0.85/1.21 end
% 0.85/1.21 substitution1:
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 paramod: (50) {G2,W3,D2,L1,V0,M1} { uri_ex_w = uri_ex_u }.
% 0.85/1.21 parent0[0]: (8) {G2,W3,D2,L1,V0,M1} R(0,4);d(7) { skol1 ==> uri_ex_u }.
% 0.85/1.21 parent1[0; 2]: (49) {G1,W3,D2,L1,V0,M1} { uri_ex_w = skol1 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 substitution1:
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (9) {G3,W3,D2,L1,V0,M1} R(0,5);d(8) { uri_ex_w ==> uri_ex_u
% 0.85/1.21 }.
% 0.85/1.21 parent0: (50) {G2,W3,D2,L1,V0,M1} { uri_ex_w = uri_ex_u }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 *** allocated 15000 integers for termspace/termends
% 0.85/1.21 *** allocated 15000 integers for justifications
% 0.85/1.21 *** allocated 15000 integers for clauses
% 0.85/1.21 *** allocated 22500 integers for termspace/termends
% 0.85/1.21 *** allocated 22500 integers for justifications
% 0.85/1.21 *** allocated 22500 integers for clauses
% 0.85/1.21 *** allocated 33750 Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------