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

% Result   : Unsatisfiable 0.35s 0.59s
% Output   : CNFRefutation 0.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   6 RR)
%            Number of literals    :   13 (  12 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   2 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   :   15 (   0 sgn)

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

cnf(eq_1,axiom,
    greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
    file('/tmp/MaedMax_3651') ).

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

cnf(eq_3,axiom,
    identity = greatest_lower_bound(a,identity),
    file('/tmp/MaedMax_3651') ).

cnf(eq_4,negated_conjecture,
    greatest_lower_bound(a,multiply(a,a)) != a,
    file('/tmp/MaedMax_3651') ).

cnf(eq_5,plain,
    greatest_lower_bound(X,multiply(x102,X)) = multiply(greatest_lower_bound(identity,x102),X),
    inference(cp,[status(thm)],[eq_0,eq_2]) ).

cnf(eq_6,plain,
    multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(Y,Z),multiply(X,Z)),
    inference(cp,[status(thm)],[eq_2,eq_1]) ).

cnf(eq_7,plain,
    multiply(greatest_lower_bound(X,Y),Z) = multiply(greatest_lower_bound(Y,X),Z),
    inference(rw,[status(thm)],[eq_6,eq_2]) ).

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

cnf(eq_9,negated_conjecture,
    multiply(greatest_lower_bound(identity,a),a) != a,
    inference(rw,[status(thm)],[eq_4,eq_8]) ).

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

cnf(eq_11,negated_conjecture,
    a != a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_10,eq_3]),eq_0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP165-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12  % Command  : run_maedmax %d %s
% 0.12/0.33  % Computer : n019.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:22:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.35/0.59  % SZS status Unsatisfiable
% 0.35/0.59  % SZS output start CNFRefutation for /tmp/MaedMax_3651
% See solution above
% 0.35/0.59  
%------------------------------------------------------------------------------