↑ Up

MaedMax---1.4.UNS-CRf.s

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

% Computer : n010.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:17 EDT 2022

% Result   : Unsatisfiable 0.76s 0.96s
% Output   : CNFRefutation 0.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   25 (  25 unt;   0 nHn;   8 RR)
%            Number of literals    :   25 (  24 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   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   :   32 (   9 sgn)

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

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

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

cnf(eq_3,axiom,
    least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
    file('/tmp/MaedMax_4837') ).

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

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

cnf(eq_6,axiom,
    least_upper_bound(identity,a) = a,
    file('/tmp/MaedMax_4837') ).

cnf(eq_7,axiom,
    least_upper_bound(identity,b) = b,
    file('/tmp/MaedMax_4837') ).

cnf(eq_8,negated_conjecture,
    identity != greatest_lower_bound(identity,multiply(a,b)),
    file('/tmp/MaedMax_4837') ).

cnf(eq_9,plain,
    greatest_lower_bound(Y,least_upper_bound(X,least_upper_bound(Y,Z))) = Y,
    inference(cp,[status(thm)],[eq_14,eq_4]) ).

cnf(eq_10,plain,
    least_upper_bound(a,identity) = a,
    inference(cp,[status(thm)],[eq_2,eq_6]) ).

cnf(eq_11,plain,
    least_upper_bound(multiply(x100,X),X) = multiply(least_upper_bound(x100,identity),X),
    inference(cp,[status(thm)],[eq_0,eq_5]) ).

cnf(eq_12,plain,
    least_upper_bound(least_upper_bound(Y,X),x102) = least_upper_bound(X,least_upper_bound(Y,x102)),
    inference(cp,[status(thm)],[eq_2,eq_3]) ).

cnf(eq_13,plain,
    least_upper_bound(b,x102) = least_upper_bound(identity,least_upper_bound(b,x102)),
    inference(cp,[status(thm)],[eq_7,eq_3]) ).

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

cnf(eq_15,plain,
    least_upper_bound(b,X) = least_upper_bound(b,least_upper_bound(identity,X)),
    inference(rw,[status(thm)],[eq_13,eq_14]) ).

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

cnf(eq_17,plain,
    multiply(least_upper_bound(X,identity),Y) = least_upper_bound(Y,multiply(X,Y)),
    inference(rw,[status(thm)],[eq_11,eq_2]) ).

cnf(eq_18,plain,
    greatest_lower_bound(identity,least_upper_bound(b,X)) = identity,
    inference(cp,[status(thm)],[eq_15,eq_16]) ).

cnf(eq_19,plain,
    identity = greatest_lower_bound(least_upper_bound(b,X),identity),
    inference(cp,[status(thm)],[eq_18,eq_1]) ).

cnf(eq_20,plain,
    greatest_lower_bound(multiply(least_upper_bound(X,identity),b),identity) = identity,
    inference(cp,[status(thm)],[eq_17,eq_19]) ).

cnf(eq_21,plain,
    identity = greatest_lower_bound(identity,multiply(least_upper_bound(X,identity),b)),
    inference(rw,[status(thm)],[eq_20,eq_1]) ).

cnf(eq_22,plain,
    greatest_lower_bound(identity,multiply(a,b)) = identity,
    inference(cp,[status(thm)],[eq_10,eq_21]) ).

cnf(eq_23,negated_conjecture,
    identity != identity,
    inference(cp,[status(thm)],[eq_22,eq_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP171-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12  % Command  : run_maedmax %d %s
% 0.12/0.33  % Computer : n010.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 04:01:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.76/0.96  % SZS status Unsatisfiable
% 0.76/0.96  % SZS output start CNFRefutation for /tmp/MaedMax_4837
% See solution above
% 0.76/0.96  
%------------------------------------------------------------------------------