↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n013.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:11 PM UTC 2026

% Result   : Theorem 0.13s 0.40s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   67 (   8 unt;  11 def)
%            Number of atoms       :  203 (  24 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  225 (  89   ~;  94   |;  24   &)
%                                         (  14 <=>;   3  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   14 (  12 usr;  12 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   51 (  44   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [B,C] : subset(B,union(B,C)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f5,axiom,
    ! [B,C] :
      ( B = C
    <=> ( subset(C,B)
        & subset(B,C) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f6,axiom,
    ! [B,C] : union(B,C) = union(C,B),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,conjecture,
    ! [B,C,D] :
      ( B = union(C,D)
    <=> ( ! [E] :
            ( ( subset(D,E)
              & subset(C,E) )
           => subset(B,E) )
        & subset(D,B)
        & subset(C,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,negated_conjecture,
    ~ ! [B,C,D] :
        ( B = union(C,D)
      <=> ( ! [E] :
              ( ( subset(D,E)
                & subset(C,E) )
             => subset(B,E) )
          & subset(D,B)
          & subset(C,B) ) ),
    inference(negated_conjecture,[status(cth)],[f9]) ).

fof(f11,plain,
    ! [X0,X1] : subset(X0,union(X0,X1)),
    inference(cnf_transformation,[status(thm)],[f1]) ).

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

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

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

fof(f27,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)],[f26]) ).

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

fof(f31,plain,
    ! [X0,X1] : union(X0,X1) = union(X1,X0),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f40,plain,
    ? [B,C,D] :
      ( B = union(C,D)
    <~> ( ! [E] :
            ( subset(B,E)
            | ~ subset(D,E)
            | ~ subset(C,E) )
        & subset(D,B)
        & subset(C,B) ) ),
    inference(pre_NNF_transformation,[status(thm)],[f10]) ).

fof(f41,plain,
    ? [B,C,D] :
      ( ( ? [E] :
            ( ~ subset(B,E)
            & subset(D,E)
            & subset(C,E) )
        | ~ subset(D,B)
        | ~ subset(C,B)
        | B != union(C,D) )
      & ( ( ! [E] :
              ( subset(B,E)
              | ~ subset(D,E)
              | ~ subset(C,E) )
          & subset(D,B)
          & subset(C,B) )
        | B = union(C,D) ) ),
    inference(NNF_transformation,[status(thm)],[f40]) ).

fof(f42,plain,
    ( ( ( ~ subset(sK2_skl,sK5_skl)
        & subset(sK4_skl,sK5_skl)
        & subset(sK3_skl,sK5_skl) )
      | ~ subset(sK4_skl,sK2_skl)
      | ~ subset(sK3_skl,sK2_skl)
      | sK2_skl != union(sK3_skl,sK4_skl) )
    & ( ( ! [E] :
            ( subset(sK2_skl,E)
            | ~ subset(sK4_skl,E)
            | ~ subset(sK3_skl,E) )
        & subset(sK4_skl,sK2_skl)
        & subset(sK3_skl,sK2_skl) )
      | sK2_skl = union(sK3_skl,sK4_skl) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl,sK4_skl,sK5_skl]),skolemize(B,sK2_skl),skolemize(C,sK3_skl),skolemize(D,sK4_skl),skolemize(E,sK5_skl)],[f41]) ).

fof(f43,plain,
    ( subset(sK3_skl,sK2_skl)
    | sK2_skl = union(sK3_skl,sK4_skl) ),
    inference(cnf_transformation,[status(thm)],[f42]) ).

fof(f44,plain,
    ( subset(sK4_skl,sK2_skl)
    | sK2_skl = union(sK3_skl,sK4_skl) ),
    inference(cnf_transformation,[status(thm)],[f42]) ).

fof(f45,plain,
    ! [X0] :
      ( subset(sK2_skl,X0)
      | ~ subset(sK4_skl,X0)
      | ~ subset(sK3_skl,X0)
      | sK2_skl = union(sK3_skl,sK4_skl) ),
    inference(cnf_transformation,[status(thm)],[f42]) ).

fof(f46,plain,
    ( subset(sK3_skl,sK5_skl)
    | ~ subset(sK4_skl,sK2_skl)
    | ~ subset(sK3_skl,sK2_skl)
    | sK2_skl != union(sK3_skl,sK4_skl) ),
    inference(cnf_transformation,[status(thm)],[f42]) ).

fof(f47,plain,
    ( subset(sK4_skl,sK5_skl)
    | ~ subset(sK4_skl,sK2_skl)
    | ~ subset(sK3_skl,sK2_skl)
    | sK2_skl != union(sK3_skl,sK4_skl) ),
    inference(cnf_transformation,[status(thm)],[f42]) ).

fof(f48,plain,
    ( ~ subset(sK2_skl,sK5_skl)
    | ~ subset(sK4_skl,sK2_skl)
    | ~ subset(sK3_skl,sK2_skl)
    | sK2_skl != union(sK3_skl,sK4_skl) ),
    inference(cnf_transformation,[status(thm)],[f42]) ).

fof(f49,definition,
    ( sQ0_spl
  <=> sK2_skl = union(sK3_skl,sK4_skl) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f50,plain,
    ( ~ sQ0_spl
    | sK2_skl = union(sK3_skl,sK4_skl) ),
    inference(component_clause,[status(thm)],[f49]) ).

fof(f51,plain,
    ( sQ0_spl
    | sK2_skl != union(sK3_skl,sK4_skl) ),
    inference(component_clause,[status(thm)],[f49]) ).

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

fof(f55,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f43,f49,f52]) ).

fof(f56,definition,
    ( sQ2_spl
  <=> subset(sK4_skl,sK2_skl) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f59,plain,
    ( sQ2_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f44,f49,f56]) ).

fof(f60,definition,
    ! [X0] :
      ( sQ3_spl
    <=> ( subset(sK2_skl,X0)
        | ~ subset(sK4_skl,X0)
        | ~ subset(sK3_skl,X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f61,plain,
    ! [X0] :
      ( ~ sQ3_spl
      | subset(sK2_skl,X0)
      | ~ subset(sK4_skl,X0)
      | ~ subset(sK3_skl,X0) ),
    inference(component_clause,[status(thm)],[f60]) ).

fof(f63,plain,
    ( sQ3_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f45,f49,f60]) ).

fof(f64,definition,
    ( sQ4_spl
  <=> subset(sK3_skl,sK5_skl) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f67,plain,
    ( sQ4_spl
    | ~ sQ2_spl
    | ~ sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f46,f49,f52,f56,f64]) ).

fof(f68,definition,
    ( sQ5_spl
  <=> subset(sK4_skl,sK5_skl) ),
    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).

fof(f71,plain,
    ( sQ5_spl
    | ~ sQ2_spl
    | ~ sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f47,f49,f52,f56,f68]) ).

fof(f72,definition,
    ( sQ6_spl
  <=> subset(sK2_skl,sK5_skl) ),
    introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).

fof(f74,plain,
    ( sQ6_spl
    | ~ subset(sK2_skl,sK5_skl) ),
    inference(component_clause,[status(thm)],[f72]) ).

fof(f75,plain,
    ( ~ sQ6_spl
    | ~ sQ2_spl
    | ~ sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f48,f49,f52,f56,f72]) ).

fof(f78,plain,
    ( ~ sQ3_spl
    | sQ6_spl
    | ~ subset(sK4_skl,sK5_skl)
    | ~ subset(sK3_skl,sK5_skl) ),
    inference(resolution,[status(thm)],[f74,f61]) ).

fof(f79,plain,
    ( ~ sQ3_spl
    | sQ6_spl
    | ~ sQ5_spl
    | ~ sQ4_spl ),
    inference(split_clause,[status(thm)],[f78,f64,f68,f72,f60]) ).

fof(f82,plain,
    ! [X0] :
      ( ~ sQ0_spl
      | subset(sK2_skl,X0)
      | ~ subset(sK4_skl,X0)
      | ~ subset(sK3_skl,X0) ),
    inference(paramodulation,[status(thm)],[f50,f13]) ).

fof(f83,plain,
    ( ~ sQ0_spl
    | subset(sK3_skl,sK2_skl) ),
    inference(paramodulation,[status(thm)],[f50,f11]) ).

fof(f84,plain,
    ( ~ sQ0_spl
    | sQ1_spl ),
    inference(split_clause,[status(thm)],[f83,f52,f49]) ).

fof(f92,plain,
    ! [X0,X1] : subset(X0,union(X1,X0)),
    inference(paramodulation,[status(thm)],[f31,f11]) ).

fof(f99,plain,
    ( sQ0_spl
    | ~ subset(union(sK3_skl,sK4_skl),sK2_skl)
    | ~ subset(sK2_skl,union(sK3_skl,sK4_skl)) ),
    inference(resolution,[status(thm)],[f30,f51]) ).

fof(f101,definition,
    ( sQ7_spl
  <=> subset(sK2_skl,union(sK3_skl,sK4_skl)) ),
    introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).

fof(f103,plain,
    ( sQ7_spl
    | ~ subset(sK2_skl,union(sK3_skl,sK4_skl)) ),
    inference(component_clause,[status(thm)],[f101]) ).

fof(f104,definition,
    ( sQ8_spl
  <=> subset(union(sK3_skl,sK4_skl),sK2_skl) ),
    introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).

fof(f106,plain,
    ( sQ8_spl
    | ~ subset(union(sK3_skl,sK4_skl),sK2_skl) ),
    inference(component_clause,[status(thm)],[f104]) ).

fof(f107,plain,
    ( sQ0_spl
    | ~ sQ8_spl
    | ~ sQ7_spl ),
    inference(split_clause,[status(thm)],[f99,f101,f104,f49]) ).

fof(f109,plain,
    ( ~ sQ3_spl
    | sQ7_spl
    | ~ subset(sK4_skl,union(sK3_skl,sK4_skl))
    | ~ subset(sK3_skl,union(sK3_skl,sK4_skl)) ),
    inference(resolution,[status(thm)],[f103,f61]) ).

fof(f110,definition,
    ( sQ9_spl
  <=> subset(sK3_skl,union(sK3_skl,sK4_skl)) ),
    introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).

fof(f112,plain,
    ( sQ9_spl
    | ~ subset(sK3_skl,union(sK3_skl,sK4_skl)) ),
    inference(component_clause,[status(thm)],[f110]) ).

fof(f113,definition,
    ( sQ10_spl
  <=> subset(sK4_skl,union(sK3_skl,sK4_skl)) ),
    introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).

fof(f115,plain,
    ( sQ10_spl
    | ~ subset(sK4_skl,union(sK3_skl,sK4_skl)) ),
    inference(component_clause,[status(thm)],[f113]) ).

fof(f116,plain,
    ( ~ sQ3_spl
    | sQ7_spl
    | ~ sQ10_spl
    | ~ sQ9_spl ),
    inference(split_clause,[status(thm)],[f109,f110,f113,f101,f60]) ).

fof(f117,plain,
    ( sQ10_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f115,f92]) ).

fof(f118,plain,
    sQ10_spl,
    inference(contradiction_clause,[status(thm)],[f117]) ).

fof(f119,plain,
    ( sQ9_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f112,f11]) ).

fof(f120,plain,
    sQ9_spl,
    inference(contradiction_clause,[status(thm)],[f119]) ).

fof(f121,plain,
    ( ~ sQ0_spl
    | sQ3_spl ),
    inference(split_clause,[status(thm)],[f82,f60,f49]) ).

fof(f131,plain,
    ( ~ sQ0_spl
    | subset(sK4_skl,sK2_skl) ),
    inference(paramodulation,[status(thm)],[f50,f92]) ).

fof(f136,plain,
    ( ~ sQ0_spl
    | sQ2_spl ),
    inference(split_clause,[status(thm)],[f131,f56,f49]) ).

fof(f141,plain,
    ( sQ8_spl
    | ~ subset(sK4_skl,sK2_skl)
    | ~ subset(sK3_skl,sK2_skl) ),
    inference(resolution,[status(thm)],[f106,f13]) ).

fof(f142,plain,
    ( sQ8_spl
    | ~ sQ2_spl
    | ~ sQ1_spl ),
    inference(split_clause,[status(thm)],[f141,f52,f56,f104]) ).

fof(f143,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f55,f59,f63,f67,f71,f75,f79,f84,f107,f116,f118,f120,f121,f136,f142]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET597+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n013.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 05:27:36 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.13/0.40  % Refutation found
% 0.13/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.42  % Elapsed time: 0.061969 seconds
% 0.13/0.42  % CPU time: 0.160960 seconds
% 0.13/0.42  % Total memory used: 102.123 MB
% 0.13/0.42  % Net memory used: 101.743 MB
%------------------------------------------------------------------------------