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

% Computer : n031.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:40:34 EDT 2024

% Result   : Unsatisfiable 0.14s 0.37s
% Output   : CNFRefutation 0.14s
% 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(f309,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/sandbox/benchmark/theBenchmark.p') ).

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

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

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

fof(f1790,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)],[f309]) ).

fof(f1791,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)],[f1790]) ).

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

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

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

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

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

fof(f2878,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(f2880,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)],[f2878]) ).

fof(f2881,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)],[f1791,f2864]) ).

fof(f2882,plain,
    ( ~ spl0_2
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f2881,f2878,f2873]) ).

fof(f2892,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f2880,f2865]) ).

fof(f2893,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f2892]) ).

fof(f2894,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f2874,f2866]) ).

fof(f2895,plain,
    ~ spl0_1,
    inference(contradiction_clause,[status(thm)],[f2894]) ).

fof(f2896,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f2882,f2893,f2895]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : SET855-1 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.31  % Computer : n031.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit : 300
% 0.09/0.31  % WCLimit  : 300
% 0.09/0.31  % DateTime : Mon Apr 29 22:12:58 EDT 2024
% 0.09/0.31  % CPUTime  : 
% 0.14/0.35  % Drodi V3.6.0
% 0.14/0.37  % Refutation found
% 0.14/0.37  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.37  % Elapsed time: 0.058658 seconds
% 0.14/0.37  % CPU time: 0.081263 seconds
% 0.14/0.37  % Total memory used: 27.090 MB
% 0.14/0.37  % Net memory used: 27.021 MB
%------------------------------------------------------------------------------