%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP174-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp
% Command  : run_maedmax %d %s

% Computer : n004.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 Jul 26 07:02:18 EDT 2022

% Result   : Unsatisfiable 0.76s 0.97s
% Output   : CNFRefutation 0.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   14 (  14 unt;   0 nHn;   8 RR)
%            Number of literals    :   14 (  13 equ;   2 neg)
%            Maximal clause size   :    1 (   1 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   :   10 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
    X = multiply(identity,X),
    file('/tmp/MaedMax_24102') ).

cnf(eq_1,axiom,
    identity = multiply(inverse(X),X),
    file('/tmp/MaedMax_24102') ).

cnf(eq_2,axiom,
    greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
    file('/tmp/MaedMax_24102') ).

cnf(eq_3,axiom,
    multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
    file('/tmp/MaedMax_24102') ).

cnf(eq_4,axiom,
    greatest_lower_bound(identity,a) = a,
    file('/tmp/MaedMax_24102') ).

cnf(eq_5,axiom,
    inverse(a) = greatest_lower_bound(identity,inverse(a)),
    file('/tmp/MaedMax_24102') ).

cnf(eq_6,negated_conjecture,
    identity != a,
    file('/tmp/MaedMax_24102') ).

cnf(eq_7,plain,
    greatest_lower_bound(inverse(a),identity) = inverse(a),
    inference(cp,[status(thm)],[eq_2,eq_5]) ).

cnf(eq_8,plain,
    greatest_lower_bound(identity,multiply(x102,X)) = multiply(greatest_lower_bound(inverse(X),x102),X),
    inference(cp,[status(thm)],[eq_1,eq_3]) ).

cnf(eq_9,plain,
    multiply(greatest_lower_bound(inverse(X),Y),X) = greatest_lower_bound(identity,multiply(Y,X)),
    eq_8 ).

cnf(eq_10,plain,
    multiply(inverse(a),a) = greatest_lower_bound(identity,multiply(identity,a)),
    inference(cp,[status(thm)],[eq_7,eq_9]) ).

cnf(eq_11,plain,
    identity = a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_10,eq_1]),eq_0]),eq_4]) ).

cnf(eq_12,negated_conjecture,
    a != a,
    inference(cp,[status(thm)],[eq_11,eq_6]) ).

cnf(bot,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[eq_12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP174-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12  % Command  : run_maedmax %d %s
% 0.12/0.33  % Computer : n004.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 Jul 26 04:18:06 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.76/0.97  % SZS status Unsatisfiable
% 0.76/0.97  % SZS output start CNFRefutation for /tmp/MaedMax_24102
% See solution above
% 0.76/0.97  
%------------------------------------------------------------------------------