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

% Computer : n016.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:45 EDT 2022

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

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

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

cnf(eq_2,axiom,
    divide(divide(A,A),B) = inverse(B),
    file('/tmp/MaedMax_26073') ).

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

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

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

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

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

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

cnf(eq_9,plain,
    divide(A,A) = divide(B,divide(inverse(C),divide(inverse(B),C))),
    eq_8 ).

cnf(eq_10,negated_conjecture,
    divide(inverse(a1),inverse(a1)) != multiply(inverse(b1),b1),
    inference(cp,[status(thm)],[eq_4,eq_3]) ).

cnf(eq_11,negated_conjecture,
    divide(B,divide(inverse(C),divide(inverse(B),C))) != multiply(inverse(b1),b1),
    inference(cp,[status(thm)],[eq_9,eq_10]) ).

cnf(eq_12,negated_conjecture,
    divide(A,divide(inverse(B),divide(inverse(A),B))) != multiply(inverse(b1),b1),
    eq_11 ).

cnf(eq_13,negated_conjecture,
    divide(A,divide(inverse(B),divide(inverse(A),B))) != divide(inverse(b1),inverse(b1)),
    inference(rw,[status(thm)],[eq_12,eq_4]) ).

cnf(eq_14,negated_conjecture,
    divide(A,A) != divide(inverse(b1),inverse(b1)),
    inference(cp,[status(thm)],[eq_9,eq_13]) ).

cnf(eq_15,negated_conjecture,
    divide(A,A) != divide(A,A),
    eq_14 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP448-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12  % Command  : run_maedmax %d %s
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue Jul 26 04:31:35 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.52  % SZS status Unsatisfiable
% 0.19/0.52  % SZS output start CNFRefutation for /tmp/MaedMax_26073
% See solution above
% 0.19/0.52  
%------------------------------------------------------------------------------