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

% Computer : n020.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:18 EDT 2024

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   4 unt;   0 def)
%            Number of atoms       :   18 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   14 (   7   ~;   2   |;   2   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   12 (  10   !;   2   ?)

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

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

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

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

fof(f12,plain,
    ( in(sk0_0,sk0_1)
    & ~ subset(sk0_0,union(sk0_1)) ),
    inference(skolemization,[status(esa)],[f11]) ).

fof(f13,plain,
    in(sk0_0,sk0_1),
    inference(cnf_transformation,[status(esa)],[f12]) ).

fof(f14,plain,
    ~ subset(sk0_0,union(sk0_1)),
    inference(cnf_transformation,[status(esa)],[f12]) ).

fof(f15,plain,
    ! [A,B] :
      ( ~ in(A,B)
      | subset(A,union(B)) ),
    inference(pre_NNF_transformation,[status(esa)],[f6]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | subset(X0,union(X1)) ),
    inference(cnf_transformation,[status(esa)],[f15]) ).

fof(f18,plain,
    ~ in(sk0_0,sk0_1),
    inference(resolution,[status(thm)],[f16,f14]) ).

fof(f19,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f18,f13]) ).

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