TSTP Solution File: GRP193-2 by MaedMax---1.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : MaedMax---1.4
% Problem  : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp
% Command  : run_maedmax %d %s

% Computer : n019.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:25 EDT 2022

% Result   : Unsatisfiable 3.14s 3.32s
% Output   : CNFRefutation 3.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   33 (  33 unt;   0 nHn;  14 RR)
%            Number of literals    :   33 (  32 equ;   8 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   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   :   41 (   9 sgn)

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

cnf(eq_1,axiom,
    greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
    file('/tmp/MaedMax_7943') ).

cnf(eq_2,axiom,
    least_upper_bound(X,Y) = least_upper_bound(Y,X),
    file('/tmp/MaedMax_7943') ).

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

cnf(eq_4,axiom,
    X = greatest_lower_bound(X,X),
    file('/tmp/MaedMax_7943') ).

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

cnf(eq_6,axiom,
    X = greatest_lower_bound(X,least_upper_bound(X,Y)),
    file('/tmp/MaedMax_7943') ).

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

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

cnf(eq_9,axiom,
    greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
    file('/tmp/MaedMax_7943') ).

cnf(eq_10,negated_conjecture,
    greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
    file('/tmp/MaedMax_7943') ).

cnf(eq_11,plain,
    X = multiply(greatest_lower_bound(b,a),X),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_0,eq_8]),eq_1]) ).

cnf(eq_12,negated_conjecture,
    greatest_lower_bound(multiply(b,c),a) != greatest_lower_bound(c,a),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_10,eq_1]),eq_1]) ).

cnf(eq_13,plain,
    greatest_lower_bound(X,greatest_lower_bound(greatest_lower_bound(X,Z),Z)) = greatest_lower_bound(X,Z),
    inference(cp,[status(thm)],[eq_20,eq_4]) ).

cnf(eq_14,plain,
    greatest_lower_bound(greatest_lower_bound(X,Y),x102) = greatest_lower_bound(Y,greatest_lower_bound(X,x102)),
    inference(cp,[status(thm)],[eq_1,eq_3]) ).

cnf(eq_15,plain,
    greatest_lower_bound(X,x102) = greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(X,Y),x102)),
    inference(cp,[status(thm)],[eq_6,eq_3]) ).

cnf(eq_16,plain,
    least_upper_bound(Y,greatest_lower_bound(X,Y)) = Y,
    inference(cp,[status(thm)],[eq_1,eq_5]) ).

cnf(eq_17,plain,
    X = least_upper_bound(X,greatest_lower_bound(Y,X)),
    eq_16 ).

cnf(eq_18,plain,
    greatest_lower_bound(X,Y) = greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(X,Z),Y)),
    eq_15 ).

cnf(eq_19,plain,
    greatest_lower_bound(X,Y) = greatest_lower_bound(X,greatest_lower_bound(X,Y)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_13,eq_3]),eq_4]) ).

cnf(eq_20,plain,
    greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(Y,greatest_lower_bound(X,Z)),
    inference(rw,[status(thm)],[eq_14,eq_3]) ).

cnf(eq_21,negated_conjecture,
    greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(c,a),
    inference(cp,[status(thm)],[eq_1,eq_12]) ).

cnf(eq_22,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_23,plain,
    least_upper_bound(b,identity) = b,
    inference(cp,[status(thm)],[eq_8,eq_17]) ).

cnf(eq_24,plain,
    multiply(least_upper_bound(identity,X),Y) = least_upper_bound(Y,multiply(X,Y)),
    eq_22 ).

cnf(eq_25,plain,
    least_upper_bound(identity,b) = b,
    inference(cp,[status(thm)],[eq_2,eq_23]) ).

cnf(eq_26,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(c,greatest_lower_bound(a,multiply(b,c))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_9,eq_1]),eq_1]),eq_11]),eq_3]),eq_20]),eq_1]),eq_20]),eq_19]) ).

cnf(eq_27,negated_conjecture,
    greatest_lower_bound(c,greatest_lower_bound(least_upper_bound(c,Z),a)) != greatest_lower_bound(a,multiply(b,c)),
    inference(cp,[status(thm)],[eq_18,eq_21]) ).

cnf(eq_28,negated_conjecture,
    greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(c,greatest_lower_bound(a,least_upper_bound(c,X))),
    inference(rw,[status(thm)],[eq_27,eq_1]) ).

cnf(eq_29,negated_conjecture,
    greatest_lower_bound(c,greatest_lower_bound(a,multiply(least_upper_bound(identity,X),c))) != greatest_lower_bound(a,multiply(b,c)),
    inference(cp,[status(thm)],[eq_24,eq_28]) ).

cnf(eq_30,negated_conjecture,
    greatest_lower_bound(c,greatest_lower_bound(a,multiply(b,c))) != greatest_lower_bound(a,multiply(b,c)),
    inference(cp,[status(thm)],[eq_25,eq_29]) ).

cnf(eq_31,negated_conjecture,
    greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,multiply(b,c)),
    inference(rw,[status(thm)],[eq_30,eq_26]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : run_maedmax %d %s
% 0.13/0.34  % Computer : n019.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:24:07 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 3.14/3.32  % SZS status Unsatisfiable
% 3.14/3.32  % SZS output start CNFRefutation for /tmp/MaedMax_7943
% See solution above
% 3.14/3.32  
%------------------------------------------------------------------------------