TSTP Solution File: SWV236+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV236+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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.40s 0.60s
% Output : Refutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 20 ( 11 unt; 0 nHn; 20 RR)
% Number of literals : 33 ( 0 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
p(data),
file('SWV236+1.p',unknown),
[] ).
cnf(11,axiom,
p(crypt(xor__dfg(km,exp),eurk)),
file('SWV236+1.p',unknown),
[] ).
cnf(12,axiom,
p(crypt(xor__dfg(km,data),eurk)),
file('SWV236+1.p',unknown),
[] ).
cnf(13,axiom,
equal(xor__dfg(u,v),xor__dfg(v,u)),
file('SWV236+1.p',unknown),
[] ).
cnf(14,axiom,
equal(decrypt(u,crypt(u,v)),v),
file('SWV236+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ p(u)
| ~ p(crypt(xor__dfg(km,exp),u)) ),
file('SWV236+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ p(crypt(xor__dfg(u,data),v))
| p(crypt(u,v)) ),
file('SWV236+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ p(u)
| ~ p(crypt(xor__dfg(km,data),v))
| p(decrypt(v,u)) ),
file('SWV236+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ p(u)
| ~ p(crypt(xor__dfg(km,u),v))
| ~ p(crypt(xor__dfg(km,exp),w))
| p(crypt(xor__dfg(w,u),v)) ),
file('SWV236+1.p',unknown),
[] ).
cnf(39,plain,
~ p(eurk),
inference(res,[status(thm),theory(equality)],[11,15]),
[iquote('0:Res:11.0,15.1')] ).
cnf(83,plain,
( ~ p(crypt(xor__dfg(data,u),v))
| p(crypt(u,v)) ),
inference(spl,[status(thm),theory(equality)],[13,20]),
[iquote('0:SpL:13.0,20.0')] ).
cnf(168,plain,
( ~ p(u)
| p(decrypt(eurk,u)) ),
inference(res,[status(thm),theory(equality)],[12,23]),
[iquote('0:Res:12.0,23.1')] ).
cnf(170,plain,
( ~ p(crypt(eurk,u))
| p(u) ),
inference(spr,[status(thm),theory(equality)],[14,168]),
[iquote('0:SpR:14.0,168.1')] ).
cnf(716,plain,
( ~ p(data)
| ~ p(crypt(xor__dfg(km,exp),u))
| p(crypt(xor__dfg(u,data),eurk)) ),
inference(res,[status(thm),theory(equality)],[12,25]),
[iquote('0:Res:12.0,25.1')] ).
cnf(723,plain,
( ~ p(crypt(xor__dfg(km,exp),u))
| p(crypt(xor__dfg(u,data),eurk)) ),
inference(ssi,[status(thm)],[716,3]),
[iquote('0:SSi:716.0,3.0')] ).
cnf(1096,plain,
p(crypt(xor__dfg(eurk,data),eurk)),
inference(res,[status(thm),theory(equality)],[11,723]),
[iquote('0:Res:11.0,723.0')] ).
cnf(1098,plain,
p(crypt(xor__dfg(data,eurk),eurk)),
inference(rew,[status(thm),theory(equality)],[13,1096]),
[iquote('0:Rew:13.0,1096.0')] ).
cnf(1102,plain,
p(crypt(eurk,eurk)),
inference(res,[status(thm),theory(equality)],[1098,83]),
[iquote('0:Res:1098.0,83.0')] ).
cnf(1105,plain,
p(eurk),
inference(sor,[status(thm)],[170,1102]),
[iquote('0:SoR:170.0,1102.0')] ).
cnf(1108,plain,
$false,
inference(mrr,[status(thm)],[1105,39]),
[iquote('0:MRR:1105.0,39.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWV236+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jun 14 22:18:25 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.40/0.60
% 0.40/0.60 SPASS V 3.9
% 0.40/0.60 SPASS beiseite: Proof found.
% 0.40/0.60 % SZS status Theorem
% 0.40/0.60 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.60 SPASS derived 766 clauses, backtracked 0 clauses, performed 0 splits and kept 246 clauses.
% 0.40/0.60 SPASS allocated 98589 KBytes.
% 0.40/0.60 SPASS spent 0:00:00.22 on the problem.
% 0.40/0.60 0:00:00.03 for the input.
% 0.40/0.60 0:00:00.03 for the FLOTTER CNF translation.
% 0.40/0.60 0:00:00.01 for inferences.
% 0.40/0.60 0:00:00.00 for the backtracking.
% 0.40/0.60 0:00:00.12 for the reduction.
% 0.40/0.60
% 0.40/0.60
% 0.40/0.60 Here is a proof with depth 4, length 20 :
% 0.40/0.60 % SZS output start Refutation
% See solution above
% 0.40/0.60 Formulae used in the proof : initial_knowledge_of_intruder_3 initial_knowledge_of_intruder_7 initial_knowledge_of_intruder_8 xor_commutative encryption_decryption_cancellation find_known_exporter data_cv_is_known_to_be_zero decrypt_data key_export
% 0.40/0.60
%------------------------------------------------------------------------------