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

% Computer : n016.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:15 EDT 2022

% Result   : Unsatisfiable 58.79s 58.98s
% Output   : CNFRefutation 58.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   19
% Syntax   : Number of clauses     :  111 ( 111 unt;   0 nHn;  19 RR)
%            Number of literals    :  111 ( 110 equ;  15 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :  165 (  26 sgn)

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

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

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

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

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

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

cnf(eq_6,axiom,
    least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
    file('/tmp/MaedMax_26047') ).

cnf(eq_7,axiom,
    X = least_upper_bound(X,X),
    file('/tmp/MaedMax_26047') ).

cnf(eq_8,axiom,
    X = greatest_lower_bound(X,X),
    file('/tmp/MaedMax_26047') ).

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

cnf(eq_10,axiom,
    X = greatest_lower_bound(X,least_upper_bound(X,Y)),
    file('/tmp/MaedMax_26047') ).

cnf(eq_11,axiom,
    multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
    file('/tmp/MaedMax_26047') ).

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

cnf(eq_13,axiom,
    multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
    file('/tmp/MaedMax_26047') ).

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

cnf(eq_15,axiom,
    least_upper_bound(X,identity) = positive_part(X),
    file('/tmp/MaedMax_26047') ).

cnf(eq_16,axiom,
    greatest_lower_bound(X,identity) = negative_part(X),
    file('/tmp/MaedMax_26047') ).

cnf(eq_17,axiom,
    greatest_lower_bound(least_upper_bound(X,Y),least_upper_bound(X,Z)) = least_upper_bound(X,greatest_lower_bound(Y,Z)),
    file('/tmp/MaedMax_26047') ).

cnf(eq_18,negated_conjecture,
    multiply(positive_part(a),negative_part(a)) != a,
    file('/tmp/MaedMax_26047') ).

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

cnf(eq_20,plain,
    multiply(negative_part(X),x102) = greatest_lower_bound(multiply(X,x102),multiply(identity,x102)),
    inference(cp,[status(thm)],[eq_16,eq_14]) ).

cnf(eq_21,plain,
    multiply(positive_part(X),x102) = least_upper_bound(multiply(X,x102),multiply(identity,x102)),
    inference(cp,[status(thm)],[eq_15,eq_13]) ).

cnf(eq_22,plain,
    greatest_lower_bound(X,greatest_lower_bound(greatest_lower_bound(X,Z),Z)) = greatest_lower_bound(X,Z),
    inference(cp,[status(thm)],[eq_45,eq_8]) ).

cnf(eq_23,plain,
    greatest_lower_bound(X,greatest_lower_bound(Y,identity)) = negative_part(greatest_lower_bound(X,Y)),
    inference(cp,[status(thm)],[eq_5,eq_16]) ).

cnf(eq_24,plain,
    greatest_lower_bound(X,greatest_lower_bound(x100,x101)) = greatest_lower_bound(x100,greatest_lower_bound(x101,X)),
    inference(cp,[status(thm)],[eq_3,eq_5]) ).

cnf(eq_25,plain,
    greatest_lower_bound(greatest_lower_bound(X,Y),x102) = greatest_lower_bound(Y,greatest_lower_bound(X,x102)),
    inference(cp,[status(thm)],[eq_3,eq_5]) ).

cnf(eq_26,plain,
    positive_part(identity) = identity,
    inference(cp,[status(thm)],[eq_15,eq_7]) ).

cnf(eq_27,plain,
    least_upper_bound(identity,X) = positive_part(X),
    inference(cp,[status(thm)],[eq_4,eq_15]) ).

cnf(eq_28,plain,
    least_upper_bound(X,least_upper_bound(Y,identity)) = positive_part(least_upper_bound(X,Y)),
    inference(cp,[status(thm)],[eq_6,eq_15]) ).

cnf(eq_29,plain,
    least_upper_bound(least_upper_bound(Y,X),x102) = least_upper_bound(X,least_upper_bound(Y,x102)),
    inference(cp,[status(thm)],[eq_4,eq_6]) ).

cnf(eq_30,plain,
    negative_part(X) = greatest_lower_bound(identity,X),
    inference(cp,[status(thm)],[eq_16,eq_3]) ).

cnf(eq_31,plain,
    greatest_lower_bound(x100,negative_part(X)) = greatest_lower_bound(X,greatest_lower_bound(x100,identity)),
    inference(cp,[status(thm)],[eq_16,eq_45]) ).

cnf(eq_32,plain,
    least_upper_bound(x101,x102) = least_upper_bound(x101,least_upper_bound(least_upper_bound(x101,x102),x102)),
    inference(cp,[status(thm)],[eq_7,eq_39]) ).

cnf(eq_33,plain,
    least_upper_bound(x100,X) = least_upper_bound(X,least_upper_bound(x100,greatest_lower_bound(X,Y))),
    inference(cp,[status(thm)],[eq_9,eq_39]) ).

cnf(eq_34,plain,
    multiply(positive_part(X),Y) = least_upper_bound(Y,multiply(X,Y)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_21,eq_0]),eq_4]) ).

cnf(eq_35,plain,
    greatest_lower_bound(identity,X) = negative_part(X),
    eq_30 ).

cnf(eq_36,plain,
    least_upper_bound(X,Y) = least_upper_bound(X,least_upper_bound(X,Y)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_32,eq_6]),eq_7]) ).

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

cnf(eq_38,plain,
    greatest_lower_bound(X,Y) = greatest_lower_bound(X,greatest_lower_bound(X,Y)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_22,eq_5]),eq_8]) ).

cnf(eq_39,plain,
    least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(Y,least_upper_bound(X,Z)),
    inference(rw,[status(thm)],[eq_29,eq_6]) ).

cnf(eq_40,plain,
    greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(Y,greatest_lower_bound(Z,X)),
    eq_24 ).

cnf(eq_41,plain,
    greatest_lower_bound(X,negative_part(Y)) = negative_part(greatest_lower_bound(X,Y)),
    inference(rw,[status(thm)],[eq_23,eq_16]) ).

cnf(eq_42,plain,
    least_upper_bound(X,Y) = least_upper_bound(Y,least_upper_bound(X,greatest_lower_bound(Y,Z))),
    eq_33 ).

cnf(eq_43,plain,
    least_upper_bound(X,positive_part(Y)) = positive_part(least_upper_bound(X,Y)),
    inference(rw,[status(thm)],[eq_28,eq_15]) ).

cnf(eq_44,plain,
    multiply(negative_part(X),Y) = greatest_lower_bound(Y,multiply(X,Y)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_20,eq_0]),eq_3]) ).

cnf(eq_45,plain,
    greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(Y,greatest_lower_bound(X,Z)),
    inference(rw,[status(thm)],[eq_25,eq_5]) ).

cnf(eq_46,plain,
    greatest_lower_bound(X,negative_part(Y)) = greatest_lower_bound(Y,negative_part(X)),
    inference(rw,[status(thm)],[eq_31,eq_16]) ).

cnf(eq_47,negated_conjecture,
    least_upper_bound(negative_part(a),multiply(a,negative_part(a))) != a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_18,eq_15]),eq_13]),eq_0]),eq_4]) ).

cnf(eq_48,plain,
    multiply(x100,negative_part(X)) = greatest_lower_bound(multiply(x100,identity),multiply(x100,X)),
    inference(cp,[status(thm)],[eq_35,eq_12]) ).

cnf(eq_49,plain,
    greatest_lower_bound(negative_part(X),x102) = greatest_lower_bound(identity,greatest_lower_bound(X,x102)),
    inference(cp,[status(thm)],[eq_35,eq_5]) ).

cnf(eq_50,plain,
    least_upper_bound(identity,negative_part(X)) = identity,
    inference(cp,[status(thm)],[eq_35,eq_9]) ).

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

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

cnf(eq_53,plain,
    identity = least_upper_bound(identity,negative_part(X)),
    eq_50 ).

cnf(eq_54,plain,
    multiply(X,Y) = multiply(inverse(inverse(X)),Y),
    eq_51 ).

cnf(eq_55,plain,
    negative_part(greatest_lower_bound(X,Y)) = negative_part(greatest_lower_bound(Y,X)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_46,eq_41]),eq_41]) ).

cnf(eq_56,plain,
    identity = positive_part(negative_part(X)),
    inference(rw,[status(thm)],[eq_53,eq_27]) ).

cnf(eq_57,plain,
    multiply(x100,positive_part(X)) = least_upper_bound(multiply(x100,identity),multiply(x100,X)),
    inference(cp,[status(thm)],[eq_27,eq_11]) ).

cnf(eq_58,plain,
    multiply(inverse(inverse(inverse(X))),X) = identity,
    inference(cp,[status(thm)],[eq_52,eq_37]) ).

cnf(eq_59,plain,
    greatest_lower_bound(least_upper_bound(identity,x101),positive_part(X)) = least_upper_bound(identity,greatest_lower_bound(x101,X)),
    inference(cp,[status(thm)],[eq_27,eq_17]) ).

cnf(eq_60,plain,
    least_upper_bound(identity,positive_part(X)) = least_upper_bound(identity,X),
    inference(cp,[status(thm)],[eq_27,eq_36]) ).

cnf(eq_61,plain,
    least_upper_bound(positive_part(X),x102) = least_upper_bound(identity,least_upper_bound(X,x102)),
    inference(cp,[status(thm)],[eq_27,eq_6]) ).

cnf(eq_62,plain,
    positive_part(X) = positive_part(positive_part(X)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_60,eq_27]),eq_27]) ).

cnf(eq_63,plain,
    greatest_lower_bound(negative_part(X),Y) = negative_part(greatest_lower_bound(X,Y)),
    inference(rw,[status(thm)],[eq_49,eq_35]) ).

cnf(eq_64,plain,
    greatest_lower_bound(positive_part(X),positive_part(Y)) = positive_part(greatest_lower_bound(X,Y)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_59,eq_27]),eq_27]) ).

cnf(eq_65,plain,
    least_upper_bound(positive_part(X),Y) = positive_part(least_upper_bound(X,Y)),
    inference(rw,[status(thm)],[eq_61,eq_27]) ).

cnf(eq_66,plain,
    multiply(inverse(inverse(inverse(inverse(X)))),identity) = X,
    inference(cp,[status(thm)],[eq_58,eq_37]) ).

cnf(eq_67,plain,
    multiply(X,identity) = X,
    inference(cp,[status(thm)],[eq_54,eq_52]) ).

cnf(eq_68,plain,
    greatest_lower_bound(X,Y) = greatest_lower_bound(greatest_lower_bound(X,Y),X),
    inference(cp,[status(thm)],[eq_38,eq_3]) ).

cnf(eq_69,plain,
    X = inverse(inverse(X)),
    inference(rw,[status(thm)],[eq_66,eq_52]) ).

cnf(eq_70,plain,
    greatest_lower_bound(X,Y) = greatest_lower_bound(X,greatest_lower_bound(Y,X)),
    inference(rw,[status(thm)],[eq_68,eq_5]) ).

cnf(eq_71,negated_conjecture,
    least_upper_bound(negative_part(a),multiply(inverse(inverse(a)),negative_part(a))) != a,
    inference(cp,[status(thm)],[eq_54,eq_47]) ).

cnf(eq_72,plain,
    multiply(X,negative_part(Y)) = greatest_lower_bound(X,multiply(X,Y)),
    inference(rw,[status(thm)],[eq_48,eq_67]) ).

cnf(eq_73,plain,
    multiply(X,positive_part(Y)) = least_upper_bound(X,multiply(X,Y)),
    inference(rw,[status(thm)],[eq_57,eq_67]) ).

cnf(eq_74,plain,
    least_upper_bound(X,identity) = multiply(positive_part(inverse(X)),X),
    inference(cp,[status(thm)],[eq_1,eq_34]) ).

cnf(eq_75,plain,
    multiply(positive_part(inverse(X)),X) = positive_part(X),
    inference(rw,[status(thm)],[eq_74,eq_15]) ).

cnf(eq_76,plain,
    multiply(inverse(positive_part(inverse(X))),positive_part(X)) = X,
    inference(cp,[status(thm)],[eq_75,eq_37]) ).

cnf(eq_77,plain,
    greatest_lower_bound(identity,positive_part(x101)) = positive_part(greatest_lower_bound(identity,x101)),
    inference(cp,[status(thm)],[eq_26,eq_64]) ).

cnf(eq_78,plain,
    greatest_lower_bound(identity,positive_part(X)) = positive_part(greatest_lower_bound(identity,X)),
    eq_77 ).

cnf(eq_79,plain,
    multiply(inverse(positive_part(inverse(negative_part(X)))),identity) = negative_part(X),
    inference(cp,[status(thm)],[eq_56,eq_76]) ).

cnf(eq_80,plain,
    greatest_lower_bound(positive_part(greatest_lower_bound(identity,X)),x102) = greatest_lower_bound(identity,greatest_lower_bound(positive_part(X),x102)),
    inference(cp,[status(thm)],[eq_78,eq_5]) ).

cnf(eq_81,plain,
    greatest_lower_bound(x100,positive_part(greatest_lower_bound(identity,X))) = greatest_lower_bound(identity,greatest_lower_bound(x100,positive_part(X))),
    inference(cp,[status(thm)],[eq_78,eq_45]) ).

cnf(eq_82,plain,
    negative_part(X) = negative_part(greatest_lower_bound(X,positive_part(Y))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_81,eq_35]),eq_56]),eq_16]),eq_35]) ).

cnf(eq_83,plain,
    inverse(positive_part(inverse(negative_part(X)))) = negative_part(X),
    inference(rw,[status(thm)],[eq_79,eq_67]) ).

cnf(eq_84,plain,
    negative_part(X) = negative_part(greatest_lower_bound(positive_part(Y),X)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_80,eq_35]),eq_56]),eq_35]),eq_35]) ).

cnf(eq_85,plain,
    inverse(negative_part(X)) = positive_part(inverse(negative_part(X))),
    inference(cp,[status(thm)],[eq_83,eq_69]) ).

cnf(eq_86,plain,
    greatest_lower_bound(positive_part(X),positive_part(least_upper_bound(X,Y))) = positive_part(X),
    inference(cp,[status(thm)],[eq_65,eq_10]) ).

cnf(eq_87,plain,
    greatest_lower_bound(X,least_upper_bound(Y,X)) = X,
    inference(cp,[status(thm)],[eq_4,eq_10]) ).

cnf(eq_88,plain,
    least_upper_bound(x100,negative_part(X)) = greatest_lower_bound(least_upper_bound(x100,identity),least_upper_bound(x100,X)),
    inference(cp,[status(thm)],[eq_35,eq_17]) ).

cnf(eq_89,plain,
    negative_part(greatest_lower_bound(inverse(negative_part(X)),x101)) = negative_part(x101),
    inference(cp,[status(thm)],[eq_85,eq_84]) ).

cnf(eq_90,plain,
    greatest_lower_bound(positive_part(X),least_upper_bound(X,Y)) = least_upper_bound(X,negative_part(Y)),
    inference(rw,[status(thm)],[eq_88,eq_15]) ).

cnf(eq_91,plain,
    negative_part(X) = negative_part(greatest_lower_bound(inverse(negative_part(Y)),X)),
    eq_89 ).

cnf(eq_92,plain,
    greatest_lower_bound(X,positive_part(X)) = X,
    inference(cp,[status(thm)],[eq_27,eq_87]) ).

cnf(eq_93,plain,
    negative_part(X) = negative_part(greatest_lower_bound(X,inverse(negative_part(Y)))),
    inference(cp,[status(thm)],[eq_91,eq_55]) ).

cnf(eq_94,negated_conjecture,
    least_upper_bound(negative_part(greatest_lower_bound(inverse(negative_part(Y)),a)),multiply(inverse(inverse(a)),negative_part(a))) != a,
    inference(cp,[status(thm)],[eq_91,eq_71]) ).

cnf(eq_95,negated_conjecture,
    least_upper_bound(negative_part(greatest_lower_bound(a,inverse(negative_part(X)))),multiply(a,negative_part(a))) != a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_94,eq_3]),eq_69]) ).

cnf(eq_96,negated_conjecture,
    least_upper_bound(negative_part(greatest_lower_bound(a,inverse(negative_part(greatest_lower_bound(Y,X))))),multiply(a,negative_part(a))) != a,
    inference(cp,[status(thm)],[eq_55,eq_95]) ).

cnf(eq_97,negated_conjecture,
    least_upper_bound(negative_part(greatest_lower_bound(a,inverse(negative_part(greatest_lower_bound(X,Y))))),multiply(a,negative_part(a))) != a,
    eq_96 ).

cnf(eq_98,plain,
    greatest_lower_bound(x100,X) = greatest_lower_bound(positive_part(X),greatest_lower_bound(x100,X)),
    inference(cp,[status(thm)],[eq_92,eq_40]) ).

cnf(eq_99,plain,
    greatest_lower_bound(X,Y) = greatest_lower_bound(positive_part(Y),greatest_lower_bound(X,Y)),
    eq_98 ).

cnf(eq_100,negated_conjecture,
    least_upper_bound(multiply(a,negative_part(a)),negative_part(greatest_lower_bound(a,inverse(negative_part(greatest_lower_bound(x100,x101)))))) != a,
    inference(cp,[status(thm)],[eq_4,eq_97]) ).

cnf(eq_101,negated_conjecture,
    least_upper_bound(multiply(a,negative_part(a)),negative_part(greatest_lower_bound(a,inverse(negative_part(greatest_lower_bound(X,Y)))))) != a,
    eq_100 ).

cnf(eq_102,negated_conjecture,
    least_upper_bound(negative_part(greatest_lower_bound(a,inverse(negative_part(greatest_lower_bound(x100,x101))))),least_upper_bound(multiply(a,negative_part(a)),greatest_lower_bound(negative_part(greatest_lower_bound(a,inverse(negative_part(greatest_lower_bound(x100,x101))))),Z))) != a,
    inference(cp,[status(thm)],[eq_42,eq_101]) ).

cnf(eq_103,negated_conjecture,
    least_upper_bound(negative_part(a),least_upper_bound(greatest_lower_bound(a,multiply(a,a)),negative_part(greatest_lower_bound(a,X)))) != a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_102,eq_93]),eq_72]),eq_93]),eq_63]) ).

cnf(eq_104,negated_conjecture,
    least_upper_bound(negative_part(a),least_upper_bound(greatest_lower_bound(a,multiply(a,a)),negative_part(greatest_lower_bound(X,a)))) != a,
    inference(cp,[status(thm)],[eq_3,eq_103]) ).

cnf(eq_105,plain,
    greatest_lower_bound(positive_part(X),greatest_lower_bound(x101,positive_part(X))) = greatest_lower_bound(x101,positive_part(X)),
    inference(cp,[status(thm)],[eq_62,eq_99]) ).

cnf(eq_106,plain,
    greatest_lower_bound(X,positive_part(Y)) = greatest_lower_bound(positive_part(Y),X),
    inference(rw,[status(thm)],[eq_105,eq_70]) ).

cnf(eq_107,negated_conjecture,
    least_upper_bound(negative_part(a),least_upper_bound(greatest_lower_bound(a,multiply(a,a)),negative_part(greatest_lower_bound(a,positive_part(Y))))) != a,
    inference(cp,[status(thm)],[eq_106,eq_104]) ).

cnf(eq_108,negated_conjecture,
    greatest_lower_bound(a,positive_part(multiply(negative_part(a),positive_part(a)))) != a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_107,eq_44]),eq_82]),eq_90]),eq_4]),eq_34]),eq_56]),eq_0]),eq_3]),eq_17]),eq_4]),eq_43]),eq_90]),eq_73]),eq_7]),eq_3]),eq_92]) ).

cnf(eq_109,negated_conjecture,
    a != a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_108,eq_44]),eq_73]),eq_64]),eq_62]),eq_86]),eq_92]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP167-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command  : run_maedmax %d %s
% 0.13/0.33  % Computer : n016.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:31:35 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 58.79/58.98  % SZS status Unsatisfiable
% 58.79/58.98  % SZS output start CNFRefutation for /tmp/MaedMax_26047
% See solution above
% 58.79/58.98  
%------------------------------------------------------------------------------