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

% Computer : n013.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:51 EDT 2022

% Result   : Unsatisfiable 0.47s 0.67s
% Output   : CNFRefutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   24 (  24 unt;   0 nHn;   9 RR)
%            Number of literals    :   24 (  23 equ;   8 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn)

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

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

cnf(eq_2,plain,
    multiply(x100,multiply(A,x101)) = multiply(multiply(inverse(multiply(inverse(multiply(x100,x101)),C)),A),C),
    inference(cp,[status(thm)],[eq_0,eq_0]) ).

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

cnf(eq_4,plain,
    A = multiply(B,multiply(multiply(inverse(C),A),multiply(multiply(inverse(multiply(B,x3)),C),x3))),
    eq_3 ).

cnf(eq_5,plain,
    multiply(A,multiply(B,C)) = multiply(multiply(inverse(multiply(inverse(multiply(A,C)),x3)),B),x3),
    eq_2 ).

cnf(eq_6,plain,
    multiply(multiply(inverse(A),x102),A) = x102,
    inference(cp,[status(thm)],[eq_0,eq_4]) ).

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

cnf(eq_8,plain,
    A = multiply(inverse(multiply(B,C)),multiply(B,multiply(A,C))),
    eq_7 ).

cnf(eq_9,plain,
    A = multiply(multiply(inverse(B),A),B),
    eq_6 ).

cnf(eq_10,plain,
    multiply(A,multiply(B,C)) = multiply(B,multiply(A,C)),
    inference(cp,[status(thm)],[eq_8,eq_9]) ).

cnf(eq_11,plain,
    multiply(inverse(A),multiply(multiply(inverse(B),A),multiply(x102,B))) = x102,
    inference(cp,[status(thm)],[eq_9,eq_8]) ).

cnf(eq_12,plain,
    multiply(inverse(multiply(x100,B)),multiply(x100,A)) = multiply(inverse(B),A),
    inference(cp,[status(thm)],[eq_9,eq_8]) ).

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

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

cnf(eq_15,plain,
    multiply(A,B) = multiply(multiply(inverse(C),B),multiply(A,C)),
    inference(cp,[status(thm)],[eq_14,eq_9]) ).

cnf(eq_16,negated_conjecture,
    multiply(inverse(multiply(C,a1)),multiply(C,a1)) != multiply(inverse(b1),b1),
    inference(cp,[status(thm)],[eq_13,eq_1]) ).

cnf(eq_17,negated_conjecture,
    multiply(inverse(multiply(A,a1)),multiply(A,a1)) != multiply(inverse(b1),b1),
    eq_16 ).

cnf(eq_18,negated_conjecture,
    multiply(B,multiply(inverse(multiply(B,a1)),a1)) != multiply(inverse(b1),b1),
    inference(cp,[status(thm)],[eq_10,eq_17]) ).

cnf(eq_19,negated_conjecture,
    multiply(A,multiply(inverse(multiply(A,a1)),a1)) != multiply(inverse(b1),b1),
    eq_18 ).

cnf(eq_20,negated_conjecture,
    multiply(inverse(multiply(multiply(inverse(a1),B),a1)),B) != multiply(inverse(b1),b1),
    inference(cp,[status(thm)],[eq_15,eq_19]) ).

cnf(eq_21,negated_conjecture,
    multiply(inverse(A),A) != multiply(inverse(b1),b1),
    inference(rw,[status(thm)],[eq_20,eq_9]) ).

cnf(eq_22,negated_conjecture,
    multiply(inverse(A),A) != multiply(inverse(A),A),
    eq_21 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : GRP517-1 : TPTP v8.1.0. Released v2.6.0.
% 0.08/0.14  % Command  : run_maedmax %d %s
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue Jul 26 04:12:30 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.47/0.67  % SZS status Unsatisfiable
% 0.47/0.67  % SZS output start CNFRefutation for /tmp/MaedMax_8947
% See solution above
% 0.47/0.67  
%------------------------------------------------------------------------------