↑ Up

Toma---0.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Toma---0.7
% Problem  : GRP185-3 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d THM

% Computer : n011.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 15 06:43:43 AM UTC 2025

% Result   : Unsatisfiable 5.27s 5.40s
% Output   : CNFRefutation 5.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   22 (  22 unt;   0 nHn;   3 RR)
%            Number of literals    :   22 (  21 equ;   1 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    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   46 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
    greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
    file('theBenchmark.p',prove_p22b) ).

cnf(c3,axiom,
    multiply(identity,X) = X,
    file('GRP004-0.ax',left_identity) ).

cnf(c5,axiom,
    least_upper_bound(X,Y) = least_upper_bound(Y,X),
    file('GRP004-2.ax',symmetry_of_lub) ).

cnf(c6,axiom,
    multiply(inverse(X),X) = identity,
    file('GRP004-0.ax',left_inverse) ).

cnf(c7,axiom,
    least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
    file('GRP004-2.ax',lub_absorbtion) ).

cnf(c8,axiom,
    greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
    file('GRP004-2.ax',glb_absorbtion) ).

cnf(c13,axiom,
    least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
    file('GRP004-2.ax',associativity_of_lub) ).

cnf(c14,plain,
    least_upper_bound(least_upper_bound(X,Y),Z) = least_upper_bound(X,least_upper_bound(Y,Z)),
    inference(equational,[status(thm)],[c13]) ).

cnf(c15,axiom,
    multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
    file('GRP004-0.ax',associativity) ).

cnf(c18,plain,
    least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(Y,least_upper_bound(X,Z)),
    inference(equational,[status(thm)],[c5,c14]) ).

cnf(c20,plain,
    multiply(inverse(X),multiply(X,Y)) = Y,
    inference(equational,[status(thm)],[c3,c6,c15]) ).

cnf(c22,plain,
    multiply(inverse(inverse(X)),identity) = X,
    inference(equational,[status(thm)],[c6,c20]) ).

cnf(c25,plain,
    multiply(inverse(inverse(X)),Y) = multiply(X,Y),
    inference(equational,[status(thm)],[c20]) ).

cnf(c26,plain,
    multiply(X,identity) = X,
    inference(equational,[status(thm)],[c22,c25]) ).

cnf(c31,axiom,
    multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
    file('GRP004-2.ax',monotony_lub1) ).

cnf(c33,axiom,
    multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
    file('GRP004-2.ax',monotony_lub2) ).

cnf(c41,plain,
    least_upper_bound(X,least_upper_bound(Y,greatest_lower_bound(X,Z))) = least_upper_bound(Y,X),
    inference(equational,[status(thm)],[c7,c18]) ).

cnf(c54,plain,
    greatest_lower_bound(least_upper_bound(X,Y),least_upper_bound(X,least_upper_bound(Y,Z))) = least_upper_bound(X,Y),
    inference(equational,[status(thm)],[c8,c14]) ).

cnf(c185,plain,
    greatest_lower_bound(least_upper_bound(X,Y),least_upper_bound(X,least_upper_bound(Z,least_upper_bound(Y,W)))) = least_upper_bound(X,Y),
    inference(equational,[status(thm)],[c18,c54]) ).

cnf(c225,plain,
    greatest_lower_bound(least_upper_bound(X,Y),least_upper_bound(X,least_upper_bound(Z,least_upper_bound(W,Y)))) = least_upper_bound(X,Y),
    inference(equational,[status(thm)],[c41,c185]) ).

cnf(g1,plain,
    greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) = least_upper_bound(multiply(a,b),identity),
    inference(equational,[status(thm)],[c3,c5,c14,c26,c31,c33,c225]) ).

cnf(g2,plain,
    $false,
    inference(resolution,[status(thm)],[g0,g1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP185-3 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.07/0.12  % Command  : run_Leo-III %s %d THM
% 0.12/0.33  % Computer : n011.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 : Mon Jul 14 08:15:19 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 5.27/5.40  % SZS status Unsatisfiable
% 5.27/5.40  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------