↑ Up

CSE_E---1.7.THM-CRf.s

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

% Computer : n013.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:28 PM UTC 2026

% Result   : Theorem 1.30s 1.74s
% Output   : CNFRefutation 1.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   32 (  11 unt;   0 def)
%            Number of atoms       :   77 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   82 (  37   ~;  35   |;   5   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   4 con; 0-2 aty)
%            Number of variables   :   48 (  19 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax184,axiom,
    ! [X116,X117,X118,X119] :
      ( ( pred_eq_bitstring_bitstring(name_Nb(X116),constr_adec(X118,name_skB))
        & pred_attacker(tuple_client_B_in_5(X118))
        & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X117,name_skB)))
        & pred_attacker(tuple_client_B_in_3(X117))
        & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X119,constr_pkey(name_skS))))
        & pred_attacker(tuple_client_B_in_2(X119)) )
     => pred_attacker(tuple_client_B_out_6(name_objective)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax184) ).

fof(ax103,axiom,
    ! [X24,X25] : pred_eq_bitstring_bitstring(X24,X25),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax103) ).

fof(ax137,axiom,
    ! [X70] :
      ( pred_attacker(X70)
     => pred_attacker(tuple_client_B_in_5(X70)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax137) ).

fof(ax139,axiom,
    ! [X72] :
      ( pred_attacker(X72)
     => pred_attacker(tuple_client_B_in_3(X72)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax139) ).

fof(ax141,axiom,
    ! [X74] :
      ( pred_attacker(X74)
     => pred_attacker(tuple_client_B_in_2(X74)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax141) ).

fof(ax173,axiom,
    ! [X107] : pred_attacker(name_new0x2Dname(X107)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax173) ).

fof(ax131,axiom,
    ! [X61] :
      ( pred_attacker(tuple_client_B_out_6(X61))
     => pred_attacker(X61) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax131) ).

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

fof(c_0_8,plain,
    ! [X364,X365,X366,X367] :
      ( ~ pred_eq_bitstring_bitstring(name_Nb(X364),constr_adec(X366,name_skB))
      | ~ pred_attacker(tuple_client_B_in_5(X366))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X365,name_skB)))
      | ~ pred_attacker(tuple_client_B_in_3(X365))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X367,constr_pkey(name_skS))))
      | ~ pred_attacker(tuple_client_B_in_2(X367))
      | pred_attacker(tuple_client_B_out_6(name_objective)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax184])]) ).

fof(c_0_9,plain,
    ! [X272,X273] : pred_eq_bitstring_bitstring(X272,X273),
    inference(variable_rename,[status(thm)],[ax103]) ).

cnf(c_0_10,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_eq_bitstring_bitstring(name_Nb(X1),constr_adec(X2,name_skB))
    | ~ pred_attacker(tuple_client_B_in_5(X2))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X3,name_skB)))
    | ~ pred_attacker(tuple_client_B_in_3(X3))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X4,constr_pkey(name_skS))))
    | ~ pred_attacker(tuple_client_B_in_2(X4)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

fof(c_0_12,plain,
    ! [X318] :
      ( ~ pred_attacker(X318)
      | pred_attacker(tuple_client_B_in_5(X318)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax137])]) ).

cnf(c_0_13,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(tuple_client_B_in_5(X2))
    | ~ pred_attacker(tuple_client_B_in_3(X3))
    | ~ pred_attacker(tuple_client_B_in_2(X4)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11])]) ).

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

fof(c_0_15,plain,
    ! [X320] :
      ( ~ pred_attacker(X320)
      | pred_attacker(tuple_client_B_in_3(X320)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax139])]) ).

cnf(c_0_16,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(tuple_client_B_in_3(X1))
    | ~ pred_attacker(tuple_client_B_in_2(X2))
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    ( pred_attacker(tuple_client_B_in_3(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_18,plain,
    ! [X322] :
      ( ~ pred_attacker(X322)
      | pred_attacker(tuple_client_B_in_2(X322)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax141])]) ).

cnf(c_0_19,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(tuple_client_B_in_2(X1))
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

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

fof(c_0_21,plain,
    ! [X355] : pred_attacker(name_new0x2Dname(X355)),
    inference(variable_rename,[status(thm)],[ax173]) ).

cnf(c_0_22,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(X1)
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    pred_attacker(name_new0x2Dname(X1)),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_24,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(X1)
    | ~ pred_attacker(X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

fof(c_0_25,plain,
    ! [X309] :
      ( ~ pred_attacker(tuple_client_B_out_6(X309))
      | pred_attacker(X309) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax131])]) ).

cnf(c_0_26,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_23]) ).

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

cnf(c_0_28,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_client_B_out_6(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_29,plain,
    pred_attacker(tuple_client_B_out_6(name_objective)),
    inference(spm,[status(thm)],[c_0_26,c_0_23]) ).

cnf(c_0_30,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_31,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
    [proof] ).

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