TSTP Solution File: SET845-1 by Drodi---3.5.1

View Problem - Process Solution

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

% Computer : n007.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:21 EDT 2023

% Result   : Unsatisfiable 1.79s 0.62s
% Output   : CNFRefutation 1.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   41 (  11 unt;   0 def)
%            Number of atoms       :   74 (  11 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   64 (  31   ~;  30   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   4 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   54 (;  54   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f266,axiom,
    ! [T_a,V_x] :
      ( ~ class_Orderings_Oorder(T_a)
      | c_lessequals(V_x,V_x,T_a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f300,axiom,
    ! [V_A,V_B,T_a] :
      ( ~ c_less(V_A,V_B,tc_set(T_a))
      | ~ c_lessequals(V_B,V_A,tc_set(T_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f447,axiom,
    ! [T_1] : class_Orderings_Oorder(tc_set(T_1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f1360,axiom,
    ! [V_B,V_A,T_a] :
      ( ~ c_in(V_B,V_A,tc_set(T_a))
      | c_lessequals(V_B,c_Union(V_A,T_a),tc_set(T_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f1361,axiom,
    ! [V_x,V_S,T_a] : c_lessequals(V_x,c_Zorn_Osucc(V_S,V_x,T_a),tc_set(tc_set(T_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f1362,axiom,
    ! [V_x,V_S,T_a] :
      ( ~ c_in(V_x,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))
      | c_in(c_Zorn_Osucc(V_S,V_x,T_a),c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f1363,axiom,
    ! [V_Y,V_S,T_a] :
      ( ~ c_lessequals(V_Y,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(tc_set(T_a))))
      | c_in(c_Union(V_Y,tc_set(T_a)),c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f1366,negated_conjecture,
    v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f1367,negated_conjecture,
    v_m != c_Zorn_Osucc(v_S,v_m,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f1732,plain,
    ! [T_a] :
      ( ~ class_Orderings_Oorder(T_a)
      | ! [V_x] : c_lessequals(V_x,V_x,T_a) ),
    inference(miniscoping,[status(esa)],[f266]) ).

fof(f1733,plain,
    ! [X0,X1] :
      ( ~ class_Orderings_Oorder(X0)
      | c_lessequals(X1,X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f1732]) ).

fof(f1771,plain,
    ! [X0,X1,X2] :
      ( ~ c_less(X0,X1,tc_set(X2))
      | ~ c_lessequals(X1,X0,tc_set(X2)) ),
    inference(cnf_transformation,[status(esa)],[f300]) ).

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

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

fof(f1931,plain,
    ! [X0] : class_Orderings_Oorder(tc_set(X0)),
    inference(cnf_transformation,[status(esa)],[f447]) ).

fof(f2845,plain,
    ! [X0,X1,X2] :
      ( ~ c_in(X0,X1,tc_set(X2))
      | c_lessequals(X0,c_Union(X1,X2),tc_set(X2)) ),
    inference(cnf_transformation,[status(esa)],[f1360]) ).

fof(f2846,plain,
    ! [X0,X1,X2] : c_lessequals(X0,c_Zorn_Osucc(X1,X0,X2),tc_set(tc_set(X2))),
    inference(cnf_transformation,[status(esa)],[f1361]) ).

fof(f2847,plain,
    ! [X0,X1,X2] :
      ( ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
      | c_in(c_Zorn_Osucc(X1,X0,X2),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
    inference(cnf_transformation,[status(esa)],[f1362]) ).

fof(f2848,plain,
    ! [X0,X1,X2] :
      ( ~ c_lessequals(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(tc_set(X2))))
      | c_in(c_Union(X0,tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
    inference(cnf_transformation,[status(esa)],[f1363]) ).

fof(f2852,plain,
    v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),
    inference(cnf_transformation,[status(esa)],[f1366]) ).

fof(f2853,plain,
    v_m != c_Zorn_Osucc(v_S,v_m,t_a),
    inference(cnf_transformation,[status(esa)],[f1367]) ).

fof(f2854,plain,
    ! [X0] :
      ( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
      | c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
    inference(paramodulation,[status(thm)],[f2852,f2845]) ).

fof(f2857,plain,
    ! [X0] :
      ( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_Osucc(v_S,X0,t_a),v_m,tc_set(tc_set(t_a))) ),
    inference(resolution,[status(thm)],[f2847,f2854]) ).

fof(f2859,plain,
    ! [X0] :
      ( ~ c_lessequals(c_Zorn_OTFin(v_S,t_a),c_Zorn_OTFin(X0,t_a),tc_set(tc_set(tc_set(t_a))))
      | c_in(v_m,c_Zorn_OTFin(X0,t_a),tc_set(tc_set(t_a))) ),
    inference(paramodulation,[status(thm)],[f2852,f2848]) ).

fof(f4440,plain,
    ( spl0_17
  <=> class_Orderings_Oorder(tc_set(tc_set(tc_set(t_a)))) ),
    introduced(split_symbol_definition) ).

fof(f4442,plain,
    ( ~ class_Orderings_Oorder(tc_set(tc_set(tc_set(t_a))))
    | spl0_17 ),
    inference(component_clause,[status(thm)],[f4440]) ).

fof(f4443,plain,
    ( spl0_18
  <=> c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    introduced(split_symbol_definition) ).

fof(f4446,plain,
    ( ~ class_Orderings_Oorder(tc_set(tc_set(tc_set(t_a))))
    | c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(resolution,[status(thm)],[f1733,f2859]) ).

fof(f4447,plain,
    ( ~ spl0_17
    | spl0_18 ),
    inference(split_clause,[status(thm)],[f4446,f4440,f4443]) ).

fof(f4462,plain,
    ( $false
    | spl0_17 ),
    inference(forward_subsumption_resolution,[status(thm)],[f4442,f1931]) ).

fof(f4463,plain,
    spl0_17,
    inference(contradiction_clause,[status(thm)],[f4462]) ).

fof(f4868,plain,
    ! [X0] :
      ( ~ c_less(v_m,c_Zorn_Osucc(v_S,X0,t_a),tc_set(tc_set(t_a)))
      | ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(resolution,[status(thm)],[f1771,f2857]) ).

fof(f5115,plain,
    ! [X0,X1,X2] :
      ( c_less(X0,c_Zorn_Osucc(X1,X0,X2),tc_set(tc_set(X2)))
      | X0 = c_Zorn_Osucc(X1,X0,X2) ),
    inference(resolution,[status(thm)],[f1774,f2846]) ).

fof(f5742,plain,
    ( spl0_109
  <=> v_m = c_Zorn_Osucc(v_S,v_m,t_a) ),
    introduced(split_symbol_definition) ).

fof(f5743,plain,
    ( v_m = c_Zorn_Osucc(v_S,v_m,t_a)
    | ~ spl0_109 ),
    inference(component_clause,[status(thm)],[f5742]) ).

fof(f5745,plain,
    ( v_m = c_Zorn_Osucc(v_S,v_m,t_a)
    | ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(resolution,[status(thm)],[f5115,f4868]) ).

fof(f5746,plain,
    ( spl0_109
    | ~ spl0_18 ),
    inference(split_clause,[status(thm)],[f5745,f5742,f4443]) ).

fof(f5753,plain,
    ( $false
    | ~ spl0_109 ),
    inference(forward_subsumption_resolution,[status(thm)],[f5743,f2853]) ).

fof(f5754,plain,
    ~ spl0_109,
    inference(contradiction_clause,[status(thm)],[f5753]) ).

fof(f5755,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f4447,f4463,f5746,f5754]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET845-1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n007.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.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Tue May 30 10:00:02 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.39  % Drodi V3.5.1
% 1.79/0.62  % Refutation found
% 1.79/0.62  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 1.79/0.62  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.79/0.65  % Elapsed time: 0.292905 seconds
% 1.79/0.65  % CPU time: 1.916988 seconds
% 1.79/0.65  % Memory used: 121.634 MB
%------------------------------------------------------------------------------