TSTP Solution File: SWW961+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW961+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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.19s 0.47s
% Output : Refutation 0.19s
% 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('SWW961+1.p',unknown),
[] ).
cnf(13,axiom,
pred_eq_bitstring_bitstring(u,v),
file('SWW961+1.p',unknown),
[] ).
cnf(15,axiom,
pred_attacker(name_new0x2Dname(u)),
file('SWW961+1.p',unknown),
[] ).
cnf(94,axiom,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
file('SWW961+1.p',unknown),
[] ).
cnf(121,axiom,
( ~ pred_attacker(tuple_client_B_out_6(u))
| pred_attacker(u) ),
file('SWW961+1.p',unknown),
[] ).
cnf(124,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_client_B_in_5(u)) ),
file('SWW961+1.p',unknown),
[] ).
cnf(126,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_client_B_in_3(u)) ),
file('SWW961+1.p',unknown),
[] ).
cnf(128,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_client_B_in_2(u)) ),
file('SWW961+1.p',unknown),
[] ).
cnf(175,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_assoc_pair_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('SWW961+1.p',unknown),
[] ).
cnf(179,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)],[175,13]),
[iquote('0:MRR:175.1,175.3,175.5,13.0,13.0,13.0')] ).
cnf(192,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(208,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)],[179,192]),
[iquote('0:MRR:179.3,192.0')] ).
cnf(209,plain,
~ pred_attacker(tuple_client_B_in_2(u)),
inference(spt,[spt(split,[position(s1)])],[208]),
[iquote('1:Spt:208.2')] ).
cnf(210,plain,
~ pred_attacker(u),
inference(mrr,[status(thm)],[128,209]),
[iquote('1:MRR:128.1,209.0')] ).
cnf(211,plain,
$false,
inference(unc,[status(thm)],[210,15]),
[iquote('1:UnC:210.0,15.0')] ).
cnf(212,plain,
( ~ pred_attacker(tuple_client_B_in_5(u))
| ~ pred_attacker(tuple_client_B_in_3(v)) ),
inference(spt,[spt(split,[position(s2)])],[208]),
[iquote('1:Spt:211.0,208.0,208.1')] ).
cnf(218,plain,
( ~ pred_attacker(u)
| ~ pred_attacker(tuple_client_B_in_3(v)) ),
inference(res,[status(thm),theory(equality)],[124,212]),
[iquote('1:Res:124.1,212.0')] ).
cnf(220,plain,
~ pred_attacker(tuple_client_B_in_3(u)),
inference(con,[status(thm)],[218]),
[iquote('1:Con:218.0')] ).
cnf(221,plain,
~ pred_attacker(u),
inference(mrr,[status(thm)],[126,220]),
[iquote('1:MRR:126.1,220.0')] ).
cnf(222,plain,
$false,
inference(unc,[status(thm)],[221,94]),
[iquote('1:UnC:221.0,94.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW961+1 : TPTP v8.1.0. Released v7.4.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 4 14:20:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47
% 0.19/0.47 SPASS V 3.9
% 0.19/0.47 SPASS beiseite: Proof found.
% 0.19/0.47 % SZS status Theorem
% 0.19/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 SPASS derived 37 clauses, backtracked 5 clauses, performed 1 splits and kept 214 clauses.
% 0.19/0.47 SPASS allocated 97980 KBytes.
% 0.19/0.47 SPASS spent 0:00:00.12 on the problem.
% 0.19/0.47 0:00:00.04 for the input.
% 0.19/0.47 0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.47 0:00:00.00 for inferences.
% 0.19/0.47 0:00:00.00 for the backtracking.
% 0.19/0.47 0:00:00.01 for the reduction.
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Here is a proof with depth 2, length 20 :
% 0.19/0.47 % SZS output start Refutation
% See solution above
% 0.19/0.47 Formulae used in the proof : co0 ax89 ax162 ax165 ax114 ax120 ax122 ax124 ax173
% 0.19/0.47
%------------------------------------------------------------------------------