%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : NUM027-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

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

% Result   : Unsatisfiable 1.31s 0.63s
% Output   : CNFRefutation 1.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   43 (  13 unt;   0 def)
%            Number of atoms       :   85 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   80 (  38   ~;  38   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   38 (;  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [A,B,C] :
      ( ~ less(A,B)
      | ~ less(C,A)
      | less(C,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f13,axiom,
    ! [A,B,C] :
      ( ~ equalish(A,B)
      | equalish(multiply(A,C),multiply(B,C)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f14,axiom,
    ! [A,B] :
      ( ~ less(A,B)
      | ~ equalish(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f15,axiom,
    ! [A,B] :
      ( less(A,B)
      | equalish(B,A)
      | less(B,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f16,axiom,
    ! [A] : ~ less(A,A),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f18,axiom,
    ! [A,B,C] :
      ( ~ less(A,B)
      | equalish(C,n0)
      | less(multiply(A,C),multiply(B,C)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f19,hypothesis,
    ~ less(b,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f20,hypothesis,
    less(multiply(b,c),multiply(a,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f21,negated_conjecture,
    ~ equalish(c,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f29,plain,
    ! [X0,X1,X2] :
      ( ~ less(X0,X1)
      | ~ less(X2,X0)
      | less(X2,X1) ),
    inference(cnf_transformation,[status(esa)],[f28]) ).

fof(f37,plain,
    ! [A,B] :
      ( ~ equalish(A,B)
      | ! [C] : equalish(multiply(A,C),multiply(B,C)) ),
    inference(miniscoping,[status(esa)],[f13]) ).

fof(f38,plain,
    ! [X0,X1,X2] :
      ( ~ equalish(X0,X1)
      | equalish(multiply(X0,X2),multiply(X1,X2)) ),
    inference(cnf_transformation,[status(esa)],[f37]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | ~ equalish(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f14]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( less(X0,X1)
      | equalish(X1,X0)
      | less(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f15]) ).

fof(f41,plain,
    ! [X0] : ~ less(X0,X0),
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f43,plain,
    ! [X0,X1,X2] :
      ( ~ less(X0,X1)
      | equalish(X2,n0)
      | less(multiply(X0,X2),multiply(X1,X2)) ),
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f44,plain,
    ~ less(b,a),
    inference(cnf_transformation,[status(esa)],[f19]) ).

fof(f45,plain,
    less(multiply(b,c),multiply(a,c)),
    inference(cnf_transformation,[status(esa)],[f20]) ).

fof(f46,plain,
    ~ equalish(c,n0),
    inference(cnf_transformation,[status(esa)],[f21]) ).

fof(f615,plain,
    ~ equalish(multiply(b,c),multiply(a,c)),
    inference(resolution,[status(thm)],[f45,f39]) ).

fof(f773,plain,
    ( spl0_11
  <=> less(a,b) ),
    introduced(split_symbol_definition) ).

fof(f774,plain,
    ( less(a,b)
    | ~ spl0_11 ),
    inference(component_clause,[status(thm)],[f773]) ).

fof(f776,plain,
    ( spl0_12
  <=> equalish(b,a) ),
    introduced(split_symbol_definition) ).

fof(f777,plain,
    ( equalish(b,a)
    | ~ spl0_12 ),
    inference(component_clause,[status(thm)],[f776]) ).

fof(f779,plain,
    ( less(a,b)
    | equalish(b,a) ),
    inference(resolution,[status(thm)],[f44,f40]) ).

fof(f780,plain,
    ( spl0_11
    | spl0_12 ),
    inference(split_clause,[status(thm)],[f779,f773,f776]) ).

fof(f804,plain,
    ! [X0] :
      ( equalish(X0,n0)
      | less(multiply(a,X0),multiply(b,X0))
      | ~ spl0_11 ),
    inference(resolution,[status(thm)],[f774,f43]) ).

fof(f835,plain,
    ! [X0,X1] :
      ( equalish(X0,n0)
      | ~ less(X1,multiply(a,X0))
      | less(X1,multiply(b,X0))
      | ~ spl0_11 ),
    inference(resolution,[status(thm)],[f804,f29]) ).

fof(f886,plain,
    ! [X0] :
      ( equalish(multiply(b,X0),multiply(a,X0))
      | ~ spl0_12 ),
    inference(resolution,[status(thm)],[f777,f38]) ).

fof(f891,plain,
    ( $false
    | ~ spl0_12 ),
    inference(backward_subsumption_resolution,[status(thm)],[f615,f886]) ).

fof(f892,plain,
    ~ spl0_12,
    inference(contradiction_clause,[status(thm)],[f891]) ).

fof(f1736,plain,
    ( spl0_46
  <=> equalish(c,n0) ),
    introduced(split_symbol_definition) ).

fof(f1737,plain,
    ( equalish(c,n0)
    | ~ spl0_46 ),
    inference(component_clause,[status(thm)],[f1736]) ).

fof(f1739,plain,
    ( spl0_47
  <=> less(multiply(b,c),multiply(b,c)) ),
    introduced(split_symbol_definition) ).

fof(f1740,plain,
    ( less(multiply(b,c),multiply(b,c))
    | ~ spl0_47 ),
    inference(component_clause,[status(thm)],[f1739]) ).

fof(f1742,plain,
    ( equalish(c,n0)
    | less(multiply(b,c),multiply(b,c))
    | ~ spl0_11 ),
    inference(resolution,[status(thm)],[f835,f45]) ).

fof(f1743,plain,
    ( spl0_46
    | spl0_47
    | ~ spl0_11 ),
    inference(split_clause,[status(thm)],[f1742,f1736,f1739,f773]) ).

fof(f1752,plain,
    ( $false
    | ~ spl0_46 ),
    inference(forward_subsumption_resolution,[status(thm)],[f1737,f46]) ).

fof(f1753,plain,
    ~ spl0_46,
    inference(contradiction_clause,[status(thm)],[f1752]) ).

fof(f1754,plain,
    ( $false
    | ~ spl0_47 ),
    inference(forward_subsumption_resolution,[status(thm)],[f1740,f41]) ).

fof(f1755,plain,
    ~ spl0_47,
    inference(contradiction_clause,[status(thm)],[f1754]) ).

fof(f1756,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f780,f892,f1743,f1753,f1755]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM027-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.06/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32  % Computer : n014.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Tue May 30 09:52:03 EDT 2023
% 0.11/0.32  % CPUTime  : 
% 0.11/0.32  % Drodi V3.5.1
% 1.31/0.63  % Refutation found
% 1.31/0.63  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 1.31/0.63  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.31/0.65  % Elapsed time: 0.322300 seconds
% 1.31/0.65  % CPU time: 1.869713 seconds
% 1.31/0.65  % Memory used: 18.130 MB
%------------------------------------------------------------------------------