TSTP Solution File: LCL894+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL894+1 : TPTP v8.1.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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 10:18:30 EDT 2022
% Result : Theorem 0.48s 72.67s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 62 ( 28 unt; 0 def)
% Number of atoms : 116 ( 17 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 93 ( 39 ~; 41 |; 7 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 89 ( 7 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals_13,conjecture,
( ( '>='(c,a)
& '>='(c,b) )
<=> '>='(c,'+'(a,'==>'(a,b))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',goals_13) ).
fof(sos_05,axiom,
! [X4,X5,X6] :
( ( '>='(X4,X5)
& '>='(X5,X6) )
=> '>='(X4,X6) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_05) ).
fof(sos_07,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_07) ).
fof(sos_12,axiom,
! [X1,X2] : '+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_12) ).
fof(sos_06,axiom,
! [X7,X8] :
( ( '>='(X7,X8)
& '>='(X8,X7) )
=> X7 = X8 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_06) ).
fof(sos_08,axiom,
! [X1] : '>='(X1,'0'),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_08) ).
fof(sos_04,axiom,
! [X1] : '>='(X1,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_04) ).
fof(sos_03,axiom,
! [X1] : '+'(X1,'0') = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_03) ).
fof(sos_02,axiom,
! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_02) ).
fof(sos_09,axiom,
! [X12,X13,X14] :
( '>='(X12,X13)
=> '>='('+'(X12,X14),'+'(X13,X14)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_09) ).
fof(c_0_10,negated_conjecture,
~ ( ( '>='(c,a)
& '>='(c,b) )
<=> '>='(c,'+'(a,'==>'(a,b))) ),
inference(assume_negation,[status(cth)],[goals_13]) ).
fof(c_0_11,plain,
! [X7,X8,X9] :
( ~ '>='(X7,X8)
| ~ '>='(X8,X9)
| '>='(X7,X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])]) ).
fof(c_0_12,plain,
! [X12,X13,X14,X12,X13,X14] :
( ( ~ '>='('+'(X12,X13),X14)
| '>='(X13,'==>'(X12,X14)) )
& ( ~ '>='(X13,'==>'(X12,X14))
| '>='('+'(X12,X13),X14) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
fof(c_0_13,negated_conjecture,
( ( ~ '>='(c,a)
| ~ '>='(c,b)
| ~ '>='(c,'+'(a,'==>'(a,b))) )
& ( '>='(c,a)
| '>='(c,'+'(a,'==>'(a,b))) )
& ( '>='(c,b)
| '>='(c,'+'(a,'==>'(a,b))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
fof(c_0_14,plain,
! [X3,X4] : '+'(X3,'==>'(X3,X4)) = '+'(X4,'==>'(X4,X3)),
inference(variable_rename,[status(thm)],[sos_12]) ).
fof(c_0_15,plain,
! [X9,X10] :
( ~ '>='(X9,X10)
| ~ '>='(X10,X9)
| X9 = X10 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])]) ).
fof(c_0_16,plain,
! [X2] : '>='(X2,'0'),
inference(variable_rename,[status(thm)],[sos_08]) ).
fof(c_0_17,plain,
! [X2] : '>='(X2,X2),
inference(variable_rename,[status(thm)],[sos_04]) ).
cnf(c_0_18,plain,
( '>='(X1,X2)
| ~ '>='(X3,X2)
| ~ '>='(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( '>='(c,'+'(a,'==>'(a,b)))
| '>='(c,b) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_26,plain,
! [X2] : '+'(X2,'0') = X2,
inference(variable_rename,[status(thm)],[sos_03]) ).
cnf(c_0_27,plain,
( '>='(X1,X2)
| ~ '>='(X1,'+'(X3,X4))
| ~ '>='(X4,'==>'(X3,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( '>='(c,'+'(b,'==>'(b,a)))
| '>='(c,b) ),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
( '0' = X1
| ~ '>='('0',X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X3,X4] : '+'(X3,X4) = '+'(X4,X3),
inference(variable_rename,[status(thm)],[sos_02]) ).
cnf(c_0_33,negated_conjecture,
( '>='(c,b)
| '>='(c,X1)
| ~ '>='('==>'(b,a),'==>'(b,X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
'==>'(X1,X1) = '0',
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
fof(c_0_35,plain,
! [X15,X16,X17] :
( ~ '>='(X15,X16)
| '>='('+'(X15,X17),'+'(X16,X17)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])])]) ).
cnf(c_0_36,plain,
'+'(X1,X2) = '+'(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
'>='(c,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_23])]) ).
cnf(c_0_38,plain,
( '>='('+'(X1,X2),'+'(X3,X2))
| ~ '>='(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,plain,
'+'('0',X1) = X1,
inference(pm,[status(thm)],[c_0_31,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( '>='(c,'+'(a,'==>'(a,b)))
| '>='(c,a) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,negated_conjecture,
( '>='(X1,b)
| ~ '>='(X1,c) ),
inference(spm,[status(thm)],[c_0_18,c_0_37]) ).
cnf(c_0_42,plain,
'>='('+'(X1,X2),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_23])]) ).
cnf(c_0_43,negated_conjecture,
( '>='(c,'+'(b,'==>'(b,a)))
| '>='(c,a) ),
inference(rw,[status(thm)],[c_0_40,c_0_21]) ).
cnf(c_0_44,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X1,X2),X3) ),
inference(pm,[status(thm)],[c_0_24,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
'>='('+'(X1,c),b),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( '>='(c,a)
| '>='(c,X1)
| ~ '>='('==>'(b,a),'==>'(b,X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
'>='(X1,'==>'(c,b)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
'>='(c,a),
inference(spm,[status(thm)],[c_0_46,c_0_25]) ).
cnf(c_0_49,negated_conjecture,
( ~ '>='(c,'+'(a,'==>'(a,b)))
| ~ '>='(c,b)
| ~ '>='(c,a) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_50,negated_conjecture,
'==>'(c,b) = '0',
inference(spm,[status(thm)],[c_0_29,c_0_47]) ).
cnf(c_0_51,plain,
( '>='('==>'(X1,X2),'==>'(X1,X3))
| ~ '>='('+'(X2,'==>'(X2,X1)),X3) ),
inference(pm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_52,negated_conjecture,
( '>='(X1,a)
| ~ '>='(X1,c) ),
inference(spm,[status(thm)],[c_0_18,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( ~ '>='(c,'+'(b,'==>'(b,a)))
| ~ '>='(c,a)
| ~ '>='(c,b) ),
inference(rw,[status(thm)],[c_0_49,c_0_21]) ).
cnf(c_0_54,plain,
( '>='('+'(X1,X2),'+'(X3,X1))
| ~ '>='(X2,X3) ),
inference(pm,[status(thm)],[c_0_38,c_0_36]) ).
cnf(c_0_55,negated_conjecture,
'+'(b,'==>'(b,c)) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_50]),c_0_31]) ).
cnf(c_0_56,negated_conjecture,
( '>='('==>'(X1,X2),'==>'(X1,a))
| ~ '>='('+'(X2,'==>'(X2,X1)),c) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( ~ '>='(c,'+'(b,'==>'(b,a)))
| ~ '>='(c,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_48])]) ).
cnf(c_0_58,negated_conjecture,
( '>='(c,'+'(X1,b))
| ~ '>='('==>'(b,c),X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
'>='('==>'(b,c),'==>'(b,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_50]),c_0_31]),c_0_25])]) ).
cnf(c_0_60,negated_conjecture,
~ '>='(c,'+'(b,'==>'(b,a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_37])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_36]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : LCL894+1 : TPTP v8.1.0. Released v5.5.0.
% 0.00/0.08 % Command : run_ET %s %d
% 0.07/0.26 % Computer : n009.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Mon Jul 4 08:49:52 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.23/23.31 eprover: CPU time limit exceeded, terminating
% 0.23/23.31 eprover: CPU time limit exceeded, terminating
% 0.23/23.31 eprover: CPU time limit exceeded, terminating
% 0.23/23.32 eprover: CPU time limit exceeded, terminating
% 0.34/46.32 eprover: CPU time limit exceeded, terminating
% 0.34/46.32 eprover: CPU time limit exceeded, terminating
% 0.34/46.34 eprover: CPU time limit exceeded, terminating
% 0.34/46.36 eprover: CPU time limit exceeded, terminating
% 0.46/69.33 eprover: CPU time limit exceeded, terminating
% 0.46/69.36 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.46/69.36
% 0.46/69.37 eprover: CPU time limit exceeded, terminating
% 0.48/72.67 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.48/72.67
% 0.48/72.67 # Failure: Resource limit exceeded (time)
% 0.48/72.67 # OLD status Res
% 0.48/72.67 # Preprocessing time : 0.008 s
% 0.48/72.67 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.48/72.67
% 0.48/72.67 # Failure: Resource limit exceeded (time)
% 0.48/72.67 # OLD status Res
% 0.48/72.67 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.48/72.67 # Preprocessing time : 0.007 s
% 0.48/72.67 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.48/72.67
% 0.48/72.67 # Failure: Resource limit exceeded (time)
% 0.48/72.67 # OLD status Res
% 0.48/72.67 # Preprocessing time : 0.014 s
% 0.48/72.67 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 0.48/72.67 # Preprocessing time : 0.014 s
% 0.48/72.67
% 0.48/72.67 # Proof found!
% 0.48/72.67 # SZS status Theorem
% 0.48/72.67 # SZS output start CNFRefutation
% See solution above
% 0.48/72.67 # Proof object total steps : 62
% 0.48/72.67 # Proof object clause steps : 41
% 0.48/72.67 # Proof object formula steps : 21
% 0.48/72.67 # Proof object conjectures : 25
% 0.48/72.67 # Proof object clause conjectures : 22
% 0.48/72.67 # Proof object formula conjectures : 3
% 0.48/72.67 # Proof object initial clauses used : 13
% 0.48/72.67 # Proof object initial formulas used : 10
% 0.48/72.67 # Proof object generating inferences : 23
% 0.48/72.67 # Proof object simplifying inferences : 18
% 0.48/72.67 # Training examples: 0 positive, 0 negative
% 0.48/72.67 # Parsed axioms : 13
% 0.48/72.67 # Removed by relevancy pruning/SinE : 0
% 0.48/72.67 # Initial clauses : 16
% 0.48/72.67 # Removed in clause preprocessing : 0
% 0.48/72.67 # Initial clauses in saturation : 16
% 0.48/72.67 # Processed clauses : 13970
% 0.48/72.67 # ...of these trivial : 296
% 0.48/72.67 # ...subsumed : 11249
% 0.48/72.67 # ...remaining for further processing : 2424
% 0.48/72.67 # Other redundant clauses eliminated : 0
% 0.48/72.67 # Clauses deleted for lack of memory : 79496
% 0.48/72.67 # Backward-subsumed : 866
% 0.48/72.67 # Backward-rewritten : 125
% 0.48/72.67 # Generated clauses : 286717
% 0.48/72.67 # ...of the previous two non-trivial : 271073
% 0.48/72.67 # Contextual simplify-reflections : 5067
% 0.48/72.67 # Paramodulations : 286717
% 0.48/72.67 # Factorizations : 0
% 0.48/72.67 # Equation resolutions : 0
% 0.48/72.67 # Current number of processed clauses : 1433
% 0.48/72.67 # Positive orientable unit clauses : 189
% 0.48/72.67 # Positive unorientable unit clauses: 46
% 0.48/72.67 # Negative unit clauses : 16
% 0.48/72.67 # Non-unit-clauses : 1182
% 0.48/72.67 # Current number of unprocessed clauses: 154054
% 0.48/72.67 # ...number of literals in the above : 406852
% 0.48/72.67 # Current number of archived formulas : 0
% 0.48/72.67 # Current number of archived clauses : 991
% 0.48/72.67 # Clause-clause subsumption calls (NU) : 868955
% 0.48/72.67 # Rec. Clause-clause subsumption calls : 730003
% 0.48/72.67 # Non-unit clause-clause subsumptions : 13495
% 0.48/72.67 # Unit Clause-clause subsumption calls : 6705
% 0.48/72.67 # Rewrite failures with RHS unbound : 0
% 0.48/72.67 # BW rewrite match attempts : 2972
% 0.48/72.67 # BW rewrite match successes : 314
% 0.48/72.67 # Condensation attempts : 0
% 0.48/72.67 # Condensation successes : 0
% 0.48/72.67 # Termbank termtop insertions : 4767403
% 0.48/72.67
% 0.48/72.67 # -------------------------------------------------
% 0.48/72.67 # User time : 2.858 s
% 0.48/72.67 # System time : 0.083 s
% 0.48/72.67 # Total time : 2.941 s
% 0.48/72.67 # Maximum resident set size: 129932 pages
% 0.48/92.38 eprover: CPU time limit exceeded, terminating
% 0.48/92.38 eprover: CPU time limit exceeded, terminating
% 0.48/92.39 eprover: CPU time limit exceeded, terminating
% 0.48/92.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.40 eprover: No such file or directory
% 0.48/92.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.40 eprover: No such file or directory
% 0.48/92.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.40 eprover: No such file or directory
% 0.48/92.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.40 eprover: No such file or directory
% 0.48/92.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.48/92.41 eprover: No such file or directory
% 0.48/92.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.41 eprover: No such file or directory
% 0.48/92.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.41 eprover: No such file or directory
% 0.48/92.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.48/92.41 eprover: No such file or directory
% 0.48/92.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.41 eprover: No such file or directory
% 0.48/92.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.41 eprover: No such file or directory
% 0.48/92.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.48/92.42 eprover: No such file or directory
% 0.48/92.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.42 eprover: No such file or directory
% 0.48/92.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.42 eprover: No such file or directory
% 0.48/92.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.48/92.42 eprover: No such file or directory
% 0.48/92.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.42 eprover: No such file or directory
% 0.48/92.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.42 eprover: No such file or directory
% 0.48/92.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.48/92.43 eprover: No such file or directory
% 0.48/92.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.43 eprover: No such file or directory
% 0.48/92.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.43 eprover: No such file or directory
% 0.48/92.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.43 eprover: No such file or directory
% 0.48/92.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.48/92.43 eprover: No such file or directory
% 0.48/92.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/92.44 eprover: No such file or directory
% 0.48/92.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.48/92.44 eprover: No such file or directory
% 0.48/92.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.48/92.44 eprover: No such file or directory
%------------------------------------------------------------------------------