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

% Computer : n026.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:42 EDT 2022

% Result   : Theorem 7.47s 2.43s
% Output   : CNFRefutation 7.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    7 (   5 unt;   0 nHn;   7 RR)
%            Number of literals    :    9 (   0 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :    4 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_57,plain,
    ( isa(X1,c_individual)
    | ~ individual(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hctu_9h3/lgb.p',i_0_57) ).

cnf(i_0_1,plain,
    individual(f_citynamedfn(s_agen,c_france)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hctu_9h3/lgb.p',i_0_1) ).

cnf(i_0_68,negated_conjecture,
    ~ isa(f_citynamedfn(s_agen,c_france),X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hctu_9h3/lgb.p',i_0_68) ).

cnf(c_0_72,plain,
    ( isa(X1,c_individual)
    | ~ individual(X1) ),
    i_0_57 ).

cnf(c_0_73,plain,
    individual(f_citynamedfn(s_agen,c_france)),
    i_0_1 ).

cnf(c_0_74,negated_conjecture,
    ~ isa(f_citynamedfn(s_agen,c_france),X1),
    i_0_68 ).

cnf(c_0_75,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : CSR032+1 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun 11 03:25:05 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.47/2.43  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.47/2.43  # No SInE strategy applied
% 7.47/2.43  # Trying AutoSched0 for 150 seconds
% 7.47/2.43  # AutoSched0-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.47/2.43  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.47/2.43  #
% 7.47/2.43  # Preprocessing time       : 0.023 s
% 7.47/2.43  
% 7.47/2.43  # Proof found!
% 7.47/2.43  # SZS status Theorem
% 7.47/2.43  # SZS output start CNFRefutation
% See solution above
% 7.47/2.43  # Training examples: 0 positive, 0 negative
% 7.47/2.43  
% 7.47/2.43  # -------------------------------------------------
% 7.47/2.43  # User time                : 0.025 s
% 7.47/2.43  # System time              : 0.006 s
% 7.47/2.43  # Total time               : 0.030 s
% 7.47/2.43  # Maximum resident set size: 7124 pages
% 7.47/2.43  
%------------------------------------------------------------------------------