%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : GRP158-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : Tue Apr 30 20:19:33 EDT 2024

% Result   : Unsatisfiable 0.12s 0.34s
% Output   : CNFRefutation 0.12s
% 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 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    6 (   6   !;   0   ?)

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

fof(f16,hypothesis,
    greatest_lower_bound(a,b) = a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f30,plain,
    ! [X0,X1,X2] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
    inference(cnf_transformation,[status(esa)],[f13]) ).

fof(f33,plain,
    greatest_lower_bound(a,b) = a,
    inference(cnf_transformation,[status(esa)],[f16]) ).

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

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

fof(f36,plain,
    multiply(c,a) != multiply(c,a),
    inference(forward_demodulation,[status(thm)],[f33,f35]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP158-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33  % Computer : n007.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue Apr 30 00:09:32 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % Drodi V3.6.0
% 0.12/0.34  % Refutation found
% 0.12/0.34  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.34  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.35  % Elapsed time: 0.015369 seconds
% 0.12/0.35  % CPU time: 0.024830 seconds
% 0.12/0.35  % Total memory used: 2.463 MB
% 0.12/0.35  % Net memory used: 2.367 MB
%------------------------------------------------------------------------------