TSTP Solution File: SWW959+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW959+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:24 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% 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 : 37 ( 0 equ; 26 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(12,axiom,
~ pred_attacker(name_objective),
file('SWW959+1.p',unknown),
[] ).
cnf(13,axiom,
pred_eq_bitstring_bitstring(u,v),
file('SWW959+1.p',unknown),
[] ).
cnf(15,axiom,
pred_attacker(name_new0x2Dname(u)),
file('SWW959+1.p',unknown),
[] ).
cnf(94,axiom,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
file('SWW959+1.p',unknown),
[] ).
cnf(121,axiom,
( ~ pred_attacker(tuple_client_B_out_6(u))
| pred_attacker(u) ),
file('SWW959+1.p',unknown),
[] ).
cnf(124,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_client_B_in_5(u)) ),
file('SWW959+1.p',unknown),
[] ).
cnf(126,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_client_B_in_3(u)) ),
file('SWW959+1.p',unknown),
[] ).
cnf(128,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_client_B_in_2(u)) ),
file('SWW959+1.p',unknown),
[] ).
cnf(168,axiom,
( ~ pred_attacker(tuple_client_B_in_2(u))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(u,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(v))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(v,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(w))
| ~ pred_eq_bitstring_bitstring(name_Nb(x),constr_adec(w,name_skB))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('SWW959+1.p',unknown),
[] ).
cnf(172,plain,
( ~ pred_attacker(tuple_client_B_in_2(u))
| ~ pred_attacker(tuple_client_B_in_3(v))
| ~ pred_attacker(tuple_client_B_in_5(w))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(mrr,[status(thm)],[168,13]),
[iquote('0:MRR:168.1,168.3,168.5,13.0,13.0,13.0')] ).
cnf(183,plain,
~ pred_attacker(tuple_client_B_out_6(name_objective)),
inference(res,[status(thm),theory(equality)],[121,12]),
[iquote('0:Res:121.1,12.0')] ).
cnf(198,plain,
( ~ pred_attacker(tuple_client_B_in_5(u))
| ~ pred_attacker(tuple_client_B_in_3(v))
| ~ pred_attacker(tuple_client_B_in_2(w)) ),
inference(mrr,[status(thm)],[172,183]),
[iquote('0:MRR:172.3,183.0')] ).
cnf(199,plain,
~ pred_attacker(tuple_client_B_in_2(u)),
inference(spt,[spt(split,[position(s1)])],[198]),
[iquote('1:Spt:198.2')] ).
cnf(200,plain,
~ pred_attacker(u),
inference(mrr,[status(thm)],[128,199]),
[iquote('1:MRR:128.1,199.0')] ).
cnf(201,plain,
$false,
inference(unc,[status(thm)],[200,15]),
[iquote('1:UnC:200.0,15.0')] ).
cnf(202,plain,
( ~ pred_attacker(tuple_client_B_in_5(u))
| ~ pred_attacker(tuple_client_B_in_3(v)) ),
inference(spt,[spt(split,[position(s2)])],[198]),
[iquote('1:Spt:201.0,198.0,198.1')] ).
cnf(208,plain,
( ~ pred_attacker(u)
| ~ pred_attacker(tuple_client_B_in_3(v)) ),
inference(res,[status(thm),theory(equality)],[124,202]),
[iquote('1:Res:124.1,202.0')] ).
cnf(210,plain,
~ pred_attacker(tuple_client_B_in_3(u)),
inference(con,[status(thm)],[208]),
[iquote('1:Con:208.0')] ).
cnf(211,plain,
~ pred_attacker(u),
inference(mrr,[status(thm)],[126,210]),
[iquote('1:MRR:126.1,210.0')] ).
cnf(212,plain,
$false,
inference(unc,[status(thm)],[211,94]),
[iquote('1:UnC:211.0,94.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW959+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 5 15:47:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.48
% 0.20/0.48 SPASS V 3.9
% 0.20/0.48 SPASS beiseite: Proof found.
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 SPASS derived 35 clauses, backtracked 5 clauses, performed 1 splits and kept 204 clauses.
% 0.20/0.48 SPASS allocated 97957 KBytes.
% 0.20/0.48 SPASS spent 0:00:00.12 on the problem.
% 0.20/0.48 0:00:00.04 for the input.
% 0.20/0.48 0:00:00.04 for the FLOTTER CNF translation.
% 0.20/0.48 0:00:00.00 for inferences.
% 0.20/0.48 0:00:00.00 for the backtracking.
% 0.20/0.48 0:00:00.01 for the reduction.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Here is a proof with depth 2, length 20 :
% 0.20/0.48 % SZS output start Refutation
% See solution above
% 0.20/0.48 Formulae used in the proof : co0 ax86 ax154 ax157 ax113 ax119 ax121 ax123 ax165
% 0.20/0.48
%------------------------------------------------------------------------------