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

View Problem - Process Solution

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

% Computer : n010.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:40 EDT 2024

% Result   : Theorem 4.84s 1.54s
% Output   : CNFRefutation 4.84s
% 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(f12494,axiom,
    ( mtvisible(c_tptp_member3356_mt)
   => marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

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

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

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

fof(f110740,plain,
    mtvisible(c_tptp_member3356_mt),
    inference(cnf_transformation,[status(esa)],[f110739]) ).

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

fof(f114085,plain,
    ( spl0_868
  <=> mtvisible(c_tptp_member3356_mt) ),
    introduced(split_symbol_definition) ).

fof(f114087,plain,
    ( ~ mtvisible(c_tptp_member3356_mt)
    | spl0_868 ),
    inference(component_clause,[status(thm)],[f114085]) ).

fof(f114088,plain,
    ( spl0_869
  <=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    introduced(split_symbol_definition) ).

fof(f114089,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ spl0_869 ),
    inference(component_clause,[status(thm)],[f114088]) ).

fof(f114091,plain,
    ( ~ spl0_868
    | spl0_869 ),
    inference(split_clause,[status(thm)],[f59892,f114085,f114088]) ).

fof(f118257,plain,
    ( $false
    | spl0_868 ),
    inference(forward_subsumption_resolution,[status(thm)],[f114087,f110740]) ).

fof(f118258,plain,
    spl0_868,
    inference(contradiction_clause,[status(thm)],[f118257]) ).

fof(f118259,plain,
    ( $false
    | ~ spl0_869 ),
    inference(forward_subsumption_resolution,[status(thm)],[f114089,f110741]) ).

fof(f118260,plain,
    ~ spl0_869,
    inference(contradiction_clause,[status(thm)],[f118259]) ).

fof(f118261,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f114091,f118258,f118260]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : CSR051+4 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n010.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Apr 29 23:27:05 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.75/0.98  % Drodi V3.6.0
% 4.84/1.54  % Refutation found
% 4.84/1.54  % SZS status Theorem for theBenchmark: Theorem is valid
% 4.84/1.54  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 6.21/1.70  % Elapsed time: 1.307698 seconds
% 6.21/1.70  % CPU time: 3.734643 seconds
% 6.21/1.70  % Total memory used: 1.841 GB
% 6.21/1.70  % Net memory used: 1.830 GB
%------------------------------------------------------------------------------