↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWW970+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n023.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:47 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   23 (  12 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  13   ~;  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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax135) ).

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

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

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

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

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

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

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

cnf(c_0_8,plain,
    ( pred_attacker(tuple_client_B_out_2(name_objective))
    | ~ pred_attacker(tuple_client_B_in_1(X1))
    | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X1,name_Kbs))) ),
    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,
    ! [X68] :
      ( ~ pred_attacker(X68)
      | pred_attacker(tuple_client_B_in_1(X68)) ),
    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,
    ! [X141] : pred_attacker(name_new0x2Dname(X141)),
    inference(variable_rename,[status(thm)],[ax134]) ).

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

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

cnf(c_0_16,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_17,plain,
    pred_attacker(name_new0x2Dname(X1)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_18,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(fof_simplification,[status(thm)],[c_0_14]) ).

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

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

cnf(c_0_21,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWW970+1 : TPTP v8.1.0. Released v7.4.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n023.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun  5 11:20:54 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.016 s
% 0.24/1.42  
% 0.24/1.42  # Failure: Out of unprocessed clauses!
% 0.24/1.42  # OLD status GaveUp
% 0.24/1.42  # Parsed axioms                        : 139
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 63
% 0.24/1.42  # Initial clauses                      : 76
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 76
% 0.24/1.42  # Processed clauses                    : 76
% 0.24/1.42  # ...of these trivial                  : 0
% 0.24/1.42  # ...subsumed                          : 0
% 0.24/1.42  # ...remaining for further processing  : 76
% 0.24/1.42  # Other redundant clauses eliminated   : 0
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 0
% 0.24/1.42  # Backward-rewritten                   : 0
% 0.24/1.42  # Generated clauses                    : 0
% 0.24/1.42  # ...of the previous two non-trivial   : 0
% 0.24/1.42  # Contextual simplify-reflections      : 0
% 0.24/1.42  # Paramodulations                      : 0
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 76
% 0.24/1.42  #    Positive orientable unit clauses  : 9
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 67
% 0.24/1.42  #    Non-unit-clauses                  : 0
% 0.24/1.42  # Current number of unprocessed clauses: 0
% 0.24/1.42  # ...number of literals in the above   : 0
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 0
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 0
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 0
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.42  # Unit Clause-clause subsumption calls : 1
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 0
% 0.24/1.42  # BW rewrite match successes           : 0
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 1371
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.017 s
% 0.24/1.42  # System time              : 0.000 s
% 0.24/1.42  # Total time               : 0.017 s
% 0.24/1.42  # Maximum resident set size: 2932 pages
% 0.24/1.42  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.42  # Preprocessing time       : 0.018 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 23
% 0.24/1.42  # Proof object clause steps            : 10
% 0.24/1.42  # Proof object formula steps           : 13
% 0.24/1.42  # Proof object conjectures             : 4
% 0.24/1.42  # Proof object clause conjectures      : 1
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 6
% 0.24/1.42  # Proof object initial formulas used   : 6
% 0.24/1.42  # Proof object generating inferences   : 3
% 0.24/1.42  # Proof object simplifying inferences  : 3
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 139
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.42  # Initial clauses                      : 139
% 0.24/1.42  # Removed in clause preprocessing      : 1
% 0.24/1.42  # Initial clauses in saturation        : 138
% 0.24/1.42  # Processed clauses                    : 140
% 0.24/1.42  # ...of these trivial                  : 0
% 0.24/1.42  # ...subsumed                          : 0
% 0.24/1.42  # ...remaining for further processing  : 140
% 0.24/1.42  # Other redundant clauses eliminated   : 0
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 1
% 0.24/1.42  # Backward-rewritten                   : 1
% 0.24/1.42  # Generated clauses                    : 72
% 0.24/1.42  # ...of the previous two non-trivial   : 55
% 0.24/1.42  # Contextual simplify-reflections      : 0
% 0.24/1.42  # Paramodulations                      : 72
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 138
% 0.24/1.42  #    Positive orientable unit clauses  : 27
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 67
% 0.24/1.42  #    Non-unit-clauses                  : 44
% 0.24/1.42  # Current number of unprocessed clauses: 15
% 0.24/1.42  # ...number of literals in the above   : 34
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 3
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 1461
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 893
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 1
% 0.24/1.42  # Unit Clause-clause subsumption calls : 825
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 1
% 0.24/1.42  # BW rewrite match successes           : 1
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 5490
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.021 s
% 0.24/1.42  # System time              : 0.001 s
% 0.24/1.42  # Total time               : 0.022 s
% 0.24/1.42  # Maximum resident set size: 3408 pages
%------------------------------------------------------------------------------