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

% Computer : n011.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:23 EDT 2022

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

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

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

cnf(eq_2,axiom,
    X = least_upper_bound(X,X),
    file('/tmp/MaedMax_18906') ).

cnf(eq_3,negated_conjecture,
    least_upper_bound(b,least_upper_bound(a,b)) != least_upper_bound(a,b),
    file('/tmp/MaedMax_18906') ).

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

cnf(eq_5,plain,
    least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(Y,least_upper_bound(X,Z)),
    inference(rw,[status(thm)],[eq_4,eq_1]) ).

cnf(eq_6,negated_conjecture,
    least_upper_bound(a,least_upper_bound(b,b)) != least_upper_bound(a,b),
    inference(cp,[status(thm)],[eq_5,eq_3]) ).

cnf(eq_7,negated_conjecture,
    least_upper_bound(b,a) != least_upper_bound(b,a),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_6,eq_2]),eq_0]),eq_0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GRP188-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.13  % Command  : run_maedmax %d %s
% 0.13/0.34  % Computer : n011.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:05:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.51  % SZS status Unsatisfiable
% 0.19/0.51  % SZS output start CNFRefutation for /tmp/MaedMax_18906
% See solution above
% 0.19/0.51  
%------------------------------------------------------------------------------