TSTP Solution File: SWV237+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV237+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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 : 600s
% DateTime : Wed Jul 20 21:41:43 EDT 2022
% Result : Theorem 0.24s 0.51s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 6 unt; 0 nHn; 12 RR)
% Number of literals : 20 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
p(a),
file('SWV237+1.p',unknown),
[] ).
cnf(4,axiom,
p(enc(tmk,pp)),
file('SWV237+1.p',unknown),
[] ).
cnf(9,axiom,
~ p(enc(pp,a)),
file('SWV237+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ p(u)
| p(enc(tc,u)) ),
file('SWV237+1.p',unknown),
[] ).
cnf(13,axiom,
equal(enc(i(u),enc(u,v)),v),
file('SWV237+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ p(u)
| ~ p(v)
| p(enc(enc(i(tmk),u),enc(i(tc),v))) ),
file('SWV237+1.p',unknown),
[] ).
cnf(90,plain,
( ~ p(enc(tmk,u))
| ~ p(v)
| p(enc(u,enc(i(tc),v))) ),
inference(spr,[status(thm),theory(equality)],[13,21]),
[iquote('0:SpR:13.0,21.2')] ).
cnf(234,plain,
( ~ p(u)
| p(enc(pp,enc(i(tc),u))) ),
inference(sor,[status(thm)],[90,4]),
[iquote('0:SoR:90.0,4.0')] ).
cnf(251,plain,
( ~ p(enc(tc,u))
| p(enc(pp,u)) ),
inference(spr,[status(thm),theory(equality)],[13,234]),
[iquote('0:SpR:13.0,234.1')] ).
cnf(253,plain,
( ~ p(u)
| p(enc(pp,u)) ),
inference(sor,[status(thm)],[251,12]),
[iquote('0:SoR:251.0,12.1')] ).
cnf(261,plain,
~ p(a),
inference(res,[status(thm),theory(equality)],[253,9]),
[iquote('0:Res:253.1,9.0')] ).
cnf(262,plain,
$false,
inference(ssi,[status(thm)],[261,2]),
[iquote('0:SSi:261.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SWV237+1 : TPTP v8.1.0. Released v3.2.0.
% 0.09/0.15 % Command : run_spass %d %s
% 0.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Thu Jun 16 01:09:00 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.24/0.51
% 0.24/0.51 SPASS V 3.9
% 0.24/0.51 SPASS beiseite: Proof found.
% 0.24/0.51 % SZS status Theorem
% 0.24/0.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.51 SPASS derived 231 clauses, backtracked 0 clauses, performed 0 splits and kept 159 clauses.
% 0.24/0.51 SPASS allocated 97845 KBytes.
% 0.24/0.51 SPASS spent 0:00:00.12 on the problem.
% 0.24/0.51 0:00:00.04 for the input.
% 0.24/0.51 0:00:00.03 for the FLOTTER CNF translation.
% 0.24/0.51 0:00:00.01 for inferences.
% 0.24/0.51 0:00:00.00 for the backtracking.
% 0.24/0.51 0:00:00.03 for the reduction.
% 0.24/0.51
% 0.24/0.51
% 0.24/0.51 Here is a proof with depth 5, length 12 :
% 0.24/0.51 % SZS output start Refutation
% See solution above
% 0.24/0.51 Formulae used in the proof : intruder_knows_8 intruder_knows_1 co1 encrypt_clear_key_as_Tcomms_key enc_dec_cancel encrypt_a_stored_comms_key
% 0.24/0.51
%------------------------------------------------------------------------------