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

% Computer : n005.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:39 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f51,axiom,
    ( mtvisible(c_tptp_member3356_mt)
   => marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f1132,conjecture,
    ? [X] :
      ( mtvisible(c_tptp_member3356_mt)
     => marriagelicensedocument(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f1133,negated_conjecture,
    ~ ? [X] :
        ( mtvisible(c_tptp_member3356_mt)
       => marriagelicensedocument(X) ),
    inference(negated_conjecture,[status(cth)],[f1132]) ).

fof(f1209,plain,
    ( ~ mtvisible(c_tptp_member3356_mt)
    | marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    inference(pre_NNF_transformation,[status(esa)],[f51]) ).

fof(f1210,plain,
    ( ~ mtvisible(c_tptp_member3356_mt)
    | marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    inference(cnf_transformation,[status(esa)],[f1209]) ).

fof(f3204,plain,
    ! [X] :
      ( mtvisible(c_tptp_member3356_mt)
      & ~ marriagelicensedocument(X) ),
    inference(pre_NNF_transformation,[status(esa)],[f1133]) ).

fof(f3205,plain,
    ( mtvisible(c_tptp_member3356_mt)
    & ! [X] : ~ marriagelicensedocument(X) ),
    inference(miniscoping,[status(esa)],[f3204]) ).

fof(f3206,plain,
    mtvisible(c_tptp_member3356_mt),
    inference(cnf_transformation,[status(esa)],[f3205]) ).

fof(f3207,plain,
    ! [X0] : ~ marriagelicensedocument(X0),
    inference(cnf_transformation,[status(esa)],[f3205]) ).

fof(f3226,plain,
    ( spl0_5
  <=> mtvisible(c_tptp_member3356_mt) ),
    introduced(split_symbol_definition) ).

fof(f3228,plain,
    ( ~ mtvisible(c_tptp_member3356_mt)
    | spl0_5 ),
    inference(component_clause,[status(thm)],[f3226]) ).

fof(f3229,plain,
    ( spl0_6
  <=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    introduced(split_symbol_definition) ).

fof(f3230,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ spl0_6 ),
    inference(component_clause,[status(thm)],[f3229]) ).

fof(f3232,plain,
    ( ~ spl0_5
    | spl0_6 ),
    inference(split_clause,[status(thm)],[f1210,f3226,f3229]) ).

fof(f3488,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[status(thm)],[f3228,f3206]) ).

fof(f3489,plain,
    spl0_5,
    inference(contradiction_clause,[status(thm)],[f3488]) ).

fof(f3490,plain,
    ( $false
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[status(thm)],[f3230,f3207]) ).

fof(f3491,plain,
    ~ spl0_6,
    inference(contradiction_clause,[status(thm)],[f3490]) ).

fof(f3492,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f3232,f3489,f3491]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07  % Problem  : CSR051+2 : TPTP v8.1.2. Released v3.4.0.
% 0.02/0.07  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.25  % Computer : n005.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit : 300
% 0.06/0.25  % WCLimit  : 300
% 0.06/0.25  % DateTime : Mon Apr 29 23:51:56 EDT 2024
% 0.06/0.25  % CPUTime  : 
% 0.10/0.27  % Drodi V3.6.0
% 0.10/0.27  % Refutation found
% 0.10/0.27  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.27  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.28  % Elapsed time: 0.025617 seconds
% 0.10/0.28  % CPU time: 0.037907 seconds
% 0.10/0.28  % Total memory used: 19.046 MB
% 0.10/0.28  % Net memory used: 19.014 MB
%------------------------------------------------------------------------------