%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : CSR032+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% 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  : 300s
% DateTime : Fri May  3 02:11:12 EDT 2024

% Result   : Theorem 0.37s 1.08s
% Output   : CNFRefutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   7 unt;   0 def)
%            Number of atoms       :   27 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   19 (   9   ~;   4   |;   1   &)
%                                         (   0 <=>;   5  =>;   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   :   12 (   1 sgn   6   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    individual(f_citynamedfn(s_agen,c_france)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',just1) ).

fof(f57,axiom,
    ! [X9] :
      ( individual(X9)
     => isa(X9,c_individual) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',just57) ).

fof(f68,conjecture,
    ? [X16] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
     => isa(f_citynamedfn(s_agen,c_france),X16) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query32) ).

fof(f69,negated_conjecture,
    ~ ? [X16] :
        ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
       => isa(f_citynamedfn(s_agen,c_france),X16) ),
    inference(negated_conjecture,[],[f68]) ).

fof(f113,plain,
    ! [X0] :
      ( individual(X0)
     => isa(X0,c_individual) ),
    inference(rectify,[],[f57]) ).

fof(f123,plain,
    ~ ? [X0] :
        ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
       => isa(f_citynamedfn(s_agen,c_france),X0) ),
    inference(rectify,[],[f69]) ).

fof(f186,plain,
    ! [X0] :
      ( isa(X0,c_individual)
      | ~ individual(X0) ),
    inference(ennf_transformation,[],[f113]) ).

fof(f193,plain,
    ! [X0] :
      ( ~ isa(f_citynamedfn(s_agen,c_france),X0)
      & mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
    inference(ennf_transformation,[],[f123]) ).

fof(f194,plain,
    individual(f_citynamedfn(s_agen,c_france)),
    inference(cnf_transformation,[],[f1]) ).

fof(f248,plain,
    ! [X0] :
      ( isa(X0,c_individual)
      | ~ individual(X0) ),
    inference(cnf_transformation,[],[f186]) ).

fof(f256,plain,
    ! [X0] : ~ isa(f_citynamedfn(s_agen,c_france),X0),
    inference(cnf_transformation,[],[f193]) ).

cnf(c_49,plain,
    individual(f_citynamedfn(s_agen,c_france)),
    inference(cnf_transformation,[],[f194]) ).

cnf(c_103,plain,
    ( ~ individual(X0)
    | isa(X0,c_individual) ),
    inference(cnf_transformation,[],[f248]) ).

cnf(c_110,negated_conjecture,
    ~ isa(f_citynamedfn(s_agen,c_france),X0),
    inference(cnf_transformation,[],[f256]) ).

cnf(c_155,plain,
    ( ~ individual(X0)
    | isa(X0,c_individual) ),
    inference(prop_impl_just,[status(thm)],[c_103]) ).

cnf(c_536,plain,
    isa(f_citynamedfn(s_agen,c_france),c_individual),
    inference(resolution,[status(thm)],[c_49,c_155]) ).

cnf(c_539,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_536,c_110]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08  % Problem  : CSR032+1 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.09  % Command  : run_iprover %s %d THM
% 0.08/0.28  % Computer : n027.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 300
% 0.08/0.28  % DateTime : Thu May  2 23:38:20 EDT 2024
% 0.08/0.29  % CPUTime  : 
% 0.12/0.40  Running first-order theorem proving
% 0.12/0.40  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.37/1.08  % SZS status Started for theBenchmark.p
% 0.37/1.08  % SZS status Theorem for theBenchmark.p
% 0.37/1.08  
% 0.37/1.08  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.37/1.08  
% 0.37/1.08  ------  iProver source info
% 0.37/1.08  
% 0.37/1.08  git: date: 2024-05-02 19:28:25 +0000
% 0.37/1.08  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.37/1.08  git: non_committed_changes: false
% 0.37/1.08  
% 0.37/1.08  ------ Parsing...
% 0.37/1.08  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.37/1.08  
% 0.37/1.08  ------ Preprocessing... sf_s  rm: 24 0s  sf_e  pe_s  pe:1:0s pe:2:0s
% 0.37/1.08  
% 0.37/1.08  % SZS status Theorem for theBenchmark.p
% 0.37/1.08  
% 0.37/1.08  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.37/1.08  
% 0.37/1.08  
%------------------------------------------------------------------------------