↑ Up

MaedMax---1.4.UNS-CRf.s

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

% Computer : n029.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:15 EDT 2022

% Result   : Unsatisfiable 0.50s 0.72s
% Output   : CNFRefutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   11 (  11 unt;   0 nHn;   6 RR)
%            Number of literals    :   11 (  10 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn)

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

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

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

cnf(eq_3,axiom,
    identity = greatest_lower_bound(b,identity),
    file('/tmp/MaedMax_8055') ).

cnf(eq_4,negated_conjecture,
    greatest_lower_bound(a,multiply(b,a)) != a,
    file('/tmp/MaedMax_8055') ).

cnf(eq_5,plain,
    greatest_lower_bound(X,multiply(x102,X)) = multiply(greatest_lower_bound(identity,x102),X),
    inference(cp,[status(thm)],[eq_0,eq_2]) ).

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

cnf(eq_7,plain,
    multiply(greatest_lower_bound(identity,X),Y) = greatest_lower_bound(Y,multiply(X,Y)),
    eq_5 ).

cnf(eq_8,negated_conjecture,
    multiply(greatest_lower_bound(identity,b),a) != a,
    inference(cp,[status(thm)],[eq_7,eq_4]) ).

cnf(eq_9,negated_conjecture,
    a != a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_8,eq_6]),eq_0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP166-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13  % Command  : run_maedmax %d %s
% 0.13/0.34  % Computer : n029.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:17:58 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.50/0.72  % SZS status Unsatisfiable
% 0.50/0.72  % SZS output start CNFRefutation for /tmp/MaedMax_8055
% See solution above
% 0.50/0.72  
%------------------------------------------------------------------------------