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

% Computer : n026.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 : Wed May 31 12:36:02 EDT 2023

% Result   : Theorem 0.16s 0.32s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (   1 unt;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   56 (  23   ~;  23   |;   4   &)
%                                         (   5 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   20 (;  16   !;   4   ?)

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

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

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

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

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

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

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

fof(f20,plain,
    ( ~ subset(singleton(sk0_2),sk0_3)
    | ~ in(sk0_2,sk0_3) ),
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f21,plain,
    ! [A,B] :
      ( ( ~ subset(singleton(A),B)
        | in(A,B) )
      & ( subset(singleton(A),B)
        | ~ in(A,B) ) ),
    inference(NNF_transformation,[status(esa)],[f7]) ).

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

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

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

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

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

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

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

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

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

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

fof(f36,plain,
    ( ~ in(sk0_2,sk0_3)
    | spl0_0 ),
    inference(resolution,[status(thm)],[f27,f24]) ).

fof(f37,plain,
    ( $false
    | ~ spl0_1
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f36,f29]) ).

fof(f38,plain,
    ( ~ spl0_1
    | spl0_0 ),
    inference(contradiction_clause,[status(thm)],[f37]) ).

fof(f39,plain,
    ( in(sk0_2,sk0_3)
    | ~ spl0_0 ),
    inference(resolution,[status(thm)],[f26,f23]) ).

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

fof(f41,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f31,f32,f38,f40]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : SEU158+3 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n026.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 : Tue May 30 09:26:43 EDT 2023
% 0.10/0.31  % CPUTime  : 
% 0.16/0.31  % Drodi V3.5.1
% 0.16/0.32  % Refutation found
% 0.16/0.32  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.32  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.54  % Elapsed time: 0.017198 seconds
% 0.16/0.54  % CPU time: 0.008626 seconds
% 0.16/0.54  % Memory used: 477.735 KB
%------------------------------------------------------------------------------