TSTP Solution File: TOP024+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : TOP024+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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 : Thu Jul 21 21:25:28 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 13 unt; 0 def)
% Number of atoms : 134 ( 19 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 153 ( 60 ~; 57 |; 18 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 3 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fc9_tops_1,axiom,
! [X1] :
( l1_pre_topc(X1)
=> v1_tops_1(k2_pre_topc(X1),X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc9_tops_1) ).
fof(t12_pre_topc,axiom,
! [X1] :
( l1_struct_0(X1)
=> k2_pre_topc(X1) = u1_struct_0(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t12_pre_topc) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( l1_pre_topc(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l1_pre_topc) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(t64_tex_4,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t64_tex_4) ).
fof(d5_tsp_2,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
<=> ( v1_tsp_1(X2,X1)
& k3_tex_4(X1,X2) = u1_struct_0(X1) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_tsp_2) ).
fof(t2_tsp_2,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_tsp_2) ).
fof(d2_tops_3,axiom,
! [X1] :
( l1_pre_topc(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tops_1(X2,X1)
<=> k6_pre_topc(X1,X2) = u1_struct_0(X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_tops_3) ).
fof(c_0_9,plain,
! [X2] :
( ~ l1_pre_topc(X2)
| v1_tops_1(k2_pre_topc(X2),X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc9_tops_1])]) ).
fof(c_0_10,plain,
! [X2] :
( ~ l1_struct_0(X2)
| k2_pre_topc(X2) = u1_struct_0(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_pre_topc])]) ).
fof(c_0_11,plain,
! [X2] :
( ~ l1_pre_topc(X2)
| l1_struct_0(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])]) ).
fof(c_0_12,plain,
! [X3,X4,X3,X4] :
( ( ~ m1_subset_1(X3,k1_zfmisc_1(X4))
| r1_tarski(X3,X4) )
& ( ~ r1_tarski(X3,X4)
| m1_subset_1(X3,k1_zfmisc_1(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
fof(c_0_13,plain,
! [X3] : r1_tarski(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_14,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| k6_pre_topc(X3,k3_tex_4(X3,X4)) = k6_pre_topc(X3,X4) ),
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)],[t64_tex_4])])])])])]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ( v1_tsp_1(X4,X3)
| ~ v1_tsp_2(X4,X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3) )
& ( k3_tex_4(X3,X4) = u1_struct_0(X3)
| ~ v1_tsp_2(X4,X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3) )
& ( ~ v1_tsp_1(X4,X3)
| k3_tex_4(X3,X4) != u1_struct_0(X3)
| v1_tsp_2(X4,X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3) ) ),
inference(distribute,[status(thm)],[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)],[d5_tsp_2])])])])])])]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
inference(assume_negation,[status(cth)],[t2_tsp_2]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ( ~ v1_tops_1(X4,X3)
| k6_pre_topc(X3,X4) = u1_struct_0(X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| ~ l1_pre_topc(X3) )
& ( k6_pre_topc(X3,X4) != u1_struct_0(X3)
| v1_tops_1(X4,X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| ~ l1_pre_topc(X3) ) ),
inference(distribute,[status(thm)],[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)],[d2_tops_3])])])])])]) ).
cnf(c_0_18,plain,
( v1_tops_1(k2_pre_topc(X1),X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( k2_pre_topc(X1) = u1_struct_0(X1)
| ~ l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( l1_struct_0(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2)
| v3_struct_0(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( v3_struct_0(X1)
| k3_tex_4(X1,X2) = u1_struct_0(X1)
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_25,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& v1_tsp_2(esk2_0,esk1_0)
& ~ v1_tops_1(esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[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)],[c_0_16])])])])])]) ).
cnf(c_0_26,plain,
( k6_pre_topc(X1,X2) = u1_struct_0(X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tops_1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
( v1_tops_1(u1_struct_0(X1),X1)
| ~ l1_pre_topc(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_28,plain,
m1_subset_1(X1,k1_zfmisc_1(X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( k6_pre_topc(X1,u1_struct_0(X1)) = k6_pre_topc(X1,X2)
| v3_struct_0(X1)
| ~ v1_tsp_2(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,negated_conjecture,
~ v1_tops_1(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
( v1_tops_1(X2,X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| k6_pre_topc(X1,X2) != u1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_37,plain,
( k6_pre_topc(X1,u1_struct_0(X1)) = u1_struct_0(X1)
| ~ l1_pre_topc(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_38,negated_conjecture,
k6_pre_topc(esk1_0,u1_struct_0(esk1_0)) = k6_pre_topc(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_39,negated_conjecture,
k6_pre_topc(esk1_0,esk2_0) != u1_struct_0(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_31]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : TOP024+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n022.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 : Sun May 29 05:05:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.020 s
% 0.22/1.41
% 0.22/1.41 # Failure: Out of unprocessed clauses!
% 0.22/1.41 # OLD status GaveUp
% 0.22/1.41 # Parsed axioms : 69
% 0.22/1.41 # Removed by relevancy pruning/SinE : 23
% 0.22/1.41 # Initial clauses : 114
% 0.22/1.41 # Removed in clause preprocessing : 3
% 0.22/1.41 # Initial clauses in saturation : 111
% 0.22/1.41 # Processed clauses : 782
% 0.22/1.41 # ...of these trivial : 13
% 0.22/1.41 # ...subsumed : 413
% 0.22/1.41 # ...remaining for further processing : 356
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 5
% 0.22/1.41 # Backward-rewritten : 7
% 0.22/1.41 # Generated clauses : 810
% 0.22/1.41 # ...of the previous two non-trivial : 727
% 0.22/1.41 # Contextual simplify-reflections : 420
% 0.22/1.41 # Paramodulations : 810
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 344
% 0.22/1.41 # Positive orientable unit clauses : 22
% 0.22/1.41 # Positive unorientable unit clauses: 1
% 0.22/1.41 # Negative unit clauses : 8
% 0.22/1.41 # Non-unit-clauses : 313
% 0.22/1.41 # Current number of unprocessed clauses: 0
% 0.22/1.41 # ...number of literals in the above : 0
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 12
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 23558
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 9893
% 0.22/1.41 # Non-unit clause-clause subsumptions : 816
% 0.22/1.41 # Unit Clause-clause subsumption calls : 87
% 0.22/1.41 # Rewrite failures with RHS unbound : 10
% 0.22/1.41 # BW rewrite match attempts : 10
% 0.22/1.41 # BW rewrite match successes : 10
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 17967
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.059 s
% 0.22/1.41 # System time : 0.002 s
% 0.22/1.41 # Total time : 0.061 s
% 0.22/1.41 # Maximum resident set size: 4000 pages
% 0.22/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.41 # Preprocessing time : 0.020 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 41
% 0.22/1.41 # Proof object clause steps : 22
% 0.22/1.41 # Proof object formula steps : 19
% 0.22/1.41 # Proof object conjectures : 12
% 0.22/1.41 # Proof object clause conjectures : 9
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 15
% 0.22/1.41 # Proof object initial formulas used : 9
% 0.22/1.41 # Proof object generating inferences : 7
% 0.22/1.41 # Proof object simplifying inferences : 14
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 69
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 155
% 0.22/1.41 # Removed in clause preprocessing : 8
% 0.22/1.41 # Initial clauses in saturation : 147
% 0.22/1.41 # Processed clauses : 884
% 0.22/1.41 # ...of these trivial : 2
% 0.22/1.41 # ...subsumed : 349
% 0.22/1.41 # ...remaining for further processing : 533
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 3
% 0.22/1.41 # Backward-rewritten : 2
% 0.22/1.41 # Generated clauses : 1079
% 0.22/1.41 # ...of the previous two non-trivial : 976
% 0.22/1.41 # Contextual simplify-reflections : 392
% 0.22/1.41 # Paramodulations : 1079
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 528
% 0.22/1.41 # Positive orientable unit clauses : 24
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 7
% 0.22/1.41 # Non-unit-clauses : 497
% 0.22/1.41 # Current number of unprocessed clauses: 206
% 0.22/1.41 # ...number of literals in the above : 954
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 5
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 106688
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 73484
% 0.22/1.41 # Non-unit clause-clause subsumptions : 714
% 0.22/1.41 # Unit Clause-clause subsumption calls : 111
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 20
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 24959
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.075 s
% 0.22/1.41 # System time : 0.002 s
% 0.22/1.41 # Total time : 0.077 s
% 0.22/1.41 # Maximum resident set size: 4424 pages
% 0.22/23.41 eprover: CPU time limit exceeded, terminating
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------