TSTP Solution File: SWW965+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW965+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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:25 EDT 2022
% Result : Theorem 0.18s 0.46s
% Output : Refutation 0.18s
% 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(13,axiom,
~ pred_attacker(name_objective),
file('SWW965+1.p',unknown),
[] ).
cnf(14,axiom,
pred_eq_bitstring_bitstring(u,v),
file('SWW965+1.p',unknown),
[] ).
cnf(16,axiom,
pred_attacker(name_new0x2Dname(u)),
file('SWW965+1.p',unknown),
[] ).
cnf(108,axiom,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
file('SWW965+1.p',unknown),
[] ).
cnf(137,axiom,
( ~ pred_attacker(tuple_client_B_out_6(u))
| pred_attacker(u) ),
file('SWW965+1.p',unknown),
[] ).
cnf(140,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_client_B_in_5(u)) ),
file('SWW965+1.p',unknown),
[] ).
cnf(142,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_client_B_in_3(u)) ),
file('SWW965+1.p',unknown),
[] ).
cnf(144,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_client_B_in_2(u)) ),
file('SWW965+1.p',unknown),
[] ).
cnf(186,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('SWW965+1.p',unknown),
[] ).
cnf(190,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)],[186,14]),
[iquote('0:MRR:186.1,186.3,186.5,14.0,14.0,14.0')] ).
cnf(203,plain,
~ pred_attacker(tuple_client_B_out_6(name_objective)),
inference(res,[status(thm),theory(equality)],[137,13]),
[iquote('0:Res:137.1,13.0')] ).
cnf(218,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)],[190,203]),
[iquote('0:MRR:190.3,203.0')] ).
cnf(219,plain,
~ pred_attacker(tuple_client_B_in_2(u)),
inference(spt,[spt(split,[position(s1)])],[218]),
[iquote('1:Spt:218.2')] ).
cnf(220,plain,
~ pred_attacker(u),
inference(mrr,[status(thm)],[144,219]),
[iquote('1:MRR:144.1,219.0')] ).
cnf(221,plain,
$false,
inference(unc,[status(thm)],[220,16]),
[iquote('1:UnC:220.0,16.0')] ).
cnf(222,plain,
( ~ pred_attacker(tuple_client_B_in_5(u))
| ~ pred_attacker(tuple_client_B_in_3(v)) ),
inference(spt,[spt(split,[position(s2)])],[218]),
[iquote('1:Spt:221.0,218.0,218.1')] ).
cnf(231,plain,
( ~ pred_attacker(u)
| ~ pred_attacker(tuple_client_B_in_3(v)) ),
inference(res,[status(thm),theory(equality)],[140,222]),
[iquote('1:Res:140.1,222.0')] ).
cnf(233,plain,
~ pred_attacker(tuple_client_B_in_3(u)),
inference(con,[status(thm)],[231]),
[iquote('1:Con:231.0')] ).
cnf(234,plain,
~ pred_attacker(u),
inference(mrr,[status(thm)],[142,233]),
[iquote('1:MRR:142.1,233.0')] ).
cnf(235,plain,
$false,
inference(unc,[status(thm)],[234,108]),
[iquote('1:UnC:234.0,108.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW965+1 : TPTP v8.1.0. Released v7.4.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n020.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 : Mon Jun 6 08:15:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.46
% 0.18/0.46 SPASS V 3.9
% 0.18/0.46 SPASS beiseite: Proof found.
% 0.18/0.46 % SZS status Theorem
% 0.18/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 SPASS derived 38 clauses, backtracked 5 clauses, performed 1 splits and kept 223 clauses.
% 0.18/0.46 SPASS allocated 97988 KBytes.
% 0.18/0.46 SPASS spent 0:00:00.11 on the problem.
% 0.18/0.46 0:00:00.04 for the input.
% 0.18/0.46 0:00:00.04 for the FLOTTER CNF translation.
% 0.18/0.46 0:00:00.00 for inferences.
% 0.18/0.46 0:00:00.00 for the backtracking.
% 0.18/0.46 0:00:00.01 for the reduction.
% 0.18/0.46
% 0.18/0.46
% 0.18/0.46 Here is a proof with depth 2, length 20 :
% 0.18/0.46 % SZS output start Refutation
% See solution above
% 0.18/0.46 Formulae used in the proof : co0 ax103 ax173 ax176 ax131 ax137 ax139 ax141 ax184
% 0.18/0.46
%------------------------------------------------------------------------------