TSTP Solution File: SWV401+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWV401+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n023.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 : Wed Jul 20 18:16:28 EDT 2022

% Result   : Theorem 0.22s 1.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   44 (  13 unt;   0 def)
%            Number of atoms       :  110 (  22 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :  102 (  36   ~;  42   |;  14   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :  123 (  15 sgn  64   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(stricly_smaller_definition,axiom,
    ! [X1,X2] :
      ( strictly_less_than(X1,X2)
    <=> ( less_than(X1,X2)
        & ~ less_than(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).

fof(totality,axiom,
    ! [X1,X2] :
      ( less_than(X1,X2)
      | less_than(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).

fof(ax29,axiom,
    ! [X1,X2,X3,X4] :
      ( strictly_less_than(X4,X3)
     => update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax29) ).

fof(l37_co,conjecture,
    ! [X1] :
      ( ! [X2,X3,X4] :
          ( ( pair_in_list(X1,X2,X3)
            & less_than(X4,X3) )
         => pair_in_list(update_slb(X1,X4),X2,X3) )
     => ! [X5,X6,X7,X8,X9] :
          ( ( pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)
            & less_than(X7,X6) )
         => pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X6) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l37_co) ).

fof(ax30,axiom,
    ! [X1,X2,X3,X4] :
      ( less_than(X3,X4)
     => update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X4)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax30) ).

fof(reflexivity,axiom,
    ! [X1] : less_than(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',reflexivity) ).

fof(ax23,axiom,
    ! [X1,X2,X3,X4,X5] :
      ( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
    <=> ( pair_in_list(X1,X3,X5)
        | ( X2 = X3
          & X4 = X5 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax23) ).

fof(c_0_7,plain,
    ! [X3,X4,X3,X4] :
      ( ( less_than(X3,X4)
        | ~ strictly_less_than(X3,X4) )
      & ( ~ less_than(X4,X3)
        | ~ strictly_less_than(X3,X4) )
      & ( ~ less_than(X3,X4)
        | less_than(X4,X3)
        | strictly_less_than(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)],[inference(fof_simplification,[status(thm)],[stricly_smaller_definition])])])])])]) ).

fof(c_0_8,plain,
    ! [X3,X4] :
      ( less_than(X3,X4)
      | less_than(X4,X3) ),
    inference(variable_rename,[status(thm)],[totality]) ).

fof(c_0_9,plain,
    ! [X5,X6,X7,X8] :
      ( ~ strictly_less_than(X8,X7)
      | update_slb(insert_slb(X5,pair(X6,X8)),X7) = insert_slb(update_slb(X5,X7),pair(X6,X7)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax29])]) ).

cnf(c_0_10,plain,
    ( strictly_less_than(X1,X2)
    | less_than(X2,X1)
    | ~ less_than(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( less_than(X1,X2)
    | less_than(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_12,negated_conjecture,
    ~ ! [X1] :
        ( ! [X2,X3,X4] :
            ( ( pair_in_list(X1,X2,X3)
              & less_than(X4,X3) )
           => pair_in_list(update_slb(X1,X4),X2,X3) )
       => ! [X5,X6,X7,X8,X9] :
            ( ( pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)
              & less_than(X7,X6) )
           => pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X6) ) ),
    inference(assume_negation,[status(cth)],[l37_co]) ).

fof(c_0_13,plain,
    ! [X5,X6,X7,X8] :
      ( ~ less_than(X7,X8)
      | update_slb(insert_slb(X5,pair(X6,X8)),X7) = insert_slb(update_slb(X5,X7),pair(X6,X8)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax30])]) ).

cnf(c_0_14,plain,
    ( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
    | ~ strictly_less_than(X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    ( strictly_less_than(X1,X2)
    | less_than(X2,X1) ),
    inference(csr,[status(thm)],[c_0_10,c_0_11]) ).

fof(c_0_16,plain,
    ! [X2] : less_than(X2,X2),
    inference(variable_rename,[status(thm)],[reflexivity]) ).

fof(c_0_17,plain,
    ! [X6,X7,X8,X9,X10,X6,X7,X8,X9,X10] :
      ( ( X7 = X8
        | pair_in_list(X6,X8,X10)
        | ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
      & ( X9 = X10
        | pair_in_list(X6,X8,X10)
        | ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
      & ( ~ pair_in_list(X6,X8,X10)
        | pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
      & ( X7 != X8
        | X9 != X10
        | pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])])]) ).

fof(c_0_18,negated_conjecture,
    ! [X11,X12,X13] :
      ( ( ~ pair_in_list(esk1_0,X11,X12)
        | ~ less_than(X13,X12)
        | pair_in_list(update_slb(esk1_0,X13),X11,X12) )
      & pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0)
      & less_than(esk4_0,esk3_0)
      & ~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk3_0) ),
    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)],[c_0_12])])])])])]) ).

cnf(c_0_19,plain,
    ( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X3))
    | ~ less_than(X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,plain,
    ( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
    | less_than(X4,X3) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,plain,
    less_than(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_22,plain,
    ( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
    | ~ pair_in_list(X1,X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    ~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_24,plain,
    ( update_slb(insert_slb(X1,pair(X2,X3)),X4) = update_slb(insert_slb(X1,pair(X2,X4)),X4)
    | less_than(X4,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_25,plain,
    ( pair_in_list(update_slb(insert_slb(X1,pair(X2,X3)),X4),X5,X6)
    | ~ pair_in_list(update_slb(X1,X4),X5,X6)
    | ~ less_than(X4,X3) ),
    inference(spm,[status(thm)],[c_0_22,c_0_19]) ).

cnf(c_0_26,negated_conjecture,
    ( less_than(esk4_0,esk6_0)
    | ~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk4_0)),esk4_0),esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk3_0)
    | ~ less_than(esk4_0,esk6_0) ),
    inference(spm,[status(thm)],[c_0_23,c_0_25]) ).

cnf(c_0_28,plain,
    ( pair_in_list(X1,X4,X5)
    | X3 = X5
    | ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_29,negated_conjecture,
    pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_30,negated_conjecture,
    ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk3_0),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_21])]),c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ( pair_in_list(update_slb(esk1_0,X1),X2,X3)
    | ~ less_than(X1,X3)
    | ~ pair_in_list(esk1_0,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_32,negated_conjecture,
    less_than(esk4_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_33,plain,
    ( pair_in_list(X1,X4,X5)
    | X2 = X4
    | ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_34,negated_conjecture,
    ( esk6_0 = esk3_0
    | pair_in_list(esk1_0,esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_35,negated_conjecture,
    ~ pair_in_list(esk1_0,esk2_0,esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).

cnf(c_0_36,negated_conjecture,
    ( esk2_0 = esk5_0
    | pair_in_list(esk1_0,esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_33,c_0_29]) ).

cnf(c_0_37,plain,
    ( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
    | X3 != X5
    | X2 != X4 ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_38,negated_conjecture,
    esk6_0 = esk3_0,
    inference(sr,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    esk2_0 = esk5_0,
    inference(sr,[status(thm)],[c_0_36,c_0_35]) ).

cnf(c_0_40,plain,
    pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])]) ).

cnf(c_0_41,negated_conjecture,
    ~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk3_0)),esk4_0),esk5_0,esk3_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_38]),c_0_39]) ).

cnf(c_0_42,plain,
    ( pair_in_list(update_slb(insert_slb(X1,pair(X2,X3)),X4),X2,X3)
    | ~ less_than(X4,X3) ),
    inference(spm,[status(thm)],[c_0_40,c_0_19]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV401+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n023.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 : Tue Jun 14 18:09:05 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.22/1.41  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.22/1.41  # Preprocessing time       : 0.015 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             : 44
% 0.22/1.41  # Proof object clause steps            : 29
% 0.22/1.41  # Proof object formula steps           : 15
% 0.22/1.41  # Proof object conjectures             : 17
% 0.22/1.41  # Proof object clause conjectures      : 14
% 0.22/1.41  # Proof object formula conjectures     : 3
% 0.22/1.41  # Proof object initial clauses used    : 13
% 0.22/1.41  # Proof object initial formulas used   : 7
% 0.22/1.41  # Proof object generating inferences   : 11
% 0.22/1.41  # Proof object simplifying inferences  : 16
% 0.22/1.41  # Training examples: 0 positive, 0 negative
% 0.22/1.41  # Parsed axioms                        : 19
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.22/1.41  # Initial clauses                      : 29
% 0.22/1.41  # Removed in clause preprocessing      : 0
% 0.22/1.41  # Initial clauses in saturation        : 29
% 0.22/1.41  # Processed clauses                    : 456
% 0.22/1.41  # ...of these trivial                  : 6
% 0.22/1.41  # ...subsumed                          : 120
% 0.22/1.41  # ...remaining for further processing  : 330
% 0.22/1.41  # Other redundant clauses eliminated   : 3
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 16
% 0.22/1.41  # Backward-rewritten                   : 18
% 0.22/1.41  # Generated clauses                    : 9078
% 0.22/1.41  # ...of the previous two non-trivial   : 4922
% 0.22/1.41  # Contextual simplify-reflections      : 71
% 0.22/1.41  # Paramodulations                      : 9041
% 0.22/1.41  # Factorizations                       : 28
% 0.22/1.41  # Equation resolutions                 : 5
% 0.22/1.41  # Current number of processed clauses  : 291
% 0.22/1.41  #    Positive orientable unit clauses  : 82
% 0.22/1.41  #    Positive unorientable unit clauses: 0
% 0.22/1.41  #    Negative unit clauses             : 6
% 0.22/1.41  #    Non-unit-clauses                  : 203
% 0.22/1.41  # Current number of unprocessed clauses: 4043
% 0.22/1.41  # ...number of literals in the above   : 13319
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 36
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 7727
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 6548
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 188
% 0.22/1.41  # Unit Clause-clause subsumption calls : 841
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 3225
% 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          : 171808
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.130 s
% 0.22/1.41  # System time              : 0.003 s
% 0.22/1.41  # Total time               : 0.133 s
% 0.22/1.41  # Maximum resident set size: 7132 pages
% 0.24/23.40  eprover: CPU time limit exceeded, terminating
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.41  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.41  eprover: No such file or directory
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------