%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR032+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n021.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 : Fri Jul 15 02:46:43 EDT 2022

% Result   : Theorem 5.00s 2.69s
% Output   : CNFRefutation 5.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   5   ~;   2   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :    7 (   1 sgn   3   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query82,conjecture,
    ? [X22] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
     => isa(f_citynamedfn(s_agen,c_france),X22) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query82) ).

fof(ax1_1014,axiom,
    ! [X13] :
      ( individual(X13)
     => isa(X13,c_individual) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_1014) ).

fof(ax1_318,axiom,
    individual(f_citynamedfn(s_agen,c_france)),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_318) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X22] :
        ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
       => isa(f_citynamedfn(s_agen,c_france),X22) ),
    inference(assume_negation,[status(cth)],[query82]) ).

fof(c_0_4,plain,
    ! [X960] :
      ( ~ individual(X960)
      | isa(X960,c_individual) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1014])]) ).

fof(c_0_5,negated_conjecture,
    ! [X1144] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
      & ~ isa(f_citynamedfn(s_agen,c_france),X1144) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

cnf(c_0_6,plain,
    ( isa(X1,c_individual)
    | ~ individual(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    individual(f_citynamedfn(s_agen,c_france)),
    inference(split_conjunct,[status(thm)],[ax1_318]) ).

cnf(c_0_8,negated_conjecture,
    ~ isa(f_citynamedfn(s_agen,c_france),X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : CSR032+2 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n021.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 Jun 11 11:33:26 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.21/0.49  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.49  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.49  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 5.00/2.69  # ENIGMATIC: Solved by autoschedule:
% 5.00/2.69  # No SInE strategy applied
% 5.00/2.69  # Trying AutoSched0 for 150 seconds
% 5.00/2.69  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S2S
% 5.00/2.69  # and selection function SelectNewComplexAHP.
% 5.00/2.69  #
% 5.00/2.69  # Preprocessing time       : 0.042 s
% 5.00/2.69  
% 5.00/2.69  # Proof found!
% 5.00/2.69  # SZS status Theorem
% 5.00/2.69  # SZS output start CNFRefutation
% See solution above
% 5.00/2.69  # Training examples: 0 positive, 0 negative
% 5.00/2.69  
% 5.00/2.69  # -------------------------------------------------
% 5.00/2.69  # User time                : 0.052 s
% 5.00/2.69  # System time              : 0.008 s
% 5.00/2.69  # Total time               : 0.060 s
% 5.00/2.69  # Maximum resident set size: 7120 pages
% 5.00/2.69  
%------------------------------------------------------------------------------