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

View Problem - Process Solution

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

% Computer : n022.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:45 EDT 2022

% Result   : Theorem 0.25s 1.44s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   73 (  31 unt;   0 def)
%            Number of atoms       :  131 (  19 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  107 (  49   ~;  46   |;   2   &)
%                                         (   0 <=>;  10  =>;   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    :   14 (  14 usr;   4 con; 0-2 aty)
%            Number of variables   :  104 (   7 sgn  50   !;   0   ?)

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

fof(ax50,axiom,
    ! [X11,X12] : constr_xor(X11,X12) = constr_xor(X12,X11),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax50) ).

fof(ax51,axiom,
    ! [X13,X14,X15] : constr_xor(X13,constr_xor(X14,X15)) = constr_xor(constr_xor(X13,X14),X15),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax51) ).

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

fof(ax52,axiom,
    ! [X16,X17] :
      ( ( pred_attacker(X16)
        & pred_attacker(X17) )
     => pred_attacker(constr_xor(X16,X17)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax52) ).

fof(ax72,axiom,
    ! [X36,X37] :
      ( pred_attacker(tuple_B_out_1(X36,X37))
     => pred_attacker(X37) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax72) ).

fof(ax82,axiom,
    pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_concat(name_objective,constr_C(name_objective)),constr_RC4(name_v,name_Kab)))),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax82) ).

fof(ax58,axiom,
    ! [X23,X24] :
      ( pred_attacker(tuple_enc_oracle_out_2(X23,X24))
     => pred_attacker(X24) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax58) ).

fof(ax81,axiom,
    ! [X50] :
      ( pred_attacker(tuple_enc_oracle_in_1(X50))
     => pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X50,constr_C(X50)),constr_RC4(name_v,name_Kab)))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax81) ).

fof(ax61,axiom,
    ! [X27,X28] :
      ( ( pred_attacker(X27)
        & pred_attacker(X28) )
     => pred_attacker(constr_concat(X27,X28)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax61) ).

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

fof(ax74,axiom,
    ! [X40,X41] :
      ( pred_attacker(tuple_2(X40,X41))
     => pred_attacker(X40) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax74) ).

fof(ax45,axiom,
    ! [X1,X2] : constr_split(constr_concat(X1,X2)) = tuple_2(X1,X2),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax45) ).

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

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

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

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

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

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

fof(c_0_19,plain,
    ! [X13,X14] : constr_xor(X13,X14) = constr_xor(X14,X13),
    inference(variable_rename,[status(thm)],[ax50]) ).

fof(c_0_20,plain,
    ! [X16,X17,X18] : constr_xor(X16,constr_xor(X17,X18)) = constr_xor(constr_xor(X16,X17),X18),
    inference(variable_rename,[status(thm)],[ax51]) ).

fof(c_0_21,plain,
    ! [X10] : constr_xor(X10,X10) = constr_ZERO,
    inference(variable_rename,[status(thm)],[ax48]) ).

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

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

fof(c_0_24,plain,
    ! [X18,X19] :
      ( ~ pred_attacker(X18)
      | ~ pred_attacker(X19)
      | pred_attacker(constr_xor(X18,X19)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax52])]) ).

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

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

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

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

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

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

cnf(c_0_31,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(constr_xor(X1,X2))
    | ~ pred_attacker(X2) ),
    inference(spm,[status(thm)],[c_0_30,c_0_23]) ).

cnf(c_0_32,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_28,c_0_25]) ).

cnf(c_0_33,plain,
    constr_xor(X1,constr_xor(X2,constr_xor(X1,X2))) = constr_ZERO,
    inference(spm,[status(thm)],[c_0_26,c_0_25]) ).

fof(c_0_34,plain,
    ! [X38,X39] :
      ( ~ pred_attacker(tuple_B_out_1(X38,X39))
      | pred_attacker(X39) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax72])]) ).

cnf(c_0_35,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(constr_xor(X2,X3))
    | ~ pred_attacker(constr_xor(X1,X2))
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,plain,
    constr_xor(X1,constr_xor(X2,X1)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_33]),c_0_22]) ).

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

cnf(c_0_38,plain,
    pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_concat(name_objective,constr_C(name_objective)),constr_RC4(name_v,name_Kab)))),
    inference(split_conjunct,[status(thm)],[ax82]) ).

fof(c_0_39,plain,
    ! [X25,X26] :
      ( ~ pred_attacker(tuple_enc_oracle_out_2(X25,X26))
      | pred_attacker(X26) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])]) ).

fof(c_0_40,plain,
    ! [X51] :
      ( ~ pred_attacker(tuple_enc_oracle_in_1(X51))
      | pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X51,constr_C(X51)),constr_RC4(name_v,name_Kab)))) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])]) ).

cnf(c_0_41,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(constr_xor(X1,X2))
    | ~ pred_attacker(constr_xor(X3,X2))
    | ~ pred_attacker(X3) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_42,plain,
    pred_attacker(constr_xor(constr_concat(name_objective,constr_C(name_objective)),constr_RC4(name_v,name_Kab))),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_43,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_enc_oracle_out_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_44,plain,
    ( pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X1,constr_C(X1)),constr_RC4(name_v,name_Kab))))
    | ~ pred_attacker(tuple_enc_oracle_in_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_45,plain,
    ( pred_attacker(constr_concat(name_objective,constr_C(name_objective)))
    | ~ pred_attacker(constr_xor(X1,constr_RC4(name_v,name_Kab)))
    | ~ pred_attacker(X1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_46,plain,
    ( pred_attacker(constr_xor(constr_concat(X1,constr_C(X1)),constr_RC4(name_v,name_Kab)))
    | ~ pred_attacker(tuple_enc_oracle_in_1(X1)) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

fof(c_0_47,plain,
    ! [X29,X30] :
      ( ~ pred_attacker(X29)
      | ~ pred_attacker(X30)
      | pred_attacker(constr_concat(X29,X30)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax61])]) ).

fof(c_0_48,plain,
    ! [X27] :
      ( ~ pred_attacker(tuple_enc_oracle_in_1(X27))
      | pred_attacker(X27) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax60])]) ).

fof(c_0_49,plain,
    ! [X42,X43] :
      ( ~ pred_attacker(tuple_2(X42,X43))
      | pred_attacker(X42) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax74])])])]) ).

fof(c_0_50,plain,
    ! [X3,X4] : constr_split(constr_concat(X3,X4)) = tuple_2(X3,X4),
    inference(variable_rename,[status(thm)],[ax45]) ).

cnf(c_0_51,plain,
    ( pred_attacker(constr_concat(name_objective,constr_C(name_objective)))
    | ~ pred_attacker(constr_concat(X1,constr_C(X1)))
    | ~ pred_attacker(tuple_enc_oracle_in_1(X1)) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

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

cnf(c_0_53,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_enc_oracle_in_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_48]) ).

fof(c_0_54,plain,
    ! [X26] :
      ( ~ pred_attacker(X26)
      | pred_attacker(tuple_enc_oracle_in_1(X26)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax59])]) ).

fof(c_0_55,plain,
    ! [X32] :
      ( ~ pred_attacker(X32)
      | pred_attacker(constr_C(X32)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax69])]) ).

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

cnf(c_0_57,plain,
    constr_split(constr_concat(X1,X2)) = tuple_2(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_50]) ).

fof(c_0_58,plain,
    ! [X19] :
      ( ~ pred_attacker(X19)
      | pred_attacker(constr_split(X19)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])]) ).

cnf(c_0_59,plain,
    ( pred_attacker(constr_concat(name_objective,constr_C(name_objective)))
    | ~ pred_attacker(tuple_enc_oracle_in_1(X1))
    | ~ pred_attacker(constr_C(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).

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

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

fof(c_0_62,plain,
    ! [X50] : pred_attacker(name_new0x2Dname(X50)),
    inference(variable_rename,[status(thm)],[ax80]) ).

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

cnf(c_0_64,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(constr_split(constr_concat(X1,X2))) ),
    inference(rw,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_65,plain,
    ( pred_attacker(constr_split(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_58]) ).

cnf(c_0_66,plain,
    ( pred_attacker(constr_concat(name_objective,constr_C(name_objective)))
    | ~ pred_attacker(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).

cnf(c_0_67,plain,
    pred_attacker(name_new0x2Dname(X1)),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

fof(c_0_68,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(fof_simplification,[status(thm)],[c_0_63]) ).

cnf(c_0_69,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(constr_concat(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_70,plain,
    pred_attacker(constr_concat(name_objective,constr_C(name_objective))),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_71,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(split_conjunct,[status(thm)],[c_0_68]) ).

cnf(c_0_72,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWW957+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n022.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 22:44:20 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.25/1.44  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.25/1.44  # Preprocessing time       : 0.018 s
% 0.25/1.44  
% 0.25/1.44  # Proof found!
% 0.25/1.44  # SZS status Theorem
% 0.25/1.44  # SZS output start CNFRefutation
% See solution above
% 0.25/1.44  # Proof object total steps             : 73
% 0.25/1.44  # Proof object clause steps            : 37
% 0.25/1.44  # Proof object formula steps           : 36
% 0.25/1.44  # Proof object conjectures             : 4
% 0.25/1.44  # Proof object clause conjectures      : 1
% 0.25/1.44  # Proof object formula conjectures     : 3
% 0.25/1.44  # Proof object initial clauses used    : 18
% 0.25/1.44  # Proof object initial formulas used   : 18
% 0.25/1.44  # Proof object generating inferences   : 18
% 0.25/1.44  # Proof object simplifying inferences  : 6
% 0.25/1.44  # Training examples: 0 positive, 0 negative
% 0.25/1.44  # Parsed axioms                        : 84
% 0.25/1.44  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.44  # Initial clauses                      : 84
% 0.25/1.44  # Removed in clause preprocessing      : 1
% 0.25/1.44  # Initial clauses in saturation        : 83
% 0.25/1.44  # Processed clauses                    : 623
% 0.25/1.44  # ...of these trivial                  : 64
% 0.25/1.44  # ...subsumed                          : 378
% 0.25/1.44  # ...remaining for further processing  : 181
% 0.25/1.44  # Other redundant clauses eliminated   : 0
% 0.25/1.44  # Clauses deleted for lack of memory   : 0
% 0.25/1.44  # Backward-subsumed                    : 5
% 0.25/1.44  # Backward-rewritten                   : 9
% 0.25/1.44  # Generated clauses                    : 4671
% 0.25/1.44  # ...of the previous two non-trivial   : 4165
% 0.25/1.44  # Contextual simplify-reflections      : 31
% 0.25/1.44  # Paramodulations                      : 4671
% 0.25/1.44  # Factorizations                       : 0
% 0.25/1.44  # Equation resolutions                 : 0
% 0.25/1.44  # Current number of processed clauses  : 167
% 0.25/1.44  #    Positive orientable unit clauses  : 37
% 0.25/1.44  #    Positive unorientable unit clauses: 10
% 0.25/1.44  #    Negative unit clauses             : 47
% 0.25/1.44  #    Non-unit-clauses                  : 73
% 0.25/1.44  # Current number of unprocessed clauses: 3050
% 0.25/1.44  # ...number of literals in the above   : 6832
% 0.25/1.44  # Current number of archived formulas  : 0
% 0.25/1.44  # Current number of archived clauses   : 15
% 0.25/1.44  # Clause-clause subsumption calls (NU) : 15388
% 0.25/1.44  # Rec. Clause-clause subsumption calls : 12640
% 0.25/1.44  # Non-unit clause-clause subsumptions  : 305
% 0.25/1.44  # Unit Clause-clause subsumption calls : 401
% 0.25/1.44  # Rewrite failures with RHS unbound    : 122
% 0.25/1.44  # BW rewrite match attempts            : 201
% 0.25/1.44  # BW rewrite match successes           : 144
% 0.25/1.44  # Condensation attempts                : 0
% 0.25/1.44  # Condensation successes               : 0
% 0.25/1.44  # Termbank termtop insertions          : 73082
% 0.25/1.44  
% 0.25/1.44  # -------------------------------------------------
% 0.25/1.44  # User time                : 0.088 s
% 0.25/1.44  # System time              : 0.006 s
% 0.25/1.44  # Total time               : 0.094 s
% 0.25/1.44  # Maximum resident set size: 6416 pages
% 0.25/23.44  eprover: CPU time limit exceeded, terminating
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: CPU time limit exceeded, terminating
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50  eprover: No such file or directory
% 0.25/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.51  eprover: No such file or directory
% 0.25/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51  eprover: No such file or directory
% 0.25/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51  eprover: No such file or directory
% 0.25/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.52  eprover: No such file or directory
% 0.25/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.52  eprover: No such file or directory
% 0.25/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.52  eprover: No such file or directory
% 0.25/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.52  eprover: No such file or directory
% 0.25/23.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.53  eprover: No such file or directory
% 0.25/23.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.53  eprover: No such file or directory
% 0.25/23.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.53  eprover: No such file or directory
%------------------------------------------------------------------------------