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

% Computer : n013.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:10 EDT 2022

% Result   : Unsatisfiable 7.29s 7.50s
% Output   : CNFRefutation 7.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   28 (  28 unt;   0 nHn;  12 RR)
%            Number of literals    :   28 (  27 equ;   3 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    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   32 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
    greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
    file('/tmp/MaedMax_10204') ).

cnf(eq_1,axiom,
    least_upper_bound(X,Y) = least_upper_bound(Y,X),
    file('/tmp/MaedMax_10204') ).

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

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

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

cnf(eq_5,axiom,
    least_upper_bound(a,c) = a,
    file('/tmp/MaedMax_10204') ).

cnf(eq_6,axiom,
    least_upper_bound(b,c) = b,
    file('/tmp/MaedMax_10204') ).

cnf(eq_7,negated_conjecture,
    greatest_lower_bound(a,b) != least_upper_bound(greatest_lower_bound(a,b),c),
    file('/tmp/MaedMax_10204') ).

cnf(eq_8,negated_conjecture,
    greatest_lower_bound(b,a) != least_upper_bound(c,greatest_lower_bound(b,a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_7,eq_0]),eq_0]),eq_1]) ).

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

cnf(eq_10,plain,
    greatest_lower_bound(greatest_lower_bound(X,Y),x102) = greatest_lower_bound(Y,greatest_lower_bound(X,x102)),
    inference(cp,[status(thm)],[eq_0,eq_2]) ).

cnf(eq_11,plain,
    least_upper_bound(greatest_lower_bound(X,Y),greatest_lower_bound(X,greatest_lower_bound(Y,Z))) = greatest_lower_bound(X,Y),
    inference(cp,[status(thm)],[eq_2,eq_3]) ).

cnf(eq_12,plain,
    least_upper_bound(c,b) = b,
    inference(cp,[status(thm)],[eq_1,eq_6]) ).

cnf(eq_13,plain,
    greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(Y,greatest_lower_bound(X,Z)),
    inference(rw,[status(thm)],[eq_10,eq_2]) ).

cnf(eq_14,plain,
    greatest_lower_bound(c,b) = c,
    inference(cp,[status(thm)],[eq_12,eq_4]) ).

cnf(eq_15,plain,
    greatest_lower_bound(c,a) = c,
    inference(cp,[status(thm)],[eq_5,eq_9]) ).

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

cnf(eq_17,plain,
    greatest_lower_bound(X,Y) = greatest_lower_bound(Y,greatest_lower_bound(X,least_upper_bound(Z,Y))),
    eq_16 ).

cnf(eq_18,plain,
    greatest_lower_bound(c,x102) = greatest_lower_bound(c,greatest_lower_bound(b,x102)),
    inference(cp,[status(thm)],[eq_14,eq_2]) ).

cnf(eq_19,plain,
    greatest_lower_bound(c,X) = greatest_lower_bound(b,greatest_lower_bound(c,X)),
    inference(rw,[status(thm)],[eq_18,eq_13]) ).

cnf(eq_20,plain,
    least_upper_bound(greatest_lower_bound(x100,b),greatest_lower_bound(x100,greatest_lower_bound(c,X))) = greatest_lower_bound(x100,b),
    inference(cp,[status(thm)],[eq_19,eq_11]) ).

cnf(eq_21,plain,
    greatest_lower_bound(X,b) = least_upper_bound(greatest_lower_bound(X,b),greatest_lower_bound(X,greatest_lower_bound(c,Y))),
    eq_20 ).

cnf(eq_22,plain,
    least_upper_bound(greatest_lower_bound(Y,b),greatest_lower_bound(c,Y)) = greatest_lower_bound(Y,b),
    inference(cp,[status(thm)],[eq_17,eq_21]) ).

cnf(eq_23,plain,
    greatest_lower_bound(X,b) = least_upper_bound(greatest_lower_bound(X,b),greatest_lower_bound(c,X)),
    eq_22 ).

cnf(eq_24,plain,
    least_upper_bound(greatest_lower_bound(a,b),c) = greatest_lower_bound(a,b),
    inference(cp,[status(thm)],[eq_15,eq_23]) ).

cnf(eq_25,plain,
    greatest_lower_bound(b,a) = least_upper_bound(c,greatest_lower_bound(b,a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_24,eq_0]),eq_1]),eq_0]) ).

cnf(eq_26,negated_conjecture,
    greatest_lower_bound(b,a) != greatest_lower_bound(b,a),
    inference(cp,[status(thm)],[eq_25,eq_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP138-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13  % Command  : run_maedmax %d %s
% 0.13/0.34  % Computer : n013.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 Jul 26 04:12:45 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 7.29/7.50  % SZS status Unsatisfiable
% 7.29/7.50  % SZS output start CNFRefutation for /tmp/MaedMax_10204
% See solution above
% 7.29/7.50  
%------------------------------------------------------------------------------