TSTP Solution File: SWW970+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW970+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:26 EDT 2022
% Result : Theorem 0.13s 0.36s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 16 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(12,axiom,
~ pred_attacker(name_objective),
file('SWW970+1.p',unknown),
[] ).
cnf(13,axiom,
pred_eq_bitstring_bitstring(u,v),
file('SWW970+1.p',unknown),
[] ).
cnf(15,axiom,
pred_attacker(name_new0x2Dname(u)),
file('SWW970+1.p',unknown),
[] ).
cnf(90,axiom,
( ~ pred_attacker(tuple_client_B_out_2(u))
| pred_attacker(u) ),
file('SWW970+1.p',unknown),
[] ).
cnf(91,axiom,
( ~ pred_attacker(u)
| pred_attacker(tuple_client_B_in_1(u)) ),
file('SWW970+1.p',unknown),
[] ).
cnf(134,axiom,
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(u,name_Kbs)))
| ~ pred_attacker(tuple_client_B_in_1(u))
| pred_attacker(tuple_client_B_out_2(name_objective)) ),
file('SWW970+1.p',unknown),
[] ).
cnf(140,plain,
( ~ pred_attacker(tuple_client_B_in_1(u))
| pred_attacker(tuple_client_B_out_2(name_objective)) ),
inference(mrr,[status(thm)],[134,13]),
[iquote('0:MRR:134.0,13.0')] ).
cnf(147,plain,
~ pred_attacker(tuple_client_B_out_2(name_objective)),
inference(res,[status(thm),theory(equality)],[90,12]),
[iquote('0:Res:90.1,12.0')] ).
cnf(157,plain,
~ pred_attacker(tuple_client_B_in_1(u)),
inference(mrr,[status(thm)],[140,147]),
[iquote('0:MRR:140.1,147.0')] ).
cnf(158,plain,
~ pred_attacker(u),
inference(mrr,[status(thm)],[91,157]),
[iquote('0:MRR:91.1,157.0')] ).
cnf(159,plain,
$false,
inference(unc,[status(thm)],[158,15]),
[iquote('0:UnC:158.0,15.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWW970+1 : TPTP v8.1.0. Released v7.4.0.
% 0.00/0.09 % Command : run_spass %d %s
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 600
% 0.10/0.28 % DateTime : Sun Jun 5 10:58:18 EDT 2022
% 0.10/0.28 % CPUTime :
% 0.13/0.36
% 0.13/0.36 SPASS V 3.9
% 0.13/0.36 SPASS beiseite: Proof found.
% 0.13/0.36 % SZS status Theorem
% 0.13/0.36 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.36 SPASS derived 18 clauses, backtracked 0 clauses, performed 0 splits and kept 145 clauses.
% 0.13/0.36 SPASS allocated 97902 KBytes.
% 0.13/0.36 SPASS spent 0:00:00.07 on the problem.
% 0.13/0.36 0:00:00.02 for the input.
% 0.13/0.36 0:00:00.02 for the FLOTTER CNF translation.
% 0.13/0.36 0:00:00.00 for inferences.
% 0.13/0.36 0:00:00.00 for the backtracking.
% 0.13/0.36 0:00:00.00 for the reduction.
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 Here is a proof with depth 1, length 11 :
% 0.13/0.36 % SZS output start Refutation
% See solution above
% 0.13/0.36 Formulae used in the proof : co0 ax79 ax134 ax93 ax94 ax135
% 0.13/0.36
%------------------------------------------------------------------------------