↑ Up

MaedMax---1.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP589-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp
% Command  : run_maedmax %d %s

% Computer : n017.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:57 EDT 2022

% Result   : Unsatisfiable 0.91s 1.12s
% Output   : CNFRefutation 0.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   22 (  22 unt;   0 nHn;   4 RR)
%            Number of literals    :   22 (  21 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   12 (   3 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   :   38 (   0 sgn)

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

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

cnf(eq_2,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/tmp/MaedMax_14508') ).

cnf(eq_3,plain,
    double_divide(inverse(double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(B,C),inverse(double_divide(B,inverse(A))))),inverse(x102))))),C) = x102,
    inference(cp,[status(thm)],[eq_0,eq_0]) ).

cnf(eq_4,plain,
    double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(B,inverse(x102)),inverse(double_divide(B,inverse(A))))),x101),inverse(A))),x101) = x102,
    inference(cp,[status(thm)],[eq_0,eq_0]) ).

cnf(eq_5,plain,
    A = double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(B,inverse(A)),inverse(double_divide(B,inverse(C))))),x3),inverse(C))),x3),
    eq_4 ).

cnf(eq_6,plain,
    A = double_divide(inverse(double_divide(B,inverse(double_divide(inverse(double_divide(double_divide(C,x3),inverse(double_divide(C,inverse(B))))),inverse(A))))),x3),
    eq_3 ).

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

cnf(eq_8,plain,
    A = double_divide(inverse(double_divide(B,inverse(B))),inverse(A)),
    eq_7 ).

cnf(eq_9,plain,
    double_divide(inverse(inverse(double_divide(B,inverse(B)))),inverse(x101)) = x101,
    inference(cp,[status(thm)],[eq_8,eq_8]) ).

cnf(eq_10,plain,
    double_divide(inverse(double_divide(inverse(double_divide(double_divide(x101,x102),inverse(double_divide(x101,inverse(inverse(double_divide(B,inverse(B)))))))),inverse(x103))),x102) = x103,
    inference(cp,[status(thm)],[eq_8,eq_6]) ).

cnf(eq_11,plain,
    A = double_divide(inverse(inverse(double_divide(B,inverse(B)))),inverse(A)),
    eq_9 ).

cnf(eq_12,plain,
    A = double_divide(inverse(double_divide(inverse(double_divide(double_divide(B,C),inverse(double_divide(B,inverse(inverse(double_divide(x3,inverse(x3)))))))),inverse(A))),C),
    eq_10 ).

cnf(eq_13,plain,
    A = double_divide(inverse(multiply(inverse(B),B)),inverse(A)),
    inference(rw,[status(thm)],[eq_11,eq_1]) ).

cnf(eq_14,plain,
    double_divide(inverse(A),inverse(inverse(double_divide(x102,inverse(x102))))) = A,
    inference(cp,[status(thm)],[eq_8,eq_12]) ).

cnf(eq_15,plain,
    A = double_divide(inverse(A),inverse(inverse(double_divide(B,inverse(B))))),
    eq_14 ).

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

cnf(eq_17,plain,
    multiply(inverse(x101),x101) = multiply(inverse(B),B),
    inference(cp,[status(thm)],[eq_13,eq_16]) ).

cnf(eq_18,plain,
    multiply(inverse(A),A) = multiply(inverse(B),B),
    eq_17 ).

cnf(eq_19,negated_conjecture,
    multiply(inverse(A),A) != multiply(inverse(b1),b1),
    inference(cp,[status(thm)],[eq_18,eq_2]) ).

cnf(eq_20,negated_conjecture,
    multiply(inverse(A),A) != multiply(inverse(A),A),
    eq_19 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP589-1 : TPTP v8.1.0. Released v2.6.0.
% 0.00/0.12  % Command  : run_maedmax %d %s
% 0.12/0.33  % Computer : n017.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 03:35:17 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.91/1.12  % SZS status Unsatisfiable
% 0.91/1.12  % SZS output start CNFRefutation for /tmp/MaedMax_14508
% See solution above
% 0.91/1.12  
%------------------------------------------------------------------------------