%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SEU158+1 : TPTP v8.1.2. Released v3.3.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:41:15 EDT 2024

% Result   : Theorem 0.10s 0.35s
% Output   : CNFRefutation 0.10s
% 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(f4,conjecture,
    ! [A,B] :
      ( subset(singleton(A),B)
    <=> in(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

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

fof(f13,plain,
    ( ( subset(singleton(sk0_0),sk0_1)
      | in(sk0_0,sk0_1) )
    & ( ~ subset(singleton(sk0_0),sk0_1)
      | ~ in(sk0_0,sk0_1) ) ),
    inference(skolemization,[status(esa)],[f12]) ).

fof(f14,plain,
    ( subset(singleton(sk0_0),sk0_1)
    | in(sk0_0,sk0_1) ),
    inference(cnf_transformation,[status(esa)],[f13]) ).

fof(f15,plain,
    ( ~ subset(singleton(sk0_0),sk0_1)
    | ~ in(sk0_0,sk0_1) ),
    inference(cnf_transformation,[status(esa)],[f13]) ).

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

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

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

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

fof(f20,plain,
    ( spl0_0
  <=> subset(singleton(sk0_0),sk0_1) ),
    introduced(split_symbol_definition) ).

fof(f21,plain,
    ( subset(singleton(sk0_0),sk0_1)
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f20]) ).

fof(f22,plain,
    ( ~ subset(singleton(sk0_0),sk0_1)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f20]) ).

fof(f23,plain,
    ( spl0_1
  <=> in(sk0_0,sk0_1) ),
    introduced(split_symbol_definition) ).

fof(f24,plain,
    ( in(sk0_0,sk0_1)
    | ~ spl0_1 ),
    inference(component_clause,[status(thm)],[f23]) ).

fof(f26,plain,
    ( spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f14,f20,f23]) ).

fof(f27,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f15,f20,f23]) ).

fof(f31,plain,
    ( ~ in(sk0_0,sk0_1)
    | spl0_0 ),
    inference(resolution,[status(thm)],[f19,f22]) ).

fof(f32,plain,
    ( $false
    | ~ spl0_1
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f31,f24]) ).

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

fof(f34,plain,
    ( in(sk0_0,sk0_1)
    | ~ spl0_0 ),
    inference(resolution,[status(thm)],[f21,f18]) ).

fof(f35,plain,
    ( spl0_1
    | ~ spl0_0 ),
    inference(split_clause,[status(thm)],[f34,f23,f20]) ).

fof(f36,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f26,f27,f33,f35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12  % Problem  : SEU158+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.33  % Computer : n019.cluster.edu
% 0.10/0.33  % Model    : x86_64 x86_64
% 0.10/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33  % Memory   : 8042.1875MB
% 0.10/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33  % CPULimit : 300
% 0.10/0.33  % WCLimit  : 300
% 0.10/0.33  % DateTime : Mon Apr 29 19:44:59 EDT 2024
% 0.10/0.34  % CPUTime  : 
% 0.10/0.34  % Drodi V3.6.0
% 0.10/0.35  % Refutation found
% 0.10/0.35  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.37  % Elapsed time: 0.016550 seconds
% 0.10/0.37  % CPU time: 0.021908 seconds
% 0.10/0.37  % Total memory used: 1.903 MB
% 0.10/0.37  % Net memory used: 1.779 MB
%------------------------------------------------------------------------------