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

% Computer : n019.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:37 EDT 2024

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

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

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

fof(f11,axiom,
    ! [X,Y] : greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
    file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).

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

fof(f17,hypothesis,
    least_upper_bound(identity,b) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f19,plain,
    ! [X0] : multiply(identity,X0) = X0,
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f24,plain,
    ! [X0,X1,X2] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f29,plain,
    ! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
    inference(cnf_transformation,[status(esa)],[f11]) ).

fof(f32,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,
    least_upper_bound(identity,a) = a,
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f35,plain,
    least_upper_bound(identity,b) = b,
    inference(cnf_transformation,[status(esa)],[f17]) ).

fof(f36,plain,
    greatest_lower_bound(identity,multiply(a,b)) != identity,
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f38,plain,
    greatest_lower_bound(identity,b) = identity,
    inference(paramodulation,[status(thm)],[f35,f29]) ).

fof(f102,plain,
    ! [X0] : greatest_lower_bound(identity,greatest_lower_bound(b,X0)) = greatest_lower_bound(identity,X0),
    inference(paramodulation,[status(thm)],[f38,f24]) ).

fof(f862,plain,
    ! [X0,X1] : multiply(least_upper_bound(identity,X0),X1) = least_upper_bound(X1,multiply(X0,X1)),
    inference(paramodulation,[status(thm)],[f19,f32]) ).

fof(f1034,plain,
    ! [X0,X1] : greatest_lower_bound(X0,multiply(least_upper_bound(identity,X1),X0)) = X0,
    inference(paramodulation,[status(thm)],[f862,f29]) ).

fof(f1056,plain,
    ! [X0] : greatest_lower_bound(X0,multiply(a,X0)) = X0,
    inference(paramodulation,[status(thm)],[f34,f1034]) ).

fof(f1132,plain,
    greatest_lower_bound(identity,b) = greatest_lower_bound(identity,multiply(a,b)),
    inference(paramodulation,[status(thm)],[f1056,f102]) ).

fof(f1133,plain,
    identity = greatest_lower_bound(identity,multiply(a,b)),
    inference(forward_demodulation,[status(thm)],[f38,f1132]) ).

fof(f1134,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f1133,f36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : GRP171-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.02/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n019.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Tue Apr 30 00:18:14 EDT 2024
% 0.10/0.31  % CPUTime  : 
% 0.16/0.32  % Drodi V3.6.0
% 0.16/0.44  % Refutation found
% 0.16/0.44  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.44  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.44  % Elapsed time: 0.124396 seconds
% 0.16/0.44  % CPU time: 0.909507 seconds
% 0.16/0.44  % Total memory used: 28.847 MB
% 0.16/0.44  % Net memory used: 28.547 MB
%------------------------------------------------------------------------------