TSTP Solution File: MGT060+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT060+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 : Sun Jul 17 22:10:16 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 : 46 ( 19 unt; 0 def)
% Number of atoms : 159 ( 43 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 168 ( 55 ~; 55 |; 35 &)
% ( 1 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 49 ( 1 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(assumption_17,axiom,
! [X1,X4] :
( organization(X1)
=> ( ( has_immunity(X1,X4)
=> hazard_of_mortality(X1,X4) = very_low )
& ( ~ has_immunity(X1,X4)
=> ( ( ( is_aligned(X1,X4)
& positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = low )
& ( ( ~ is_aligned(X1,X4)
& positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod1 )
& ( ( is_aligned(X1,X4)
& ~ positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod2 )
& ( ( ~ is_aligned(X1,X4)
& ~ positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = high ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_17) ).
fof(assumption_3,conjecture,
! [X1,X5,X4] :
( ( organization(X1)
& has_immunity(X1,X5)
& ~ has_immunity(X1,X4) )
=> greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_3) ).
fof(meaning_postulate_greater_transitive,axiom,
! [X1,X2,X3] :
( ( greater(X1,X2)
& greater(X2,X3) )
=> greater(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_transitive) ).
fof(assumption_18c,axiom,
greater(low,very_low),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_18c) ).
fof(assumption_18e,axiom,
greater(mod2,low),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_18e) ).
fof(assumption_18d,axiom,
greater(high,mod2),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_18d) ).
fof(assumption_18b,axiom,
greater(mod1,low),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',assumption_18b) ).
fof(c_0_7,plain,
! [X4,X1] :
( epred1_2(X1,X4)
<=> ( ( ( is_aligned(X1,X4)
& positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = low )
& ( ( ~ is_aligned(X1,X4)
& positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod1 )
& ( ( is_aligned(X1,X4)
& ~ positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod2 )
& ( ( ~ is_aligned(X1,X4)
& ~ positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = high ) ) ),
introduced(definition) ).
fof(c_0_8,axiom,
! [X1,X4] :
( organization(X1)
=> ( ( has_immunity(X1,X4)
=> hazard_of_mortality(X1,X4) = very_low )
& ( ~ has_immunity(X1,X4)
=> epred1_2(X1,X4) ) ) ),
inference(apply_def,[status(thm)],[assumption_17,c_0_7]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X5,X4] :
( ( organization(X1)
& has_immunity(X1,X5)
& ~ has_immunity(X1,X4) )
=> greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5)) ),
inference(assume_negation,[status(cth)],[assumption_3]) ).
fof(c_0_10,plain,
! [X4,X1] :
( epred1_2(X1,X4)
=> ( ( ( is_aligned(X1,X4)
& positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = low )
& ( ( ~ is_aligned(X1,X4)
& positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod1 )
& ( ( is_aligned(X1,X4)
& ~ positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod2 )
& ( ( ~ is_aligned(X1,X4)
& ~ positional_advantage(X1,X4) )
=> hazard_of_mortality(X1,X4) = high ) ) ),
inference(split_equiv,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X5,X6,X6] :
( ( ~ has_immunity(X5,X6)
| hazard_of_mortality(X5,X6) = very_low
| ~ organization(X5) )
& ( has_immunity(X5,X6)
| epred1_2(X5,X6)
| ~ organization(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])])]) ).
fof(c_0_12,negated_conjecture,
( organization(esk1_0)
& has_immunity(esk1_0,esk2_0)
& ~ has_immunity(esk1_0,esk3_0)
& ~ greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,plain,
! [X5,X6] :
( ( ~ is_aligned(X6,X5)
| ~ positional_advantage(X6,X5)
| hazard_of_mortality(X6,X5) = low
| ~ epred1_2(X6,X5) )
& ( is_aligned(X6,X5)
| ~ positional_advantage(X6,X5)
| hazard_of_mortality(X6,X5) = mod1
| ~ epred1_2(X6,X5) )
& ( ~ is_aligned(X6,X5)
| positional_advantage(X6,X5)
| hazard_of_mortality(X6,X5) = mod2
| ~ epred1_2(X6,X5) )
& ( is_aligned(X6,X5)
| positional_advantage(X6,X5)
| hazard_of_mortality(X6,X5) = high
| ~ epred1_2(X6,X5) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_14,plain,
( hazard_of_mortality(X1,X2) = very_low
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
has_immunity(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X4,X5,X6] :
( ~ greater(X4,X5)
| ~ greater(X5,X6)
| greater(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[meaning_postulate_greater_transitive])]) ).
cnf(c_0_18,plain,
( hazard_of_mortality(X1,X2) = low
| ~ epred1_2(X1,X2)
| ~ positional_advantage(X1,X2)
| ~ is_aligned(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( hazard_of_mortality(X1,X2) = mod2
| positional_advantage(X1,X2)
| ~ epred1_2(X1,X2)
| ~ is_aligned(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| ~ epred1_2(X1,X2)
| ~ positional_advantage(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( hazard_of_mortality(X1,X2) = high
| positional_advantage(X1,X2)
| is_aligned(X1,X2)
| ~ epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( epred1_2(X1,X2)
| has_immunity(X1,X2)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
hazard_of_mortality(esk1_0,esk2_0) = very_low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_25,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
greater(low,very_low),
inference(split_conjunct,[status(thm)],[assumption_18c]) ).
cnf(c_0_27,plain,
( hazard_of_mortality(X1,X2) = mod2
| hazard_of_mortality(X1,X2) = low
| ~ epred1_2(X1,X2)
| ~ is_aligned(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
( hazard_of_mortality(X1,X2) = high
| hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| ~ epred1_2(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
~ has_immunity(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,negated_conjecture,
( epred1_2(esk1_0,X1)
| has_immunity(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_31,plain,
greater(mod2,low),
inference(split_conjunct,[status(thm)],[assumption_18e]) ).
cnf(c_0_32,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),very_low),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
( greater(X1,very_low)
| ~ greater(X1,low) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( hazard_of_mortality(X1,X2) = mod1
| hazard_of_mortality(X1,X2) = high
| hazard_of_mortality(X1,X2) = low
| hazard_of_mortality(X1,X2) = mod2
| ~ epred1_2(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
epred1_2(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( greater(X1,low)
| ~ greater(X1,mod2) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_37,plain,
greater(high,mod2),
inference(split_conjunct,[status(thm)],[assumption_18d]) ).
cnf(c_0_38,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),low),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( hazard_of_mortality(esk1_0,esk3_0) = mod2
| hazard_of_mortality(esk1_0,esk3_0) = low
| hazard_of_mortality(esk1_0,esk3_0) = high
| hazard_of_mortality(esk1_0,esk3_0) = mod1 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
greater(high,low),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( hazard_of_mortality(esk1_0,esk3_0) = mod1
| hazard_of_mortality(esk1_0,esk3_0) = low
| hazard_of_mortality(esk1_0,esk3_0) = mod2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
( hazard_of_mortality(esk1_0,esk3_0) = low
| hazard_of_mortality(esk1_0,esk3_0) = mod1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_41]),c_0_31])]) ).
cnf(c_0_43,plain,
greater(mod1,low),
inference(split_conjunct,[status(thm)],[assumption_18b]) ).
cnf(c_0_44,negated_conjecture,
hazard_of_mortality(esk1_0,esk3_0) = low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_42]),c_0_43])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_44]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT060+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n019.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 : Thu Jun 9 08:04:10 EDT 2022
% 0.12/0.34 % 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.014 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 : 13
% 0.23/1.41 # Removed by relevancy pruning/SinE : 10
% 0.23/1.41 # Initial clauses : 6
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 6
% 0.23/1.41 # Processed clauses : 6
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 6
% 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 : 6
% 0.23/1.41 # Positive orientable unit clauses : 2
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 2
% 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) : 2
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 2
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 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 : 422
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.013 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.015 s
% 0.23/1.41 # Maximum resident set size: 2660 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.015 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 : 46
% 0.23/1.41 # Proof object clause steps : 31
% 0.23/1.41 # Proof object formula steps : 15
% 0.23/1.41 # Proof object conjectures : 17
% 0.23/1.41 # Proof object clause conjectures : 14
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 15
% 0.23/1.41 # Proof object initial formulas used : 7
% 0.23/1.41 # Proof object generating inferences : 14
% 0.23/1.41 # Proof object simplifying inferences : 12
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 13
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 26
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 26
% 0.23/1.41 # Processed clauses : 105
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 28
% 0.23/1.41 # ...remaining for further processing : 77
% 0.23/1.41 # Other redundant clauses eliminated : 2
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 2
% 0.23/1.41 # Backward-rewritten : 10
% 0.23/1.41 # Generated clauses : 270
% 0.23/1.41 # ...of the previous two non-trivial : 251
% 0.23/1.41 # Contextual simplify-reflections : 9
% 0.23/1.41 # Paramodulations : 254
% 0.23/1.41 # Factorizations : 14
% 0.23/1.41 # Equation resolutions : 2
% 0.23/1.41 # Current number of processed clauses : 63
% 0.23/1.41 # Positive orientable unit clauses : 13
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 9
% 0.23/1.41 # Non-unit-clauses : 41
% 0.23/1.41 # Current number of unprocessed clauses: 123
% 0.23/1.41 # ...number of literals in the above : 524
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 12
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 503
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 347
% 0.23/1.41 # Non-unit clause-clause subsumptions : 23
% 0.23/1.41 # Unit Clause-clause subsumption calls : 113
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 4
% 0.23/1.41 # BW rewrite match successes : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 3431
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.021 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.022 s
% 0.23/1.41 # Maximum resident set size: 3152 pages
% 0.25/23.41 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/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/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.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.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
%------------------------------------------------------------------------------