TSTP Solution File: SWW948+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW948+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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:22 EDT 2022
% Result : Theorem 0.14s 0.42s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 34 ( 24 unt; 0 nHn; 34 RR)
% Number of literals : 46 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
~ pred_attacker(name_objective_R),
file('SWW948+1.p',unknown),
[] ).
cnf(13,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
file('SWW948+1.p',unknown),
[] ).
cnf(14,axiom,
pred_attacker(tuple_R_out_1(name_r0x30)),
file('SWW948+1.p',unknown),
[] ).
cnf(81,axiom,
equal(constr_xor(u,u),constr_ZERO),
file('SWW948+1.p',unknown),
[] ).
cnf(82,axiom,
equal(constr_xor(u,constr_ZERO),u),
file('SWW948+1.p',unknown),
[] ).
cnf(86,axiom,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(u))
| pred_attacker(u) ),
file('SWW948+1.p',unknown),
[] ).
cnf(89,axiom,
( ~ pred_attacker(tuple_R_out_4(u))
| pred_attacker(u) ),
file('SWW948+1.p',unknown),
[] ).
cnf(93,axiom,
( ~ pred_attacker(tuple_R_out_1(u))
| pred_attacker(u) ),
file('SWW948+1.p',unknown),
[] ).
cnf(94,axiom,
equal(constr_xor(u,v),constr_xor(v,u)),
file('SWW948+1.p',unknown),
[] ).
cnf(95,axiom,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(u,v))
| pred_attacker(u) ),
file('SWW948+1.p',unknown),
[] ).
cnf(96,axiom,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(u,v))
| pred_attacker(v) ),
file('SWW948+1.p',unknown),
[] ).
cnf(101,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
file('SWW948+1.p',unknown),
[] ).
cnf(102,axiom,
( ~ pred_attacker(u)
| ~ pred_attacker(v)
| pred_attacker(constr_xor(v,u)) ),
file('SWW948+1.p',unknown),
[] ).
cnf(104,axiom,
( ~ pred_attacker(u)
| ~ pred_attacker(v)
| pred_attacker(tuple_R_in_2(v,u)) ),
file('SWW948+1.p',unknown),
[] ).
cnf(105,axiom,
equal(constr_xor(constr_xor(u,v),w),constr_xor(u,constr_xor(v,w))),
file('SWW948+1.p',unknown),
[] ).
cnf(107,axiom,
( ~ pred_attacker(tuple_R_in_2(u,constr_h(constr_xor(constr_xor(name_r0x30,u),name_k))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
file('SWW948+1.p',unknown),
[] ).
cnf(109,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st))))),
inference(rew,[status(thm),theory(equality)],[94,101]),
[iquote('0:Rew:94.0,101.0')] ).
cnf(110,plain,
( ~ pred_attacker(tuple_R_in_2(u,constr_h(constr_xor(name_r0x30,constr_xor(u,name_k)))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(rew,[status(thm),theory(equality)],[105,107]),
[iquote('0:Rew:105.0,107.0')] ).
cnf(117,plain,
~ pred_attacker(tuple_R_out_4(name_objective_R)),
inference(res,[status(thm),theory(equality)],[89,10]),
[iquote('0:Res:89.1,10.0')] ).
cnf(123,plain,
~ pred_attacker(tuple_R_in_2(u,constr_h(constr_xor(name_r0x30,constr_xor(u,name_k))))),
inference(mrr,[status(thm)],[110,117]),
[iquote('0:MRR:110.1,117.0')] ).
cnf(132,plain,
pred_attacker(name_r0x30),
inference(res,[status(thm),theory(equality)],[14,93]),
[iquote('0:Res:14.0,93.0')] ).
cnf(136,plain,
pred_attacker(name_r0x30_from_1st),
inference(res,[status(thm),theory(equality)],[13,86]),
[iquote('0:Res:13.0,86.0')] ).
cnf(139,plain,
equal(constr_xor(constr_ZERO,u),u),
inference(spr,[status(thm),theory(equality)],[94,82]),
[iquote('0:SpR:94.0,82.0')] ).
cnf(152,plain,
pred_attacker(name_r1_from_1st),
inference(res,[status(thm),theory(equality)],[109,95]),
[iquote('0:Res:109.0,95.0')] ).
cnf(153,plain,
pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))),
inference(res,[status(thm),theory(equality)],[109,96]),
[iquote('0:Res:109.0,96.0')] ).
cnf(201,plain,
equal(constr_xor(u,constr_xor(v,w)),constr_xor(w,constr_xor(u,v))),
inference(spr,[status(thm),theory(equality)],[105,94]),
[iquote('0:SpR:105.0,94.0')] ).
cnf(207,plain,
equal(constr_xor(u,constr_xor(u,v)),constr_xor(constr_ZERO,v)),
inference(spr,[status(thm),theory(equality)],[81,105]),
[iquote('0:SpR:81.0,105.0')] ).
cnf(214,plain,
equal(constr_xor(u,constr_xor(u,v)),v),
inference(rew,[status(thm),theory(equality)],[139,207]),
[iquote('0:Rew:139.0,207.0')] ).
cnf(215,plain,
~ pred_attacker(tuple_R_in_2(u,constr_h(constr_xor(name_k,constr_xor(name_r0x30,u))))),
inference(rew,[status(thm),theory(equality)],[201,123]),
[iquote('0:Rew:201.0,123.0')] ).
cnf(230,plain,
equal(constr_xor(u,constr_xor(v,u)),v),
inference(spr,[status(thm),theory(equality)],[94,214]),
[iquote('0:SpR:94.0,214.0')] ).
cnf(265,plain,
~ pred_attacker(tuple_R_in_2(constr_xor(u,name_r0x30),constr_h(constr_xor(name_k,u)))),
inference(spl,[status(thm),theory(equality)],[230,215]),
[iquote('0:SpL:230.0,215.0')] ).
cnf(293,plain,
( ~ pred_attacker(constr_h(constr_xor(name_k,u)))
| ~ pred_attacker(constr_xor(u,name_r0x30)) ),
inference(res,[status(thm),theory(equality)],[104,265]),
[iquote('0:Res:104.2,265.0')] ).
cnf(870,plain,
~ pred_attacker(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_r0x30)),
inference(sor,[status(thm)],[293,153]),
[iquote('0:SoR:293.0,153.0')] ).
cnf(872,plain,
$false,
inference(ssi,[status(thm)],[870,102,136,152,132]),
[iquote('0:SSi:870.0,102.0,102.0,136.0,152.2,132.2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWW948+1 : TPTP v8.1.0. Released v7.4.0.
% 0.06/0.11 % Command : run_spass %d %s
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Sun Jun 5 12:51:48 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.14/0.42
% 0.14/0.42 SPASS V 3.9
% 0.14/0.42 SPASS beiseite: Proof found.
% 0.14/0.42 % SZS status Theorem
% 0.14/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.42 SPASS derived 537 clauses, backtracked 0 clauses, performed 0 splits and kept 242 clauses.
% 0.14/0.42 SPASS allocated 98245 KBytes.
% 0.14/0.42 SPASS spent 0:00:00.10 on the problem.
% 0.14/0.42 0:00:00.03 for the input.
% 0.14/0.42 0:00:00.02 for the FLOTTER CNF translation.
% 0.14/0.42 0:00:00.01 for inferences.
% 0.14/0.42 0:00:00.00 for the backtracking.
% 0.14/0.42 0:00:00.03 for the reduction.
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42 Here is a proof with depth 5, length 34 :
% 0.14/0.42 % SZS output start Refutation
% See solution above
% 0.14/0.42 Formulae used in the proof : co0 ax101 ax104 ax66 ax67 ax78 ax83 ax87 ax68 ax75 ax76 ax102 ax70 ax88 ax69 ax106
% 0.14/0.42
%------------------------------------------------------------------------------