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

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

% Result   : Unsatisfiable 0.14s 0.32s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   36 (  11 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   71 (  37   ~;  32   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   41 (;  41   !;   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(f8,axiom,
    ! [A,B,C] :
      ( ~ equalish(add(successor(A),B),C)
      | less(B,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

fof(f15,axiom,
    ! [X,Y,Z] :
      ( ~ equalish(X,Y)
      | ~ equalish(Y,Z)
      | equalish(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

fof(f18,negated_conjecture,
    divides(c,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

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

fof(f30,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X0)),X0),X1) ),
    inference(cnf_transformation,[status(esa)],[f9]) ).

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

fof(f36,plain,
    ! [X,Z] :
      ( ! [Y] :
          ( ~ equalish(X,Y)
          | ~ equalish(Y,Z) )
      | equalish(X,Z) ),
    inference(miniscoping,[status(esa)],[f15]) ).

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

fof(f38,plain,
    less(b,c),
    inference(cnf_transformation,[status(esa)],[f16]) ).

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

fof(f40,plain,
    divides(c,a),
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f89,plain,
    ! [X0] :
      ( ~ less(X0,a)
      | ~ less(b,X0) ),
    inference(resolution,[status(thm)],[f27,f39]) ).

fof(f91,plain,
    ! [X0] :
      ( ~ less(b,X0)
      | ~ divides(X0,a)
      | equalish(X0,a) ),
    inference(resolution,[status(thm)],[f89,f31]) ).

fof(f92,plain,
    ! [X0] : ~ equalish(add(successor(X0),b),a),
    inference(resolution,[status(thm)],[f29,f39]) ).

fof(f94,plain,
    ! [X0,X1] :
      ( ~ equalish(add(successor(X0),b),X1)
      | ~ equalish(X1,a) ),
    inference(resolution,[status(thm)],[f92,f37]) ).

fof(f263,plain,
    ( spl0_2
  <=> less(b,c) ),
    introduced(split_symbol_definition) ).

fof(f265,plain,
    ( ~ less(b,c)
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f263]) ).

fof(f266,plain,
    ( spl0_3
  <=> equalish(c,a) ),
    introduced(split_symbol_definition) ).

fof(f267,plain,
    ( equalish(c,a)
    | ~ spl0_3 ),
    inference(component_clause,[status(thm)],[f266]) ).

fof(f269,plain,
    ( ~ less(b,c)
    | equalish(c,a) ),
    inference(resolution,[status(thm)],[f91,f40]) ).

fof(f270,plain,
    ( ~ spl0_2
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f269,f263,f266]) ).

fof(f272,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f265,f38]) ).

fof(f273,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f272]) ).

fof(f277,plain,
    ! [X0] :
      ( ~ equalish(X0,a)
      | ~ less(b,X0) ),
    inference(resolution,[status(thm)],[f94,f30]) ).

fof(f282,plain,
    ~ equalish(c,a),
    inference(resolution,[status(thm)],[f277,f38]) ).

fof(f283,plain,
    ( $false
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f282,f267]) ).

fof(f284,plain,
    ~ spl0_3,
    inference(contradiction_clause,[status(thm)],[f283]) ).

fof(f285,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f270,f273,f284]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem  : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.05/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30  % Computer : n028.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 300
% 0.10/0.30  % DateTime : Tue May 30 10:06:02 EDT 2023
% 0.10/0.30  % CPUTime  : 
% 0.10/0.31  % Drodi V3.5.1
% 0.14/0.32  % Refutation found
% 0.14/0.32  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.32  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.36  % Elapsed time: 0.058827 seconds
% 0.14/0.36  % CPU time: 0.029541 seconds
% 0.14/0.36  % Memory used: 769.890 KB
%------------------------------------------------------------------------------