%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWV011+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %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  : 300s
% DateTime : Thu Aug 31 21:36:07 EDT 2023

% Result   : Theorem 0.19s 0.57s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   32 (   5 unt;  23 typ;   0 def)
%            Number of atoms       :   13 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   5   ~;   2   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   27 (  17   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-1 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-4 aty)
%            Number of variables   :    4 (   0 sgn;   1   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    at: $i ).

tff(decl_23,type,
    t: $i ).

tff(decl_24,type,
    key: ( $i * $i ) > $i ).

tff(decl_25,type,
    a_holds: $i > $o ).

tff(decl_26,type,
    a: $i ).

tff(decl_27,type,
    party_of_protocol: $i > $o ).

tff(decl_28,type,
    b: $i ).

tff(decl_29,type,
    an_a_nonce: $i ).

tff(decl_30,type,
    pair: ( $i * $i ) > $i ).

tff(decl_31,type,
    sent: ( $i * $i * $i ) > $i ).

tff(decl_32,type,
    message: $i > $o ).

tff(decl_33,type,
    a_stored: $i > $o ).

tff(decl_34,type,
    bt: $i ).

tff(decl_35,type,
    b_holds: $i > $o ).

tff(decl_36,type,
    fresh_to_b: $i > $o ).

tff(decl_37,type,
    t_holds: $i > $o ).

tff(decl_38,type,
    generate_key: $i > $i ).

tff(decl_39,type,
    generate_expiration_time: $i > $i ).

tff(decl_40,type,
    triple: ( $i * $i * $i ) > $i ).

tff(decl_41,type,
    encrypt: ( $i * $i ) > $i ).

tff(decl_42,type,
    generate_b_nonce: $i > $i ).

tff(decl_43,type,
    quadruple: ( $i * $i * $i * $i ) > $i ).

tff(decl_44,type,
    b_stored: $i > $o ).

fof(co1,conjecture,
    ? [X1] :
      ( a_holds(key(X1,b))
      & b_holds(key(X1,a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(ax1,axiom,
    b_holds(key(generate_key(an_a_nonce),a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).

fof(ax3,axiom,
    a_holds(key(generate_key(an_a_nonce),b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X1] :
        ( a_holds(key(X1,b))
        & b_holds(key(X1,a)) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_4,negated_conjecture,
    ! [X2] :
      ( ~ a_holds(key(X2,b))
      | ~ b_holds(key(X2,a)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ a_holds(key(X1,b))
    | ~ b_holds(key(X1,a)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_6,plain,
    b_holds(key(generate_key(an_a_nonce),a)),
    inference(split_conjunct,[status(thm)],[ax1]) ).

cnf(c_0_7,plain,
    a_holds(key(generate_key(an_a_nonce),b)),
    inference(split_conjunct,[status(thm)],[ax3]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12  % Problem    : SWV011+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n017.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    : 300
% 0.13/0.33  % DateTime   : Tue Aug 29 05:37:43 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.19/0.57  % Version  : CSE_E---1.5
% 0.19/0.57  % Problem  : theBenchmark.p
% 0.19/0.57  % Proof found
% 0.19/0.57  % SZS status Theorem for theBenchmark.p
% 0.19/0.57  % SZS output start Proof
% See solution above
% 0.19/0.57  % Total time : 0.005000 s
% 0.19/0.57  % SZS output end Proof
% 0.19/0.57  % Total time : 0.008000 s
%------------------------------------------------------------------------------