%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP597-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:58 EDT 2022

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

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

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

cnf(eq_2,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/tmp/MaedMax_19323') ).

cnf(eq_3,negated_conjecture,
    inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_2,eq_1]),eq_1]) ).

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

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

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

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

cnf(eq_8,plain,
    double_divide(A,inverse(double_divide(double_divide(double_divide(C,x3),inverse(double_divide(C,inverse(double_divide(inverse(inverse(x103)),x3))))),inverse(A)))) = x103,
    inference(cp,[status(thm)],[eq_6,eq_6]) ).

cnf(eq_9,plain,
    A = double_divide(B,inverse(double_divide(inverse(A),inverse(B)))),
    inference(rw,[status(thm)],[eq_8,eq_0]) ).

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

cnf(eq_11,plain,
    double_divide(double_divide(B,inverse(B)),inverse(A)) = A,
    inference(cp,[status(thm)],[eq_9,eq_0]) ).

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

cnf(eq_13,plain,
    double_divide(A,inverse(x102)) = double_divide(inverse(x102),inverse(inverse(A))),
    inference(cp,[status(thm)],[eq_12,eq_7]) ).

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

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

cnf(eq_16,negated_conjecture,
    inverse(double_divide(inverse(a1),inverse(inverse(a1)))) != inverse(double_divide(b1,inverse(b1))),
    inference(cp,[status(thm)],[eq_14,eq_3]) ).

cnf(eq_17,plain,
    double_divide(A,inverse(A)) = double_divide(B,inverse(B)),
    inference(cp,[status(thm)],[eq_11,eq_15]) ).

cnf(eq_18,negated_conjecture,
    inverse(double_divide(inverse(inverse(a1)),inverse(inverse(inverse(a1))))) != inverse(double_divide(b1,inverse(b1))),
    inference(cp,[status(thm)],[eq_14,eq_16]) ).

cnf(eq_19,negated_conjecture,
    inverse(double_divide(A,inverse(A))) != inverse(double_divide(b1,inverse(b1))),
    inference(cp,[status(thm)],[eq_17,eq_18]) ).

cnf(eq_20,negated_conjecture,
    inverse(double_divide(A,inverse(A))) != inverse(double_divide(A,inverse(A))),
    eq_19 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP597-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/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:04:51 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.72/0.91  % SZS status Unsatisfiable
% 0.72/0.91  % SZS output start CNFRefutation for /tmp/MaedMax_19323
% See solution above
% 0.72/0.91  
%------------------------------------------------------------------------------