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

View Problem - Process Solution

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

% Computer : n019.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 1.00s 1.19s
% Output   : CNFRefutation 1.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   41 (  41 unt;   0 nHn;   7 RR)
%            Number of literals    :   41 (  40 equ;   6 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    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   73 (   0 sgn)

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

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

cnf(eq_2,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/tmp/MaedMax_19840') ).

cnf(eq_3,plain,
    A = divide(divide(multiply(B,A),C),divide(B,C)),
    inference(rw,[status(thm)],[eq_0,eq_1]) ).

cnf(eq_4,negated_conjecture,
    divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_2,eq_1]),eq_1]),eq_1]),eq_1]) ).

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

cnf(eq_6,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_7,plain,
    A = divide(B,divide(divide(C,inverse(B)),divide(C,inverse(A)))),
    eq_5 ).

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

cnf(eq_9,plain,
    A = divide(divide(multiply(divide(multiply(B,C),x3),A),divide(B,x3)),C),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_8,eq_1]),eq_1]) ).

cnf(eq_10,plain,
    divide(multiply(multiply(x100,x101),B),divide(x100,inverse(B))) = x101,
    inference(cp,[status(thm)],[eq_1,eq_3]) ).

cnf(eq_11,plain,
    A = divide(multiply(multiply(B,A),C),multiply(B,C)),
    inference(rw,[status(thm)],[eq_10,eq_1]) ).

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

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

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

cnf(eq_15,plain,
    A = multiply(divide(multiply(divide(multiply(B,inverse(x101)),x3),A),divide(B,x3)),x101),
    inference(cp,[status(thm)],[eq_9,eq_1]) ).

cnf(eq_16,plain,
    A = multiply(divide(multiply(divide(multiply(B,inverse(C)),x3),A),divide(B,x3)),C),
    eq_15 ).

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

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

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

cnf(eq_20,plain,
    A = divide(divide(divide(divide(B,inverse(C)),inverse(A)),B),C),
    eq_19 ).

cnf(eq_21,plain,
    A = divide(B,divide(inverse(A),inverse(B))),
    eq_17 ).

cnf(eq_22,plain,
    divide(x100,A) = divide(inverse(A),inverse(x100)),
    inference(cp,[status(thm)],[eq_21,eq_7]) ).

cnf(eq_23,plain,
    divide(divide(B,B),inverse(x101)) = x101,
    inference(cp,[status(thm)],[eq_18,eq_13]) ).

cnf(eq_24,plain,
    divide(divide(divide(A,inverse(x102)),divide(inverse(x101),inverse(A))),x101) = x102,
    inference(cp,[status(thm)],[eq_13,eq_20]) ).

cnf(eq_25,plain,
    A = divide(divide(divide(B,inverse(A)),divide(inverse(C),inverse(B))),C),
    eq_24 ).

cnf(eq_26,plain,
    A = divide(divide(B,B),inverse(A)),
    eq_23 ).

cnf(eq_27,plain,
    divide(A,B) = divide(inverse(B),inverse(A)),
    eq_22 ).

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

cnf(eq_29,plain,
    multiply(multiply(divide(multiply(B,inverse(x101)),B),x103),x101) = x103,
    inference(cp,[status(thm)],[eq_18,eq_16]) ).

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

cnf(eq_31,plain,
    multiply(A,B) = multiply(inverse(inverse(B)),A),
    inference(rw,[status(thm)],[eq_1,eq_28]) ).

cnf(eq_32,plain,
    A = multiply(inverse(multiply(B,C)),multiply(multiply(B,A),C)),
    inference(rw,[status(thm)],[eq_11,eq_28]) ).

cnf(eq_33,negated_conjecture,
    multiply(inverse(inverse(multiply(inverse(inverse(c3)),b3))),a3) != multiply(inverse(inverse(c3)),multiply(inverse(inverse(b3)),a3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_4,eq_28]),eq_28]),eq_28]),eq_28]) ).

cnf(eq_34,plain,
    A = inverse(inverse(A)),
    inference(cp,[status(thm)],[eq_26,eq_25]) ).

cnf(eq_35,plain,
    multiply(A,B) = multiply(B,A),
    inference(rw,[status(thm)],[eq_31,eq_34]) ).

cnf(eq_36,negated_conjecture,
    multiply(multiply(c3,b3),a3) != multiply(c3,multiply(b3,a3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_33,eq_34]),eq_34]),eq_34]),eq_34]) ).

cnf(eq_37,negated_conjecture,
    multiply(multiply(b3,c3),a3) != multiply(c3,multiply(b3,a3)),
    inference(cp,[status(thm)],[eq_35,eq_36]) ).

cnf(eq_38,plain,
    multiply(A,multiply(B,C)) = multiply(multiply(B,A),C),
    inference(cp,[status(thm)],[eq_32,eq_30]) ).

cnf(eq_39,negated_conjecture,
    multiply(c3,multiply(b3,a3)) != multiply(c3,multiply(b3,a3)),
    inference(rw,[status(thm)],[eq_37,eq_38]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP563-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12  % Command  : run_maedmax %d %s
% 0.12/0.33  % Computer : n019.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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Jul 26 04:16:22 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.00/1.19  % SZS status Unsatisfiable
% 1.00/1.19  % SZS output start CNFRefutation for /tmp/MaedMax_19840
% See solution above
% 1.00/1.19  
%------------------------------------------------------------------------------