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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP524-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp
% Command  : run_maedmax %d %s

% Computer : n006.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:52 EDT 2022

% Result   : Unsatisfiable 0.19s 0.56s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   35 (  35 unt;   0 nHn;   4 RR)
%            Number of literals    :   35 (  34 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   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   :   62 (   0 sgn)

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

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

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

cnf(eq_3,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    file('/tmp/MaedMax_10416') ).

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

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

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

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

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

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

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

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

cnf(eq_12,plain,
    A = divide(B,divide(divide(C,divide(A,B)),C)),
    eq_5 ).

cnf(eq_13,plain,
    divide(A,A) = divide(x102,x102),
    inference(cp,[status(thm)],[eq_9,eq_9]) ).

cnf(eq_14,plain,
    divide(x100,divide(x101,divide(inverse(divide(A,A)),divide(x100,x101)))) = divide(x102,x102),
    inference(cp,[status(thm)],[eq_10,eq_9]) ).

cnf(eq_15,plain,
    divide(x100,inverse(divide(x102,x100))) = x102,
    inference(cp,[status(thm)],[eq_2,eq_12]) ).

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

cnf(eq_17,plain,
    inverse(A) = divide(inverse(B),divide(A,B)),
    inference(cp,[status(thm)],[eq_12,eq_11]) ).

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

cnf(eq_19,plain,
    divide(A,A) = divide(B,B),
    eq_13 ).

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

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

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

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

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

cnf(eq_25,plain,
    A = inverse(inverse(A)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_24,eq_4]),eq_10]) ).

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

cnf(eq_27,plain,
    A = divide(A,divide(B,B)),
    eq_26 ).

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

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

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

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

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

cnf(eq_33,negated_conjecture,
    multiply(a,b) != multiply(a,b),
    inference(cp,[status(thm)],[eq_32,eq_3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : GRP524-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/0.12  % Command  : run_maedmax %d %s
% 0.12/0.33  % Computer : n006.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:08:47 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.56  % SZS status Unsatisfiable
% 0.19/0.56  % SZS output start CNFRefutation for /tmp/MaedMax_10416
% See solution above
% 0.19/0.56  
%------------------------------------------------------------------------------