TSTP Solution File: SET352+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET352+4 : TPTP v8.1.0. Released v2.2.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 : Tue Jul 19 00:50:52 EDT 2022
% Result : Theorem 0.53s 47.71s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 49 ( 12 unt; 0 def)
% Number of atoms : 121 ( 15 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 126 ( 54 ~; 54 |; 12 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 88 ( 20 sgn 43 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI40,conjecture,
! [X1,X2] : equal_set(sum(unordered_pair(X1,X2)),union(X1,X2)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI40) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(unordered_pair,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( X3 = X1
| X3 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',unordered_pair) ).
fof(sum,axiom,
! [X3,X1] :
( member(X3,sum(X1))
<=> ? [X5] :
( member(X5,X1)
& member(X3,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',sum) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',union) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] : equal_set(sum(unordered_pair(X1,X2)),union(X1,X2)),
inference(assume_negation,[status(cth)],[thI40]) ).
fof(c_0_7,negated_conjecture,
~ equal_set(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| ~ equal_set(X3,X4) )
& ( subset(X4,X3)
| ~ equal_set(X3,X4) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| equal_set(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])])]) ).
cnf(c_0_9,negated_conjecture,
~ equal_set(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subset(X4,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)],[subset])])])])])])]) ).
fof(c_0_12,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X4,unordered_pair(X5,X6))
| X4 = X5
| X4 = X6 )
& ( X4 != X5
| member(X4,unordered_pair(X5,X6)) )
& ( X4 != X6
| member(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ subset(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0)))
| ~ subset(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)) ),
inference(pm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X6,X7,X6,X7,X9] :
( ( member(esk2_2(X6,X7),X7)
| ~ member(X6,sum(X7)) )
& ( member(X6,esk2_2(X6,X7))
| ~ member(X6,sum(X7)) )
& ( ~ member(X9,X7)
| ~ member(X6,X9)
| member(X6,sum(X7)) ) ),
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)],[sum])])])])])])]) ).
cnf(c_0_16,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0))),sum(unordered_pair(esk4_0,esk5_0)))
| ~ subset(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)) ),
inference(pm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( member(X1,sum(X2))
| ~ member(X1,X3)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
member(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
member(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X4,union(X5,X6))
| member(X4,X5)
| member(X4,X6) )
& ( ~ member(X4,X5)
| member(X4,union(X5,X6)) )
& ( ~ member(X4,X6)
| member(X4,union(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])])])]) ).
cnf(c_0_24,negated_conjecture,
( member(esk1_2(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0))),union(esk4_0,esk5_0))
| ~ subset(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)) ),
inference(pm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),sum(unordered_pair(esk4_0,esk5_0)))
| ~ member(esk1_2(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0))),sum(unordered_pair(esk4_0,esk5_0))) ),
inference(pm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_26,plain,
( member(X1,sum(unordered_pair(X2,X3)))
| ~ member(X1,X2) ),
inference(pm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( member(X1,sum(unordered_pair(X2,X3)))
| ~ member(X1,X3) ),
inference(pm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0))),sum(unordered_pair(esk4_0,esk5_0)))
| ~ member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),union(esk4_0,esk5_0)) ),
inference(pm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_29,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
( member(esk2_2(X1,X2),X2)
| ~ member(X1,sum(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_31,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),sum(unordered_pair(esk4_0,esk5_0)))
| member(esk1_2(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0))),union(esk4_0,esk5_0)) ),
inference(pm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_33,negated_conjecture,
( member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),sum(unordered_pair(esk4_0,esk5_0)))
| ~ member(esk1_2(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0))),esk4_0) ),
inference(pm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
( member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),sum(unordered_pair(esk4_0,esk5_0)))
| ~ member(esk1_2(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0))),esk5_0) ),
inference(pm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( member(esk1_2(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0))),union(esk4_0,esk5_0))
| ~ member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),union(esk4_0,esk5_0)) ),
inference(pm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_36,negated_conjecture,
( ~ member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),union(esk4_0,esk5_0))
| ~ member(esk1_2(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0))),esk4_0) ),
inference(pm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),union(esk4_0,esk5_0))
| ~ member(esk1_2(union(esk4_0,esk5_0),sum(unordered_pair(esk4_0,esk5_0))),esk5_0) ),
inference(pm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_38,plain,
( esk2_2(X1,unordered_pair(X2,X3)) = X2
| esk2_2(X1,unordered_pair(X2,X3)) = X3
| ~ member(X1,sum(unordered_pair(X2,X3))) ),
inference(pm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,negated_conjecture,
member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),sum(unordered_pair(esk4_0,esk5_0))),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),union(esk4_0,esk5_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_31,c_0_35]),c_0_36]),c_0_37]) ).
cnf(c_0_41,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_42,plain,
( member(X1,esk2_2(X1,X2))
| ~ member(X1,sum(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_43,negated_conjecture,
( esk2_2(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
| esk2_2(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0 ),
inference(pm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
~ member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),esk5_0),
inference(pm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_46,negated_conjecture,
esk2_2(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_42,c_0_43]),c_0_39])]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
~ member(esk1_2(sum(unordered_pair(esk4_0,esk5_0)),union(esk4_0,esk5_0)),esk4_0),
inference(pm,[status(thm)],[c_0_40,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_42,c_0_46]),c_0_39])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET352+4 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n010.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 9 18:02:46 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.38/23.42
% 0.38/23.45 eprover: CPU time limit exceeded, terminating
% 0.53/46.44 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.53/46.44
% 0.53/46.46 eprover: CPU time limit exceeded, terminating
% 0.53/46.46 eprover: CPU time limit exceeded, terminating
% 0.53/47.71 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.53/47.71
% 0.53/47.71 # Failure: Resource limit exceeded (time)
% 0.53/47.71 # OLD status Res
% 0.53/47.71 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.53/47.71 # Preprocessing time : 0.015 s
% 0.53/47.71 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.53/47.71
% 0.53/47.71 # Failure: Resource limit exceeded (time)
% 0.53/47.71 # OLD status Res
% 0.53/47.71 # Preprocessing time : 0.009 s
% 0.53/47.71 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 0.53/47.71 # Preprocessing time : 0.009 s
% 0.53/47.71
% 0.53/47.71 # Proof found!
% 0.53/47.71 # SZS status Theorem
% 0.53/47.71 # SZS output start CNFRefutation
% See solution above
% 0.53/47.71 # Proof object total steps : 49
% 0.53/47.71 # Proof object clause steps : 36
% 0.53/47.71 # Proof object formula steps : 13
% 0.53/47.71 # Proof object conjectures : 22
% 0.53/47.71 # Proof object clause conjectures : 19
% 0.53/47.71 # Proof object formula conjectures : 3
% 0.53/47.71 # Proof object initial clauses used : 13
% 0.53/47.71 # Proof object initial formulas used : 6
% 0.53/47.71 # Proof object generating inferences : 21
% 0.53/47.71 # Proof object simplifying inferences : 12
% 0.53/47.71 # Training examples: 0 positive, 0 negative
% 0.53/47.71 # Parsed axioms : 12
% 0.53/47.71 # Removed by relevancy pruning/SinE : 0
% 0.53/47.71 # Initial clauses : 30
% 0.53/47.71 # Removed in clause preprocessing : 0
% 0.53/47.71 # Initial clauses in saturation : 30
% 0.53/47.71 # Processed clauses : 1149
% 0.53/47.71 # ...of these trivial : 35
% 0.53/47.71 # ...subsumed : 369
% 0.53/47.71 # ...remaining for further processing : 745
% 0.53/47.71 # Other redundant clauses eliminated : 21
% 0.53/47.71 # Clauses deleted for lack of memory : 0
% 0.53/47.71 # Backward-subsumed : 2
% 0.53/47.71 # Backward-rewritten : 5
% 0.53/47.71 # Generated clauses : 42408
% 0.53/47.71 # ...of the previous two non-trivial : 40187
% 0.53/47.71 # Contextual simplify-reflections : 173
% 0.53/47.71 # Paramodulations : 42321
% 0.53/47.71 # Factorizations : 66
% 0.53/47.71 # Equation resolutions : 21
% 0.53/47.71 # Current number of processed clauses : 735
% 0.53/47.71 # Positive orientable unit clauses : 182
% 0.53/47.71 # Positive unorientable unit clauses: 0
% 0.53/47.71 # Negative unit clauses : 166
% 0.53/47.71 # Non-unit-clauses : 387
% 0.53/47.71 # Current number of unprocessed clauses: 38940
% 0.53/47.71 # ...number of literals in the above : 92991
% 0.53/47.71 # Current number of archived formulas : 0
% 0.53/47.71 # Current number of archived clauses : 7
% 0.53/47.71 # Clause-clause subsumption calls (NU) : 31679
% 0.53/47.71 # Rec. Clause-clause subsumption calls : 27006
% 0.53/47.71 # Non-unit clause-clause subsumptions : 345
% 0.53/47.71 # Unit Clause-clause subsumption calls : 15491
% 0.53/47.71 # Rewrite failures with RHS unbound : 0
% 0.53/47.71 # BW rewrite match attempts : 3442
% 0.53/47.71 # BW rewrite match successes : 2
% 0.53/47.71 # Condensation attempts : 0
% 0.53/47.71 # Condensation successes : 0
% 0.53/47.71 # Termbank termtop insertions : 512972
% 0.53/47.71
% 0.53/47.71 # -------------------------------------------------
% 0.53/47.71 # User time : 0.334 s
% 0.53/47.71 # System time : 0.024 s
% 0.53/47.71 # Total time : 0.359 s
% 0.53/47.71 # Maximum resident set size: 43012 pages
% 0.53/69.46 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.53/69.46
% 0.53/69.47 eprover: CPU time limit exceeded, terminating
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.51 eprover: No such file or directory
% 0.53/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.51 eprover: No such file or directory
% 0.53/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.51 eprover: No such file or directory
% 0.53/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.51 eprover: No such file or directory
% 0.53/69.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.52 eprover: No such file or directory
%------------------------------------------------------------------------------