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

% Computer : n005.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:03 EDT 2023

% Result   : Theorem 0.09s 0.31s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   36 (   5 unt;   0 def)
%            Number of atoms       :   96 (  37 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   97 (  37   ~;  45   |;   8   &)
%                                         (   6 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   25 (;  21   !;   4   ?)

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

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

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

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

fof(f8,plain,
    ! [A] : subset(A,A),
    inference(miniscoping,[status(esa)],[f1]) ).

fof(f9,plain,
    ! [X0] : subset(X0,X0),
    inference(cnf_transformation,[status(esa)],[f8]) ).

fof(f15,plain,
    ? [A,B] :
      ( subset(A,singleton(B))
    <~> ( A = empty_set
        | A = singleton(B) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f6]) ).

fof(f16,plain,
    ? [A,B] :
      ( ( subset(A,singleton(B))
        | A = empty_set
        | A = singleton(B) )
      & ( ~ subset(A,singleton(B))
        | ( A != empty_set
          & A != singleton(B) ) ) ),
    inference(NNF_transformation,[status(esa)],[f15]) ).

fof(f17,plain,
    ( ( subset(sk0_2,singleton(sk0_3))
      | sk0_2 = empty_set
      | sk0_2 = singleton(sk0_3) )
    & ( ~ subset(sk0_2,singleton(sk0_3))
      | ( sk0_2 != empty_set
        & sk0_2 != singleton(sk0_3) ) ) ),
    inference(skolemization,[status(esa)],[f16]) ).

fof(f18,plain,
    ( subset(sk0_2,singleton(sk0_3))
    | sk0_2 = empty_set
    | sk0_2 = singleton(sk0_3) ),
    inference(cnf_transformation,[status(esa)],[f17]) ).

fof(f19,plain,
    ( ~ subset(sk0_2,singleton(sk0_3))
    | sk0_2 != empty_set ),
    inference(cnf_transformation,[status(esa)],[f17]) ).

fof(f20,plain,
    ( ~ subset(sk0_2,singleton(sk0_3))
    | sk0_2 != singleton(sk0_3) ),
    inference(cnf_transformation,[status(esa)],[f17]) ).

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

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

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

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

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

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

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

fof(f29,plain,
    ( spl0_1
  <=> sk0_2 = empty_set ),
    introduced(split_symbol_definition) ).

fof(f30,plain,
    ( sk0_2 = empty_set
    | ~ spl0_1 ),
    inference(component_clause,[status(thm)],[f29]) ).

fof(f32,plain,
    ( spl0_2
  <=> sk0_2 = singleton(sk0_3) ),
    introduced(split_symbol_definition) ).

fof(f33,plain,
    ( sk0_2 = singleton(sk0_3)
    | ~ spl0_2 ),
    inference(component_clause,[status(thm)],[f32]) ).

fof(f35,plain,
    ( spl0_0
    | spl0_1
    | spl0_2 ),
    inference(split_clause,[status(thm)],[f18,f26,f29,f32]) ).

fof(f36,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f19,f26,f29]) ).

fof(f37,plain,
    ( ~ spl0_0
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f20,f26,f32]) ).

fof(f38,plain,
    ! [X0] : subset(empty_set,singleton(X0)),
    inference(destructive_equality_resolution,[status(esa)],[f24]) ).

fof(f48,plain,
    ( ~ subset(empty_set,singleton(sk0_3))
    | ~ spl0_1
    | spl0_0 ),
    inference(forward_demodulation,[status(thm)],[f30,f28]) ).

fof(f49,plain,
    ( $false
    | ~ spl0_1
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f48,f38]) ).

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

fof(f51,plain,
    ( sk0_2 = empty_set
    | sk0_2 = singleton(sk0_3)
    | ~ spl0_0 ),
    inference(resolution,[status(thm)],[f27,f23]) ).

fof(f52,plain,
    ( spl0_1
    | spl0_2
    | ~ spl0_0 ),
    inference(split_clause,[status(thm)],[f51,f29,f32,f26]) ).

fof(f56,plain,
    ( ~ subset(sk0_2,sk0_2)
    | ~ spl0_2
    | spl0_0 ),
    inference(forward_demodulation,[status(thm)],[f33,f28]) ).

fof(f57,plain,
    ( $false
    | ~ spl0_2
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f56,f9]) ).

fof(f58,plain,
    ( ~ spl0_2
    | spl0_0 ),
    inference(contradiction_clause,[status(thm)],[f57]) ).

fof(f59,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f35,f36,f37,f50,f52,f58]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : SEU160+3 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30  % Computer : n005.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Tue May 30 09:08:51 EDT 2023
% 0.09/0.30  % CPUTime  : 
% 0.09/0.31  % Drodi V3.5.1
% 0.09/0.31  % Refutation found
% 0.09/0.31  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.31  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.53  % Elapsed time: 0.012514 seconds
% 0.15/0.53  % CPU time: 0.011414 seconds
% 0.15/0.53  % Memory used: 2.863 MB
%------------------------------------------------------------------------------