TSTP Solution File: CSR032+4 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : CSR032+4 : TPTP v8.1.2. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n024.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 : Tue Apr 30 20:14:26 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f42659,axiom,
    ! [ARG1,ARG2] : city(f_citynamedfn(ARG1,ARG2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f43829,axiom,
    ! [X] :
      ( city(X)
     => isa(X,c_city) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f44217,conjecture,
    ? [COL] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
     => isa(f_citynamedfn(s_agen,c_france),COL) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f44218,negated_conjecture,
    ~ ? [COL] :
        ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
       => isa(f_citynamedfn(s_agen,c_france),COL) ),
    inference(negated_conjecture,[status(cth)],[f44217]) ).

fof(f107690,plain,
    ! [X0,X1] : city(f_citynamedfn(X0,X1)),
    inference(cnf_transformation,[status(esa)],[f42659]) ).

fof(f109996,plain,
    ! [X] :
      ( ~ city(X)
      | isa(X,c_city) ),
    inference(pre_NNF_transformation,[status(esa)],[f43829]) ).

fof(f109997,plain,
    ! [X0] :
      ( ~ city(X0)
      | isa(X0,c_city) ),
    inference(cnf_transformation,[status(esa)],[f109996]) ).

fof(f110738,plain,
    ! [COL] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
      & ~ isa(f_citynamedfn(s_agen,c_france),COL) ),
    inference(pre_NNF_transformation,[status(esa)],[f44218]) ).

fof(f110739,plain,
    ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
    & ! [COL] : ~ isa(f_citynamedfn(s_agen,c_france),COL) ),
    inference(miniscoping,[status(esa)],[f110738]) ).

fof(f110741,plain,
    ! [X0] : ~ isa(f_citynamedfn(s_agen,c_france),X0),
    inference(cnf_transformation,[status(esa)],[f110739]) ).

fof(f118531,plain,
    ~ city(f_citynamedfn(s_agen,c_france)),
    inference(resolution,[status(thm)],[f109997,f110741]) ).

fof(f118532,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f118531,f107690]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR032+4 : TPTP v8.1.2. Released v3.4.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34  % Computer : n024.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  : 300
% 0.12/0.34  % DateTime : Mon Apr 29 23:39:21 EDT 2024
% 0.12/0.35  % CPUTime  : 
% 1.02/1.20  % Drodi V3.6.0
% 53.46/7.90  % Refutation found
% 53.46/7.90  % SZS status Theorem for theBenchmark: Theorem is valid
% 53.46/7.90  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 55.05/8.09  % Elapsed time: 7.692579 seconds
% 55.05/8.09  % CPU time: 52.600874 seconds
% 55.05/8.09  % Total memory used: 1.901 GB
% 55.05/8.09  % Net memory used: 1.891 GB
%------------------------------------------------------------------------------