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

View Problem - Process Solution

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

% Computer : n024.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:44 EDT 2022

% Result   : Theorem 0.22s 1.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   65 (  32 unt;   0 def)
%            Number of atoms       :  111 (  15 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   86 (  40   ~;  36   |;   2   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   8 con; 0-2 aty)
%            Number of variables   :   81 (   3 sgn  40   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax92,axiom,
    ! [X2] : constr_xor(X2,constr_ZERO) = X2,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax92) ).

fof(ax93,axiom,
    ! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax93) ).

fof(ax136,axiom,
    ! [X48] :
      ( pred_attacker(tuple_R_in_2(X48,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X48),name_k))),constr_h(constr_xor(constr_xor(name_r1,X48),name_k))))))
     => pred_attacker(tuple_R_out_4(name_objective)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax136) ).

fof(ax94,axiom,
    ! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax94) ).

fof(ax91,axiom,
    ! [X1] : constr_xor(X1,X1) = constr_ZERO,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax91) ).

fof(ax117,axiom,
    ! [X35,X36] :
      ( ( pred_attacker(X35)
        & pred_attacker(X36) )
     => pred_attacker(tuple_R_in_2(X35,X36)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax117) ).

fof(ax103,axiom,
    ! [X18,X19] :
      ( pred_attacker(tuple_sess_1_out_2(X18,X19))
     => pred_attacker(X19) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax103) ).

fof(ax132,axiom,
    pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k))),constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k)))))),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax132) ).

fof(ax95,axiom,
    ! [X8,X9] :
      ( ( pred_attacker(X8)
        & pred_attacker(X9) )
     => pred_attacker(constr_xor(X8,X9)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax95) ).

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

fof(ax111,axiom,
    ! [X26] :
      ( pred_attacker(tuple_R_out_4(X26))
     => pred_attacker(X26) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax111) ).

fof(ax105,axiom,
    ! [X21] :
      ( pred_attacker(tuple_sess_1_out_1(X21))
     => pred_attacker(X21) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax105) ).

fof(ax116,axiom,
    ! [X33,X34] :
      ( pred_attacker(tuple_R_out_1(X33,X34))
     => pred_attacker(X34) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax116) ).

fof(ax102,axiom,
    ! [X16,X17] :
      ( pred_attacker(tuple_sess_1_out_2(X16,X17))
     => pred_attacker(X16) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax102) ).

fof(ax131,axiom,
    pred_attacker(tuple_sess_1_out_1(name_r1_s1)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax131) ).

fof(ax134,axiom,
    pred_attacker(tuple_R_out_1(constr_QUERY,name_r1)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax134) ).

fof(c_0_16,plain,
    ! [X3] : constr_xor(X3,constr_ZERO) = X3,
    inference(variable_rename,[status(thm)],[ax92]) ).

fof(c_0_17,plain,
    ! [X5,X6] : constr_xor(X5,X6) = constr_xor(X6,X5),
    inference(variable_rename,[status(thm)],[ax93]) ).

fof(c_0_18,plain,
    ! [X49] :
      ( ~ pred_attacker(tuple_R_in_2(X49,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X49),name_k))),constr_h(constr_xor(constr_xor(name_r1,X49),name_k))))))
      | pred_attacker(tuple_R_out_4(name_objective)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax136])])])]) ).

fof(c_0_19,plain,
    ! [X8,X9,X10] : constr_xor(X8,constr_xor(X9,X10)) = constr_xor(constr_xor(X8,X9),X10),
    inference(variable_rename,[status(thm)],[ax94]) ).

fof(c_0_20,plain,
    ! [X2] : constr_xor(X2,X2) = constr_ZERO,
    inference(variable_rename,[status(thm)],[ax91]) ).

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

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

cnf(c_0_23,plain,
    ( pred_attacker(tuple_R_out_4(name_objective))
    | ~ pred_attacker(tuple_R_in_2(X1,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X1),name_k))),constr_h(constr_xor(constr_xor(name_r1,X1),name_k)))))) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_24,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_25,plain,
    constr_xor(X1,X1) = constr_ZERO,
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

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

cnf(c_0_27,plain,
    ( pred_attacker(tuple_R_out_4(name_objective))
    | ~ pred_attacker(tuple_R_in_2(X1,constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r1,X1))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r1,X1)))))))) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22]),c_0_22]),c_0_22]) ).

cnf(c_0_28,plain,
    constr_xor(X1,constr_xor(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).

cnf(c_0_29,plain,
    ( pred_attacker(tuple_R_out_4(name_objective))
    | ~ pred_attacker(tuple_R_in_2(constr_xor(name_r1,X1),constr_split_L(constr_xor(constr_h(constr_xor(name_k,X1)),constr_rotate(name_ID,constr_h(constr_xor(name_k,X1))))))) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,plain,
    constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X2,constr_xor(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_24]) ).

fof(c_0_31,plain,
    ! [X37,X38] :
      ( ~ pred_attacker(X37)
      | ~ pred_attacker(X38)
      | pred_attacker(tuple_R_in_2(X37,X38)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax117])]) ).

fof(c_0_32,plain,
    ! [X20,X21] :
      ( ~ pred_attacker(tuple_sess_1_out_2(X20,X21))
      | pred_attacker(X21) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax103])]) ).

cnf(c_0_33,plain,
    pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k))),constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k)))))),
    inference(split_conjunct,[status(thm)],[ax132]) ).

fof(c_0_34,plain,
    ! [X10,X11] :
      ( ~ pred_attacker(X10)
      | ~ pred_attacker(X11)
      | pred_attacker(constr_xor(X10,X11)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax95])]) ).

cnf(c_0_35,plain,
    ( pred_attacker(tuple_R_out_4(name_objective))
    | ~ pred_attacker(tuple_R_in_2(constr_xor(name_k,constr_xor(name_r1,X1)),constr_split_L(constr_xor(constr_h(X1),constr_rotate(name_ID,constr_h(X1)))))) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_28]),c_0_30]) ).

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

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

cnf(c_0_38,plain,
    pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1)))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_22]),c_0_22]),c_0_22]) ).

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

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

fof(c_0_41,plain,
    ! [X27] :
      ( ~ pred_attacker(tuple_R_out_4(X27))
      | pred_attacker(X27) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax111])]) ).

cnf(c_0_42,plain,
    ( pred_attacker(tuple_R_out_4(name_objective))
    | ~ pred_attacker(constr_split_L(constr_xor(constr_h(X1),constr_rotate(name_ID,constr_h(X1)))))
    | ~ pred_attacker(constr_xor(name_k,constr_xor(name_r1,X1))) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_43,plain,
    pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1))))))),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

fof(c_0_44,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(fof_simplification,[status(thm)],[c_0_39]) ).

cnf(c_0_45,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(constr_xor(X2,X1))
    | ~ pred_attacker(X2) ),
    inference(spm,[status(thm)],[c_0_40,c_0_28]) ).

cnf(c_0_46,plain,
    ( pred_attacker(constr_xor(X1,constr_xor(X2,X3)))
    | ~ pred_attacker(constr_xor(X1,X2))
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_40,c_0_24]) ).

fof(c_0_47,plain,
    ! [X22] :
      ( ~ pred_attacker(tuple_sess_1_out_1(X22))
      | pred_attacker(X22) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax105])]) ).

fof(c_0_48,plain,
    ! [X35,X36] :
      ( ~ pred_attacker(tuple_R_out_1(X35,X36))
      | pred_attacker(X36) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax116])]) ).

fof(c_0_49,plain,
    ! [X18,X19] :
      ( ~ pred_attacker(tuple_sess_1_out_2(X18,X19))
      | pred_attacker(X18) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax102])])])]) ).

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

cnf(c_0_51,plain,
    ( pred_attacker(tuple_R_out_4(name_objective))
    | ~ pred_attacker(constr_xor(name_r1,constr_xor(name_r1_s1,name_r2_s1))) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_30]),c_0_28]) ).

cnf(c_0_52,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_53,plain,
    ( pred_attacker(constr_xor(X1,X2))
    | ~ pred_attacker(constr_xor(X3,X1))
    | ~ pred_attacker(X3)
    | ~ pred_attacker(X2) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

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

cnf(c_0_55,plain,
    pred_attacker(tuple_sess_1_out_1(name_r1_s1)),
    inference(split_conjunct,[status(thm)],[ax131]) ).

cnf(c_0_56,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_R_out_1(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_48]) ).

cnf(c_0_57,plain,
    pred_attacker(tuple_R_out_1(constr_QUERY,name_r1)),
    inference(split_conjunct,[status(thm)],[ax134]) ).

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

cnf(c_0_59,plain,
    ~ pred_attacker(constr_xor(name_r1,constr_xor(name_r1_s1,name_r2_s1))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).

cnf(c_0_60,plain,
    ( pred_attacker(constr_xor(X1,constr_xor(X2,X3)))
    | ~ pred_attacker(X2)
    | ~ pred_attacker(X1)
    | ~ pred_attacker(X3) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_28]),c_0_24]) ).

cnf(c_0_61,plain,
    pred_attacker(name_r1_s1),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_62,plain,
    pred_attacker(name_r1),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_63,plain,
    pred_attacker(name_r2_s1),
    inference(spm,[status(thm)],[c_0_58,c_0_38]) ).

cnf(c_0_64,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62]),c_0_63])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWW952+1 : TPTP v8.1.0. Released v7.4.0.
% 0.06/0.13  % Command  : run_ET %s %d
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun  5 19:12:50 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.22/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41  # Preprocessing time       : 0.015 s
% 0.22/1.41  
% 0.22/1.41  # Failure: Out of unprocessed clauses!
% 0.22/1.41  # OLD status GaveUp
% 0.22/1.41  # Parsed axioms                        : 138
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 38
% 0.22/1.41  # Initial clauses                      : 100
% 0.22/1.41  # Removed in clause preprocessing      : 0
% 0.22/1.41  # Initial clauses in saturation        : 100
% 0.22/1.41  # Processed clauses                    : 100
% 0.22/1.41  # ...of these trivial                  : 0
% 0.22/1.41  # ...subsumed                          : 0
% 0.22/1.41  # ...remaining for further processing  : 100
% 0.22/1.41  # Other redundant clauses eliminated   : 0
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 0
% 0.22/1.41  # Backward-rewritten                   : 0
% 0.22/1.41  # Generated clauses                    : 0
% 0.22/1.41  # ...of the previous two non-trivial   : 0
% 0.22/1.41  # Contextual simplify-reflections      : 0
% 0.22/1.41  # Paramodulations                      : 0
% 0.22/1.41  # Factorizations                       : 0
% 0.22/1.41  # Equation resolutions                 : 0
% 0.22/1.41  # Current number of processed clauses  : 100
% 0.22/1.41  #    Positive orientable unit clauses  : 8
% 0.22/1.41  #    Positive unorientable unit clauses: 0
% 0.22/1.41  #    Negative unit clauses             : 92
% 0.22/1.41  #    Non-unit-clauses                  : 0
% 0.22/1.41  # Current number of unprocessed clauses: 0
% 0.22/1.41  # ...number of literals in the above   : 0
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 0
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 0
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 0
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.22/1.41  # Unit Clause-clause subsumption calls : 1
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 0
% 0.22/1.41  # BW rewrite match successes           : 0
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 1373
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.013 s
% 0.22/1.41  # System time              : 0.003 s
% 0.22/1.41  # Total time               : 0.016 s
% 0.22/1.41  # Maximum resident set size: 3128 pages
% 0.22/1.41  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.41  # Preprocessing time       : 0.016 s
% 0.22/1.41  
% 0.22/1.41  # Proof found!
% 0.22/1.41  # SZS status Theorem
% 0.22/1.41  # SZS output start CNFRefutation
% See solution above
% 0.22/1.41  # Proof object total steps             : 65
% 0.22/1.41  # Proof object clause steps            : 35
% 0.22/1.41  # Proof object formula steps           : 30
% 0.22/1.41  # Proof object conjectures             : 4
% 0.22/1.41  # Proof object clause conjectures      : 1
% 0.22/1.41  # Proof object formula conjectures     : 3
% 0.22/1.41  # Proof object initial clauses used    : 16
% 0.22/1.41  # Proof object initial formulas used   : 16
% 0.22/1.41  # Proof object generating inferences   : 17
% 0.22/1.41  # Proof object simplifying inferences  : 17
% 0.22/1.41  # Training examples: 0 positive, 0 negative
% 0.22/1.41  # Parsed axioms                        : 138
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.22/1.41  # Initial clauses                      : 138
% 0.22/1.41  # Removed in clause preprocessing      : 0
% 0.22/1.41  # Initial clauses in saturation        : 138
% 0.22/1.41  # Processed clauses                    : 294
% 0.22/1.41  # ...of these trivial                  : 4
% 0.22/1.41  # ...subsumed                          : 89
% 0.22/1.41  # ...remaining for further processing  : 201
% 0.22/1.41  # Other redundant clauses eliminated   : 0
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 2
% 0.22/1.41  # Backward-rewritten                   : 3
% 0.22/1.41  # Generated clauses                    : 517
% 0.22/1.41  # ...of the previous two non-trivial   : 430
% 0.22/1.41  # Contextual simplify-reflections      : 9
% 0.22/1.41  # Paramodulations                      : 517
% 0.22/1.41  # Factorizations                       : 0
% 0.22/1.41  # Equation resolutions                 : 0
% 0.22/1.41  # Current number of processed clauses  : 196
% 0.22/1.41  #    Positive orientable unit clauses  : 27
% 0.22/1.41  #    Positive unorientable unit clauses: 3
% 0.22/1.41  #    Negative unit clauses             : 93
% 0.22/1.41  #    Non-unit-clauses                  : 73
% 0.22/1.41  # Current number of unprocessed clauses: 269
% 0.22/1.41  # ...number of literals in the above   : 671
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 5
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 4900
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 4610
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 89
% 0.22/1.41  # Unit Clause-clause subsumption calls : 2551
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 63
% 0.22/1.41  # BW rewrite match successes           : 44
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 10283
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.026 s
% 0.22/1.41  # System time              : 0.005 s
% 0.22/1.41  # Total time               : 0.031 s
% 0.22/1.41  # Maximum resident set size: 3536 pages
% 0.22/23.41  eprover: CPU time limit exceeded, terminating
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
%------------------------------------------------------------------------------