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

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

% Result   : Theorem 0.10s 0.33s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (   6 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   44 (  18   ~;  15   |;   6   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (  18   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,conjecture,
    ! [A,B,C] :
      ( subset(A,B)
     => ( in(C,A)
        | subset(A,set_difference(B,singleton(C))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f6,negated_conjecture,
    ~ ! [A,B,C] :
        ( subset(A,B)
       => ( in(C,A)
          | subset(A,set_difference(B,singleton(C))) ) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

fof(f7,axiom,
    ! [A,B,C] :
      ( subset(A,B)
     => ( in(C,A)
        | subset(A,set_difference(B,singleton(C))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f16,plain,
    ? [A,B,C] :
      ( subset(A,B)
      & ~ in(C,A)
      & ~ subset(A,set_difference(B,singleton(C))) ),
    inference(pre_NNF_transformation,[status(esa)],[f6]) ).

fof(f17,plain,
    ? [A,B] :
      ( subset(A,B)
      & ? [C] :
          ( ~ in(C,A)
          & ~ subset(A,set_difference(B,singleton(C))) ) ),
    inference(miniscoping,[status(esa)],[f16]) ).

fof(f18,plain,
    ( subset(sk0_2,sk0_3)
    & ~ in(sk0_4,sk0_2)
    & ~ subset(sk0_2,set_difference(sk0_3,singleton(sk0_4))) ),
    inference(skolemization,[status(esa)],[f17]) ).

fof(f19,plain,
    subset(sk0_2,sk0_3),
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f20,plain,
    ~ in(sk0_4,sk0_2),
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f21,plain,
    ~ subset(sk0_2,set_difference(sk0_3,singleton(sk0_4))),
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f22,plain,
    ! [A,B,C] :
      ( ~ subset(A,B)
      | in(C,A)
      | subset(A,set_difference(B,singleton(C))) ),
    inference(pre_NNF_transformation,[status(esa)],[f7]) ).

fof(f23,plain,
    ! [A,B] :
      ( ~ subset(A,B)
      | ! [C] :
          ( in(C,A)
          | subset(A,set_difference(B,singleton(C))) ) ),
    inference(miniscoping,[status(esa)],[f22]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( ~ subset(X0,X1)
      | in(X2,X0)
      | subset(X0,set_difference(X1,singleton(X2))) ),
    inference(cnf_transformation,[status(esa)],[f23]) ).

fof(f25,plain,
    ( spl0_0
  <=> subset(sk0_2,sk0_3) ),
    introduced(split_symbol_definition) ).

fof(f27,plain,
    ( ~ subset(sk0_2,sk0_3)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f25]) ).

fof(f28,plain,
    ( spl0_1
  <=> in(sk0_4,sk0_2) ),
    introduced(split_symbol_definition) ).

fof(f29,plain,
    ( in(sk0_4,sk0_2)
    | ~ spl0_1 ),
    inference(component_clause,[status(thm)],[f28]) ).

fof(f31,plain,
    ( ~ subset(sk0_2,sk0_3)
    | in(sk0_4,sk0_2) ),
    inference(resolution,[status(thm)],[f24,f21]) ).

fof(f32,plain,
    ( ~ spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f31,f25,f28]) ).

fof(f33,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f27,f19]) ).

fof(f34,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f33]) ).

fof(f35,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f29,f20]) ).

fof(f36,plain,
    ~ spl0_1,
    inference(contradiction_clause,[status(thm)],[f35]) ).

fof(f37,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f32,f34,f36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem  : SET899+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n019.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Mon Apr 29 21:30:14 EDT 2024
% 0.10/0.31  % CPUTime  : 
% 0.10/0.32  % Drodi V3.6.0
% 0.10/0.33  % Refutation found
% 0.10/0.33  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.33  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.33  % Elapsed time: 0.013238 seconds
% 0.10/0.33  % CPU time: 0.021006 seconds
% 0.10/0.33  % Total memory used: 1.909 MB
% 0.10/0.33  % Net memory used: 1.766 MB
%------------------------------------------------------------------------------