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