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

% Computer : n023.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:10:46 EDT 2023

% Result   : Unsatisfiable 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (  23 unt;   0 def)
%            Number of atoms       :   23 (  22 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 (   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   :   29 (;  29   !;   0   ?)

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

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

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

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

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

fof(f17,hypothesis,
    greatest_lower_bound(b,c) = b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f22,plain,
    ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f23,plain,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    inference(cnf_transformation,[status(esa)],[f5]) ).

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(f28,plain,
    ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
    inference(cnf_transformation,[status(esa)],[f10]) ).

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

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

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

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

fof(f37,plain,
    ! [X0,X1,X2] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X2,greatest_lower_bound(X0,X1)),
    inference(paramodulation,[status(thm)],[f22,f24]) ).

fof(f387,plain,
    ! [X0,X1,X2] : least_upper_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,X0))) = X0,
    inference(paramodulation,[status(thm)],[f37,f28]) ).

fof(f593,plain,
    ! [X0] : least_upper_bound(c,greatest_lower_bound(X0,b)) = c,
    inference(paramodulation,[status(thm)],[f35,f387]) ).

fof(f755,plain,
    least_upper_bound(c,a) = c,
    inference(paramodulation,[status(thm)],[f34,f593]) ).

fof(f756,plain,
    least_upper_bound(a,c) = c,
    inference(forward_demodulation,[status(thm)],[f23,f755]) ).

fof(f775,plain,
    greatest_lower_bound(a,c) = a,
    inference(paramodulation,[status(thm)],[f756,f29]) ).

fof(f776,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f775,f36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP163-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n023.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue May 30 11:51:08 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.13/0.37  % Refutation found
% 0.13/0.37  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38  % Elapsed time: 0.029729 seconds
% 0.13/0.38  % CPU time: 0.125531 seconds
% 0.13/0.38  % Memory used: 2.261 MB
%------------------------------------------------------------------------------