%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP497-1 : TPTP v8.1.0. Released v2.6.0.
% 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:50 EDT 2022

% Result   : Unsatisfiable 0.47s 0.64s
% Output   : CNFRefutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   22 (  22 unt;   0 nHn;   6 RR)
%            Number of literals    :   22 (  21 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn)

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

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

cnf(eq_2,axiom,
    double_divide(A,identity) = inverse(A),
    file('/tmp/MaedMax_7974') ).

cnf(eq_3,axiom,
    identity = double_divide(A,inverse(A)),
    file('/tmp/MaedMax_7974') ).

cnf(eq_4,negated_conjecture,
    multiply(identity,a2) != a2,
    file('/tmp/MaedMax_7974') ).

cnf(eq_5,plain,
    A = double_divide(double_divide(identity,double_divide(B,inverse(C))),inverse(double_divide(C,double_divide(A,B)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_0,eq_2]),eq_2]) ).

cnf(eq_6,negated_conjecture,
    double_divide(double_divide(a2,identity),identity) != a2,
    inference(rw,[status(thm)],[eq_4,eq_1]) ).

cnf(eq_7,plain,
    inverse(identity) = identity,
    inference(cp,[status(thm)],[eq_5,eq_3]) ).

cnf(eq_8,plain,
    double_divide(double_divide(identity,double_divide(inverse(A),inverse(x101))),inverse(double_divide(x101,identity))) = A,
    inference(cp,[status(thm)],[eq_3,eq_5]) ).

cnf(eq_9,plain,
    double_divide(double_divide(identity,double_divide(identity,inverse(x101))),inverse(double_divide(x101,inverse(A)))) = A,
    inference(cp,[status(thm)],[eq_2,eq_5]) ).

cnf(eq_10,plain,
    A = double_divide(double_divide(identity,double_divide(inverse(A),inverse(B))),inverse(inverse(B))),
    inference(rw,[status(thm)],[eq_8,eq_2]) ).

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

cnf(eq_12,plain,
    double_divide(double_divide(identity,double_divide(identity,inverse(A))),inverse(identity)) = A,
    inference(cp,[status(thm)],[eq_3,eq_11]) ).

cnf(eq_13,plain,
    double_divide(double_divide(identity,double_divide(identity,inverse(x101))),inverse(inverse(x101))) = identity,
    inference(cp,[status(thm)],[eq_7,eq_10]) ).

cnf(eq_14,plain,
    identity = double_divide(double_divide(identity,double_divide(identity,inverse(A))),inverse(inverse(A))),
    eq_13 ).

cnf(eq_15,plain,
    A = double_divide(double_divide(identity,double_divide(identity,inverse(A))),inverse(identity)),
    eq_12 ).

cnf(eq_16,plain,
    A = inverse(double_divide(identity,double_divide(identity,inverse(A)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_15,eq_7]),eq_2]) ).

cnf(eq_17,plain,
    double_divide(double_divide(identity,double_divide(inverse(inverse(A)),inverse(x101))),inverse(double_divide(x101,identity))) = double_divide(identity,double_divide(identity,inverse(A))),
    inference(cp,[status(thm)],[eq_14,eq_5]) ).

cnf(eq_18,plain,
    double_divide(identity,double_divide(identity,inverse(A))) = inverse(A),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_17,eq_2]),eq_10]) ).

cnf(eq_19,plain,
    inverse(inverse(A)) = A,
    inference(cp,[status(thm)],[eq_18,eq_16]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP497-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13  % Command  : run_maedmax %d %s
% 0.12/0.34  % Computer : n019.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Jul 26 04:24:07 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.47/0.64  % SZS status Unsatisfiable
% 0.47/0.64  % SZS output start CNFRefutation for /tmp/MaedMax_7974
% See solution above
% 0.47/0.64  
%------------------------------------------------------------------------------