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

% Computer : n025.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:55 EDT 2022

% Result   : Unsatisfiable 0.54s 0.74s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   28 (  28 unt;   0 nHn;   9 RR)
%            Number of literals    :   28 (  27 equ;   8 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 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   :   43 (   0 sgn)

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

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

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

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

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

cnf(eq_5,plain,
    divide(divide(divide(divide(divide(B,inverse(A)),C),inverse(x101)),divide(B,C)),A) = x101,
    inference(cp,[status(thm)],[eq_0,eq_0]) ).

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

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

cnf(eq_8,plain,
    divide(divide(A,divide(divide(divide(B,inverse(inverse(x103))),x3),divide(B,x3))),A) = x103,
    inference(cp,[status(thm)],[eq_7,eq_7]) ).

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

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

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

cnf(eq_12,plain,
    A = divide(A,divide(B,B)),
    eq_11 ).

cnf(eq_13,plain,
    A = divide(B,divide(inverse(A),inverse(B))),
    eq_10 ).

cnf(eq_14,plain,
    divide(x100,A) = divide(inverse(A),inverse(x100)),
    inference(cp,[status(thm)],[eq_13,eq_6]) ).

cnf(eq_15,plain,
    divide(A,B) = divide(inverse(B),inverse(A)),
    eq_14 ).

cnf(eq_16,plain,
    A = divide(B,multiply(inverse(A),B)),
    inference(rw,[status(thm)],[eq_13,eq_1]) ).

cnf(eq_17,plain,
    divide(A,B) = multiply(inverse(B),A),
    inference(rw,[status(thm)],[eq_15,eq_1]) ).

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

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

cnf(eq_20,negated_conjecture,
    divide(b1,b1) != divide(inverse(a1),inverse(a1)),
    inference(cp,[status(thm)],[eq_15,eq_3]) ).

cnf(eq_21,negated_conjecture,
    divide(inverse(a1),inverse(a1)) != divide(b1,b1),
    eq_20 ).

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

cnf(eq_23,negated_conjecture,
    divide(b1,b1) != multiply(inverse(a1),a1),
    inference(rw,[status(thm)],[eq_21,eq_1]) ).

cnf(eq_24,negated_conjecture,
    multiply(inverse(B),B) != divide(b1,b1),
    inference(cp,[status(thm)],[eq_22,eq_23]) ).

cnf(eq_25,negated_conjecture,
    multiply(inverse(A),A) != multiply(inverse(b1),b1),
    inference(rw,[status(thm)],[eq_24,eq_17]) ).

cnf(eq_26,negated_conjecture,
    multiply(inverse(A),A) != multiply(inverse(A),A),
    eq_25 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP561-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13  % Command  : run_maedmax %d %s
% 0.12/0.34  % Computer : n025.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:27:44 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.54/0.74  % SZS status Unsatisfiable
% 0.54/0.74  % SZS output start CNFRefutation for /tmp/MaedMax_21519
% See solution above
% 0.54/0.74  
%------------------------------------------------------------------------------