TSTP Solution File: SWW952+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW952+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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 : Thu Jul 21 01:29:23 EDT 2022
% Result : Theorem 5.93s 6.14s
% Output : Refutation 5.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 35 ( 25 unt; 0 nHn; 35 RR)
% Number of literals : 47 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 11 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(11,axiom,
~ pred_attacker(name_objective),
file('SWW952+1.p',unknown),
[] ).
cnf(14,axiom,
pred_attacker(tuple_sess_1_out_1(name_r1_s1)),
file('SWW952+1.p',unknown),
[] ).
cnf(106,axiom,
pred_attacker(tuple_R_out_1(constr_QUERY,name_r1)),
file('SWW952+1.p',unknown),
[] ).
cnf(107,axiom,
equal(constr_xor(u,u),constr_ZERO),
file('SWW952+1.p',unknown),
[] ).
cnf(108,axiom,
equal(constr_xor(u,constr_ZERO),u),
file('SWW952+1.p',unknown),
[] ).
cnf(114,axiom,
( ~ pred_attacker(tuple_sess_1_out_1(u))
| pred_attacker(u) ),
file('SWW952+1.p',unknown),
[] ).
cnf(117,axiom,
( ~ pred_attacker(tuple_R_out_4(u))
| pred_attacker(u) ),
file('SWW952+1.p',unknown),
[] ).
cnf(120,axiom,
equal(constr_xor(u,v),constr_xor(v,u)),
file('SWW952+1.p',unknown),
[] ).
cnf(121,axiom,
( ~ pred_attacker(tuple_sess_1_out_2(u,v))
| pred_attacker(u) ),
file('SWW952+1.p',unknown),
[] ).
cnf(122,axiom,
( ~ pred_attacker(tuple_sess_1_out_2(u,v))
| pred_attacker(v) ),
file('SWW952+1.p',unknown),
[] ).
cnf(124,axiom,
( ~ pred_attacker(tuple_R_out_1(u,v))
| pred_attacker(v) ),
file('SWW952+1.p',unknown),
[] ).
cnf(129,axiom,
( ~ pred_attacker(u)
| ~ pred_attacker(v)
| pred_attacker(constr_xor(v,u)) ),
file('SWW952+1.p',unknown),
[] ).
cnf(133,axiom,
( ~ pred_attacker(u)
| ~ pred_attacker(v)
| pred_attacker(tuple_R_in_2(v,u)) ),
file('SWW952+1.p',unknown),
[] ).
cnf(134,axiom,
equal(constr_xor(constr_xor(u,v),w),constr_xor(u,constr_xor(v,w))),
file('SWW952+1.p',unknown),
[] ).
cnf(136,axiom,
pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k))),constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k)))))),
file('SWW952+1.p',unknown),
[] ).
cnf(137,axiom,
( ~ pred_attacker(tuple_R_in_2(u,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,u),name_k))),constr_h(constr_xor(constr_xor(name_r1,u),name_k))))))
| pred_attacker(tuple_R_out_4(name_objective)) ),
file('SWW952+1.p',unknown),
[] ).
cnf(140,plain,
pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_h(constr_xor(name_r1_s1,constr_xor(name_k,name_r2_s1))),constr_rotate(name_ID,constr_h(constr_xor(name_r1_s1,constr_xor(name_k,name_r2_s1)))))))),
inference(rew,[status(thm),theory(equality)],[120,136,134]),
[iquote('0:Rew:120.0,136.0,120.0,136.0,134.0,136.0')] ).
cnf(141,plain,
( ~ pred_attacker(tuple_R_in_2(u,constr_split_L(constr_xor(constr_h(constr_xor(name_r1,constr_xor(u,name_k))),constr_rotate(name_ID,constr_h(constr_xor(name_r1,constr_xor(u,name_k))))))))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(rew,[status(thm),theory(equality)],[134,137,120]),
[iquote('0:Rew:134.0,137.0,120.0,137.0')] ).
cnf(148,plain,
~ pred_attacker(tuple_R_out_4(name_objective)),
inference(res,[status(thm),theory(equality)],[117,11]),
[iquote('0:Res:117.1,11.0')] ).
cnf(154,plain,
~ pred_attacker(tuple_R_in_2(u,constr_split_L(constr_xor(constr_h(constr_xor(name_r1,constr_xor(u,name_k))),constr_rotate(name_ID,constr_h(constr_xor(name_r1,constr_xor(u,name_k)))))))),
inference(mrr,[status(thm)],[141,148]),
[iquote('0:MRR:141.1,148.0')] ).
cnf(164,plain,
pred_attacker(name_r1_s1),
inference(res,[status(thm),theory(equality)],[14,114]),
[iquote('0:Res:14.0,114.0')] ).
cnf(167,plain,
pred_attacker(name_r1),
inference(res,[status(thm),theory(equality)],[106,124]),
[iquote('0:Res:106.0,124.0')] ).
cnf(169,plain,
equal(constr_xor(constr_ZERO,u),u),
inference(spr,[status(thm),theory(equality)],[120,108]),
[iquote('0:SpR:120.0,108.0')] ).
cnf(212,plain,
equal(constr_xor(u,constr_xor(v,w)),constr_xor(w,constr_xor(u,v))),
inference(spr,[status(thm),theory(equality)],[134,120]),
[iquote('0:SpR:134.0,120.0')] ).
cnf(218,plain,
equal(constr_xor(u,constr_xor(u,v)),constr_xor(constr_ZERO,v)),
inference(spr,[status(thm),theory(equality)],[107,134]),
[iquote('0:SpR:107.0,134.0')] ).
cnf(224,plain,
equal(constr_xor(u,constr_xor(u,v)),v),
inference(rew,[status(thm),theory(equality)],[169,218]),
[iquote('0:Rew:169.0,218.0')] ).
cnf(225,plain,
~ pred_attacker(tuple_R_in_2(u,constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r1,u))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r1,u)))))))),
inference(rew,[status(thm),theory(equality)],[212,154]),
[iquote('0:Rew:212.0,154.0')] ).
cnf(227,plain,
pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r2_s1,name_r1_s1))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r2_s1,name_r1_s1)))))))),
inference(rew,[status(thm),theory(equality)],[212,140]),
[iquote('0:Rew:212.0,140.0')] ).
cnf(232,plain,
pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1)))))))),
inference(rew,[status(thm),theory(equality)],[120,227]),
[iquote('0:Rew:120.0,227.0')] ).
cnf(272,plain,
pred_attacker(name_r2_s1),
inference(res,[status(thm),theory(equality)],[232,121]),
[iquote('0:Res:232.0,121.0')] ).
cnf(273,plain,
pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1))))))),
inference(res,[status(thm),theory(equality)],[232,122]),
[iquote('0:Res:232.0,122.0')] ).
cnf(507,plain,
~ pred_attacker(tuple_R_in_2(constr_xor(name_r1,u),constr_split_L(constr_xor(constr_h(constr_xor(name_k,u)),constr_rotate(name_ID,constr_h(constr_xor(name_k,u))))))),
inference(spl,[status(thm),theory(equality)],[224,225]),
[iquote('0:SpL:224.0,225.0')] ).
cnf(3713,plain,
( ~ pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,u)),constr_rotate(name_ID,constr_h(constr_xor(name_k,u))))))
| ~ pred_attacker(constr_xor(name_r1,u)) ),
inference(res,[status(thm),theory(equality)],[133,507]),
[iquote('0:Res:133.2,507.0')] ).
cnf(11809,plain,
~ pred_attacker(constr_xor(name_r1,constr_xor(name_r1_s1,name_r2_s1))),
inference(sor,[status(thm)],[3713,273]),
[iquote('0:SoR:3713.0,273.0')] ).
cnf(11811,plain,
$false,
inference(ssi,[status(thm)],[11809,129,167,164,272]),
[iquote('0:SSi:11809.0,129.0,167.0,129.2,164.0,272.2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWW952+1 : TPTP v8.1.0. Released v7.4.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jun 5 19:19:32 EDT 2022
% 0.15/0.36 % CPUTime :
% 5.93/6.14
% 5.93/6.14 SPASS V 3.9
% 5.93/6.14 SPASS beiseite: Proof found.
% 5.93/6.14 % SZS status Theorem
% 5.93/6.14 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.93/6.14 SPASS derived 7112 clauses, backtracked 0 clauses, performed 0 splits and kept 1033 clauses.
% 5.93/6.14 SPASS allocated 105997 KBytes.
% 5.93/6.14 SPASS spent 0:00:05.72 on the problem.
% 5.93/6.14 0:00:00.04 for the input.
% 5.93/6.14 0:00:00.03 for the FLOTTER CNF translation.
% 5.93/6.14 0:00:00.08 for inferences.
% 5.93/6.14 0:00:00.00 for the backtracking.
% 5.93/6.14 0:00:05.54 for the reduction.
% 5.93/6.14
% 5.93/6.14
% 5.93/6.14 Here is a proof with depth 4, length 35 :
% 5.93/6.14 % SZS output start Refutation
% See solution above
% 5.93/6.14 Formulae used in the proof : co0 ax131 ax134 ax91 ax92 ax105 ax111 ax93 ax102 ax103 ax116 ax95 ax117 ax94 ax132 ax136
% 5.93/6.14
%------------------------------------------------------------------------------