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

View Problem - Process Solution

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

% Result   : Unsatisfiable 1.07s 1.26s
% Output   : CNFRefutation 1.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   26 (  26 unt;   0 nHn;   8 RR)
%            Number of literals    :   26 (  25 equ;   7 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    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   66 (   0 sgn)

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

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

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

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

cnf(eq_4,negated_conjecture,
    divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_2,eq_1]),eq_1]) ).

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

cnf(eq_6,plain,
    divide(A,A) = divide(divide(B,B),divide(divide(divide(C,divide(D,x4)),inverse(D)),divide(C,inverse(x4)))),
    eq_5 ).

cnf(eq_7,plain,
    divide(A,A) = divide(divide(B,B),divide(multiply(divide(C,divide(D,x4)),D),multiply(C,x4))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_6,eq_1]),eq_1]) ).

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

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

cnf(eq_10,plain,
    divide(A,A) = divide(x104,x104),
    inference(cp,[status(thm)],[eq_6,eq_6]) ).

cnf(eq_11,plain,
    divide(A,A) = divide(B,B),
    eq_10 ).

cnf(eq_12,negated_conjecture,
    divide(divide(divide(B,B),divide(divide(divide(C,divide(D,x4)),inverse(D)),divide(C,inverse(x4)))),inverse(a2)) != a2,
    inference(cp,[status(thm)],[eq_6,eq_4]) ).

cnf(eq_13,negated_conjecture,
    divide(divide(divide(A,A),divide(divide(divide(B,divide(C,D)),inverse(C)),divide(B,inverse(D)))),inverse(a2)) != a2,
    eq_12 ).

cnf(eq_14,negated_conjecture,
    multiply(divide(divide(A,A),divide(multiply(divide(B,divide(C,D)),C),multiply(B,D))),a2) != a2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_13,eq_1]),eq_1]),eq_1]) ).

cnf(eq_15,plain,
    divide(divide(x100,x100),divide(x101,multiply(divide(B,B),x103))) = divide(x103,x101),
    inference(cp,[status(thm)],[eq_11,eq_3]) ).

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

cnf(eq_17,plain,
    divide(A,B) = divide(divide(C,C),divide(B,multiply(divide(D,D),A))),
    eq_15 ).

cnf(eq_18,plain,
    divide(divide(A,A),divide(inverse(B),multiply(divide(C,C),D))) = multiply(D,B),
    eq_16 ).

cnf(eq_19,negated_conjecture,
    multiply(divide(A,A),a2) != a2,
    inference(cp,[status(thm)],[eq_7,eq_14]) ).

cnf(eq_20,plain,
    divide(A,A) = divide(x4,multiply(divide(divide(x102,x102),divide(D,x4)),D)),
    inference(cp,[status(thm)],[eq_7,eq_17]) ).

cnf(eq_21,plain,
    divide(A,A) = divide(B,multiply(divide(divide(C,C),divide(D,B)),D)),
    eq_20 ).

cnf(eq_22,plain,
    divide(divide(x100,x100),divide(inverse(D),multiply(divide(A,A),divide(divide(C,C),divide(D,B))))) = B,
    inference(cp,[status(thm)],[eq_21,eq_9]) ).

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

cnf(eq_24,negated_conjecture,
    a2 != a2,
    inference(cp,[status(thm)],[eq_23,eq_19]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP467-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12  % Command  : run_maedmax %d %s
% 0.12/0.33  % Computer : n004.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:14:21 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.07/1.26  % SZS status Unsatisfiable
% 1.07/1.26  % SZS output start CNFRefutation for /tmp/MaedMax_16479
% See solution above
% 1.07/1.26  
%------------------------------------------------------------------------------