↑ Up

Toma---0.7.UNS-CRf.s

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

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

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

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

cnf(c2,axiom,
    greatest_lower_bound(X,X) = X,
    file('GRP004-2.ax',idempotence_of_gld) ).

cnf(c4,axiom,
    greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
    file('GRP004-2.ax',symmetry_of_glb) ).

cnf(c11,axiom,
    greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z),
    file('GRP004-2.ax',associativity_of_glb) ).

cnf(c12,plain,
    greatest_lower_bound(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(X,greatest_lower_bound(Y,Z)),
    inference(equational,[status(thm)],[c11]) ).

cnf(c17,plain,
    greatest_lower_bound(X,greatest_lower_bound(X,Y)) = greatest_lower_bound(X,Y),
    inference(equational,[status(thm)],[c2,c12]) ).

cnf(g1,plain,
    greatest_lower_bound(greatest_lower_bound(a,b),a) = greatest_lower_bound(a,b),
    inference(equational,[status(thm)],[c4,c17]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : GRP143-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.11/0.11  % Command  : run_Leo-III %s %d THM
% 0.11/0.32  % Computer : n010.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Mon Jul 14 08:12:19 EDT 2025
% 0.11/0.32  % CPUTime  : 
% 0.65/0.85  % SZS status Unsatisfiable
% 0.65/0.85  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------