TSTP Solution File: SWW963+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWW963+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n027.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 00:11:46 EDT 2022

% Result   : Theorem 0.23s 1.41s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   33 (  12 unt;   0 def)
%            Number of atoms       :   78 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   83 (  38   ~;  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    :   16 (  16 usr;   4 con; 0-2 aty)
%            Number of variables   :   48 (  19 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax192,axiom,
    ! [X193,X194,X195,X196] :
      ( ( pred_eq_bitstring_bitstring(name_Nb(X193),constr_ecb_dec_1(X195,name_skB))
        & pred_attacker(tuple_client_B_in_5(X195))
        & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(X194,name_skB)))
        & pred_attacker(tuple_client_B_in_3(X194))
        & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X196,constr_pkey(name_skS))))
        & pred_attacker(tuple_client_B_in_2(X196)) )
     => pred_attacker(tuple_client_B_out_6(name_objective)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax192) ).

fof(ax95,axiom,
    ! [X50,X51] : pred_eq_bitstring_bitstring(X50,X51),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax95) ).

fof(ax139,axiom,
    ! [X119] :
      ( pred_attacker(X119)
     => pred_attacker(tuple_client_B_in_5(X119)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax139) ).

fof(ax141,axiom,
    ! [X121] :
      ( pred_attacker(X121)
     => pred_attacker(tuple_client_B_in_3(X121)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax141) ).

fof(ax143,axiom,
    ! [X123] :
      ( pred_attacker(X123)
     => pred_attacker(tuple_client_B_in_2(X123)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax143) ).

fof(ax181,axiom,
    ! [X184] : pred_attacker(name_new0x2Dname(X184)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax181) ).

fof(co0,conjecture,
    pred_attacker(name_objective),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co0) ).

fof(ax133,axiom,
    ! [X110] :
      ( pred_attacker(tuple_client_B_out_6(X110))
     => pred_attacker(X110) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax133) ).

fof(c_0_8,plain,
    ! [X197,X198,X199,X200] :
      ( ~ pred_eq_bitstring_bitstring(name_Nb(X197),constr_ecb_dec_1(X199,name_skB))
      | ~ pred_attacker(tuple_client_B_in_5(X199))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(X198,name_skB)))
      | ~ pred_attacker(tuple_client_B_in_3(X198))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X200,constr_pkey(name_skS))))
      | ~ pred_attacker(tuple_client_B_in_2(X200))
      | pred_attacker(tuple_client_B_out_6(name_objective)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax192])])])]) ).

fof(c_0_9,plain,
    ! [X52,X53] : pred_eq_bitstring_bitstring(X52,X53),
    inference(variable_rename,[status(thm)],[ax95]) ).

cnf(c_0_10,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(tuple_client_B_in_2(X1))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X1,constr_pkey(name_skS))))
    | ~ pred_attacker(tuple_client_B_in_3(X2))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(X2,name_skB)))
    | ~ pred_attacker(tuple_client_B_in_5(X3))
    | ~ pred_eq_bitstring_bitstring(name_Nb(X4),constr_ecb_dec_1(X3,name_skB)) ),
    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,
    ! [X120] :
      ( ~ pred_attacker(X120)
      | pred_attacker(tuple_client_B_in_5(X120)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax139])]) ).

cnf(c_0_13,plain,
    ( pred_attacker(tuple_client_B_out_6(name_objective))
    | ~ pred_attacker(tuple_client_B_in_5(X3))
    | ~ pred_attacker(tuple_client_B_in_3(X2))
    | ~ pred_attacker(tuple_client_B_in_2(X1)) ),
    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,
    ! [X122] :
      ( ~ pred_attacker(X122)
      | pred_attacker(tuple_client_B_in_3(X122)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax141])]) ).

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,
    ! [X124] :
      ( ~ pred_attacker(X124)
      | pred_attacker(tuple_client_B_in_2(X124)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax143])]) ).

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,
    ! [X185] : pred_attacker(name_new0x2Dname(X185)),
    inference(variable_rename,[status(thm)],[ax181]) ).

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,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(assume_negation,[status(cth)],[co0]) ).

fof(c_0_26,plain,
    ! [X111] :
      ( ~ pred_attacker(tuple_client_B_out_6(X111))
      | pred_attacker(X111) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax133])]) ).

cnf(c_0_27,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_28,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(fof_simplification,[status(thm)],[c_0_25]) ).

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

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

cnf(c_0_31,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWW963+1 : TPTP v8.1.0. Released v7.4.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun  4 08:20:51 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.017 s
% 0.23/1.41  
% 0.23/1.41  # Failure: Out of unprocessed clauses!
% 0.23/1.41  # OLD status GaveUp
% 0.23/1.41  # Parsed axioms                        : 196
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 108
% 0.23/1.41  # Initial clauses                      : 88
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 88
% 0.23/1.41  # Processed clauses                    : 88
% 0.23/1.41  # ...of these trivial                  : 0
% 0.23/1.41  # ...subsumed                          : 0
% 0.23/1.41  # ...remaining for further processing  : 88
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 0
% 0.23/1.41  # Backward-rewritten                   : 0
% 0.23/1.41  # Generated clauses                    : 0
% 0.23/1.41  # ...of the previous two non-trivial   : 0
% 0.23/1.41  # Contextual simplify-reflections      : 0
% 0.23/1.41  # Paramodulations                      : 0
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 88
% 0.23/1.41  #    Positive orientable unit clauses  : 9
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 79
% 0.23/1.41  #    Non-unit-clauses                  : 0
% 0.23/1.41  # Current number of unprocessed clauses: 0
% 0.23/1.41  # ...number of literals in the above   : 0
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 0
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.41  # Unit Clause-clause subsumption calls : 3
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 0
% 0.23/1.41  # BW rewrite match successes           : 0
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 1923
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.017 s
% 0.23/1.41  # System time              : 0.001 s
% 0.23/1.41  # Total time               : 0.018 s
% 0.23/1.41  # Maximum resident set size: 3076 pages
% 0.23/1.41  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41  # Preprocessing time       : 0.021 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 33
% 0.23/1.41  # Proof object clause steps            : 16
% 0.23/1.41  # Proof object formula steps           : 17
% 0.23/1.41  # Proof object conjectures             : 4
% 0.23/1.41  # Proof object clause conjectures      : 1
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 8
% 0.23/1.41  # Proof object initial formulas used   : 8
% 0.23/1.41  # Proof object generating inferences   : 7
% 0.23/1.41  # Proof object simplifying inferences  : 5
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 196
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.41  # Initial clauses                      : 196
% 0.23/1.41  # Removed in clause preprocessing      : 4
% 0.23/1.41  # Initial clauses in saturation        : 192
% 0.23/1.41  # Processed clauses                    : 203
% 0.23/1.41  # ...of these trivial                  : 0
% 0.23/1.41  # ...subsumed                          : 1
% 0.23/1.41  # ...remaining for further processing  : 202
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 5
% 0.23/1.41  # Backward-rewritten                   : 1
% 0.23/1.41  # Generated clauses                    : 270
% 0.23/1.41  # ...of the previous two non-trivial   : 233
% 0.23/1.41  # Contextual simplify-reflections      : 0
% 0.23/1.41  # Paramodulations                      : 270
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 196
% 0.23/1.41  #    Positive orientable unit clauses  : 38
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 79
% 0.23/1.41  #    Non-unit-clauses                  : 79
% 0.23/1.41  # Current number of unprocessed clauses: 33
% 0.23/1.41  # ...number of literals in the above   : 111
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 10
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 4847
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 3775
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 6
% 0.23/1.41  # Unit Clause-clause subsumption calls : 1214
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 1
% 0.23/1.41  # BW rewrite match successes           : 1
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 10703
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.026 s
% 0.23/1.41  # System time              : 0.003 s
% 0.23/1.41  # Total time               : 0.029 s
% 0.23/1.41  # Maximum resident set size: 3876 pages
%------------------------------------------------------------------------------