TSTP Solution File: SWV235+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV235+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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.57s
% Output : Refutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 22
% Syntax : Number of clauses : 56 ( 27 unt; 0 nHn; 56 RR)
% Number of literals : 107 ( 0 equ; 55 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
p(kp),
file('SWV235+1.p',unknown),
[] ).
cnf(2,axiom,
p(imp),
file('SWV235+1.p',unknown),
[] ).
cnf(3,axiom,
p(data),
file('SWV235+1.p',unknown),
[] ).
cnf(4,axiom,
p(id__dfg),
file('SWV235+1.p',unknown),
[] ).
cnf(5,axiom,
p(pin),
file('SWV235+1.p',unknown),
[] ).
cnf(6,axiom,
p(exp),
file('SWV235+1.p',unknown),
[] ).
cnf(7,axiom,
p(a),
file('SWV235+1.p',unknown),
[] ).
cnf(8,axiom,
~ p(crypt(pp,a)),
file('SWV235+1.p',unknown),
[] ).
cnf(9,axiom,
equal(xor__dfg(u,id__dfg),u),
file('SWV235+1.p',unknown),
[] ).
cnf(10,axiom,
equal(xor__dfg(u,u),id__dfg),
file('SWV235+1.p',unknown),
[] ).
cnf(11,axiom,
p(crypt(xor__dfg(km,pin),pp)),
file('SWV235+1.p',unknown),
[] ).
cnf(12,axiom,
p(crypt(xor__dfg(km,imp),rand)),
file('SWV235+1.p',unknown),
[] ).
cnf(13,axiom,
p(crypt(xor__dfg(rand,imp),kek)),
file('SWV235+1.p',unknown),
[] ).
cnf(14,axiom,
equal(xor__dfg(u,v),xor__dfg(v,u)),
file('SWV235+1.p',unknown),
[] ).
cnf(15,axiom,
equal(decrypt(u,crypt(u,v)),v),
file('SWV235+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ p(u)
| ~ p(v)
| p(xor__dfg(v,u)) ),
file('SWV235+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ p(u)
| ~ p(crypt(u,v))
| p(v) ),
file('SWV235+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ p(u)
| ~ p(v)
| p(crypt(v,u)) ),
file('SWV235+1.p',unknown),
[] ).
cnf(21,axiom,
equal(xor__dfg(xor__dfg(u,v),w),xor__dfg(u,xor__dfg(v,w))),
file('SWV235+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ p(u)
| ~ p(v)
| p(crypt(xor__dfg(km,xor__dfg(kp,u)),v)) ),
file('SWV235+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ p(u)
| ~ p(crypt(xor__dfg(km,data),v))
| p(decrypt(v,u)) ),
file('SWV235+1.p',unknown),
[] ).
cnf(26,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('SWV235+1.p',unknown),
[] ).
cnf(30,plain,
p(crypt(xor__dfg(imp,rand),kek)),
inference(rew,[status(thm),theory(equality)],[14,13]),
[iquote('0:Rew:14.0,13.0')] ).
cnf(31,plain,
( ~ p(pp)
| ~ p(a) ),
inference(res,[status(thm),theory(equality)],[19,8]),
[iquote('0:Res:19.2,8.0')] ).
cnf(34,plain,
~ p(pp),
inference(mrr,[status(thm)],[31,7]),
[iquote('0:MRR:31.1,7.0')] ).
cnf(40,plain,
equal(xor__dfg(id__dfg,u),u),
inference(spr,[status(thm),theory(equality)],[14,9]),
[iquote('0:SpR:14.0,9.0')] ).
cnf(65,plain,
( ~ p(xor__dfg(imp,rand))
| p(kek) ),
inference(res,[status(thm),theory(equality)],[30,18]),
[iquote('0:Res:30.0,18.1')] ).
cnf(78,plain,
equal(xor__dfg(u,xor__dfg(u,v)),xor__dfg(id__dfg,v)),
inference(spr,[status(thm),theory(equality)],[10,21]),
[iquote('0:SpR:10.0,21.0')] ).
cnf(84,plain,
equal(xor__dfg(u,xor__dfg(u,v)),v),
inference(rew,[status(thm),theory(equality)],[40,78]),
[iquote('0:Rew:40.0,78.0')] ).
cnf(96,plain,
( ~ p(imp)
| ~ p(rand)
| p(kek) ),
inference(sor,[status(thm)],[65,17]),
[iquote('0:SoR:65.0,17.2')] ).
cnf(97,plain,
( ~ p(rand)
| p(kek) ),
inference(ssi,[status(thm)],[96,2]),
[iquote('0:SSi:96.0,2.0')] ).
cnf(107,plain,
equal(xor__dfg(u,xor__dfg(v,u)),v),
inference(spr,[status(thm),theory(equality)],[14,84]),
[iquote('0:SpR:14.0,84.0')] ).
cnf(140,plain,
( ~ p(xor__dfg(u,kp))
| ~ p(v)
| p(crypt(xor__dfg(km,u),v)) ),
inference(spr,[status(thm),theory(equality)],[107,22]),
[iquote('0:SpR:107.0,22.2')] ).
cnf(782,plain,
( ~ p(u)
| ~ p(v)
| ~ p(kp)
| p(crypt(xor__dfg(km,v),u)) ),
inference(sor,[status(thm)],[140,17]),
[iquote('0:SoR:140.0,17.2')] ).
cnf(783,plain,
( ~ p(u)
| ~ p(v)
| p(crypt(xor__dfg(km,v),u)) ),
inference(ssi,[status(thm)],[782,1]),
[iquote('0:SSi:782.2,1.0')] ).
cnf(843,plain,
( ~ p(imp)
| ~ p(crypt(xor__dfg(km,exp),u))
| p(crypt(xor__dfg(u,imp),rand)) ),
inference(res,[status(thm),theory(equality)],[12,26]),
[iquote('0:Res:12.0,26.1')] ).
cnf(847,plain,
( ~ p(pin)
| ~ p(crypt(xor__dfg(km,exp),u))
| p(crypt(xor__dfg(u,pin),pp)) ),
inference(res,[status(thm),theory(equality)],[11,26]),
[iquote('0:Res:11.0,26.1')] ).
cnf(853,plain,
( ~ p(crypt(xor__dfg(km,exp),u))
| p(crypt(xor__dfg(u,imp),rand)) ),
inference(ssi,[status(thm)],[843,2]),
[iquote('0:SSi:843.0,2.0')] ).
cnf(855,plain,
( ~ p(crypt(xor__dfg(km,exp),u))
| p(crypt(xor__dfg(u,pin),pp)) ),
inference(ssi,[status(thm)],[847,5]),
[iquote('0:SSi:847.0,5.0')] ).
cnf(937,plain,
( ~ p(u)
| ~ p(data)
| ~ p(v)
| p(decrypt(u,v)) ),
inference(res,[status(thm),theory(equality)],[783,24]),
[iquote('0:Res:783.2,24.1')] ).
cnf(940,plain,
( ~ p(u)
| ~ p(v)
| p(decrypt(u,v)) ),
inference(ssi,[status(thm)],[937,3]),
[iquote('0:SSi:937.1,3.0')] ).
cnf(942,plain,
( ~ p(u)
| ~ p(crypt(u,v))
| p(v) ),
inference(spr,[status(thm),theory(equality)],[15,940]),
[iquote('0:SpR:15.0,940.2')] ).
cnf(1091,plain,
( ~ p(u)
| ~ p(exp)
| p(crypt(xor__dfg(u,imp),rand)) ),
inference(res,[status(thm),theory(equality)],[783,853]),
[iquote('0:Res:783.2,853.0')] ).
cnf(1092,plain,
( ~ p(u)
| p(crypt(xor__dfg(u,imp),rand)) ),
inference(ssi,[status(thm)],[1091,6]),
[iquote('0:SSi:1091.1,6.0')] ).
cnf(1093,plain,
( ~ p(xor__dfg(u,imp))
| ~ p(u)
| p(rand) ),
inference(sor,[status(thm)],[942,1092]),
[iquote('0:SoR:942.1,1092.1')] ).
cnf(1097,plain,
( ~ p(id__dfg)
| p(crypt(imp,rand)) ),
inference(spr,[status(thm),theory(equality)],[40,1092]),
[iquote('0:SpR:40.0,1092.1')] ).
cnf(1102,plain,
p(crypt(imp,rand)),
inference(ssi,[status(thm)],[1097,4]),
[iquote('0:SSi:1097.0,4.0')] ).
cnf(1103,plain,
( ~ p(u)
| p(rand) ),
inference(ssi,[status(thm)],[1093,17,2]),
[iquote('0:SSi:1093.0,17.0,2.2')] ).
cnf(1110,plain,
( ~ p(u)
| ~ p(exp)
| p(crypt(xor__dfg(u,pin),pp)) ),
inference(res,[status(thm),theory(equality)],[783,855]),
[iquote('0:Res:783.2,855.0')] ).
cnf(1111,plain,
( ~ p(u)
| p(crypt(xor__dfg(u,pin),pp)) ),
inference(ssi,[status(thm)],[1110,6]),
[iquote('0:SSi:1110.1,6.0')] ).
cnf(1116,plain,
p(rand),
inference(ems,[status(thm)],[1103,1102]),
[iquote('0:EmS:1103.0,1102.0')] ).
cnf(1147,plain,
p(kek),
inference(mrr,[status(thm)],[97,1116]),
[iquote('0:MRR:97.0,1116.0')] ).
cnf(1241,plain,
( ~ p(xor__dfg(u,pin))
| ~ p(u)
| p(pp) ),
inference(sor,[status(thm)],[942,1111]),
[iquote('0:SoR:942.1,1111.1')] ).
cnf(1251,plain,
( ~ p(u)
| p(pp) ),
inference(ssi,[status(thm)],[1241,17,5]),
[iquote('0:SSi:1241.0,17.0,5.2')] ).
cnf(1252,plain,
~ p(u),
inference(mrr,[status(thm)],[1251,34]),
[iquote('0:MRR:1251.1,34.0')] ).
cnf(1253,plain,
$false,
inference(unc,[status(thm)],[1252,1147]),
[iquote('0:UnC:1252.0,1147.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV235+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n015.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 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 19:57:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/0.57
% 0.40/0.57 SPASS V 3.9
% 0.40/0.57 SPASS beiseite: Proof found.
% 0.40/0.57 % SZS status Theorem
% 0.40/0.57 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.57 SPASS derived 868 clauses, backtracked 0 clauses, performed 0 splits and kept 268 clauses.
% 0.40/0.57 SPASS allocated 98683 KBytes.
% 0.40/0.57 SPASS spent 0:00:00.22 on the problem.
% 0.40/0.57 0:00:00.03 for the input.
% 0.40/0.57 0:00:00.03 for the FLOTTER CNF translation.
% 0.40/0.57 0:00:00.01 for inferences.
% 0.40/0.57 0:00:00.00 for the backtracking.
% 0.40/0.57 0:00:00.12 for the reduction.
% 0.40/0.57
% 0.40/0.57
% 0.40/0.57 Here is a proof with depth 8, length 56 :
% 0.40/0.57 % SZS output start Refutation
% See solution above
% 0.40/0.57 Formulae used in the proof : initial_knowledge_of_intruder_1 initial_knowledge_of_intruder_2 initial_knowledge_of_intruder_3 initial_knowledge_of_intruder_4 initial_knowledge_of_intruder_5 initial_knowledge_of_intruder_11 an_account_number find_pin xor_rules_1 xor_rules_2 initial_knowledge_of_intruder_6 initial_knowledge_of_intruder_8 initial_knowledge_of_intruder_10 xor_commutative encryption_decryption_cancellation combine_with_XOR decrypt_knowledge encrypt_knowledge xor_associative key_part_import___part_1 decrypt_data key_export
% 0.40/0.57
%------------------------------------------------------------------------------