↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SET583+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n007.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 02:10:08 PM UTC 2026

% Result   : Theorem 0.09s 0.39s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   6 unt;   2 def)
%            Number of atoms       :   52 (  14 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   48 (  18   ~;  14   |;  11   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   16 (  14   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [B,C] :
      ( B = C
    <=> ( subset(C,B)
        & subset(B,C) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,conjecture,
    ! [B,C] :
      ( ( subset(C,B)
        & subset(B,C) )
     => B = C ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,negated_conjecture,
    ~ ! [B,C] :
        ( ( subset(C,B)
          & subset(B,C) )
       => B = C ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f6,plain,
    ! [B,C] :
      ( ( ~ subset(C,B)
        | ~ subset(B,C)
        | B = C )
      & ( ( subset(C,B)
          & subset(B,C) )
        | B != C ) ),
    inference(NNF_transformation,[status(thm)],[f1]) ).

fof(f7,plain,
    ( ! [B,C] :
        ( ~ subset(C,B)
        | ~ subset(B,C)
        | B = C )
    & ! [B,C] :
        ( ( subset(C,B)
          & subset(B,C) )
        | B != C ) ),
    inference(miniscoping,[status(thm)],[f6]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | ~ subset(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[status(thm)],[f7]) ).

fof(f19,plain,
    ? [B,C] :
      ( B != C
      & subset(C,B)
      & subset(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f5]) ).

fof(f20,plain,
    ( sK1_skl != sK2_skl
    & subset(sK2_skl,sK1_skl)
    & subset(sK1_skl,sK2_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl,sK2_skl]),skolemize(B,sK1_skl),skolemize(C,sK2_skl)],[f19]) ).

fof(f21,plain,
    subset(sK1_skl,sK2_skl),
    inference(cnf_transformation,[status(thm)],[f20]) ).

fof(f22,plain,
    subset(sK2_skl,sK1_skl),
    inference(cnf_transformation,[status(thm)],[f20]) ).

fof(f23,plain,
    sK1_skl != sK2_skl,
    inference(cnf_transformation,[status(thm)],[f20]) ).

fof(f26,plain,
    ( ~ subset(sK1_skl,sK2_skl)
    | sK1_skl = sK2_skl ),
    inference(resolution,[status(thm)],[f10,f22]) ).

fof(f29,definition,
    ( sQ0_spl
  <=> sK1_skl = sK2_skl ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f30,plain,
    ( ~ sQ0_spl
    | sK1_skl = sK2_skl ),
    inference(component_clause,[status(thm)],[f29]) ).

fof(f32,definition,
    ( sQ1_spl
  <=> subset(sK1_skl,sK2_skl) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f34,plain,
    ( sQ1_spl
    | ~ subset(sK1_skl,sK2_skl) ),
    inference(component_clause,[status(thm)],[f32]) ).

fof(f35,plain,
    ( ~ sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f26,f29,f32]) ).

fof(f40,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f30,f23]) ).

fof(f41,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f40]) ).

fof(f42,plain,
    ( sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f34,f21]) ).

fof(f43,plain,
    sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f42]) ).

fof(f44,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f35,f41,f43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET583+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n007.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 05:25:08 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.39  % Refutation found
% 0.09/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.42  % Elapsed time: 0.050672 seconds
% 0.09/0.42  % CPU time: 0.144239 seconds
% 0.09/0.42  % Total memory used: 79.753 MB
% 0.09/0.42  % Net memory used: 79.285 MB
%------------------------------------------------------------------------------