%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP590-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp
% Command  : run_maedmax %d %s

% Computer : n004.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:57 EDT 2022

% Result   : Unsatisfiable 0.90s 1.13s
% Output   : CNFRefutation 0.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   22 (  22 unt;   0 nHn;   3 RR)
%            Number of literals    :   22 (  21 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   13 (   3 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   9 con; 0-2 aty)
%            Number of variables   :   40 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
    A = double_divide(inverse(double_divide(double_divide(B,C),inverse(double_divide(B,inverse(A))))),C),
    file('/tmp/MaedMax_5057') ).

cnf(eq_1,axiom,
    inverse(double_divide(A,B)) = multiply(B,A),
    file('/tmp/MaedMax_5057') ).

cnf(eq_2,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('/tmp/MaedMax_5057') ).

cnf(eq_3,plain,
    double_divide(inverse(double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(B,C),inverse(double_divide(B,inverse(A))))),inverse(x102))))),C) = x102,
    inference(cp,[status(thm)],[eq_0,eq_0]) ).

cnf(eq_4,plain,
    double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(B,inverse(x102)),inverse(double_divide(B,inverse(A))))),x101),inverse(A))),x101) = x102,
    inference(cp,[status(thm)],[eq_0,eq_0]) ).

cnf(eq_5,plain,
    A = double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(B,inverse(A)),inverse(double_divide(B,inverse(C))))),x3),inverse(C))),x3),
    eq_4 ).

cnf(eq_6,plain,
    A = double_divide(inverse(double_divide(B,inverse(double_divide(inverse(double_divide(double_divide(C,x3),inverse(double_divide(C,inverse(B))))),inverse(A))))),x3),
    eq_3 ).

cnf(eq_7,plain,
    double_divide(inverse(double_divide(A,inverse(A))),inverse(x101)) = x101,
    inference(cp,[status(thm)],[eq_0,eq_5]) ).

cnf(eq_8,plain,
    double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(B,inverse(x102)),inverse(double_divide(B,inverse(A))))),inverse(x101)),inverse(A))),x103),inverse(x102))),x103) = x101,
    inference(cp,[status(thm)],[eq_0,eq_5]) ).

cnf(eq_9,plain,
    A = double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(B,inverse(C)),inverse(double_divide(B,inverse(x3))))),inverse(A)),inverse(x3))),x4),inverse(C))),x4),
    eq_8 ).

cnf(eq_10,plain,
    A = double_divide(inverse(double_divide(B,inverse(B))),inverse(A)),
    eq_7 ).

cnf(eq_11,plain,
    double_divide(inverse(double_divide(x100,inverse(A))),inverse(x100)) = A,
    inference(cp,[status(thm)],[eq_10,eq_6]) ).

cnf(eq_12,plain,
    double_divide(inverse(double_divide(double_divide(inverse(double_divide(A,inverse(A))),x104),inverse(x101))),x104) = x101,
    inference(cp,[status(thm)],[eq_0,eq_9]) ).

cnf(eq_13,plain,
    A = double_divide(inverse(double_divide(double_divide(inverse(double_divide(B,inverse(B))),C),inverse(A))),C),
    eq_12 ).

cnf(eq_14,plain,
    A = double_divide(inverse(double_divide(B,inverse(A))),inverse(B)),
    eq_11 ).

cnf(eq_15,plain,
    double_divide(inverse(A),inverse(inverse(double_divide(double_divide(inverse(double_divide(B,inverse(B))),inverse(x101)),inverse(A))))) = x101,
    inference(cp,[status(thm)],[eq_13,eq_14]) ).

cnf(eq_16,plain,
    A = double_divide(inverse(B),inverse(inverse(double_divide(A,inverse(B))))),
    inference(rw,[status(thm)],[eq_15,eq_10]) ).

cnf(eq_17,plain,
    A = inverse(double_divide(A,inverse(double_divide(x100,inverse(x100))))),
    inference(cp,[status(thm)],[eq_16,eq_10]) ).

cnf(eq_18,plain,
    A = inverse(double_divide(A,inverse(double_divide(B,inverse(B))))),
    eq_17 ).

cnf(eq_19,plain,
    A = multiply(multiply(inverse(B),B),A),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_18,eq_1]),eq_1]) ).

cnf(eq_20,negated_conjecture,
    a2 != a2,
    inference(cp,[status(thm)],[eq_19,eq_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GRP590-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13  % Command  : run_maedmax %d %s
% 0.13/0.34  % Computer : n004.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:11:51 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.90/1.13  % SZS status Unsatisfiable
% 0.90/1.13  % SZS output start CNFRefutation for /tmp/MaedMax_5057
% See solution above
% 0.90/1.13  
%------------------------------------------------------------------------------