↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SET589+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 : 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 02:10:09 PM UTC 2026

% Result   : Theorem 0.10s 0.39s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   32 (   6 unt;   2 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   60 (  26   ~;  20   |;   7   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   50 (  46   !;   4   ?)

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

fof(f2,axiom,
    ! [B,C,D] :
      ( subset(B,C)
     => subset(difference(B,D),difference(C,D)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [B,C,D] :
      ( subset(B,C)
     => subset(difference(D,C),difference(D,B)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f8,negated_conjecture,
    ~ ! [B,C,D,E] :
        ( ( subset(D,E)
          & subset(B,C) )
       => subset(difference(B,E),difference(C,D)) ),
    inference(negated_conjecture,[status(cth)],[f7]) ).

fof(f9,plain,
    ! [B,C,D] :
      ( subset(B,D)
      | ~ subset(C,D)
      | ~ subset(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f1]) ).

fof(f10,plain,
    ! [B,D] :
      ( subset(B,D)
      | ! [C] :
          ( ~ subset(C,D)
          | ~ subset(B,C) ) ),
    inference(miniscoping,[status(thm)],[f9]) ).

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

fof(f12,plain,
    ! [B,C,D] :
      ( subset(difference(B,D),difference(C,D))
      | ~ subset(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f13,plain,
    ! [B,C] :
      ( ! [D] : subset(difference(B,D),difference(C,D))
      | ~ subset(B,C) ),
    inference(miniscoping,[status(thm)],[f12]) ).

fof(f14,plain,
    ! [X0,X1,X2] :
      ( subset(difference(X0,X2),difference(X1,X2))
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f15,plain,
    ! [B,C,D] :
      ( subset(difference(D,C),difference(D,B))
      | ~ subset(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f3]) ).

fof(f16,plain,
    ! [B,C] :
      ( ! [D] : subset(difference(D,C),difference(D,B))
      | ~ subset(B,C) ),
    inference(miniscoping,[status(thm)],[f15]) ).

fof(f17,plain,
    ! [X0,X1,X2] :
      ( subset(difference(X2,X1),difference(X2,X0))
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f16]) ).

fof(f31,plain,
    ? [B,C,D,E] :
      ( ~ subset(difference(B,E),difference(C,D))
      & subset(D,E)
      & subset(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f8]) ).

fof(f32,plain,
    ( ~ subset(difference(sK1_skl,sK4_skl),difference(sK2_skl,sK3_skl))
    & subset(sK3_skl,sK4_skl)
    & subset(sK1_skl,sK2_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl,sK2_skl,sK3_skl,sK4_skl]),skolemize(B,sK1_skl),skolemize(C,sK2_skl),skolemize(D,sK3_skl),skolemize(E,sK4_skl)],[f31]) ).

fof(f33,plain,
    subset(sK1_skl,sK2_skl),
    inference(cnf_transformation,[status(thm)],[f32]) ).

fof(f34,plain,
    subset(sK3_skl,sK4_skl),
    inference(cnf_transformation,[status(thm)],[f32]) ).

fof(f35,plain,
    ~ subset(difference(sK1_skl,sK4_skl),difference(sK2_skl,sK3_skl)),
    inference(cnf_transformation,[status(thm)],[f32]) ).

fof(f36,plain,
    ! [X0] :
      ( ~ subset(X0,difference(sK2_skl,sK3_skl))
      | ~ subset(difference(sK1_skl,sK4_skl),X0) ),
    inference(resolution,[status(thm)],[f11,f35]) ).

fof(f37,plain,
    ! [X0] :
      ( ~ subset(X0,sK4_skl)
      | ~ subset(difference(sK1_skl,X0),difference(sK2_skl,sK3_skl)) ),
    inference(resolution,[status(thm)],[f36,f17]) ).

fof(f41,plain,
    ( ~ subset(sK1_skl,sK2_skl)
    | ~ subset(sK3_skl,sK4_skl) ),
    inference(resolution,[status(thm)],[f37,f14]) ).

fof(f43,definition,
    ( sQ0_spl
  <=> subset(sK3_skl,sK4_skl) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f45,plain,
    ( sQ0_spl
    | ~ subset(sK3_skl,sK4_skl) ),
    inference(component_clause,[status(thm)],[f43]) ).

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

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

fof(f49,plain,
    ( ~ sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f41,f43,f46]) ).

fof(f50,plain,
    ( sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f45,f34]) ).

fof(f51,plain,
    sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f50]) ).

fof(f52,plain,
    ( sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f48,f33]) ).

fof(f53,plain,
    sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f52]) ).

fof(f54,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f49,f51,f53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET589+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 05:27:43 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.10/0.39  % Refutation found
% 0.10/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.42  % Elapsed time: 0.043937 seconds
% 0.10/0.42  % CPU time: 0.108527 seconds
% 0.10/0.42  % Total memory used: 16.776 MB
% 0.10/0.42  % Net memory used: 16.294 MB
%------------------------------------------------------------------------------