%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SET787-1 : TPTP v8.1.2. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n002.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:35:11 EDT 2023

% Result   : Unsatisfiable 0.14s 0.36s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   53 (  14 unt;   0 def)
%            Number of atoms       :  101 (   9 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   90 (  42   ~;  41   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :   10 (   8 usr;   8 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   37 (;  37   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [U,V] :
      ( ~ member(U,union(V))
      | member(U,unionE_sk1(U,V)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,axiom,
    ! [U,V] :
      ( ~ member(U,union(V))
      | member(unionE_sk1(U,V),V) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [U,V,W] :
      ( ~ member(U,cons(V,W))
      | U = V
      | member(U,W) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,axiom,
    ! [C,A,B] :
      ( ~ member(C,A)
      | member(C,un(A,B)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f7,axiom,
    ! [C,B,A] :
      ( ~ member(C,B)
      | member(C,un(A,B)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ! [X] : ~ member(X,eptset),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    member(sk2,union(cons(a,cons(b,eptset)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f14,negated_conjecture,
    ~ member(sk2,un(a,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ member(X0,union(X1))
      | member(X0,unionE_sk1(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ member(X0,union(X1))
      | member(unionE_sk1(X0,X1),X1) ),
    inference(cnf_transformation,[status(esa)],[f2]) ).

fof(f19,plain,
    ! [U,W] :
      ( ! [V] :
          ( ~ member(U,cons(V,W))
          | U = V )
      | member(U,W) ),
    inference(miniscoping,[status(esa)],[f5]) ).

fof(f20,plain,
    ! [X0,X1,X2] :
      ( ~ member(X0,cons(X1,X2))
      | X0 = X1
      | member(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f19]) ).

fof(f21,plain,
    ! [C,A] :
      ( ~ member(C,A)
      | ! [B] : member(C,un(A,B)) ),
    inference(miniscoping,[status(esa)],[f6]) ).

fof(f22,plain,
    ! [X0,X1,X2] :
      ( ~ member(X0,X1)
      | member(X0,un(X1,X2)) ),
    inference(cnf_transformation,[status(esa)],[f21]) ).

fof(f23,plain,
    ! [C,B] :
      ( ~ member(C,B)
      | ! [A] : member(C,un(A,B)) ),
    inference(miniscoping,[status(esa)],[f7]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( ~ member(X0,X1)
      | member(X0,un(X2,X1)) ),
    inference(cnf_transformation,[status(esa)],[f23]) ).

fof(f25,plain,
    ! [X0] : ~ member(X0,eptset),
    inference(cnf_transformation,[status(esa)],[f8]) ).

fof(f31,plain,
    member(sk2,union(cons(a,cons(b,eptset)))),
    inference(cnf_transformation,[status(esa)],[f13]) ).

fof(f32,plain,
    ~ member(sk2,un(a,b)),
    inference(cnf_transformation,[status(esa)],[f14]) ).

fof(f33,plain,
    ~ member(sk2,a),
    inference(resolution,[status(thm)],[f22,f32]) ).

fof(f34,plain,
    ~ member(sk2,b),
    inference(resolution,[status(thm)],[f24,f32]) ).

fof(f35,plain,
    member(unionE_sk1(sk2,cons(a,cons(b,eptset))),cons(a,cons(b,eptset))),
    inference(resolution,[status(thm)],[f16,f31]) ).

fof(f36,plain,
    ( spl0_0
  <=> unionE_sk1(sk2,cons(a,cons(b,eptset))) = a ),
    introduced(split_symbol_definition) ).

fof(f37,plain,
    ( unionE_sk1(sk2,cons(a,cons(b,eptset))) = a
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f36]) ).

fof(f39,plain,
    ( spl0_1
  <=> member(unionE_sk1(sk2,cons(a,cons(b,eptset))),cons(b,eptset)) ),
    introduced(split_symbol_definition) ).

fof(f40,plain,
    ( member(unionE_sk1(sk2,cons(a,cons(b,eptset))),cons(b,eptset))
    | ~ spl0_1 ),
    inference(component_clause,[status(thm)],[f39]) ).

fof(f42,plain,
    ( unionE_sk1(sk2,cons(a,cons(b,eptset))) = a
    | member(unionE_sk1(sk2,cons(a,cons(b,eptset))),cons(b,eptset)) ),
    inference(resolution,[status(thm)],[f35,f20]) ).

fof(f43,plain,
    ( spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f42,f36,f39]) ).

fof(f45,plain,
    ( spl0_2
  <=> member(sk2,union(cons(a,cons(b,eptset)))) ),
    introduced(split_symbol_definition) ).

fof(f47,plain,
    ( ~ member(sk2,union(cons(a,cons(b,eptset))))
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f45]) ).

fof(f48,plain,
    ( spl0_3
  <=> member(sk2,a) ),
    introduced(split_symbol_definition) ).

fof(f49,plain,
    ( member(sk2,a)
    | ~ spl0_3 ),
    inference(component_clause,[status(thm)],[f48]) ).

fof(f51,plain,
    ( ~ member(sk2,union(cons(a,cons(b,eptset))))
    | member(sk2,a)
    | ~ spl0_0 ),
    inference(paramodulation,[status(thm)],[f37,f15]) ).

fof(f52,plain,
    ( ~ spl0_2
    | spl0_3
    | ~ spl0_0 ),
    inference(split_clause,[status(thm)],[f51,f45,f48,f36]) ).

fof(f53,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f47,f31]) ).

fof(f54,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f53]) ).

fof(f55,plain,
    ( $false
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f49,f33]) ).

fof(f56,plain,
    ~ spl0_3,
    inference(contradiction_clause,[status(thm)],[f55]) ).

fof(f57,plain,
    ( spl0_4
  <=> unionE_sk1(sk2,cons(a,cons(b,eptset))) = b ),
    introduced(split_symbol_definition) ).

fof(f58,plain,
    ( unionE_sk1(sk2,cons(a,cons(b,eptset))) = b
    | ~ spl0_4 ),
    inference(component_clause,[status(thm)],[f57]) ).

fof(f60,plain,
    ( spl0_5
  <=> member(unionE_sk1(sk2,cons(a,cons(b,eptset))),eptset) ),
    introduced(split_symbol_definition) ).

fof(f61,plain,
    ( member(unionE_sk1(sk2,cons(a,cons(b,eptset))),eptset)
    | ~ spl0_5 ),
    inference(component_clause,[status(thm)],[f60]) ).

fof(f63,plain,
    ( unionE_sk1(sk2,cons(a,cons(b,eptset))) = b
    | member(unionE_sk1(sk2,cons(a,cons(b,eptset))),eptset)
    | ~ spl0_1 ),
    inference(resolution,[status(thm)],[f40,f20]) ).

fof(f64,plain,
    ( spl0_4
    | spl0_5
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f63,f57,f60,f39]) ).

fof(f70,plain,
    ( spl0_6
  <=> member(sk2,b) ),
    introduced(split_symbol_definition) ).

fof(f71,plain,
    ( member(sk2,b)
    | ~ spl0_6 ),
    inference(component_clause,[status(thm)],[f70]) ).

fof(f73,plain,
    ( ~ member(sk2,union(cons(a,cons(b,eptset))))
    | member(sk2,b)
    | ~ spl0_4 ),
    inference(paramodulation,[status(thm)],[f58,f15]) ).

fof(f74,plain,
    ( ~ spl0_2
    | spl0_6
    | ~ spl0_4 ),
    inference(split_clause,[status(thm)],[f73,f45,f70,f57]) ).

fof(f75,plain,
    ( $false
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[status(thm)],[f61,f25]) ).

fof(f76,plain,
    ~ spl0_5,
    inference(contradiction_clause,[status(thm)],[f75]) ).

fof(f77,plain,
    ( $false
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[status(thm)],[f71,f34]) ).

fof(f78,plain,
    ~ spl0_6,
    inference(contradiction_clause,[status(thm)],[f77]) ).

fof(f79,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f43,f52,f54,f56,f64,f74,f76,f78]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SET787-1 : TPTP v8.1.2. Released v2.7.0.
% 0.12/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35  % Computer : n002.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue May 30 10:27:43 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  % Drodi V3.5.1
% 0.14/0.36  % Refutation found
% 0.14/0.36  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.27/0.58  % Elapsed time: 0.018429 seconds
% 0.27/0.58  % CPU time: 0.049721 seconds
% 0.27/0.58  % Memory used: 13.261 MB
%------------------------------------------------------------------------------