↑ Up

MaedMax---1.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP175-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp
% Command  : run_maedmax %d %s

% Computer : n023.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:18 EDT 2022

% Result   : Unsatisfiable 11.10s 11.38s
% Output   : CNFRefutation 11.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   39 (  39 unt;   0 nHn;   8 RR)
%            Number of literals    :   39 (  38 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    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   46 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
    X = multiply(identity,X),
    file('/tmp/MaedMax_16710') ).

cnf(eq_1,axiom,
    identity = multiply(inverse(X),X),
    file('/tmp/MaedMax_16710') ).

cnf(eq_2,axiom,
    multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
    file('/tmp/MaedMax_16710') ).

cnf(eq_3,axiom,
    greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
    file('/tmp/MaedMax_16710') ).

cnf(eq_4,axiom,
    least_upper_bound(X,Y) = least_upper_bound(Y,X),
    file('/tmp/MaedMax_16710') ).

cnf(eq_5,axiom,
    X = least_upper_bound(X,greatest_lower_bound(X,Y)),
    file('/tmp/MaedMax_16710') ).

cnf(eq_6,axiom,
    multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
    file('/tmp/MaedMax_16710') ).

cnf(eq_7,axiom,
    multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
    file('/tmp/MaedMax_16710') ).

cnf(eq_8,axiom,
    identity = greatest_lower_bound(identity,b),
    file('/tmp/MaedMax_16710') ).

cnf(eq_9,negated_conjecture,
    multiply(inverse(a),multiply(b,a)) != least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),
    file('/tmp/MaedMax_16710') ).

cnf(eq_10,plain,
    multiply(identity,x102) = multiply(inverse(X),multiply(X,x102)),
    inference(cp,[status(thm)],[eq_1,eq_2]) ).

cnf(eq_11,plain,
    greatest_lower_bound(b,identity) = identity,
    inference(cp,[status(thm)],[eq_3,eq_8]) ).

cnf(eq_12,plain,
    least_upper_bound(multiply(inverse(X),x101),identity) = multiply(inverse(X),least_upper_bound(x101,X)),
    inference(cp,[status(thm)],[eq_1,eq_6]) ).

cnf(eq_13,plain,
    least_upper_bound(X,multiply(x102,X)) = multiply(least_upper_bound(identity,x102),X),
    inference(cp,[status(thm)],[eq_0,eq_7]) ).

cnf(eq_14,plain,
    multiply(inverse(X),least_upper_bound(Y,X)) = least_upper_bound(identity,multiply(inverse(X),Y)),
    inference(rw,[status(thm)],[eq_12,eq_4]) ).

cnf(eq_15,plain,
    multiply(least_upper_bound(identity,X),Y) = least_upper_bound(Y,multiply(X,Y)),
    eq_13 ).

cnf(eq_16,plain,
    X = multiply(inverse(Y),multiply(Y,X)),
    inference(rw,[status(thm)],[eq_10,eq_0]) ).

cnf(eq_17,plain,
    least_upper_bound(b,identity) = b,
    inference(cp,[status(thm)],[eq_11,eq_5]) ).

cnf(eq_18,plain,
    multiply(inverse(inverse(X)),identity) = X,
    inference(cp,[status(thm)],[eq_1,eq_16]) ).

cnf(eq_19,plain,
    X = multiply(inverse(inverse(X)),identity),
    eq_18 ).

cnf(eq_20,plain,
    multiply(inverse(inverse(inverse(X))),X) = identity,
    inference(cp,[status(thm)],[eq_18,eq_16]) ).

cnf(eq_21,plain,
    least_upper_bound(identity,b) = b,
    inference(cp,[status(thm)],[eq_4,eq_17]) ).

cnf(eq_22,plain,
    multiply(inverse(inverse(inverse(inverse(X)))),identity) = X,
    inference(cp,[status(thm)],[eq_20,eq_16]) ).

cnf(eq_23,plain,
    multiply(b,x101) = least_upper_bound(x101,multiply(b,x101)),
    inference(cp,[status(thm)],[eq_21,eq_15]) ).

cnf(eq_24,plain,
    X = inverse(inverse(X)),
    inference(rw,[status(thm)],[eq_22,eq_18]) ).

cnf(eq_25,plain,
    multiply(b,X) = least_upper_bound(X,multiply(b,X)),
    eq_23 ).

cnf(eq_26,plain,
    X = multiply(X,identity),
    inference(rw,[status(thm)],[eq_19,eq_24]) ).

cnf(eq_27,plain,
    multiply(X,inverse(X)) = identity,
    inference(cp,[status(thm)],[eq_24,eq_1]) ).

cnf(eq_28,plain,
    multiply(X,multiply(Y,inverse(multiply(X,Y)))) = identity,
    inference(cp,[status(thm)],[eq_2,eq_27]) ).

cnf(eq_29,plain,
    multiply(inverse(X),identity) = multiply(Y,inverse(multiply(X,Y))),
    inference(cp,[status(thm)],[eq_28,eq_16]) ).

cnf(eq_30,plain,
    multiply(X,inverse(multiply(Y,X))) = inverse(Y),
    inference(rw,[status(thm)],[eq_29,eq_26]) ).

cnf(eq_31,plain,
    least_upper_bound(inverse(multiply(Y,b)),inverse(Y)) = multiply(b,inverse(multiply(Y,b))),
    inference(cp,[status(thm)],[eq_30,eq_25]) ).

cnf(eq_32,plain,
    inverse(X) = least_upper_bound(inverse(X),inverse(multiply(X,b))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_31,eq_4]),eq_30]) ).

cnf(eq_33,plain,
    multiply(inverse(inverse(multiply(X,b))),inverse(X)) = least_upper_bound(identity,multiply(inverse(inverse(multiply(X,b))),inverse(X))),
    inference(cp,[status(thm)],[eq_32,eq_14]) ).

cnf(eq_34,plain,
    multiply(X,multiply(b,inverse(X))) = least_upper_bound(identity,multiply(X,multiply(b,inverse(X)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_33,eq_24]),eq_2]),eq_24]),eq_2]) ).

cnf(eq_35,plain,
    least_upper_bound(identity,multiply(inverse(X),multiply(b,X))) = multiply(inverse(X),multiply(b,inverse(inverse(X)))),
    inference(cp,[status(thm)],[eq_24,eq_34]) ).

cnf(eq_36,plain,
    multiply(inverse(X),multiply(b,X)) = least_upper_bound(identity,multiply(inverse(X),multiply(b,X))),
    inference(rw,[status(thm)],[eq_35,eq_24]) ).

cnf(eq_37,negated_conjecture,
    multiply(inverse(a),multiply(b,a)) != multiply(inverse(a),multiply(b,a)),
    inference(cp,[status(thm)],[eq_36,eq_9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP175-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : run_maedmax %d %s
% 0.12/0.34  % Computer : n023.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Jul 26 04:30:48 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 11.10/11.38  % SZS status Unsatisfiable
% 11.10/11.38  % SZS output start CNFRefutation for /tmp/MaedMax_16710
% See solution above
% 11.10/11.38  
%------------------------------------------------------------------------------