TSTP Solution File: SWB002+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWB002+2 : TPTP v8.1.0. Released v5.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 18:47:28 EDT 2022
% Result : Theorem 0.42s 1.06s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWB002+2 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.12 % 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 : Wed Jun 1 11:47:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.06 *** allocated 10000 integers for termspace/termends
% 0.42/1.06 *** allocated 10000 integers for clauses
% 0.42/1.06 *** allocated 10000 integers for justifications
% 0.42/1.06 Bliksem 1.12
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Automatic Strategy Selection
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Clauses:
% 0.42/1.06
% 0.42/1.06 { ! iext( uri_ex_p, X, Y ), ! iext( uri_ex_q, Y, X ) }.
% 0.42/1.06 { iext( uri_ex_p, uri_ex_s, skol1 ) }.
% 0.42/1.06 { iext( uri_ex_q, skol1, uri_ex_s ) }.
% 0.42/1.06
% 0.42/1.06 percentage equality = 0.000000, percentage horn = 1.000000
% 0.42/1.06 This is a near-Horn, non-equality problem
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Options Used:
% 0.42/1.06
% 0.42/1.06 useres = 1
% 0.42/1.06 useparamod = 0
% 0.42/1.06 useeqrefl = 0
% 0.42/1.06 useeqfact = 0
% 0.42/1.06 usefactor = 1
% 0.42/1.06 usesimpsplitting = 0
% 0.42/1.06 usesimpdemod = 0
% 0.42/1.06 usesimpres = 4
% 0.42/1.06
% 0.42/1.06 resimpinuse = 1000
% 0.42/1.06 resimpclauses = 20000
% 0.42/1.06 substype = standard
% 0.42/1.06 backwardsubs = 1
% 0.42/1.06 selectoldest = 5
% 0.42/1.06
% 0.42/1.06 litorderings [0] = split
% 0.42/1.06 litorderings [1] = liftord
% 0.42/1.06
% 0.42/1.06 termordering = none
% 0.42/1.06
% 0.42/1.06 litapriori = 1
% 0.42/1.06 termapriori = 0
% 0.42/1.06 litaposteriori = 0
% 0.42/1.06 termaposteriori = 0
% 0.42/1.06 demodaposteriori = 0
% 0.42/1.06 ordereqreflfact = 0
% 0.42/1.06
% 0.42/1.06 litselect = negative
% 0.42/1.06
% 0.42/1.06 maxweight = 30000
% 0.42/1.06 maxdepth = 30000
% 0.42/1.06 maxlength = 115
% 0.42/1.06 maxnrvars = 195
% 0.42/1.06 excuselevel = 0
% 0.42/1.06 increasemaxweight = 0
% 0.42/1.06
% 0.42/1.06 maxselected = 10000000
% 0.42/1.06 maxnrclauses = 10000000
% 0.42/1.06
% 0.42/1.06 showgenerated = 0
% 0.42/1.06 showkept = 0
% 0.42/1.06 showselected = 0
% 0.42/1.06 showdeleted = 0
% 0.42/1.06 showresimp = 1
% 0.42/1.06 showstatus = 2000
% 0.42/1.06
% 0.42/1.06 prologoutput = 0
% 0.42/1.06 nrgoals = 5000000
% 0.42/1.06 totalproof = 1
% 0.42/1.06
% 0.42/1.06 Symbols occurring in the translation:
% 0.42/1.06
% 0.42/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.06 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.42/1.06 ! [4, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.42/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 uri_ex_p [37, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.42/1.06 iext [38, 3] (w:1, o:42, a:1, s:1, b:0),
% 0.42/1.06 uri_ex_q [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.42/1.06 uri_ex_s [41, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.42/1.06 skol1 [42, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Starting Search:
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksems!, er is een bewijs:
% 0.42/1.06 % SZS status Theorem
% 0.42/1.06 % SZS output start Refutation
% 0.42/1.06
% 0.42/1.06 (0) {G0,W10,D2,L2,V2,M1} I { ! iext( uri_ex_q, Y, X ), ! iext( uri_ex_p, X
% 0.42/1.06 , Y ) }.
% 0.42/1.06 (1) {G0,W4,D2,L1,V0,M1} I { iext( uri_ex_p, uri_ex_s, skol1 ) }.
% 0.42/1.06 (2) {G0,W4,D2,L1,V0,M1} I { iext( uri_ex_q, skol1, uri_ex_s ) }.
% 0.42/1.06 (3) {G1,W0,D0,L0,V0,M0} R(0,1);r(2) { }.
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 % SZS output end Refutation
% 0.42/1.06 found a proof!
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Unprocessed initial clauses:
% 0.42/1.06
% 0.42/1.06 (5) {G0,W10,D2,L2,V2,M2} { ! iext( uri_ex_p, X, Y ), ! iext( uri_ex_q, Y,
% 0.42/1.06 X ) }.
% 0.42/1.06 (6) {G0,W4,D2,L1,V0,M1} { iext( uri_ex_p, uri_ex_s, skol1 ) }.
% 0.42/1.06 (7) {G0,W4,D2,L1,V0,M1} { iext( uri_ex_q, skol1, uri_ex_s ) }.
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Total Proof:
% 0.42/1.06
% 0.42/1.06 subsumption: (0) {G0,W10,D2,L2,V2,M1} I { ! iext( uri_ex_q, Y, X ), ! iext
% 0.42/1.06 ( uri_ex_p, X, Y ) }.
% 0.42/1.06 parent0: (5) {G0,W10,D2,L2,V2,M2} { ! iext( uri_ex_p, X, Y ), ! iext(
% 0.42/1.06 uri_ex_q, Y, X ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := X
% 0.42/1.06 Y := Y
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 1
% 0.42/1.06 1 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (1) {G0,W4,D2,L1,V0,M1} I { iext( uri_ex_p, uri_ex_s, skol1 )
% 0.42/1.06 }.
% 0.42/1.06 parent0: (6) {G0,W4,D2,L1,V0,M1} { iext( uri_ex_p, uri_ex_s, skol1 ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (2) {G0,W4,D2,L1,V0,M1} I { iext( uri_ex_q, skol1, uri_ex_s )
% 0.42/1.06 }.
% 0.42/1.06 parent0: (7) {G0,W4,D2,L1,V0,M1} { iext( uri_ex_q, skol1, uri_ex_s ) }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 0 ==> 0
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 resolution: (8) {G1,W5,D2,L1,V0,M1} { ! iext( uri_ex_q, skol1, uri_ex_s )
% 0.42/1.06 }.
% 0.42/1.06 parent0[1]: (0) {G0,W10,D2,L2,V2,M1} I { ! iext( uri_ex_q, Y, X ), ! iext(
% 0.42/1.06 uri_ex_p, X, Y ) }.
% 0.42/1.06 parent1[0]: (1) {G0,W4,D2,L1,V0,M1} I { iext( uri_ex_p, uri_ex_s, skol1 )
% 0.42/1.06 }.
% 0.42/1.06 substitution0:
% 0.42/1.06 X := uri_ex_s
% 0.42/1.06 Y := skol1
% 0.42/1.06 end
% 0.42/1.06 substitution1:
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 resolution: (9) {G1,W0,D0,L0,V0,M0} { }.
% 0.42/1.06 parent0[0]: (8) {G1,W5,D2,L1,V0,M1} { ! iext( uri_ex_q, skol1, uri_ex_s )
% 0.42/1.06 }.
% 0.42/1.06 parent1[0]: (2) {G0,W4,D2,L1,V0,M1} I { iext( uri_ex_q, skol1, uri_ex_s )
% 0.42/1.06 }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 substitution1:
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 subsumption: (3) {G1,W0,D0,L0,V0,M0} R(0,1);r(2) { }.
% 0.42/1.06 parent0: (9) {G1,W0,D0,L0,V0,M0} { }.
% 0.42/1.06 substitution0:
% 0.42/1.06 end
% 0.42/1.06 permutation0:
% 0.42/1.06 end
% 0.42/1.06
% 0.42/1.06 Proof check complete!
% 0.42/1.06
% 0.42/1.06 Memory use:
% 0.42/1.06
% 0.42/1.06 space for terms: 69
% 0.42/1.06 space for clauses: 233
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 clauses generated: 4
% 0.42/1.06 clauses kept: 4
% 0.42/1.06 clauses selected: 3
% 0.42/1.06 clauses deleted: 0
% 0.42/1.06 clauses inuse deleted: 0
% 0.42/1.06
% 0.42/1.06 subsentry: 0
% 0.42/1.06 literals s-matched: 0
% 0.42/1.06 literals matched: 0
% 0.42/1.06 full subsumption: 0
% 0.42/1.06
% 0.42/1.06 checksum: -134218921
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksem ended
%------------------------------------------------------------------------------