TSTP Solution File: SWB001+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWB001+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:27 EDT 2022
% Result : Theorem 0.72s 1.09s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWB001+2 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.13 % Command : bliksem %s
% 0.14/0.33 % Computer : n021.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % DateTime : Wed Jun 1 07:12:30 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.72/1.09 *** allocated 10000 integers for termspace/termends
% 0.72/1.09 *** allocated 10000 integers for clauses
% 0.72/1.09 *** allocated 10000 integers for justifications
% 0.72/1.09 Bliksem 1.12
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Automatic Strategy Selection
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Clauses:
% 0.72/1.09
% 0.72/1.09 { ! iext( uri_rdf_type, uri_ex_r, uri_owl_Restriction ), ! iext(
% 0.72/1.09 uri_owl_onProperty, uri_ex_r, uri_ex_p ) }.
% 0.72/1.09 { iext( uri_rdfs_subClassOf, uri_ex_c, uri_ex_r ) }.
% 0.72/1.09 { iext( uri_rdf_type, uri_ex_r, uri_owl_Restriction ) }.
% 0.72/1.09 { iext( uri_owl_onProperty, uri_ex_r, uri_ex_p ) }.
% 0.72/1.09 { iext( uri_owl_someValuesFrom, uri_ex_r, uri_ex_d ) }.
% 0.72/1.09
% 0.72/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.72/1.09 This is a near-Horn, non-equality problem
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Options Used:
% 0.72/1.09
% 0.72/1.09 useres = 1
% 0.72/1.09 useparamod = 0
% 0.72/1.09 useeqrefl = 0
% 0.72/1.09 useeqfact = 0
% 0.72/1.09 usefactor = 1
% 0.72/1.09 usesimpsplitting = 0
% 0.72/1.09 usesimpdemod = 0
% 0.72/1.09 usesimpres = 4
% 0.72/1.09
% 0.72/1.09 resimpinuse = 1000
% 0.72/1.09 resimpclauses = 20000
% 0.72/1.09 substype = standard
% 0.72/1.09 backwardsubs = 1
% 0.72/1.09 selectoldest = 5
% 0.72/1.09
% 0.72/1.09 litorderings [0] = split
% 0.72/1.09 litorderings [1] = liftord
% 0.72/1.09
% 0.72/1.09 termordering = none
% 0.72/1.09
% 0.72/1.09 litapriori = 1
% 0.72/1.09 termapriori = 0
% 0.72/1.09 litaposteriori = 0
% 0.72/1.09 termaposteriori = 0
% 0.72/1.09 demodaposteriori = 0
% 0.72/1.09 ordereqreflfact = 0
% 0.72/1.09
% 0.72/1.09 litselect = negative
% 0.72/1.09
% 0.72/1.09 maxweight = 30000
% 0.72/1.09 maxdepth = 30000
% 0.72/1.09 maxlength = 115
% 0.72/1.09 maxnrvars = 195
% 0.72/1.09 excuselevel = 0
% 0.72/1.09 increasemaxweight = 0
% 0.72/1.09
% 0.72/1.09 maxselected = 10000000
% 0.72/1.09 maxnrclauses = 10000000
% 0.72/1.09
% 0.72/1.09 showgenerated = 0
% 0.72/1.09 showkept = 0
% 0.72/1.09 showselected = 0
% 0.72/1.09 showdeleted = 0
% 0.72/1.09 showresimp = 1
% 0.72/1.09 showstatus = 2000
% 0.72/1.09
% 0.72/1.09 prologoutput = 0
% 0.72/1.09 nrgoals = 5000000
% 0.72/1.09 totalproof = 1
% 0.72/1.09
% 0.72/1.09 Symbols occurring in the translation:
% 0.72/1.09
% 0.72/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.09 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.72/1.09 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.72/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.09 uri_rdf_type [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.72/1.09 uri_ex_r [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.72/1.09 uri_owl_Restriction [37, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.72/1.09 iext [38, 3] (w:1, o:44, a:1, s:1, b:0),
% 0.72/1.09 uri_owl_onProperty [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.72/1.09 uri_ex_p [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.72/1.09 uri_rdfs_subClassOf [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.72/1.09 uri_ex_c [42, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.72/1.09 uri_owl_someValuesFrom [43, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.72/1.09 uri_ex_d [44, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Starting Search:
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Bliksems!, er is een bewijs:
% 0.72/1.09 % SZS status Theorem
% 0.72/1.09 % SZS output start Refutation
% 0.72/1.09
% 0.72/1.09 (0) {G0,W10,D2,L2,V0,M1} I { ! iext( uri_owl_onProperty, uri_ex_r, uri_ex_p
% 0.72/1.09 ), ! iext( uri_rdf_type, uri_ex_r, uri_owl_Restriction ) }.
% 0.72/1.09 (2) {G0,W4,D2,L1,V0,M1} I { iext( uri_rdf_type, uri_ex_r,
% 0.72/1.09 uri_owl_Restriction ) }.
% 0.72/1.09 (3) {G0,W4,D2,L1,V0,M1} I { iext( uri_owl_onProperty, uri_ex_r, uri_ex_p )
% 0.72/1.09 }.
% 0.72/1.09 (5) {G1,W0,D0,L0,V0,M0} S(0);r(3);r(2) { }.
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 % SZS output end Refutation
% 0.72/1.09 found a proof!
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Unprocessed initial clauses:
% 0.72/1.09
% 0.72/1.09 (7) {G0,W10,D2,L2,V0,M2} { ! iext( uri_rdf_type, uri_ex_r,
% 0.72/1.09 uri_owl_Restriction ), ! iext( uri_owl_onProperty, uri_ex_r, uri_ex_p )
% 0.72/1.09 }.
% 0.72/1.09 (8) {G0,W4,D2,L1,V0,M1} { iext( uri_rdfs_subClassOf, uri_ex_c, uri_ex_r )
% 0.72/1.09 }.
% 0.72/1.09 (9) {G0,W4,D2,L1,V0,M1} { iext( uri_rdf_type, uri_ex_r,
% 0.72/1.09 uri_owl_Restriction ) }.
% 0.72/1.09 (10) {G0,W4,D2,L1,V0,M1} { iext( uri_owl_onProperty, uri_ex_r, uri_ex_p )
% 0.72/1.09 }.
% 0.72/1.09 (11) {G0,W4,D2,L1,V0,M1} { iext( uri_owl_someValuesFrom, uri_ex_r,
% 0.72/1.09 uri_ex_d ) }.
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Total Proof:
% 0.72/1.09
% 0.72/1.09 subsumption: (0) {G0,W10,D2,L2,V0,M1} I { ! iext( uri_owl_onProperty,
% 0.72/1.09 uri_ex_r, uri_ex_p ), ! iext( uri_rdf_type, uri_ex_r, uri_owl_Restriction
% 0.72/1.09 ) }.
% 0.72/1.09 parent0: (7) {G0,W10,D2,L2,V0,M2} { ! iext( uri_rdf_type, uri_ex_r,
% 0.72/1.09 uri_owl_Restriction ), ! iext( uri_owl_onProperty, uri_ex_r, uri_ex_p )
% 0.72/1.09 }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 1
% 0.72/1.09 1 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (2) {G0,W4,D2,L1,V0,M1} I { iext( uri_rdf_type, uri_ex_r,
% 0.72/1.09 uri_owl_Restriction ) }.
% 0.72/1.09 parent0: (9) {G0,W4,D2,L1,V0,M1} { iext( uri_rdf_type, uri_ex_r,
% 0.72/1.09 uri_owl_Restriction ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (3) {G0,W4,D2,L1,V0,M1} I { iext( uri_owl_onProperty, uri_ex_r
% 0.72/1.09 , uri_ex_p ) }.
% 0.72/1.09 parent0: (10) {G0,W4,D2,L1,V0,M1} { iext( uri_owl_onProperty, uri_ex_r,
% 0.72/1.09 uri_ex_p ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (12) {G1,W5,D2,L1,V0,M1} { ! iext( uri_rdf_type, uri_ex_r,
% 0.72/1.09 uri_owl_Restriction ) }.
% 0.72/1.09 parent0[0]: (0) {G0,W10,D2,L2,V0,M1} I { ! iext( uri_owl_onProperty,
% 0.72/1.09 uri_ex_r, uri_ex_p ), ! iext( uri_rdf_type, uri_ex_r, uri_owl_Restriction
% 0.72/1.09 ) }.
% 0.72/1.09 parent1[0]: (3) {G0,W4,D2,L1,V0,M1} I { iext( uri_owl_onProperty, uri_ex_r
% 0.72/1.09 , uri_ex_p ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (13) {G1,W0,D0,L0,V0,M0} { }.
% 0.72/1.09 parent0[0]: (12) {G1,W5,D2,L1,V0,M1} { ! iext( uri_rdf_type, uri_ex_r,
% 0.72/1.09 uri_owl_Restriction ) }.
% 0.72/1.09 parent1[0]: (2) {G0,W4,D2,L1,V0,M1} I { iext( uri_rdf_type, uri_ex_r,
% 0.72/1.09 uri_owl_Restriction ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (5) {G1,W0,D0,L0,V0,M0} S(0);r(3);r(2) { }.
% 0.72/1.09 parent0: (13) {G1,W0,D0,L0,V0,M0} { }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 Proof check complete!
% 0.72/1.09
% 0.72/1.09 Memory use:
% 0.72/1.09
% 0.72/1.09 space for terms: 98
% 0.72/1.09 space for clauses: 338
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 clauses generated: 6
% 0.72/1.09 clauses kept: 6
% 0.72/1.09 clauses selected: 4
% 0.72/1.09 clauses deleted: 1
% 0.72/1.09 clauses inuse deleted: 0
% 0.72/1.09
% 0.72/1.09 subsentry: 0
% 0.72/1.09 literals s-matched: 0
% 0.72/1.09 literals matched: 0
% 0.72/1.09 full subsumption: 0
% 0.72/1.09
% 0.72/1.09 checksum: -318768474
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Bliksem ended
%------------------------------------------------------------------------------