%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP181-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp
% Command  : run_maedmax %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 Jul 26 07:02:20 EDT 2022

% Result   : Unsatisfiable 96.36s 96.64s
% Output   : CNFRefutation 96.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   45 (  45 unt;   0 nHn;  12 RR)
%            Number of literals    :   45 (  44 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   57 (   0 sgn)

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

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

cnf(eq_2,axiom,
    multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
    file('/tmp/MaedMax_25489') ).

cnf(eq_3,axiom,
    greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
    file('/tmp/MaedMax_25489') ).

cnf(eq_4,axiom,
    least_upper_bound(X,Y) = least_upper_bound(Y,X),
    file('/tmp/MaedMax_25489') ).

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

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

cnf(eq_7,axiom,
    greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
    file('/tmp/MaedMax_25489') ).

cnf(eq_8,axiom,
    least_upper_bound(a,c) = least_upper_bound(b,c),
    file('/tmp/MaedMax_25489') ).

cnf(eq_9,axiom,
    inverse(least_upper_bound(X,Y)) = greatest_lower_bound(inverse(X),inverse(Y)),
    file('/tmp/MaedMax_25489') ).

cnf(eq_10,negated_conjecture,
    a != b,
    file('/tmp/MaedMax_25489') ).

cnf(eq_11,plain,
    multiply(identity,x102) = multiply(inverse(X),multiply(X,x102)),
    inference(cp,[status(thm)],[eq_1,eq_2]) ).

cnf(eq_12,plain,
    inverse(least_upper_bound(b,c)) = greatest_lower_bound(inverse(a),inverse(c)),
    inference(cp,[status(thm)],[eq_8,eq_9]) ).

cnf(eq_13,plain,
    greatest_lower_bound(c,a) = greatest_lower_bound(b,c),
    inference(cp,[status(thm)],[eq_3,eq_7]) ).

cnf(eq_14,plain,
    X = multiply(inverse(Y),multiply(Y,X)),
    inference(rw,[status(thm)],[eq_11,eq_0]) ).

cnf(eq_15,plain,
    multiply(inverse(inverse(Y)),X) = multiply(Y,X),
    inference(cp,[status(thm)],[eq_14,eq_14]) ).

cnf(eq_16,plain,
    multiply(inverse(inverse(X)),identity) = X,
    inference(cp,[status(thm)],[eq_1,eq_14]) ).

cnf(eq_17,plain,
    multiply(X,Y) = multiply(inverse(inverse(X)),Y),
    eq_15 ).

cnf(eq_18,plain,
    greatest_lower_bound(inverse(c),inverse(a)) = greatest_lower_bound(inverse(c),inverse(b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_12,eq_4]),eq_9]),eq_3]) ).

cnf(eq_19,plain,
    multiply(inverse(inverse(inverse(X))),X) = identity,
    inference(cp,[status(thm)],[eq_16,eq_14]) ).

cnf(eq_20,plain,
    multiply(X,inverse(X)) = identity,
    inference(cp,[status(thm)],[eq_17,eq_1]) ).

cnf(eq_21,plain,
    multiply(inverse(inverse(inverse(inverse(X)))),identity) = X,
    inference(cp,[status(thm)],[eq_19,eq_14]) ).

cnf(eq_22,plain,
    multiply(X,identity) = X,
    inference(cp,[status(thm)],[eq_17,eq_16]) ).

cnf(eq_23,plain,
    X = inverse(inverse(X)),
    inference(rw,[status(thm)],[eq_21,eq_16]) ).

cnf(eq_24,plain,
    multiply(X,multiply(Y,inverse(multiply(X,Y)))) = identity,
    inference(cp,[status(thm)],[eq_2,eq_20]) ).

cnf(eq_25,plain,
    greatest_lower_bound(identity,multiply(X,x102)) = multiply(X,greatest_lower_bound(inverse(X),x102)),
    inference(cp,[status(thm)],[eq_20,eq_5]) ).

cnf(eq_26,plain,
    greatest_lower_bound(identity,multiply(x102,inverse(X))) = multiply(greatest_lower_bound(X,x102),inverse(X)),
    inference(cp,[status(thm)],[eq_20,eq_6]) ).

cnf(eq_27,plain,
    greatest_lower_bound(multiply(x100,inverse(X)),identity) = multiply(greatest_lower_bound(x100,X),inverse(X)),
    inference(cp,[status(thm)],[eq_20,eq_6]) ).

cnf(eq_28,plain,
    multiply(greatest_lower_bound(X,Y),inverse(X)) = greatest_lower_bound(identity,multiply(Y,inverse(X))),
    eq_26 ).

cnf(eq_29,plain,
    multiply(X,greatest_lower_bound(inverse(X),Y)) = greatest_lower_bound(identity,multiply(X,Y)),
    eq_25 ).

cnf(eq_30,plain,
    multiply(greatest_lower_bound(X,Y),inverse(Y)) = greatest_lower_bound(identity,multiply(X,inverse(Y))),
    inference(rw,[status(thm)],[eq_27,eq_3]) ).

cnf(eq_31,plain,
    multiply(inverse(X),identity) = multiply(Y,inverse(multiply(X,Y))),
    inference(cp,[status(thm)],[eq_24,eq_14]) ).

cnf(eq_32,plain,
    multiply(X,inverse(multiply(Y,X))) = inverse(Y),
    inference(rw,[status(thm)],[eq_31,eq_22]) ).

cnf(eq_33,plain,
    multiply(inverse(multiply(Y,X)),inverse(inverse(Y))) = inverse(X),
    inference(cp,[status(thm)],[eq_32,eq_32]) ).

cnf(eq_34,plain,
    multiply(inverse(multiply(X,Y)),X) = inverse(Y),
    inference(rw,[status(thm)],[eq_33,eq_23]) ).

cnf(eq_35,plain,
    multiply(c,greatest_lower_bound(inverse(c),inverse(b))) = greatest_lower_bound(identity,multiply(c,inverse(a))),
    inference(cp,[status(thm)],[eq_18,eq_29]) ).

cnf(eq_36,plain,
    greatest_lower_bound(identity,multiply(c,inverse(a))) = greatest_lower_bound(identity,multiply(c,inverse(b))),
    inference(rw,[status(thm)],[eq_35,eq_29]) ).

cnf(eq_37,plain,
    multiply(inverse(greatest_lower_bound(identity,multiply(X,inverse(Y)))),greatest_lower_bound(X,Y)) = inverse(inverse(Y)),
    inference(cp,[status(thm)],[eq_30,eq_34]) ).

cnf(eq_38,plain,
    multiply(inverse(greatest_lower_bound(identity,multiply(Y,inverse(X)))),greatest_lower_bound(X,Y)) = inverse(inverse(X)),
    inference(cp,[status(thm)],[eq_28,eq_34]) ).

cnf(eq_39,plain,
    X = multiply(inverse(greatest_lower_bound(identity,multiply(Y,inverse(X)))),greatest_lower_bound(Y,X)),
    inference(rw,[status(thm)],[eq_37,eq_23]) ).

cnf(eq_40,plain,
    X = multiply(inverse(greatest_lower_bound(identity,multiply(Y,inverse(X)))),greatest_lower_bound(X,Y)),
    inference(rw,[status(thm)],[eq_38,eq_23]) ).

cnf(eq_41,plain,
    multiply(inverse(greatest_lower_bound(identity,multiply(c,inverse(a)))),greatest_lower_bound(b,c)) = a,
    inference(cp,[status(thm)],[eq_13,eq_39]) ).

cnf(eq_42,plain,
    a = b,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_41,eq_36]),eq_40]) ).

cnf(eq_43,negated_conjecture,
    b != b,
    inference(rw,[status(thm)],[eq_10,eq_42]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP181-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12  % Command  : run_maedmax %d %s
% 0.13/0.33  % Computer : n007.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Tue Jul 26 04:01:15 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 96.36/96.64  % SZS status Unsatisfiable
% 96.36/96.64  % SZS output start CNFRefutation for /tmp/MaedMax_25489
% See solution above
% 96.36/96.64  
%------------------------------------------------------------------------------