↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWW948+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 : 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:27 PM UTC 2026

% Result   : Theorem 1.32s 1.74s
% Output   : CNFRefutation 1.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   61 (  33 unt;   0 def)
%            Number of atoms       :   97 (  15 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   66 (  30   ~;  26   |;   2   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-2 aty)
%            Number of variables   :   66 (   2 sgn  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax106,axiom,
    ! [X40] :
      ( pred_attacker(tuple_R_in_2(X40,constr_h(constr_xor(constr_xor(name_r0x30,X40),name_k))))
     => pred_attacker(tuple_R_out_4(name_objective_R)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax106) ).

fof(ax68,axiom,
    ! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).

fof(ax67,axiom,
    ! [X2] : constr_xor(X2,constr_ZERO) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax67) ).

fof(ax69,axiom,
    ! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).

fof(ax88,axiom,
    ! [X27,X28] :
      ( ( pred_attacker(X27)
        & pred_attacker(X28) )
     => pred_attacker(tuple_R_in_2(X27,X28)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax88) ).

fof(ax66,axiom,
    ! [X1] : constr_xor(X1,X1) = constr_ZERO,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).

fof(ax76,axiom,
    ! [X16,X17] :
      ( pred_attacker(tuple_knowledge_from_1st_round_out_2(X16,X17))
     => pred_attacker(X17) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).

fof(ax102,axiom,
    pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax102) ).

fof(ax83,axiom,
    ! [X22] :
      ( pred_attacker(tuple_R_out_4(X22))
     => pred_attacker(X22) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).

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

fof(ax87,axiom,
    ! [X26] :
      ( pred_attacker(tuple_R_out_1(X26))
     => pred_attacker(X26) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax87) ).

fof(ax70,axiom,
    ! [X8,X9] :
      ( ( pred_attacker(X8)
        & pred_attacker(X9) )
     => pred_attacker(constr_xor(X8,X9)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax70) ).

fof(ax104,axiom,
    pred_attacker(tuple_R_out_1(name_r0x30)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax104) ).

fof(ax75,axiom,
    ! [X14,X15] :
      ( pred_attacker(tuple_knowledge_from_1st_round_out_2(X14,X15))
     => pred_attacker(X14) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax75) ).

fof(ax78,axiom,
    ! [X19] :
      ( pred_attacker(tuple_knowledge_from_1st_round_out_1(X19))
     => pred_attacker(X19) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).

fof(ax101,axiom,
    pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax101) ).

fof(c_0_16,plain,
    ! [X120] :
      ( ~ pred_attacker(tuple_R_in_2(X120,constr_h(constr_xor(constr_xor(name_r0x30,X120),name_k))))
      | pred_attacker(tuple_R_out_4(name_objective_R)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax106])]) ).

fof(c_0_17,plain,
    ! [X83,X84] : constr_xor(X83,X84) = constr_xor(X84,X83),
    inference(variable_rename,[status(thm)],[ax68]) ).

fof(c_0_18,plain,
    ! [X82] : constr_xor(X82,constr_ZERO) = X82,
    inference(variable_rename,[status(thm)],[ax67]) ).

fof(c_0_19,plain,
    ! [X85,X86,X87] : constr_xor(X85,constr_xor(X86,X87)) = constr_xor(constr_xor(X85,X86),X87),
    inference(variable_rename,[status(thm)],[ax69]) ).

cnf(c_0_20,plain,
    ( pred_attacker(tuple_R_out_4(name_objective_R))
    | ~ pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(constr_xor(name_r0x30,X1),name_k)))) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,plain,
    constr_xor(X1,X2) = constr_xor(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_22,plain,
    ! [X107,X108] :
      ( ~ pred_attacker(X107)
      | ~ pred_attacker(X108)
      | pred_attacker(tuple_R_in_2(X107,X108)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax88])]) ).

fof(c_0_23,plain,
    ! [X81] : constr_xor(X81,X81) = constr_ZERO,
    inference(variable_rename,[status(thm)],[ax66]) ).

cnf(c_0_24,plain,
    constr_xor(X1,constr_ZERO) = X1,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_25,plain,
    ! [X96,X97] :
      ( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X96,X97))
      | pred_attacker(X97) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax76])]) ).

cnf(c_0_26,plain,
    pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
    inference(split_conjunct,[status(thm)],[ax102]) ).

cnf(c_0_27,plain,
    constr_xor(X1,constr_xor(X2,X3)) = constr_xor(constr_xor(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_28,plain,
    ( pred_attacker(tuple_R_out_4(name_objective_R))
    | ~ pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1))))) ),
    inference(rw,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_29,plain,
    ( pred_attacker(tuple_R_in_2(X1,X2))
    | ~ pred_attacker(X1)
    | ~ pred_attacker(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_30,plain,
    constr_xor(X1,X1) = constr_ZERO,
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_31,plain,
    constr_xor(constr_ZERO,X1) = X1,
    inference(spm,[status(thm)],[c_0_24,c_0_21]) ).

cnf(c_0_32,plain,
    ( pred_attacker(X2)
    | ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_33,plain,
    pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(name_r0x30_from_1st,constr_xor(name_k,name_r1_from_1st))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_21]) ).

cnf(c_0_34,plain,
    ( pred_attacker(tuple_R_out_4(name_objective_R))
    | ~ pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1))))
    | ~ pred_attacker(X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_35,plain,
    constr_xor(X1,constr_xor(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_30]),c_0_31]) ).

cnf(c_0_36,plain,
    pred_attacker(constr_h(constr_xor(name_r0x30_from_1st,constr_xor(name_k,name_r1_from_1st)))),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_37,plain,
    constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X2,constr_xor(X3,X1)),
    inference(spm,[status(thm)],[c_0_27,c_0_21]) ).

fof(c_0_38,plain,
    ! [X102] :
      ( ~ pred_attacker(tuple_R_out_4(X102))
      | pred_attacker(X102) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])]) ).

cnf(c_0_39,plain,
    ( pred_attacker(tuple_R_out_4(name_objective_R))
    | ~ pred_attacker(constr_h(constr_xor(name_k,X1)))
    | ~ pred_attacker(constr_xor(name_r0x30,X1)) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_40,plain,
    pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_21]) ).

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

fof(c_0_42,plain,
    ! [X106] :
      ( ~ pred_attacker(tuple_R_out_1(X106))
      | pred_attacker(X106) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax87])]) ).

cnf(c_0_43,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_R_out_4(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_44,plain,
    ( pred_attacker(tuple_R_out_4(name_objective_R))
    | ~ pred_attacker(constr_xor(name_r0x30,constr_xor(name_r0x30_from_1st,name_r1_from_1st))) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_45,negated_conjecture,
    ~ pred_attacker(name_objective_R),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

fof(c_0_46,plain,
    ! [X88,X89] :
      ( ~ pred_attacker(X88)
      | ~ pred_attacker(X89)
      | pred_attacker(constr_xor(X88,X89)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax70])]) ).

cnf(c_0_47,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_R_out_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

cnf(c_0_48,plain,
    pred_attacker(tuple_R_out_1(name_r0x30)),
    inference(split_conjunct,[status(thm)],[ax104]) ).

fof(c_0_49,plain,
    ! [X94,X95] :
      ( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X94,X95))
      | pred_attacker(X94) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax75])]) ).

fof(c_0_50,plain,
    ! [X99] :
      ( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X99))
      | pred_attacker(X99) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).

cnf(c_0_51,plain,
    ~ pred_attacker(constr_xor(name_r0x30,constr_xor(name_r0x30_from_1st,name_r1_from_1st))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).

cnf(c_0_52,plain,
    ( pred_attacker(constr_xor(X1,X2))
    | ~ pred_attacker(X1)
    | ~ pred_attacker(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_53,plain,
    pred_attacker(name_r0x30),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_54,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_49]) ).

cnf(c_0_55,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_50]) ).

cnf(c_0_56,plain,
    pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
    inference(split_conjunct,[status(thm)],[ax101]) ).

cnf(c_0_57,plain,
    ~ pred_attacker(constr_xor(name_r0x30_from_1st,name_r1_from_1st)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).

cnf(c_0_58,plain,
    pred_attacker(name_r1_from_1st),
    inference(spm,[status(thm)],[c_0_54,c_0_33]) ).

cnf(c_0_59,plain,
    pred_attacker(name_r0x30_from_1st),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_60,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_52]),c_0_58]),c_0_59])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWW948+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.15/0.33  % Computer : n013.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 07:35:56 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.32/1.74  % Version  : CSE_E---1.7
% 1.32/1.74  % Problem  : theBenchmark.p
% 1.32/1.74  % SZS status Theorem for theBenchmark.p
% 1.32/1.74  % SZS output start CNFRefutation
% See solution above
% 1.32/1.74  % Total time : 1.373s
%------------------------------------------------------------------------------