TSTP Solution File: SWW967+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWW967+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n024.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.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   22 (   8 unt;   0 nHn;  22 RR)
%            Number of literals    :   52 (   0 equ;  40 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   25 (  25 usr;   9 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(12,axiom,
    ~ pred_attacker(name_objective),
    file('SWW967+1.p',unknown),
    [] ).

cnf(13,axiom,
    pred_eq_bitstring_bitstring(u,v),
    file('SWW967+1.p',unknown),
    [] ).

cnf(101,axiom,
    ( ~ pred_attacker(tuple_client_A_out_9(u))
    | pred_attacker(u) ),
    file('SWW967+1.p',unknown),
    [] ).

cnf(108,axiom,
    ( ~ pred_attacker(u)
    | pred_attacker(tuple_client_A_in_8(u)) ),
    file('SWW967+1.p',unknown),
    [] ).

cnf(110,axiom,
    ( ~ pred_attacker(u)
    | pred_attacker(tuple_client_A_in_6(u)) ),
    file('SWW967+1.p',unknown),
    [] ).

cnf(112,axiom,
    ( ~ pred_attacker(u)
    | pred_attacker(tuple_client_A_in_4(u)) ),
    file('SWW967+1.p',unknown),
    [] ).

cnf(114,axiom,
    ( ~ pred_attacker(u)
    | pred_attacker(tuple_client_A_in_2(u)) ),
    file('SWW967+1.p',unknown),
    [] ).

cnf(122,axiom,
    pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(u))),
    file('SWW967+1.p',unknown),
    [] ).

cnf(136,axiom,
    ( ~ pred_attacker(tuple_client_A_out_1(u,v,w))
    | pred_attacker(w) ),
    file('SWW967+1.p',unknown),
    [] ).

cnf(175,axiom,
    ( ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(u,v,w)),constr_cbc_dec_1(x,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(y,name_Kas))))
    | ~ pred_eq_bitstring_bitstring(name_Na(w),constr_tuple_4_get_0x30(constr_cbc_dec_4(v,name_Kas)))
    | ~ pred_attacker(tuple_client_A_in_6(y))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(y,name_Kas)))
    | ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(v,name_Kas)))
    | ~ pred_attacker(tuple_client_A_in_2(v))
    | ~ pred_attacker(tuple_client_A_in_4(u))
    | ~ pred_attacker(tuple_client_A_in_8(x))
    | pred_attacker(tuple_client_A_out_9(name_objective)) ),
    file('SWW967+1.p',unknown),
    [] ).

cnf(180,plain,
    ( ~ pred_attacker(tuple_client_A_in_6(u))
    | ~ pred_attacker(tuple_client_A_in_2(v))
    | ~ pred_attacker(tuple_client_A_in_4(w))
    | ~ pred_attacker(tuple_client_A_in_8(x))
    | pred_attacker(tuple_client_A_out_9(name_objective)) ),
    inference(mrr,[status(thm)],[175,13]),
    [iquote('0:MRR:175.0,175.1,175.3,175.4,13.0,13.0,13.0,13.0')] ).

cnf(191,plain,
    ~ pred_attacker(tuple_client_A_out_9(name_objective)),
    inference(res,[status(thm),theory(equality)],[101,12]),
    [iquote('0:Res:101.1,12.0')] ).

cnf(210,plain,
    ( ~ pred_attacker(tuple_client_A_in_8(u))
    | ~ pred_attacker(tuple_client_A_in_4(v))
    | ~ pred_attacker(tuple_client_A_in_2(w))
    | ~ pred_attacker(tuple_client_A_in_6(x)) ),
    inference(mrr,[status(thm)],[180,191]),
    [iquote('0:MRR:180.4,191.0')] ).

cnf(243,plain,
    pred_attacker(name_Na(u)),
    inference(res,[status(thm),theory(equality)],[122,136]),
    [iquote('0:Res:122.0,136.0')] ).

cnf(346,plain,
    ( ~ pred_attacker(u)
    | ~ pred_attacker(tuple_client_A_in_4(v))
    | ~ pred_attacker(tuple_client_A_in_2(w))
    | ~ pred_attacker(tuple_client_A_in_6(x)) ),
    inference(res,[status(thm),theory(equality)],[108,210]),
    [iquote('0:Res:108.1,210.0')] ).

cnf(347,plain,
    ( ~ pred_attacker(tuple_client_A_in_4(u))
    | ~ pred_attacker(tuple_client_A_in_2(v))
    | ~ pred_attacker(tuple_client_A_in_6(w)) ),
    inference(con,[status(thm)],[346]),
    [iquote('0:Con:346.0')] ).

cnf(348,plain,
    ( ~ pred_attacker(u)
    | ~ pred_attacker(tuple_client_A_in_2(v))
    | ~ pred_attacker(tuple_client_A_in_6(w)) ),
    inference(res,[status(thm),theory(equality)],[112,347]),
    [iquote('0:Res:112.1,347.0')] ).

cnf(349,plain,
    ( ~ pred_attacker(tuple_client_A_in_2(u))
    | ~ pred_attacker(tuple_client_A_in_6(v)) ),
    inference(con,[status(thm)],[348]),
    [iquote('0:Con:348.0')] ).

cnf(350,plain,
    ( ~ pred_attacker(u)
    | ~ pred_attacker(tuple_client_A_in_6(v)) ),
    inference(res,[status(thm),theory(equality)],[114,349]),
    [iquote('0:Res:114.1,349.0')] ).

cnf(351,plain,
    ~ pred_attacker(tuple_client_A_in_6(u)),
    inference(con,[status(thm)],[350]),
    [iquote('0:Con:350.0')] ).

cnf(352,plain,
    ~ pred_attacker(u),
    inference(mrr,[status(thm)],[110,351]),
    [iquote('0:MRR:110.1,351.0')] ).

cnf(353,plain,
    $false,
    inference(unc,[status(thm)],[352,243]),
    [iquote('0:UnC:352.0,243.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWW967+1 : TPTP v8.1.0. Released v7.4.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun  5 02:34:05 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.49  
% 0.19/0.49  SPASS V 3.9 
% 0.19/0.49  SPASS beiseite: Proof found.
% 0.19/0.49  % SZS status Theorem
% 0.19/0.49  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.49  SPASS derived 144 clauses, backtracked 0 clauses, performed 0 splits and kept 245 clauses.
% 0.19/0.49  SPASS allocated 98025 KBytes.
% 0.19/0.49  SPASS spent	0:00:00.14 on the problem.
% 0.19/0.49  		0:00:00.04 for the input.
% 0.19/0.49  		0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.49  		0:00:00.00 for inferences.
% 0.19/0.49  		0:00:00.00 for the backtracking.
% 0.19/0.49  		0:00:00.02 for the reduction.
% 0.19/0.49  
% 0.19/0.49  
% 0.19/0.49  Here is a proof with depth 3, length 22 :
% 0.19/0.49  % SZS output start Refutation
% See solution above
% 0.19/0.49  Formulae used in the proof : co0 ax83 ax109 ax120 ax122 ax124 ax126 ax167 ax119 ax171
% 0.19/0.49  
%------------------------------------------------------------------------------