TSTP Solution File: GRP509-1 by MaedMax---1.4

View Problem - Process Solution

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

% Result   : Unsatisfiable 0.64s 0.82s
% Output   : CNFRefutation 0.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   43 (  43 unt;   0 nHn;   6 RR)
%            Number of literals    :   43 (  42 equ;   5 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;   7 con; 0-2 aty)
%            Number of variables   :   89 (   0 sgn)

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

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

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

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

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

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

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

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

cnf(eq_8,plain,
    inverse(multiply(C,multiply(A,inverse(multiply(multiply(C,A),x102))))) = x102,
    inference(cp,[status(thm)],[eq_6,eq_7]) ).

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

cnf(eq_10,plain,
    multiply(inverse(multiply(C,x3)),inverse(multiply(A,inverse(multiply(multiply(multiply(C,A),x3),B))))) = B,
    inference(cp,[status(thm)],[eq_6,eq_0]) ).

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

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

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

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

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

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

cnf(eq_17,plain,
    multiply(multiply(x100,A),inverse(x100)) = inverse(multiply(B,multiply(C,inverse(multiply(multiply(B,C),A))))),
    inference(cp,[status(thm)],[eq_13,eq_9]) ).

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

cnf(eq_19,plain,
    A = multiply(B,multiply(multiply(A,C),inverse(multiply(B,C)))),
    eq_15 ).

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

cnf(eq_21,plain,
    inverse(multiply(B,inverse(multiply(B,C)))) = C,
    inference(cp,[status(thm)],[eq_16,eq_13]) ).

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

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

cnf(eq_24,plain,
    A = inverse(multiply(B,inverse(multiply(B,A)))),
    eq_21 ).

cnf(eq_25,plain,
    multiply(A,multiply(multiply(x101,inverse(multiply(B,inverse(B)))),inverse(A))) = x101,
    inference(cp,[status(thm)],[eq_20,eq_19]) ).

cnf(eq_26,plain,
    multiply(multiply(A,inverse(A)),inverse(multiply(x102,inverse(multiply(multiply(multiply(B,x102),inverse(B)),x103))))) = x103,
    inference(cp,[status(thm)],[eq_22,eq_14]) ).

cnf(eq_27,plain,
    inverse(inverse(B)) = B,
    inference(cp,[status(thm)],[eq_23,eq_24]) ).

cnf(eq_28,plain,
    multiply(A,inverse(A)) = multiply(x101,inverse(x101)),
    inference(cp,[status(thm)],[eq_22,eq_22]) ).

cnf(eq_29,plain,
    A = multiply(multiply(B,inverse(B)),A),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_26,eq_18]),eq_24]) ).

cnf(eq_30,plain,
    A = multiply(B,multiply(A,inverse(B))),
    inference(rw,[status(thm)],[eq_25,eq_20]) ).

cnf(eq_31,plain,
    A = inverse(inverse(A)),
    eq_27 ).

cnf(eq_32,plain,
    multiply(A,inverse(A)) = multiply(B,inverse(B)),
    eq_28 ).

cnf(eq_33,plain,
    multiply(multiply(A,inverse(multiply(x100,inverse(multiply(x100,x101))))),inverse(x101)) = A,
    inference(cp,[status(thm)],[eq_29,eq_5]) ).

cnf(eq_34,plain,
    multiply(inverse(A),A) = multiply(x101,inverse(x101)),
    inference(cp,[status(thm)],[eq_31,eq_32]) ).

cnf(eq_35,plain,
    A = multiply(multiply(A,B),inverse(B)),
    inference(rw,[status(thm)],[eq_33,eq_24]) ).

cnf(eq_36,plain,
    multiply(A,inverse(A)) = multiply(inverse(B),B),
    eq_34 ).

cnf(eq_37,plain,
    multiply(B,A) = multiply(A,B),
    inference(cp,[status(thm)],[eq_35,eq_30]) ).

cnf(eq_38,negated_conjecture,
    multiply(A,inverse(A)) != multiply(inverse(b1),b1),
    inference(cp,[status(thm)],[eq_36,eq_1]) ).

cnf(eq_39,negated_conjecture,
    multiply(b1,inverse(b1)) != multiply(x100,inverse(x100)),
    inference(cp,[status(thm)],[eq_37,eq_38]) ).

cnf(eq_40,negated_conjecture,
    multiply(A,inverse(A)) != multiply(b1,inverse(b1)),
    eq_39 ).

cnf(eq_41,negated_conjecture,
    multiply(A,inverse(A)) != multiply(A,inverse(A)),
    eq_40 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP509-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/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:17:36 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.64/0.82  % SZS status Unsatisfiable
% 0.64/0.82  % SZS output start CNFRefutation for /tmp/MaedMax_22782
% See solution above
% 0.64/0.82  
%------------------------------------------------------------------------------