%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : GRP176-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n008.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:19:38 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f12,axiom,
    ! [X,Y,Z] : multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f14,axiom,
    ! [Y,Z,X] : multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f17,negated_conjecture,
    multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f29,plain,
    ! [X0,X1,X2] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
    inference(cnf_transformation,[status(esa)],[f12]) ).

fof(f31,plain,
    ! [X0,X1,X2] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
    inference(cnf_transformation,[status(esa)],[f14]) ).

fof(f34,plain,
    multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
    inference(cnf_transformation,[status(esa)],[f17]) ).

fof(f35,plain,
    multiply(c,multiply(least_upper_bound(a,b),d)) != multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))),
    inference(forward_demodulation,[status(thm)],[f29,f34]) ).

fof(f36,plain,
    multiply(c,multiply(least_upper_bound(a,b),d)) != multiply(c,multiply(least_upper_bound(a,b),d)),
    inference(forward_demodulation,[status(thm)],[f31,f35]) ).

fof(f37,plain,
    $false,
    inference(trivial_equality_resolution,[status(esa)],[f36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : GRP176-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30  % Computer : n008.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 Apr 30 00:25:27 EDT 2024
% 0.10/0.30  % CPUTime  : 
% 0.14/0.30  % Drodi V3.6.0
% 0.14/0.31  % Refutation found
% 0.14/0.31  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.31  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.31  % Elapsed time: 0.011167 seconds
% 0.14/0.31  % CPU time: 0.018753 seconds
% 0.14/0.31  % Total memory used: 2.479 MB
% 0.14/0.31  % Net memory used: 2.388 MB
%------------------------------------------------------------------------------