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

View Problem - Process Solution

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

% Result   : Unsatisfiable 0.75s 0.98s
% Output   : CNFRefutation 0.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   43 (  43 unt;   0 nHn;   4 RR)
%            Number of literals    :   43 (  42 equ;   3 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    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   71 (   0 sgn)

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

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

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

cnf(eq_3,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('/tmp/MaedMax_25727') ).

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(inverse(divide(B,divide(A,divide(inverse(B),C)))),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,
    multiply(divide(x100,x100),B) = inverse(inverse(B)),
    inference(cp,[status(thm)],[eq_4,eq_2]) ).

cnf(eq_9,plain,
    divide(multiply(inverse(B),B),x101) = inverse(x101),
    inference(cp,[status(thm)],[eq_4,eq_2]) ).

cnf(eq_10,plain,
    divide(inverse(multiply(inverse(B),B)),x101) = inverse(x101),
    inference(cp,[status(thm)],[eq_4,eq_7]) ).

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

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

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

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

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

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

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

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

cnf(eq_19,negated_conjecture,
    multiply(divide(inverse(b2),inverse(b2)),a2) != a2,
    inference(cp,[status(thm)],[eq_4,eq_3]) ).

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

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

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

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

cnf(eq_24,plain,
    divide(inverse(divide(x100,inverse(divide(inverse(x100),x102)))),x102) = multiply(inverse(A),A),
    inference(cp,[status(thm)],[eq_14,eq_5]) ).

cnf(eq_25,plain,
    divide(inverse(multiply(A,divide(inverse(A),B))),B) = multiply(inverse(C),C),
    inference(rw,[status(thm)],[eq_24,eq_4]) ).

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

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

cnf(eq_28,plain,
    A = divide(inverse(divide(inverse(multiply(B,C)),divide(A,B))),C),
    eq_26 ).

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

cnf(eq_30,plain,
    divide(A,A) = divide(x101,x101),
    inference(cp,[status(thm)],[eq_27,eq_27]) ).

cnf(eq_31,plain,
    divide(A,A) = divide(B,B),
    eq_30 ).

cnf(eq_32,plain,
    divide(A,A) = inverse(divide(B,B)),
    eq_29 ).

cnf(eq_33,plain,
    divide(inverse(inverse(inverse(divide(C,C)))),x101) = inverse(divide(A,inverse(divide(inverse(A),inverse(x101))))),
    inference(cp,[status(thm)],[eq_18,eq_22]) ).

cnf(eq_34,plain,
    inverse(A) = inverse(divide(B,inverse(divide(inverse(B),inverse(A))))),
    inference(rw,[status(thm)],[eq_33,eq_17]) ).

cnf(eq_35,plain,
    divide(inverse(multiply(inverse(C),C)),divide(inverse(A),divide(x102,A))) = x102,
    inference(cp,[status(thm)],[eq_25,eq_28]) ).

cnf(eq_36,plain,
    A = inverse(divide(inverse(B),divide(A,B))),
    inference(rw,[status(thm)],[eq_35,eq_16]) ).

cnf(eq_37,plain,
    inverse(divide(x100,divide(A,A))) = inverse(x100),
    inference(cp,[status(thm)],[eq_32,eq_34]) ).

cnf(eq_38,plain,
    inverse(divide(inverse(A),divide(B,B))) = A,
    inference(cp,[status(thm)],[eq_31,eq_36]) ).

cnf(eq_39,plain,
    inverse(A) = inverse(divide(A,divide(B,B))),
    eq_37 ).

cnf(eq_40,plain,
    A = inverse(inverse(A)),
    inference(cp,[status(thm)],[eq_38,eq_39]) ).

cnf(eq_41,negated_conjecture,
    a2 != a2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_19,eq_4]),eq_2]),eq_40]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP452-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12  % Command  : run_maedmax %d %s
% 0.13/0.32  % Computer : n019.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit : 300
% 0.13/0.32  % WCLimit  : 300
% 0.13/0.32  % DateTime : Tue Jul 26 04:18:37 EDT 2022
% 0.13/0.32  % CPUTime  : 
% 0.75/0.98  % SZS status Unsatisfiable
% 0.75/0.98  % SZS output start CNFRefutation for /tmp/MaedMax_25727
% See solution above
% 0.75/0.98  
%------------------------------------------------------------------------------