↑ Up

MaedMax---1.4.UNS-CRf.s

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

% Computer : n013.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:55 EDT 2022

% Result   : Unsatisfiable 0.77s 1.03s
% Output   : CNFRefutation 0.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   31 (  31 unt;   0 nHn;   6 RR)
%            Number of literals    :   31 (  30 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   11 (   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   :   62 (   0 sgn)

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

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

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

cnf(eq_3,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_4,plain,
    divide(x100,inverse(divide(A,divide(x100,inverse(divide(divide(A,C),divide(B,C))))))) = B,
    inference(cp,[status(thm)],[eq_0,eq_0]) ).

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

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

cnf(eq_7,plain,
    A = divide(B,inverse(divide(C,divide(B,inverse(divide(divide(C,x3),divide(A,x3))))))),
    eq_4 ).

cnf(eq_8,plain,
    divide(B,inverse(divide(A,A))) = B,
    inference(cp,[status(thm)],[eq_0,eq_7]) ).

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

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

cnf(eq_11,plain,
    A = divide(B,inverse(divide(divide(A,inverse(divide(C,divide(B,inverse(divide(divide(C,x3),divide(x4,x3))))))),x4))),
    eq_9 ).

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

cnf(eq_13,plain,
    A = multiply(B,divide(multiply(A,divide(C,multiply(B,divide(divide(C,x3),divide(x4,x3))))),x4)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_11,eq_1]),eq_1]),eq_1]) ).

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

cnf(eq_15,plain,
    A = multiply(A,divide(B,B)),
    inference(rw,[status(thm)],[eq_10,eq_1]) ).

cnf(eq_16,plain,
    multiply(A,divide(x101,A)) = x101,
    inference(cp,[status(thm)],[eq_15,eq_14]) ).

cnf(eq_17,plain,
    multiply(A,divide(multiply(x101,divide(x102,A)),x102)) = x101,
    inference(cp,[status(thm)],[eq_15,eq_13]) ).

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

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

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

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

cnf(eq_22,plain,
    multiply(x100,divide(divide(x102,x103),x102)) = divide(x100,x103),
    inference(cp,[status(thm)],[eq_18,eq_12]) ).

cnf(eq_23,plain,
    divide(A,B) = multiply(A,divide(divide(C,B),C)),
    eq_22 ).

cnf(eq_24,plain,
    divide(A,B) = divide(A,inverse(divide(divide(C,B),C))),
    inference(rw,[status(thm)],[eq_23,eq_1]) ).

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

cnf(eq_26,plain,
    divide(x100,inverse(divide(divide(x102,x100),x102))) = inverse(divide(B,B)),
    inference(cp,[status(thm)],[eq_25,eq_20]) ).

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

cnf(eq_28,negated_conjecture,
    divide(inverse(divide(B,B)),inverse(a2)) != a2,
    inference(cp,[status(thm)],[eq_27,eq_3]) ).

cnf(eq_29,negated_conjecture,
    a2 != a2,
    inference(rw,[status(thm)],[eq_28,eq_25]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : GRP558-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13  % Command  : run_maedmax %d %s
% 0.13/0.35  % Computer : n013.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Tue Jul 26 04:10:45 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.77/1.03  % SZS status Unsatisfiable
% 0.77/1.03  % SZS output start CNFRefutation for /tmp/MaedMax_3516
% See solution above
% 0.77/1.03  
%------------------------------------------------------------------------------