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

% Computer : n003.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:24 EDT 2023

% Result   : Unsatisfiable 0.20s 0.58s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   20 (   9 unt;   0 def)
%            Number of atoms       :   34 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   28 (  14   ~;  12   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    9 (;   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [V_B,V_A,T_a] :
      ( ~ c_lessequals(V_B,V_A,tc_set(T_a))
      | ~ c_lessequals(V_A,V_B,tc_set(T_a))
      | V_A = V_B ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,negated_conjecture,
    c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    v_n != c_Union(v_Y,tc_set(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,plain,
    ! [V_B,V_A] :
      ( ! [T_a] :
          ( ~ c_lessequals(V_B,V_A,tc_set(T_a))
          | ~ c_lessequals(V_A,V_B,tc_set(T_a)) )
      | V_A = V_B ),
    inference(miniscoping,[status(esa)],[f1]) ).

fof(f6,plain,
    ! [X0,X1,X2] :
      ( ~ c_lessequals(X0,X1,tc_set(X2))
      | ~ c_lessequals(X1,X0,tc_set(X2))
      | X1 = X0 ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f7,plain,
    c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    inference(cnf_transformation,[status(esa)],[f2]) ).

fof(f8,plain,
    c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f9,plain,
    v_n != c_Union(v_Y,tc_set(t_a)),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f13,plain,
    ( spl0_1
  <=> c_Union(v_Y,tc_set(t_a)) = v_n ),
    introduced(split_symbol_definition) ).

fof(f14,plain,
    ( c_Union(v_Y,tc_set(t_a)) = v_n
    | ~ spl0_1 ),
    inference(component_clause,[status(thm)],[f13]) ).

fof(f18,plain,
    ( spl0_2
  <=> c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))) ),
    introduced(split_symbol_definition) ).

fof(f20,plain,
    ( ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a)))
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f18]) ).

fof(f21,plain,
    ( ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a)))
    | v_n = c_Union(v_Y,tc_set(t_a)) ),
    inference(resolution,[status(thm)],[f6,f7]) ).

fof(f22,plain,
    ( ~ spl0_2
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f21,f18,f13]) ).

fof(f23,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f20,f8]) ).

fof(f24,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f23]) ).

fof(f25,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f14,f9]) ).

fof(f26,plain,
    ~ spl0_1,
    inference(contradiction_clause,[status(thm)],[f25]) ).

fof(f27,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f22,f24,f26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET855-2 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n003.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 : Tue May 30 10:18:08 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.20/0.58  % Refutation found
% 0.20/0.58  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.58  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.58  % Elapsed time: 0.013907 seconds
% 0.20/0.58  % CPU time: 0.015874 seconds
% 0.20/0.58  % Memory used: 1.002 MB
%------------------------------------------------------------------------------