TSTP Solution File: NUM443+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM443+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 09:32:29 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 11 unt; 0 def)
% Number of atoms : 187 ( 23 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 224 ( 63 ~; 65 |; 80 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 46 ( 2 sgn 24 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ! [X1] :
( ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
=> ( aInteger0(X1)
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa)) )
& aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
& sdteqdtlpzmzozddtrp0(X1,xa,xq) ) )
& ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa)) )
| aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(X1,xa,xq) ) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) ) )
& ~ aElementOf0(xb,szAzrzSzezqlpdtcmdtrp0(xa,xq))
& aElementOf0(xb,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
& ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xc,smndt0(xb)) )
& aDivisorOf0(xq,sdtpldt0(xc,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xc,xb,xq) )
=> ( ( aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ! [X1] :
( ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
=> ( aInteger0(X1)
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa)) )
& aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
& sdteqdtlpzmzozddtrp0(X1,xa,xq) ) )
& ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa)) )
| aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(X1,xa,xq) ) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) ) ) )
=> ( ~ aElementOf0(xc,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| aElementOf0(xc,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq))) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mEquModTrn,axiom,
! [X1,X2,X3,X4] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& X3 != sz00
& aInteger0(X4) )
=> ( ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
& sdteqdtlpzmzozddtrp0(X2,X4,X3) )
=> sdteqdtlpzmzozddtrp0(X1,X4,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEquModTrn) ).
fof(mEquModSym,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& X3 != sz00 )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
=> sdteqdtlpzmzozddtrp0(X2,X1,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEquModSym) ).
fof(m__1962,hypothesis,
( aInteger0(xa)
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1962) ).
fof(m__2010,hypothesis,
( aInteger0(xb)
& aInteger0(xc) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2010) ).
fof(c_0_5,negated_conjecture,
~ ( ( aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ! [X1] :
( ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
=> ( aInteger0(X1)
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa)) )
& aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
& sdteqdtlpzmzozddtrp0(X1,xa,xq) ) )
& ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa)) )
| aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(X1,xa,xq) ) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) ) )
& ~ aElementOf0(xb,szAzrzSzezqlpdtcmdtrp0(xa,xq))
& aElementOf0(xb,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
& ? [X1] :
( aInteger0(X1)
& sdtasdt0(xq,X1) = sdtpldt0(xc,smndt0(xb)) )
& aDivisorOf0(xq,sdtpldt0(xc,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xc,xb,xq) )
=> ( ( aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ! [X1] :
( ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
=> ( aInteger0(X1)
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa)) )
& aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
& sdteqdtlpzmzozddtrp0(X1,xa,xq) ) )
& ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa)) )
| aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(X1,xa,xq) ) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) ) ) )
=> ( ~ aElementOf0(xc,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| aElementOf0(xc,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq))) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X8] :
( ~ aInteger0(X5)
| ~ aInteger0(X6)
| ~ aInteger0(X7)
| X7 = sz00
| ~ aInteger0(X8)
| ~ sdteqdtlpzmzozddtrp0(X5,X6,X7)
| ~ sdteqdtlpzmzozddtrp0(X6,X8,X7)
| sdteqdtlpzmzozddtrp0(X5,X8,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEquModTrn])]) ).
fof(c_0_7,negated_conjecture,
! [X3,X3,X5,X7,X7,X9] :
( aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ( aInteger0(X3)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( aInteger0(esk1_1(X3))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( sdtasdt0(xq,esk1_1(X3)) = sdtpldt0(X3,smndt0(xa))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( aDivisorOf0(xq,sdtpldt0(X3,smndt0(xa)))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( sdteqdtlpzmzozddtrp0(X3,xa,xq)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( ~ aInteger0(X5)
| sdtasdt0(xq,X5) != sdtpldt0(X3,smndt0(xa))
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( ~ aDivisorOf0(xq,sdtpldt0(X3,smndt0(xa)))
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( ~ sdteqdtlpzmzozddtrp0(X3,xa,xq)
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ~ aElementOf0(xb,szAzrzSzezqlpdtcmdtrp0(xa,xq))
& aElementOf0(xb,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
& aInteger0(esk2_0)
& sdtasdt0(xq,esk2_0) = sdtpldt0(xc,smndt0(xb))
& aDivisorOf0(xq,sdtpldt0(xc,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xc,xb,xq)
& aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ( aInteger0(X7)
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( aInteger0(esk3_1(X7))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( sdtasdt0(xq,esk3_1(X7)) = sdtpldt0(X7,smndt0(xa))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( aDivisorOf0(xq,sdtpldt0(X7,smndt0(xa)))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( sdteqdtlpzmzozddtrp0(X7,xa,xq)
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( ~ aInteger0(X9)
| sdtasdt0(xq,X9) != sdtpldt0(X7,smndt0(xa))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( ~ aDivisorOf0(xq,sdtpldt0(X7,smndt0(xa)))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( ~ sdteqdtlpzmzozddtrp0(X7,xa,xq)
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& aElementOf0(xc,szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ~ aElementOf0(xc,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq))) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])])])])]) ).
fof(c_0_8,plain,
! [X4,X5,X6] :
( ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| X6 = sz00
| ~ sdteqdtlpzmzozddtrp0(X4,X5,X6)
| sdteqdtlpzmzozddtrp0(X5,X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEquModSym])]) ).
cnf(c_0_9,plain,
( sdteqdtlpzmzozddtrp0(X1,X2,X3)
| X3 = sz00
| ~ sdteqdtlpzmzozddtrp0(X4,X2,X3)
| ~ sdteqdtlpzmzozddtrp0(X1,X4,X3)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X4)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( sdteqdtlpzmzozddtrp0(X1,xa,xq)
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[m__1962]) ).
cnf(c_0_12,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[m__1962]) ).
cnf(c_0_13,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[m__1962]) ).
cnf(c_0_14,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( sdteqdtlpzmzozddtrp0(X1,X2,X3)
| X3 = sz00
| ~ sdteqdtlpzmzozddtrp0(X2,X1,X3)
| ~ aInteger0(X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
sdteqdtlpzmzozddtrp0(xc,xb,xq),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,hypothesis,
aInteger0(xc),
inference(split_conjunct,[status(thm)],[m__2010]) ).
cnf(c_0_18,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[m__2010]) ).
cnf(c_0_19,negated_conjecture,
( sdteqdtlpzmzozddtrp0(X1,xa,xq)
| ~ aElementOf0(X2,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| ~ sdteqdtlpzmzozddtrp0(X1,X2,xq)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),c_0_13]),c_0_14]) ).
cnf(c_0_20,negated_conjecture,
sdteqdtlpzmzozddtrp0(xb,xc,xq),
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_15,c_0_16]),c_0_11]),c_0_17]),c_0_18])]),c_0_13]) ).
cnf(c_0_21,negated_conjecture,
aElementOf0(xc,szAzrzSzezqlpdtcmdtrp0(xa,xq)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| ~ aInteger0(X1)
| ~ sdteqdtlpzmzozddtrp0(X1,xa,xq) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
sdteqdtlpzmzozddtrp0(xb,xa,xq),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
~ aElementOf0(xb,szAzrzSzezqlpdtcmdtrp0(xa,xq)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM443+4 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 8 02:39:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.024 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 26
% 0.23/1.41 # Proof object clause steps : 17
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 13
% 0.23/1.41 # Proof object clause conjectures : 10
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 13
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 4
% 0.23/1.41 # Proof object simplifying inferences : 16
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 43
% 0.23/1.41 # Removed by relevancy pruning/SinE : 11
% 0.23/1.41 # Initial clauses : 108
% 0.23/1.41 # Removed in clause preprocessing : 3
% 0.23/1.41 # Initial clauses in saturation : 105
% 0.23/1.41 # Processed clauses : 137
% 0.23/1.41 # ...of these trivial : 7
% 0.23/1.41 # ...subsumed : 16
% 0.23/1.41 # ...remaining for further processing : 114
% 0.23/1.41 # Other redundant clauses eliminated : 1
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 2
% 0.23/1.41 # Generated clauses : 347
% 0.23/1.41 # ...of the previous two non-trivial : 296
% 0.23/1.41 # Contextual simplify-reflections : 5
% 0.23/1.41 # Paramodulations : 338
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 9
% 0.23/1.41 # Current number of processed clauses : 112
% 0.23/1.41 # Positive orientable unit clauses : 21
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 3
% 0.23/1.41 # Non-unit-clauses : 88
% 0.23/1.41 # Current number of unprocessed clauses: 264
% 0.23/1.41 # ...number of literals in the above : 1518
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 2
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 1483
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 363
% 0.23/1.41 # Non-unit clause-clause subsumptions : 16
% 0.23/1.41 # Unit Clause-clause subsumption calls : 31
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 2
% 0.23/1.41 # BW rewrite match successes : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 14104
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.053 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.057 s
% 0.23/1.41 # Maximum resident set size: 3772 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
%------------------------------------------------------------------------------