%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : REL008+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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 19:19:00 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 65 ( 60 unt; 0 def)
% Number of atoms : 70 ( 69 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 107 ( 0 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_top) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(goals,conjecture,
! [X1,X2,X3] :
( join(join(composition(X1,join(X2,X3)),composition(X1,X2)),composition(X1,X3)) = join(composition(X1,X2),composition(X1,X3))
& join(join(composition(X1,X2),composition(X1,X3)),composition(X1,join(X2,X3))) = composition(X1,join(X2,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(c_0_13,plain,
! [X3,X4] : converse(composition(X3,X4)) = composition(converse(X4),converse(X3)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_14,plain,
! [X2] : converse(converse(X2)) = X2,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_15,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X2] : composition(X2,one) = X2,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_18,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X3,X4] : join(composition(converse(X3),complement(composition(X3,X4))),complement(X4)) = complement(X4),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_21,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_22,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).
fof(c_0_23,plain,
! [X2] : zero = meet(X2,complement(X2)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_24,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_25,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_28,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,plain,
! [X2] : top = join(X2,complement(X2)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_31,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_33,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_35,plain,
! [X3,X4] : X3 = join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_36,plain,
! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_37,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_32]) ).
cnf(c_0_38,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_39,c_0_26]) ).
fof(c_0_43,plain,
! [X3,X4] : converse(join(X3,X4)) = join(converse(X3),converse(X4)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
fof(c_0_44,plain,
! [X4,X5,X6] : composition(join(X4,X5),X6) = join(composition(X4,X6),composition(X5,X6)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_45,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_37]),c_0_34]),c_0_38]),c_0_26]) ).
fof(c_0_47,negated_conjecture,
~ ! [X1,X2,X3] :
( join(join(composition(X1,join(X2,X3)),composition(X1,X2)),composition(X1,X3)) = join(composition(X1,X2),composition(X1,X3))
& join(join(composition(X1,X2),composition(X1,X3)),composition(X1,join(X2,X3))) = composition(X1,join(X2,X3)) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_48,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
fof(c_0_51,negated_conjecture,
( join(join(composition(esk1_0,join(esk2_0,esk3_0)),composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0)) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))
| join(join(composition(esk4_0,esk5_0),composition(esk4_0,esk6_0)),composition(esk4_0,join(esk5_0,esk6_0))) != composition(esk4_0,join(esk5_0,esk6_0)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])])]) ).
cnf(c_0_52,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_48,c_0_16]) ).
cnf(c_0_53,plain,
join(converse(composition(X1,X2)),composition(X3,converse(X1))) = composition(join(converse(X2),X3),converse(X1)),
inference(spm,[status(thm)],[c_0_49,c_0_15]) ).
cnf(c_0_54,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_55,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_46,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( join(join(composition(esk4_0,esk5_0),composition(esk4_0,esk6_0)),composition(esk4_0,join(esk5_0,esk6_0))) != composition(esk4_0,join(esk5_0,esk6_0))
| join(join(composition(esk1_0,join(esk2_0,esk3_0)),composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0)) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_57,plain,
join(composition(X1,X2),composition(X1,converse(X3))) = composition(X1,join(X2,converse(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_52]),c_0_54]) ).
cnf(c_0_58,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_26]),c_0_40]) ).
cnf(c_0_59,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( join(composition(esk1_0,esk2_0),join(composition(esk1_0,esk3_0),composition(esk1_0,join(esk2_0,esk3_0)))) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))
| join(composition(esk4_0,esk5_0),join(composition(esk4_0,esk6_0),composition(esk4_0,join(esk5_0,esk6_0)))) != composition(esk4_0,join(esk5_0,esk6_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_40]),c_0_26]),c_0_40]),c_0_26]) ).
cnf(c_0_61,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_57,c_0_16]) ).
cnf(c_0_62,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_40]),c_0_59]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_61]),c_0_63]),c_0_61]),c_0_61]),c_0_62]),c_0_61]),c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : REL008+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 09:14:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.014 s
% 0.22/1.40
% 0.22/1.40 # Failure: Out of unprocessed clauses!
% 0.22/1.40 # OLD status GaveUp
% 0.22/1.40 # Parsed axioms : 14
% 0.22/1.40 # Removed by relevancy pruning/SinE : 9
% 0.22/1.40 # Initial clauses : 5
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 5
% 0.22/1.40 # Processed clauses : 109
% 0.22/1.40 # ...of these trivial : 62
% 0.22/1.40 # ...subsumed : 37
% 0.22/1.40 # ...remaining for further processing : 10
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 2
% 0.22/1.40 # Generated clauses : 108
% 0.22/1.40 # ...of the previous two non-trivial : 104
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 108
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 8
% 0.22/1.40 # Positive orientable unit clauses : 3
% 0.22/1.40 # Positive unorientable unit clauses: 4
% 0.22/1.40 # Negative unit clauses : 0
% 0.22/1.40 # Non-unit-clauses : 1
% 0.22/1.40 # Current number of unprocessed clauses: 0
% 0.22/1.40 # ...number of literals in the above : 0
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 2
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.22/1.40 # Non-unit clause-clause subsumptions : 0
% 0.22/1.40 # Unit Clause-clause subsumption calls : 6
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 38
% 0.22/1.40 # BW rewrite match successes : 38
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 1251
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.014 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.016 s
% 0.22/1.40 # Maximum resident set size: 2812 pages
% 0.22/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.40 # Preprocessing time : 0.021 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 65
% 0.22/1.40 # Proof object clause steps : 38
% 0.22/1.40 # Proof object formula steps : 27
% 0.22/1.40 # Proof object conjectures : 6
% 0.22/1.40 # Proof object clause conjectures : 3
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 13
% 0.22/1.40 # Proof object initial formulas used : 13
% 0.22/1.40 # Proof object generating inferences : 17
% 0.22/1.40 # Proof object simplifying inferences : 32
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 14
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 14
% 0.22/1.40 # Removed in clause preprocessing : 1
% 0.22/1.40 # Initial clauses in saturation : 13
% 0.22/1.40 # Processed clauses : 453
% 0.22/1.40 # ...of these trivial : 186
% 0.22/1.40 # ...subsumed : 75
% 0.22/1.40 # ...remaining for further processing : 192
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 92
% 0.22/1.40 # Generated clauses : 4035
% 0.22/1.40 # ...of the previous two non-trivial : 2756
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 4035
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 100
% 0.22/1.40 # Positive orientable unit clauses : 96
% 0.22/1.40 # Positive unorientable unit clauses: 4
% 0.22/1.40 # Negative unit clauses : 0
% 0.22/1.40 # Non-unit-clauses : 0
% 0.22/1.40 # Current number of unprocessed clauses: 1629
% 0.22/1.40 # ...number of literals in the above : 1629
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 93
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.22/1.40 # Non-unit clause-clause subsumptions : 0
% 0.22/1.40 # Unit Clause-clause subsumption calls : 12
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 318
% 0.22/1.40 # BW rewrite match successes : 143
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 47413
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.068 s
% 0.22/1.40 # System time : 0.003 s
% 0.22/1.40 # Total time : 0.071 s
% 0.22/1.40 # Maximum resident set size: 5720 pages
% 0.22/23.43 eprover: CPU time limit exceeded, terminating
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.49 eprover: No such file or directory
% 0.22/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.49 eprover: No such file or directory
% 0.22/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.50 eprover: No such file or directory
% 0.22/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------