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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : REL023+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n015.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 : Mon Jul 18 19:19:26 EDT 2022

% Result   : Theorem 0.25s 1.44s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   76 (  76 unt;   0 def)
%            Number of atoms       :   76 (  75 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :  107 (   3 sgn  50   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
    ! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).

fof(converse_idempotence,axiom,
    ! [X1] : converse(converse(X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).

fof(composition_identity,axiom,
    ! [X1] : composition(X1,one) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).

fof(converse_cancellativity,axiom,
    ! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).

fof(maddux1_join_commutativity,axiom,
    ! [X1,X2] : join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).

fof(def_zero,axiom,
    ! [X1] : zero = meet(X1,complement(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_zero) ).

fof(maddux4_definiton_of_meet,axiom,
    ! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).

fof(def_top,axiom,
    ! [X1] : top = join(X1,complement(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_top) ).

fof(maddux3_a_kind_of_de_Morgan,axiom,
    ! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).

fof(maddux2_join_associativity,axiom,
    ! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).

fof(converse_additivity,axiom,
    ! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_additivity) ).

fof(goals,conjecture,
    ! [X1,X2,X3] : join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3))) = composition(X1,meet(X2,X3)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).

fof(composition_distributivity,axiom,
    ! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).

fof(c_0_13,plain,
    ! [X3,X4] : converse(composition(X3,X4)) = composition(converse(X4),converse(X3)),
    inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).

fof(c_0_14,plain,
    ! [X2] : converse(converse(X2)) = X2,
    inference(variable_rename,[status(thm)],[converse_idempotence]) ).

cnf(c_0_15,plain,
    converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_16,plain,
    converse(converse(X1)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_17,plain,
    ! [X2] : composition(X2,one) = X2,
    inference(variable_rename,[status(thm)],[composition_identity]) ).

cnf(c_0_18,plain,
    converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    composition(X1,one) = X1,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_20,plain,
    ! [X3,X4] : join(composition(converse(X3),complement(composition(X3,X4))),complement(X4)) = complement(X4),
    inference(variable_rename,[status(thm)],[converse_cancellativity]) ).

fof(c_0_21,plain,
    ! [X3,X4] : join(X3,X4) = join(X4,X3),
    inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).

cnf(c_0_22,plain,
    composition(converse(one),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).

fof(c_0_23,plain,
    ! [X2] : zero = meet(X2,complement(X2)),
    inference(variable_rename,[status(thm)],[def_zero]) ).

fof(c_0_24,plain,
    ! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
    inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).

cnf(c_0_25,plain,
    join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

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

cnf(c_0_27,plain,
    converse(one) = one,
    inference(spm,[status(thm)],[c_0_19,c_0_22]) ).

cnf(c_0_28,plain,
    zero = meet(X1,complement(X1)),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_29,plain,
    meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

fof(c_0_30,plain,
    ! [X2] : top = join(X2,complement(X2)),
    inference(variable_rename,[status(thm)],[def_top]) ).

cnf(c_0_31,plain,
    join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
    inference(rw,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_32,plain,
    composition(one,X1) = X1,
    inference(rw,[status(thm)],[c_0_22,c_0_27]) ).

cnf(c_0_33,plain,
    zero = complement(join(complement(X1),complement(complement(X1)))),
    inference(rw,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,plain,
    top = join(X1,complement(X1)),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

fof(c_0_35,plain,
    ! [X3,X4] : X3 = join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),
    inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).

fof(c_0_36,plain,
    ! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
    inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).

cnf(c_0_37,plain,
    join(complement(X1),complement(X1)) = complement(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_32]) ).

cnf(c_0_38,plain,
    complement(top) = zero,
    inference(rw,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_39,plain,
    X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_40,plain,
    join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_41,plain,
    join(zero,zero) = zero,
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
    inference(rw,[status(thm)],[c_0_39,c_0_26]) ).

cnf(c_0_43,plain,
    join(zero,join(zero,X1)) = join(zero,X1),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_44,plain,
    join(zero,complement(complement(X1))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_34]),c_0_38]),c_0_37]),c_0_26]) ).

fof(c_0_45,plain,
    ! [X3,X4] : converse(join(X3,X4)) = join(converse(X3),converse(X4)),
    inference(variable_rename,[status(thm)],[converse_additivity]) ).

cnf(c_0_46,plain,
    join(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_47,plain,
    converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_48,plain,
    complement(complement(X1)) = X1,
    inference(rw,[status(thm)],[c_0_44,c_0_46]) ).

cnf(c_0_49,plain,
    join(converse(X1),X2) = converse(join(X1,converse(X2))),
    inference(spm,[status(thm)],[c_0_47,c_0_16]) ).

cnf(c_0_50,plain,
    join(X1,join(X2,complement(join(X1,X2)))) = top,
    inference(spm,[status(thm)],[c_0_34,c_0_40]) ).

cnf(c_0_51,plain,
    join(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_37,c_0_48]) ).

cnf(c_0_52,plain,
    converse(join(X1,converse(complement(converse(X1))))) = top,
    inference(spm,[status(thm)],[c_0_34,c_0_49]) ).

cnf(c_0_53,plain,
    join(X1,top) = top,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_34]) ).

cnf(c_0_54,plain,
    join(X1,converse(complement(converse(X1)))) = converse(top),
    inference(spm,[status(thm)],[c_0_16,c_0_52]) ).

cnf(c_0_55,plain,
    join(top,X1) = top,
    inference(spm,[status(thm)],[c_0_26,c_0_53]) ).

cnf(c_0_56,plain,
    converse(top) = top,
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_57,plain,
    join(X1,converse(complement(converse(X1)))) = top,
    inference(rw,[status(thm)],[c_0_54,c_0_56]) ).

cnf(c_0_58,plain,
    complement(join(complement(X1),complement(converse(complement(converse(complement(X1))))))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_57]),c_0_38]),c_0_46]) ).

cnf(c_0_59,plain,
    complement(join(X1,complement(converse(complement(converse(X1)))))) = complement(X1),
    inference(spm,[status(thm)],[c_0_58,c_0_48]) ).

fof(c_0_60,negated_conjecture,
    ~ ! [X1,X2,X3] : join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3))) = composition(X1,meet(X2,X3)),
    inference(assume_negation,[status(cth)],[goals]) ).

cnf(c_0_61,plain,
    join(X1,complement(converse(complement(converse(X1))))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_59]),c_0_42]) ).

fof(c_0_62,negated_conjecture,
    join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(esk1_0,meet(esk2_0,esk3_0))) != composition(esk1_0,meet(esk2_0,esk3_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])])]) ).

cnf(c_0_63,plain,
    converse(join(X1,converse(complement(converse(complement(X1)))))) = converse(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_61]),c_0_16]) ).

cnf(c_0_64,negated_conjecture,
    join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(esk1_0,meet(esk2_0,esk3_0))) != composition(esk1_0,meet(esk2_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

fof(c_0_65,plain,
    ! [X4,X5,X6] : composition(join(X4,X5),X6) = join(composition(X4,X6),composition(X5,X6)),
    inference(variable_rename,[status(thm)],[composition_distributivity]) ).

cnf(c_0_66,plain,
    join(X1,converse(complement(converse(complement(X1))))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_63]),c_0_16]) ).

cnf(c_0_67,negated_conjecture,
    join(composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk2_0),complement(esk3_0)))),composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0))))) != composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_29]),c_0_29]),c_0_29]),c_0_29]) ).

cnf(c_0_68,plain,
    composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_65]) ).

cnf(c_0_69,plain,
    join(complement(X1),converse(complement(converse(X1)))) = complement(X1),
    inference(spm,[status(thm)],[c_0_66,c_0_48]) ).

cnf(c_0_70,negated_conjecture,
    composition(join(esk1_0,complement(join(complement(esk1_0),complement(converse(esk2_0))))),complement(join(complement(esk2_0),complement(esk3_0)))) != composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_26]),c_0_68]) ).

cnf(c_0_71,plain,
    complement(converse(X1)) = converse(complement(X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_16]),c_0_26]),c_0_49]),c_0_69]) ).

cnf(c_0_72,plain,
    join(X1,join(X1,X2)) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_40,c_0_51]) ).

cnf(c_0_73,negated_conjecture,
    composition(join(esk1_0,complement(join(complement(esk1_0),converse(complement(esk2_0))))),complement(join(complement(esk2_0),complement(esk3_0)))) != composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))),
    inference(rw,[status(thm)],[c_0_70,c_0_71]) ).

cnf(c_0_74,plain,
    join(X1,complement(join(complement(X1),X2))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_42]),c_0_26]) ).

cnf(c_0_75,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : REL023+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14  % Command  : run_ET %s %d
% 0.14/0.35  % Computer : n015.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Fri Jul  8 09:24:05 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.25/1.44  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.25/1.44  # Preprocessing time       : 0.014 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             : 76
% 0.25/1.44  # Proof object clause steps            : 49
% 0.25/1.44  # Proof object formula steps           : 27
% 0.25/1.44  # Proof object conjectures             : 8
% 0.25/1.44  # Proof object clause conjectures      : 5
% 0.25/1.44  # Proof object formula conjectures     : 3
% 0.25/1.44  # Proof object initial clauses used    : 13
% 0.25/1.44  # Proof object initial formulas used   : 13
% 0.25/1.44  # Proof object generating inferences   : 25
% 0.25/1.44  # Proof object simplifying inferences  : 32
% 0.25/1.44  # Training examples: 0 positive, 0 negative
% 0.25/1.44  # Parsed axioms                        : 14
% 0.25/1.44  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.44  # Initial clauses                      : 14
% 0.25/1.44  # Removed in clause preprocessing      : 1
% 0.25/1.44  # Initial clauses in saturation        : 13
% 0.25/1.44  # Processed clauses                    : 211
% 0.25/1.44  # ...of these trivial                  : 40
% 0.25/1.44  # ...subsumed                          : 71
% 0.25/1.44  # ...remaining for further processing  : 100
% 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                    : 0
% 0.25/1.44  # Backward-rewritten                   : 35
% 0.25/1.44  # Generated clauses                    : 3301
% 0.25/1.44  # ...of the previous two non-trivial   : 2708
% 0.25/1.44  # Contextual simplify-reflections      : 0
% 0.25/1.44  # Paramodulations                      : 3301
% 0.25/1.44  # Factorizations                       : 0
% 0.25/1.44  # Equation resolutions                 : 0
% 0.25/1.44  # Current number of processed clauses  : 65
% 0.25/1.44  #    Positive orientable unit clauses  : 45
% 0.25/1.44  #    Positive unorientable unit clauses: 20
% 0.25/1.44  #    Negative unit clauses             : 0
% 0.25/1.44  #    Non-unit-clauses                  : 0
% 0.25/1.44  # Current number of unprocessed clauses: 1814
% 0.25/1.44  # ...number of literals in the above   : 1814
% 0.25/1.44  # Current number of archived formulas  : 0
% 0.25/1.44  # Current number of archived clauses   : 36
% 0.25/1.44  # Clause-clause subsumption calls (NU) : 0
% 0.25/1.44  # Rec. Clause-clause subsumption calls : 0
% 0.25/1.44  # Non-unit clause-clause subsumptions  : 0
% 0.25/1.44  # Unit Clause-clause subsumption calls : 36
% 0.25/1.44  # Rewrite failures with RHS unbound    : 2
% 0.25/1.44  # BW rewrite match attempts            : 254
% 0.25/1.44  # BW rewrite match successes           : 146
% 0.25/1.44  # Condensation attempts                : 0
% 0.25/1.44  # Condensation successes               : 0
% 0.25/1.44  # Termbank termtop insertions          : 41203
% 0.25/1.44  
% 0.25/1.44  # -------------------------------------------------
% 0.25/1.44  # User time                : 0.054 s
% 0.25/1.44  # System time              : 0.003 s
% 0.25/1.44  # Total time               : 0.057 s
% 0.25/1.44  # Maximum resident set size: 5448 pages
% 0.25/23.43  eprover: CPU time limit exceeded, terminating
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------