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

View Problem - Process Solution

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

% Computer : n026.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 1.00s 1.20s
% Output   : CNFRefutation 1.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   45 (  45 unt;   0 nHn;   9 RR)
%            Number of literals    :   45 (  44 equ;   7 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    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   77 (   0 sgn)

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

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

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

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

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,negated_conjecture,
    divide(a3,inverse(multiply(b3,c3))) != multiply(multiply(a3,b3),c3),
    inference(cp,[status(thm)],[eq_4,eq_3]) ).

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

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

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

cnf(eq_27,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)],[eq_23,eq_4]),eq_4]),eq_4]) ).

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

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

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

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

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

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

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

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

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

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

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

cnf(eq_39,negated_conjecture,
    divide(divide(a3,divide(divide(A,b3),A)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
    inference(cp,[status(thm)],[eq_35,eq_27]) ).

cnf(eq_40,plain,
    divide(A,B) = divide(divide(A,divide(B,C)),C),
    inference(rw,[status(thm)],[eq_38,eq_37]) ).

cnf(eq_41,negated_conjecture,
    divide(divide(a3,divide(divide(A,b3),A)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
    inference(rw,[status(thm)],[eq_39,eq_37]) ).

cnf(eq_42,negated_conjecture,
    divide(a3,divide(inverse(c3),b3)) != divide(a3,divide(inverse(c3),b3)),
    inference(cp,[status(thm)],[eq_40,eq_41]) ).

cnf(eq_43,negated_conjecture,
    divide(a3,inverse(divide(c3,inverse(b3)))) != divide(a3,inverse(divide(c3,inverse(b3)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_42,eq_36]),eq_36]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP523-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13  % Command  : run_maedmax %d %s
% 0.13/0.34  % Computer : n026.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:35:38 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 1.00/1.20  % SZS status Unsatisfiable
% 1.00/1.20  % SZS output start CNFRefutation for /tmp/MaedMax_21008
% See solution above
% 1.00/1.20  
%------------------------------------------------------------------------------