↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWW970+1 : TPTP v9.2.1. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n018.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 : Tue May  5 05:33:29 PM UTC 2026

% Result   : Theorem 1.28s 1.72s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  11 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  12   ~;  10   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   20 (   5 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax135,axiom,
    ! [X141] :
      ( ( pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X141,name_Kbs)))
        & pred_attacker(tuple_client_B_in_1(X141)) )
     => pred_attacker(tuple_client_B_out_2(name_objective)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax135) ).

fof(ax79,axiom,
    ! [X50,X51] : pred_eq_bitstring_bitstring(X50,X51),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax79) ).

fof(ax94,axiom,
    ! [X67] :
      ( pred_attacker(X67)
     => pred_attacker(tuple_client_B_in_1(X67)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax94) ).

fof(ax134,axiom,
    ! [X140] : pred_attacker(name_new0x2Dname(X140)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax134) ).

fof(ax93,axiom,
    ! [X66] :
      ( pred_attacker(tuple_client_B_out_2(X66))
     => pred_attacker(X66) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).

fof(co0,conjecture,
    pred_attacker(name_objective),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).

fof(c_0_6,plain,
    ! [X427] :
      ( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X427,name_Kbs)))
      | ~ pred_attacker(tuple_client_B_in_1(X427))
      | pred_attacker(tuple_client_B_out_2(name_objective)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax135])]) ).

fof(c_0_7,plain,
    ! [X336,X337] : pred_eq_bitstring_bitstring(X336,X337),
    inference(variable_rename,[status(thm)],[ax79]) ).

cnf(c_0_8,plain,
    ( pred_attacker(tuple_client_B_out_2(name_objective))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X1,name_Kbs)))
    | ~ pred_attacker(tuple_client_B_in_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    pred_eq_bitstring_bitstring(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_10,plain,
    ! [X353] :
      ( ~ pred_attacker(X353)
      | pred_attacker(tuple_client_B_in_1(X353)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax94])]) ).

cnf(c_0_11,plain,
    ( pred_attacker(tuple_client_B_out_2(name_objective))
    | ~ pred_attacker(tuple_client_B_in_1(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

cnf(c_0_12,plain,
    ( pred_attacker(tuple_client_B_in_1(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_13,plain,
    ! [X426] : pred_attacker(name_new0x2Dname(X426)),
    inference(variable_rename,[status(thm)],[ax134]) ).

fof(c_0_14,plain,
    ! [X352] :
      ( ~ pred_attacker(tuple_client_B_out_2(X352))
      | pred_attacker(X352) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax93])]) ).

cnf(c_0_15,plain,
    ( pred_attacker(tuple_client_B_out_2(name_objective))
    | ~ pred_attacker(X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    pred_attacker(name_new0x2Dname(X1)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_17,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).

cnf(c_0_18,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_client_B_out_2(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    pred_attacker(tuple_client_B_out_2(name_objective)),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_21,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWW970+1 : TPTP v9.2.1. Released v7.4.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33  % Computer : n018.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 07:37:47 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.28/1.72  % Version  : CSE_E---1.7
% 1.28/1.72  % Problem  : theBenchmark.p
% 1.28/1.72  % SZS status Theorem for theBenchmark.p
% 1.28/1.72  % SZS output start CNFRefutation
% See solution above
% 1.28/1.72  % Total time : 1.370s
%------------------------------------------------------------------------------