TSTP Solution File: RNG115+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG115+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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 20:26:58 EDT 2022
% Result : Theorem 0.90s 141.09s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 169 ( 49 equ)
% Maximal formula atoms : 52 ( 6 avg)
% Number of connectives : 248 ( 106 ~; 104 |; 31 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 5 con; 0-4 aty)
% Number of variables : 61 ( 4 sgn 28 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& xu = sdtpldt0(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mDefSSum,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aSet0(X2) )
=> ! [X3] :
( X3 = sdtpldt1(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5,X6] :
( aElementOf0(X5,X1)
& aElementOf0(X6,X2)
& sdtpldt0(X5,X6) = X4 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSSum) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2174) ).
fof(m__2273,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2273) ).
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefPrIdeal) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2091) ).
fof(c_0_6,negated_conjecture,
~ ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& xu = sdtpldt0(X1,X2) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
! [X3,X4] :
( ~ aElementOf0(X3,slsdtgt0(xa))
| ~ aElementOf0(X4,slsdtgt0(xb))
| xu != sdtpldt0(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_8,plain,
! [X7,X8,X9,X10,X10,X13,X14,X9,X16,X17] :
( ( aSet0(X9)
| X9 != sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( aElementOf0(esk3_4(X7,X8,X9,X10),X7)
| ~ aElementOf0(X10,X9)
| X9 != sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( aElementOf0(esk4_4(X7,X8,X9,X10),X8)
| ~ aElementOf0(X10,X9)
| X9 != sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( sdtpldt0(esk3_4(X7,X8,X9,X10),esk4_4(X7,X8,X9,X10)) = X10
| ~ aElementOf0(X10,X9)
| X9 != sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( ~ aElementOf0(X13,X7)
| ~ aElementOf0(X14,X8)
| sdtpldt0(X13,X14) != X10
| aElementOf0(X10,X9)
| X9 != sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( ~ aElementOf0(esk5_3(X7,X8,X9),X9)
| ~ aElementOf0(X16,X7)
| ~ aElementOf0(X17,X8)
| sdtpldt0(X16,X17) != esk5_3(X7,X8,X9)
| ~ aSet0(X9)
| X9 = sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( aElementOf0(esk6_3(X7,X8,X9),X7)
| aElementOf0(esk5_3(X7,X8,X9),X9)
| ~ aSet0(X9)
| X9 = sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( aElementOf0(esk7_3(X7,X8,X9),X8)
| aElementOf0(esk5_3(X7,X8,X9),X9)
| ~ aSet0(X9)
| X9 = sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( sdtpldt0(esk6_3(X7,X8,X9),esk7_3(X7,X8,X9)) = esk5_3(X7,X8,X9)
| aElementOf0(esk5_3(X7,X8,X9),X9)
| ~ aSet0(X9)
| X9 = sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSSum])])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( xu != sdtpldt0(X1,X2)
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( aElementOf0(esk4_4(X2,X1,X3,X4),X1)
| ~ aSet0(X1)
| ~ aSet0(X2)
| X3 != sdtpldt1(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( sdtpldt0(X1,esk4_4(X2,slsdtgt0(xb),X3,X4)) != xu
| X3 != sdtpldt1(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa))
| ~ aElementOf0(X4,X3)
| ~ aSet0(slsdtgt0(xb))
| ~ aSet0(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( sdtpldt0(esk3_4(X2,X1,X3,X4),esk4_4(X2,X1,X3,X4)) = X4
| ~ aSet0(X1)
| ~ aSet0(X2)
| X3 != sdtpldt1(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( X1 != sdtpldt1(X2,slsdtgt0(xb))
| X3 != xu
| ~ aElementOf0(esk3_4(X2,slsdtgt0(xb),X1,X3),slsdtgt0(xa))
| ~ aElementOf0(X3,X1)
| ~ aSet0(slsdtgt0(xb))
| ~ aSet0(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( aElementOf0(esk3_4(X2,X1,X3,X4),X2)
| ~ aSet0(X1)
| ~ aSet0(X2)
| X3 != sdtpldt1(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_16,hypothesis,
! [X2] :
( aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X2,xI)
| X2 = sz00
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) ) ),
inference(shift_quantors,[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)],[m__2273])])])])])]) ).
fof(c_0_17,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( aSet0(X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( aElement0(esk8_3(X5,X6,X7))
| ~ aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( sdtasdt0(X5,esk8_3(X5,X6,X7)) = X7
| ~ aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( ~ aElement0(X9)
| sdtasdt0(X5,X9) != X7
| aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( ~ aElementOf0(esk9_2(X5,X6),X6)
| ~ aElement0(X11)
| sdtasdt0(X5,X11) != esk9_2(X5,X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) )
& ( aElement0(esk10_2(X5,X6))
| aElementOf0(esk9_2(X5,X6),X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) )
& ( sdtasdt0(X5,esk10_2(X5,X6)) = esk9_2(X5,X6)
| aElementOf0(esk9_2(X5,X6),X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefPrIdeal])])])])])])]) ).
cnf(c_0_18,negated_conjecture,
( X1 != xI
| X2 != xu
| ~ aElementOf0(X2,X1)
| ~ aSet0(slsdtgt0(xb))
| ~ aSet0(slsdtgt0(xa)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( aSet0(X2)
| ~ aElement0(X1)
| X2 != slsdtgt0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,hypothesis,
( ~ aSet0(slsdtgt0(xb))
| ~ aSet0(slsdtgt0(xa)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( aSet0(slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_23,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_24,hypothesis,
~ aSet0(slsdtgt0(xa)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_25,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_26,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : RNG115+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.10 % Command : run_ET %s %d
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Mon May 30 09:22:27 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.27/23.34 eprover: CPU time limit exceeded, terminating
% 0.27/23.34 eprover: CPU time limit exceeded, terminating
% 0.27/23.34 eprover: CPU time limit exceeded, terminating
% 0.27/23.34 eprover: CPU time limit exceeded, terminating
% 0.39/46.35 eprover: CPU time limit exceeded, terminating
% 0.39/46.36 eprover: CPU time limit exceeded, terminating
% 0.39/46.36 eprover: CPU time limit exceeded, terminating
% 0.39/46.38 eprover: CPU time limit exceeded, terminating
% 0.51/69.37 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.51/69.37
% 0.51/69.37 eprover: CPU time limit exceeded, terminating
% 0.51/69.39 eprover: CPU time limit exceeded, terminating
% 0.65/92.38 eprover: CPU time limit exceeded, terminating
% 0.65/92.39 eprover: CPU time limit exceeded, terminating
% 0.65/92.40 eprover: CPU time limit exceeded, terminating
% 0.65/92.41 eprover: CPU time limit exceeded, terminating
% 0.76/115.40 eprover: CPU time limit exceeded, terminating
% 0.76/115.40 eprover: CPU time limit exceeded, terminating
% 0.76/115.41 eprover: CPU time limit exceeded, terminating
% 0.76/115.43 eprover: CPU time limit exceeded, terminating
% 0.89/138.41 eprover: CPU time limit exceeded, terminating
% 0.89/138.42 eprover: CPU time limit exceeded, terminating
% 0.89/138.44 eprover: CPU time limit exceeded, terminating
% 0.89/138.45 eprover: CPU time limit exceeded, terminating
% 0.90/141.09 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.90/141.09
% 0.90/141.09 # Failure: Resource limit exceeded (time)
% 0.90/141.09 # OLD status Res
% 0.90/141.09 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.90/141.09 # Preprocessing time : 0.014 s
% 0.90/141.09 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.90/141.09
% 0.90/141.09 # Failure: Resource limit exceeded (time)
% 0.90/141.09 # OLD status Res
% 0.90/141.09 # Preprocessing time : 0.012 s
% 0.90/141.09 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 0.90/141.09
% 0.90/141.09 # Failure: Resource limit exceeded (time)
% 0.90/141.09 # OLD status Res
% 0.90/141.09 # Preprocessing time : 0.011 s
% 0.90/141.09 # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 0.90/141.09
% 0.90/141.09 # Failure: Resource limit exceeded (time)
% 0.90/141.09 # OLD status Res
% 0.90/141.09 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 0.90/141.09 # Preprocessing time : 0.011 s
% 0.90/141.09 # Running protocol protocol_eprover_bb5e3cecdbc7660bd3a6f864cadb7769d8aea26a for 23 seconds:
% 0.90/141.09
% 0.90/141.09 # Failure: Resource limit exceeded (time)
% 0.90/141.09 # OLD status Res
% 0.90/141.09 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,,500,1.0)
% 0.90/141.09 # Preprocessing time : 0.011 s
% 0.90/141.09 # Running protocol protocol_eprover_e252f7803940d118fa0ef69fc2319cb55aee23b9 for 23 seconds:
% 0.90/141.09
% 0.90/141.09 # Failure: Resource limit exceeded (time)
% 0.90/141.09 # OLD status Res
% 0.90/141.09 # SinE strategy is GSinE(CountFormulas,,1.4,,03,100,1.0)
% 0.90/141.09 # Preprocessing time : 0.011 s
% 0.90/141.09 # Running protocol protocol_eprover_b1d72019af42f5b571a6c0b233a5b6d1de064075 for 23 seconds:
% 0.90/141.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,500,1.0)
% 0.90/141.09 # Preprocessing time : 0.011 s
% 0.90/141.09
% 0.90/141.09 # Proof found!
% 0.90/141.09 # SZS status Theorem
% 0.90/141.09 # SZS output start CNFRefutation
% See solution above
% 0.90/141.09 # Proof object total steps : 27
% 0.90/141.09 # Proof object clause steps : 16
% 0.90/141.09 # Proof object formula steps : 11
% 0.90/141.09 # Proof object conjectures : 7
% 0.90/141.09 # Proof object clause conjectures : 4
% 0.90/141.09 # Proof object formula conjectures : 3
% 0.90/141.09 # Proof object initial clauses used : 9
% 0.90/141.09 # Proof object initial formulas used : 6
% 0.90/141.09 # Proof object generating inferences : 7
% 0.90/141.09 # Proof object simplifying inferences : 5
% 0.90/141.09 # Training examples: 0 positive, 0 negative
% 0.90/141.09 # Parsed axioms : 47
% 0.90/141.09 # Removed by relevancy pruning/SinE : 11
% 0.90/141.09 # Initial clauses : 83
% 0.90/141.09 # Removed in clause preprocessing : 4
% 0.90/141.09 # Initial clauses in saturation : 79
% 0.90/141.09 # Processed clauses : 9833
% 0.90/141.09 # ...of these trivial : 20
% 0.90/141.09 # ...subsumed : 7728
% 0.90/141.09 # ...remaining for further processing : 2085
% 0.90/141.09 # Other redundant clauses eliminated : 127
% 0.90/141.09 # Clauses deleted for lack of memory : 0
% 0.90/141.09 # Backward-subsumed : 473
% 0.90/141.09 # Backward-rewritten : 81
% 0.90/141.09 # Generated clauses : 167553
% 0.90/141.09 # ...of the previous two non-trivial : 160176
% 0.90/141.09 # Contextual simplify-reflections : 8204
% 0.90/141.09 # Paramodulations : 167176
% 0.90/141.09 # Factorizations : 0
% 0.90/141.09 # Equation resolutions : 260
% 0.90/141.09 # Current number of processed clauses : 1490
% 0.90/141.09 # Positive orientable unit clauses : 70
% 0.90/141.09 # Positive unorientable unit clauses: 0
% 0.90/141.09 # Negative unit clauses : 53
% 0.90/141.09 # Non-unit-clauses : 1367
% 0.90/141.09 # Current number of unprocessed clauses: 117575
% 0.90/141.09 # ...number of literals in the above : 760407
% 0.90/141.09 # Current number of archived formulas : 0
% 0.90/141.09 # Current number of archived clauses : 554
% 0.90/141.09 # Clause-clause subsumption calls (NU) : 997193
% 0.90/141.09 # Rec. Clause-clause subsumption calls : 254127
% 0.90/141.09 # Non-unit clause-clause subsumptions : 13680
% 0.90/141.09 # Unit Clause-clause subsumption calls : 48094
% 0.90/141.09 # Rewrite failures with RHS unbound : 0
% 0.90/141.09 # BW rewrite match attempts : 47
% 0.90/141.09 # BW rewrite match successes : 47
% 0.90/141.09 # Condensation attempts : 0
% 0.90/141.09 # Condensation successes : 0
% 0.90/141.09 # Termbank termtop insertions : 2991771
% 0.90/141.09
% 0.90/141.09 # -------------------------------------------------
% 0.90/141.09 # User time : 2.544 s
% 0.90/141.09 # System time : 0.068 s
% 0.90/141.09 # Total time : 2.612 s
% 0.90/141.09 # Maximum resident set size: 111976 pages
% 0.90/161.43 eprover: CPU time limit exceeded, terminating
% 0.90/161.44 eprover: CPU time limit exceeded, terminating
% 0.90/161.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.90/161.45 eprover: No such file or directory
% 0.90/161.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.90/161.46 eprover: No such file or directory
% 0.90/161.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.90/161.46 eprover: No such file or directory
% 0.90/161.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.90/161.46 eprover: No such file or directory
% 0.90/161.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.90/161.46 eprover: No such file or directory
% 0.90/161.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.90/161.47 eprover: No such file or directory
% 0.90/161.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.90/161.47 eprover: No such file or directory
% 0.90/161.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.90/161.47 eprover: No such file or directory
% 0.90/161.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.90/161.47 eprover: No such file or directory
% 0.90/161.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.90/161.48 eprover: No such file or directory
% 0.90/161.48 eprover: CPU time limit exceeded, terminating
% 0.90/161.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.90/161.50 eprover: No such file or directory
% 0.90/161.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.90/161.50 eprover: No such file or directory
% 0.90/161.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.90/161.51 eprover: No such file or directory
% 0.90/161.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.90/161.51 eprover: No such file or directory
% 0.90/161.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.90/161.51 eprover: No such file or directory
%------------------------------------------------------------------------------