TSTP Solution File: GRP776+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRP776+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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 : Sat Jul 16 09:03:38 EDT 2022
% Result : Theorem 0.20s 1.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 66 ( 20 unt; 0 def)
% Number of atoms : 129 ( 48 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 115 ( 52 ~; 46 |; 6 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 3 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos05,axiom,
! [X2] :
( g(X2)
=> product(eh,X2) = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos05) ).
fof(sos07,axiom,
! [X2] :
( g(X2)
=> product(X2,inv(X2)) = eh ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos07) ).
fof(sos03,axiom,
g(eh),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos03) ).
fof(sos02,axiom,
! [X2] :
( g(X2)
=> g(inv(X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos02) ).
fof(sos10,axiom,
! [X1,X2] :
( h(X2)
=> h(opp(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos10) ).
fof(sos17,axiom,
! [X2] :
( g(X2)
=> h(f(X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos17) ).
fof(sos18,axiom,
! [X1,X2] : f(product(X2,X1)) = sum(f(X2),f(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos18) ).
fof(sos15,axiom,
! [X2] :
( h(X2)
=> sum(X2,opp(X2)) = eg ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos15) ).
fof(sos12,axiom,
! [X3,X1,X2] :
( ( h(X2)
& h(X1)
& h(X3) )
=> sum(sum(X2,X1),X3) = sum(X2,sum(X1,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos12) ).
fof(sos11,axiom,
h(eg),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos11) ).
fof(sos09,axiom,
! [X1,X2] :
( ( h(X2)
& h(X1) )
=> h(sum(X2,X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos09) ).
fof(sos14,axiom,
! [X2] :
( h(X2)
=> sum(X2,eg) = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos14) ).
fof(sos16,axiom,
! [X2] :
( h(X2)
=> sum(opp(X2),X2) = eg ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos16) ).
fof(goals,conjecture,
! [X4] :
( f(eh) = eg
& ( ~ g(X4)
| f(inv(X4)) = opp(f(X4)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(sos13,axiom,
! [X2] :
( h(X2)
=> sum(eg,X2) = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos13) ).
fof(c_0_15,plain,
! [X3] :
( ~ g(X3)
| product(eh,X3) = X3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos05])]) ).
fof(c_0_16,plain,
! [X3] :
( ~ g(X3)
| product(X3,inv(X3)) = eh ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos07])]) ).
cnf(c_0_17,plain,
( product(eh,X1) = X1
| ~ g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
( product(X1,inv(X1)) = eh
| ~ g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
g(eh),
inference(split_conjunct,[status(thm)],[sos03]) ).
fof(c_0_20,plain,
! [X3] :
( ~ g(X3)
| g(inv(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos02])]) ).
cnf(c_0_21,plain,
( inv(eh) = eh
| ~ g(inv(eh)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( g(inv(X1))
| ~ g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X4,X3] :
( ~ h(X4)
| h(opp(X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos10])])])]) ).
fof(c_0_24,plain,
! [X3] :
( ~ g(X3)
| h(f(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos17])]) ).
fof(c_0_25,plain,
! [X3,X4] : f(product(X4,X3)) = sum(f(X4),f(X3)),
inference(variable_rename,[status(thm)],[sos18]) ).
cnf(c_0_26,plain,
inv(eh) = eh,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_19])]) ).
fof(c_0_27,plain,
! [X3] :
( ~ h(X3)
| sum(X3,opp(X3)) = eg ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos15])]) ).
fof(c_0_28,plain,
! [X4,X5,X6] :
( ~ h(X6)
| ~ h(X5)
| ~ h(X4)
| sum(sum(X6,X5),X4) = sum(X6,sum(X5,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos12])]) ).
cnf(c_0_29,plain,
( h(opp(X1))
| ~ h(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
h(eg),
inference(split_conjunct,[status(thm)],[sos11]) ).
fof(c_0_31,plain,
! [X3,X4] :
( ~ h(X4)
| ~ h(X3)
| h(sum(X4,X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos09])]) ).
cnf(c_0_32,plain,
( h(f(X1))
| ~ g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
f(product(X1,X2)) = sum(f(X1),f(X2)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
product(eh,eh) = eh,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_26]),c_0_19])]) ).
cnf(c_0_35,plain,
( sum(X1,opp(X1)) = eg
| ~ h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( sum(sum(X1,X2),X3) = sum(X1,sum(X2,X3))
| ~ h(X3)
| ~ h(X2)
| ~ h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
h(opp(X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( h(sum(X1,X2))
| ~ h(X2)
| ~ h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
( h(sum(f(X1),f(X2)))
| ~ g(product(X1,X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
sum(f(eh),f(eh)) = f(eh),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( sum(X1,sum(X2,opp(sum(X1,X2)))) = eg
| ~ h(X2)
| ~ h(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_42,plain,
h(f(eh)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34]),c_0_19])]) ).
fof(c_0_43,plain,
! [X3] :
( ~ h(X3)
| sum(X3,eg) = X3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos14])]) ).
cnf(c_0_44,plain,
sum(f(eh),sum(f(eh),opp(f(eh)))) = eg,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_40]),c_0_42])]) ).
fof(c_0_45,plain,
! [X3] :
( ~ h(X3)
| sum(opp(X3),X3) = eg ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos16])]) ).
cnf(c_0_46,plain,
( sum(X1,eg) = X1
| ~ h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_47,plain,
sum(f(eh),eg) = eg,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_35]),c_0_42])]) ).
fof(c_0_48,negated_conjecture,
~ ! [X4] :
( f(eh) = eg
& ( ~ g(X4)
| f(inv(X4)) = opp(f(X4)) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_49,plain,
( sum(opp(X1),X1) = eg
| ~ h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,plain,
( sum(f(X1),f(inv(X1))) = f(eh)
| ~ g(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_18]) ).
cnf(c_0_51,plain,
f(eh) = eg,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_42])]) ).
fof(c_0_52,negated_conjecture,
( ( g(esk1_0)
| f(eh) != eg )
& ( f(inv(esk1_0)) != opp(f(esk1_0))
| f(eh) != eg ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_48])])])])])]) ).
cnf(c_0_53,plain,
( sum(opp(X1),sum(X1,X2)) = sum(eg,X2)
| ~ h(X2)
| ~ h(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_49]),c_0_37])]) ).
cnf(c_0_54,plain,
( sum(f(X1),f(inv(X1))) = eg
| ~ g(X1) ),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( f(eh) != eg
| f(inv(esk1_0)) != opp(f(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_56,plain,
( sum(opp(f(X1)),eg) = sum(eg,f(inv(X1)))
| ~ h(f(inv(X1)))
| ~ g(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_32]) ).
cnf(c_0_57,negated_conjecture,
( g(esk1_0)
| f(eh) != eg ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
fof(c_0_58,plain,
! [X3] :
( ~ h(X3)
| sum(eg,X3) = X3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos13])]) ).
cnf(c_0_59,negated_conjecture,
opp(f(esk1_0)) != f(inv(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_51])]) ).
cnf(c_0_60,plain,
( opp(f(X1)) = sum(eg,f(inv(X1)))
| ~ h(f(inv(X1)))
| ~ g(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_56]),c_0_37])]) ).
cnf(c_0_61,negated_conjecture,
g(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_51])]) ).
cnf(c_0_62,plain,
( sum(eg,X1) = X1
| ~ h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_63,negated_conjecture,
~ h(f(inv(esk1_0))),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]),c_0_62]) ).
cnf(c_0_64,negated_conjecture,
~ g(inv(esk1_0)),
inference(spm,[status(thm)],[c_0_63,c_0_32]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_22]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP776+1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 13 06:36:10 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.20/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.40 # Preprocessing time : 0.016 s
% 0.20/1.40
% 0.20/1.40 # Proof found!
% 0.20/1.40 # SZS status Theorem
% 0.20/1.40 # SZS output start CNFRefutation
% See solution above
% 0.20/1.40 # Proof object total steps : 66
% 0.20/1.40 # Proof object clause steps : 37
% 0.20/1.40 # Proof object formula steps : 29
% 0.20/1.40 # Proof object conjectures : 10
% 0.20/1.40 # Proof object clause conjectures : 7
% 0.20/1.40 # Proof object formula conjectures : 3
% 0.20/1.40 # Proof object initial clauses used : 16
% 0.20/1.40 # Proof object initial formulas used : 15
% 0.20/1.40 # Proof object generating inferences : 18
% 0.20/1.40 # Proof object simplifying inferences : 33
% 0.20/1.40 # Training examples: 0 positive, 0 negative
% 0.20/1.40 # Parsed axioms : 19
% 0.20/1.40 # Removed by relevancy pruning/SinE : 0
% 0.20/1.40 # Initial clauses : 20
% 0.20/1.40 # Removed in clause preprocessing : 0
% 0.20/1.40 # Initial clauses in saturation : 20
% 0.20/1.40 # Processed clauses : 873
% 0.20/1.40 # ...of these trivial : 7
% 0.20/1.40 # ...subsumed : 629
% 0.20/1.40 # ...remaining for further processing : 237
% 0.20/1.40 # Other redundant clauses eliminated : 0
% 0.20/1.40 # Clauses deleted for lack of memory : 0
% 0.20/1.40 # Backward-subsumed : 4
% 0.20/1.40 # Backward-rewritten : 14
% 0.20/1.40 # Generated clauses : 10436
% 0.20/1.40 # ...of the previous two non-trivial : 9086
% 0.20/1.40 # Contextual simplify-reflections : 298
% 0.20/1.40 # Paramodulations : 10436
% 0.20/1.40 # Factorizations : 0
% 0.20/1.40 # Equation resolutions : 0
% 0.20/1.40 # Current number of processed clauses : 219
% 0.20/1.40 # Positive orientable unit clauses : 10
% 0.20/1.40 # Positive unorientable unit clauses: 0
% 0.20/1.40 # Negative unit clauses : 3
% 0.20/1.40 # Non-unit-clauses : 206
% 0.20/1.40 # Current number of unprocessed clauses: 8193
% 0.20/1.40 # ...number of literals in the above : 28487
% 0.20/1.40 # Current number of archived formulas : 0
% 0.20/1.40 # Current number of archived clauses : 18
% 0.20/1.40 # Clause-clause subsumption calls (NU) : 14483
% 0.20/1.40 # Rec. Clause-clause subsumption calls : 13649
% 0.20/1.40 # Non-unit clause-clause subsumptions : 931
% 0.20/1.40 # Unit Clause-clause subsumption calls : 5
% 0.20/1.40 # Rewrite failures with RHS unbound : 0
% 0.20/1.40 # BW rewrite match attempts : 4
% 0.20/1.40 # BW rewrite match successes : 4
% 0.20/1.40 # Condensation attempts : 0
% 0.20/1.40 # Condensation successes : 0
% 0.20/1.40 # Termbank termtop insertions : 183083
% 0.20/1.40
% 0.20/1.40 # -------------------------------------------------
% 0.20/1.40 # User time : 0.167 s
% 0.20/1.40 # System time : 0.006 s
% 0.20/1.40 # Total time : 0.173 s
% 0.20/1.40 # Maximum resident set size: 9912 pages
% 0.20/23.40 eprover: CPU time limit exceeded, terminating
% 0.20/23.42 eprover: CPU time limit exceeded, terminating
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------