TSTP Solution File: SWV011+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV011+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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 : Wed Jul 20 16:22:09 EDT 2022
% Result : Theorem 0.42s 1.07s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV011+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n013.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 15 07:18:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.07 *** allocated 10000 integers for termspace/termends
% 0.42/1.07 *** allocated 10000 integers for clauses
% 0.42/1.07 *** allocated 10000 integers for justifications
% 0.42/1.07 Bliksem 1.12
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Automatic Strategy Selection
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Clauses:
% 0.42/1.07
% 0.42/1.07 { a_holds( key( at, t ) ) }.
% 0.42/1.07 { party_of_protocol( a ) }.
% 0.42/1.07 { message( sent( a, b, pair( a, an_a_nonce ) ) ) }.
% 0.42/1.07 { a_stored( pair( b, an_a_nonce ) ) }.
% 0.42/1.07 { b_holds( key( bt, t ) ) }.
% 0.42/1.07 { party_of_protocol( b ) }.
% 0.42/1.07 { fresh_to_b( an_a_nonce ) }.
% 0.42/1.07 { t_holds( key( at, a ) ) }.
% 0.42/1.07 { t_holds( key( bt, b ) ) }.
% 0.42/1.07 { party_of_protocol( t ) }.
% 0.42/1.07 { b_holds( key( generate_key( an_a_nonce ), a ) ) }.
% 0.42/1.07 { message( sent( a, b, pair( encrypt( triple( a, generate_key( an_a_nonce )
% 0.42/1.07 , generate_expiration_time( an_a_nonce ) ), bt ), encrypt(
% 0.42/1.07 generate_b_nonce( an_a_nonce ), generate_key( an_a_nonce ) ) ) ) ) }.
% 0.42/1.07 { a_holds( key( generate_key( an_a_nonce ), b ) ) }.
% 0.42/1.07 { message( sent( t, a, triple( encrypt( quadruple( b, an_a_nonce,
% 0.42/1.07 generate_key( an_a_nonce ), generate_expiration_time( an_a_nonce ) ), at
% 0.42/1.07 ), encrypt( triple( a, generate_key( an_a_nonce ),
% 0.42/1.07 generate_expiration_time( an_a_nonce ) ), bt ), generate_b_nonce(
% 0.42/1.07 an_a_nonce ) ) ) ) }.
% 0.42/1.07 { message( sent( b, t, triple( b, generate_b_nonce( an_a_nonce ), encrypt(
% 0.42/1.07 triple( a, an_a_nonce, generate_expiration_time( an_a_nonce ) ), bt ) ) )
% 0.42/1.07 ) }.
% 0.42/1.07 { b_stored( pair( a, an_a_nonce ) ) }.
% 0.42/1.07 { ! a_holds( key( X, b ) ), ! b_holds( key( X, a ) ) }.
% 0.42/1.07
% 0.42/1.07 percentage equality = 0.000000, percentage horn = 1.000000
% 0.42/1.07 This is a near-Horn, non-equality problem
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Options Used:
% 0.42/1.07
% 0.42/1.07 useres = 1
% 0.42/1.07 useparamod = 0
% 0.42/1.07 useeqrefl = 0
% 0.42/1.07 useeqfact = 0
% 0.42/1.07 usefactor = 1
% 0.42/1.07 usesimpsplitting = 0
% 0.42/1.07 usesimpdemod = 0
% 0.42/1.07 usesimpres = 4
% 0.42/1.07
% 0.42/1.07 resimpinuse = 1000
% 0.42/1.07 resimpclauses = 20000
% 0.42/1.07 substype = standard
% 0.42/1.07 backwardsubs = 1
% 0.42/1.07 selectoldest = 5
% 0.42/1.07
% 0.42/1.07 litorderings [0] = split
% 0.42/1.07 litorderings [1] = liftord
% 0.42/1.07
% 0.42/1.07 termordering = none
% 0.42/1.07
% 0.42/1.07 litapriori = 1
% 0.42/1.07 termapriori = 0
% 0.42/1.07 litaposteriori = 0
% 0.42/1.07 termaposteriori = 0
% 0.42/1.07 demodaposteriori = 0
% 0.42/1.07 ordereqreflfact = 0
% 0.42/1.07
% 0.42/1.07 litselect = negative
% 0.42/1.07
% 0.42/1.07 maxweight = 30000
% 0.42/1.07 maxdepth = 30000
% 0.42/1.07 maxlength = 115
% 0.42/1.07 maxnrvars = 195
% 0.42/1.07 excuselevel = 0
% 0.42/1.07 increasemaxweight = 0
% 0.42/1.07
% 0.42/1.07 maxselected = 10000000
% 0.42/1.07 maxnrclauses = 10000000
% 0.42/1.07
% 0.42/1.07 showgenerated = 0
% 0.42/1.07 showkept = 0
% 0.42/1.07 showselected = 0
% 0.42/1.07 showdeleted = 0
% 0.42/1.07 showresimp = 1
% 0.42/1.07 showstatus = 2000
% 0.42/1.07
% 0.42/1.07 prologoutput = 0
% 0.42/1.07 nrgoals = 5000000
% 0.42/1.07 totalproof = 1
% 0.42/1.07
% 0.42/1.07 Symbols occurring in the translation:
% 0.42/1.07
% 0.42/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.07 . [1, 2] (w:1, o:29, a:1, s:1, b:0),
% 0.42/1.07 ! [4, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.42/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.07 at [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.42/1.07 t [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.42/1.07 key [37, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.42/1.07 a_holds [38, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.42/1.07 a [39, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.42/1.07 party_of_protocol [40, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.07 b [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.42/1.07 an_a_nonce [42, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.42/1.07 pair [43, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.42/1.07 sent [44, 3] (w:1, o:56, a:1, s:1, b:0),
% 0.42/1.07 message [45, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.42/1.07 a_stored [46, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.42/1.07 bt [47, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.42/1.07 b_holds [48, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.42/1.07 fresh_to_b [49, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.42/1.07 t_holds [50, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.42/1.07 generate_key [51, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.42/1.07 generate_expiration_time [52, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.42/1.07 triple [53, 3] (w:1, o:57, a:1, s:1, b:0),
% 0.42/1.07 encrypt [54, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.42/1.07 generate_b_nonce [55, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.42/1.07 quadruple [56, 4] (w:1, o:58, a:1, s:1, b:0),
% 0.42/1.07 b_stored [57, 1] (w:1, o:28, a:1, s:1, b:0).
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Starting Search:
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Bliksems!, er is een bewijs:
% 0.42/1.07 % SZS status Theorem
% 0.42/1.07 % SZS output start Refutation
% 0.42/1.07
% 0.42/1.07 (10) {G0,W5,D4,L1,V0,M1} I { b_holds( key( generate_key( an_a_nonce ), a )
% 0.42/1.07 ) }.
% 0.42/1.07 (12) {G0,W5,D4,L1,V0,M1} I { a_holds( key( generate_key( an_a_nonce ), b )
% 0.42/1.07 ) }.
% 0.42/1.07 (16) {G0,W10,D3,L2,V1,M1} I { ! b_holds( key( X, a ) ), ! a_holds( key( X,
% 0.42/1.07 b ) ) }.
% 0.42/1.07 (17) {G1,W0,D0,L0,V0,M0} R(16,12);r(10) { }.
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 % SZS output end Refutation
% 0.42/1.07 found a proof!
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Unprocessed initial clauses:
% 0.42/1.07
% 0.42/1.07 (19) {G0,W4,D3,L1,V0,M1} { a_holds( key( at, t ) ) }.
% 0.42/1.07 (20) {G0,W2,D2,L1,V0,M1} { party_of_protocol( a ) }.
% 0.42/1.07 (21) {G0,W7,D4,L1,V0,M1} { message( sent( a, b, pair( a, an_a_nonce ) ) )
% 0.42/1.07 }.
% 0.42/1.07 (22) {G0,W4,D3,L1,V0,M1} { a_stored( pair( b, an_a_nonce ) ) }.
% 0.42/1.07 (23) {G0,W4,D3,L1,V0,M1} { b_holds( key( bt, t ) ) }.
% 0.42/1.07 (24) {G0,W2,D2,L1,V0,M1} { party_of_protocol( b ) }.
% 0.42/1.07 (25) {G0,W2,D2,L1,V0,M1} { fresh_to_b( an_a_nonce ) }.
% 0.42/1.07 (26) {G0,W4,D3,L1,V0,M1} { t_holds( key( at, a ) ) }.
% 0.42/1.07 (27) {G0,W4,D3,L1,V0,M1} { t_holds( key( bt, b ) ) }.
% 0.42/1.07 (28) {G0,W2,D2,L1,V0,M1} { party_of_protocol( t ) }.
% 0.42/1.07 (29) {G0,W5,D4,L1,V0,M1} { b_holds( key( generate_key( an_a_nonce ), a ) )
% 0.42/1.07 }.
% 0.42/1.07 (30) {G0,W18,D7,L1,V0,M1} { message( sent( a, b, pair( encrypt( triple( a
% 0.42/1.07 , generate_key( an_a_nonce ), generate_expiration_time( an_a_nonce ) ),
% 0.42/1.07 bt ), encrypt( generate_b_nonce( an_a_nonce ), generate_key( an_a_nonce )
% 0.42/1.07 ) ) ) ) }.
% 0.42/1.07 (31) {G0,W5,D4,L1,V0,M1} { a_holds( key( generate_key( an_a_nonce ), b ) )
% 0.42/1.07 }.
% 0.42/1.07 (32) {G0,W24,D7,L1,V0,M1} { message( sent( t, a, triple( encrypt(
% 0.42/1.07 quadruple( b, an_a_nonce, generate_key( an_a_nonce ),
% 0.42/1.07 generate_expiration_time( an_a_nonce ) ), at ), encrypt( triple( a,
% 0.42/1.07 generate_key( an_a_nonce ), generate_expiration_time( an_a_nonce ) ), bt
% 0.42/1.07 ), generate_b_nonce( an_a_nonce ) ) ) ) }.
% 0.42/1.07 (33) {G0,W15,D7,L1,V0,M1} { message( sent( b, t, triple( b,
% 0.42/1.07 generate_b_nonce( an_a_nonce ), encrypt( triple( a, an_a_nonce,
% 0.42/1.07 generate_expiration_time( an_a_nonce ) ), bt ) ) ) ) }.
% 0.42/1.07 (34) {G0,W4,D3,L1,V0,M1} { b_stored( pair( a, an_a_nonce ) ) }.
% 0.42/1.07 (35) {G0,W10,D3,L2,V1,M2} { ! a_holds( key( X, b ) ), ! b_holds( key( X, a
% 0.42/1.07 ) ) }.
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Total Proof:
% 0.42/1.07
% 0.42/1.07 subsumption: (10) {G0,W5,D4,L1,V0,M1} I { b_holds( key( generate_key(
% 0.42/1.07 an_a_nonce ), a ) ) }.
% 0.42/1.07 parent0: (29) {G0,W5,D4,L1,V0,M1} { b_holds( key( generate_key( an_a_nonce
% 0.42/1.07 ), a ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (12) {G0,W5,D4,L1,V0,M1} I { a_holds( key( generate_key(
% 0.42/1.07 an_a_nonce ), b ) ) }.
% 0.42/1.07 parent0: (31) {G0,W5,D4,L1,V0,M1} { a_holds( key( generate_key( an_a_nonce
% 0.42/1.07 ), b ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (16) {G0,W10,D3,L2,V1,M1} I { ! b_holds( key( X, a ) ), !
% 0.42/1.07 a_holds( key( X, b ) ) }.
% 0.42/1.07 parent0: (35) {G0,W10,D3,L2,V1,M2} { ! a_holds( key( X, b ) ), ! b_holds(
% 0.42/1.07 key( X, a ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 1
% 0.42/1.07 1 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (36) {G1,W6,D4,L1,V0,M1} { ! b_holds( key( generate_key(
% 0.42/1.07 an_a_nonce ), a ) ) }.
% 0.42/1.07 parent0[1]: (16) {G0,W10,D3,L2,V1,M1} I { ! b_holds( key( X, a ) ), !
% 0.42/1.07 a_holds( key( X, b ) ) }.
% 0.42/1.07 parent1[0]: (12) {G0,W5,D4,L1,V0,M1} I { a_holds( key( generate_key(
% 0.42/1.07 an_a_nonce ), b ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := generate_key( an_a_nonce )
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (37) {G1,W0,D0,L0,V0,M0} { }.
% 0.42/1.07 parent0[0]: (36) {G1,W6,D4,L1,V0,M1} { ! b_holds( key( generate_key(
% 0.42/1.07 an_a_nonce ), a ) ) }.
% 0.42/1.07 parent1[0]: (10) {G0,W5,D4,L1,V0,M1} I { b_holds( key( generate_key(
% 0.42/1.07 an_a_nonce ), a ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (17) {G1,W0,D0,L0,V0,M0} R(16,12);r(10) { }.
% 0.42/1.07 parent0: (37) {G1,W0,D0,L0,V0,M0} { }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 Proof check complete!
% 0.42/1.07
% 0.42/1.07 Memory use:
% 0.42/1.07
% 0.42/1.07 space for terms: 386
% 0.42/1.07 space for clauses: 1324
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 clauses generated: 18
% 0.42/1.07 clauses kept: 18
% 0.42/1.07 clauses selected: 14
% 0.42/1.07 clauses deleted: 0
% 0.42/1.07 clauses inuse deleted: 0
% 0.42/1.07
% 0.42/1.07 subsentry: 0
% 0.42/1.07 literals s-matched: 0
% 0.42/1.07 literals matched: 0
% 0.42/1.07 full subsumption: 0
% 0.42/1.07
% 0.42/1.07 checksum: 988781546
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Bliksem ended
%------------------------------------------------------------------------------