↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : CSR051+4 : TPTP v9.3.1. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:13:11 PM UTC 2026

% Result   : Theorem 8.73s 2.98s
% Output   : CNFRefutation 8.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   5 unt;   2 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/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

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

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

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

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

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

fof(f114085,definition,
    ( sQ868_spl
  <=> mtvisible(c_tptp_member3356_mt) ),
    introduced(definition,[new_symbols(definition,[sQ868_spl])],[split_symbol_definition]) ).

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

fof(f114088,definition,
    ( sQ869_spl
  <=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    introduced(definition,[new_symbols(definition,[sQ869_spl])],[split_symbol_definition]) ).

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

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

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

fof(f118469,plain,
    sQ868_spl,
    inference(contradiction_clause,[status(thm)],[f118468]) ).

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

fof(f118471,plain,
    ~ sQ869_spl,
    inference(contradiction_clause,[status(thm)],[f118470]) ).

fof(f118472,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f114091,f118469,f118471]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR051+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n009.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 14:36:12 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 1.05/1.30  % Drodi V4.1.1
% 8.73/2.98  % Refutation found
% 8.73/2.98  % SZS status Theorem for theBenchmark: Theorem is valid
% 8.73/2.98  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 2.66/3.07  % Elapsed time: 2.646077 seconds
% 2.66/3.07  % CPU time: 12.218135 seconds
% 2.66/3.07  % Total memory used: 1.910 GB
% 2.66/3.07  % Net memory used: 1.905 GB
%------------------------------------------------------------------------------