↑ Up

Toma---0.7.UNS-CRf.s

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

% Computer : n004.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:35 AM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
    least_upper_bound(a,c) != c,
    file('theBenchmark.p',prove_ax_transa) ).

cnf(c4,axiom,
    least_upper_bound(a,b) = b,
    file('theBenchmark.p',ax_transa_1) ).

cnf(c5,axiom,
    least_upper_bound(b,c) = c,
    file('theBenchmark.p',ax_transa_2) ).

cnf(c17,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(c18,plain,
    least_upper_bound(least_upper_bound(X,Y),Z) = least_upper_bound(X,least_upper_bound(Y,Z)),
    inference(equational,[status(thm)],[c17]) ).

cnf(c22,plain,
    least_upper_bound(a,least_upper_bound(b,X)) = least_upper_bound(b,X),
    inference(equational,[status(thm)],[c4,c18]) ).

cnf(c23,plain,
    least_upper_bound(a,c) = c,
    inference(equational,[status(thm)],[c5,c22]) ).

cnf(g1,plain,
    least_upper_bound(a,c) = c,
    inference(equational,[status(thm)],[c23]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : GRP162-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.04/0.13  % Command  : run_Leo-III %s %d THM
% 0.12/0.33  % Computer : n004.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:13:04 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.79/0.93  % SZS status Unsatisfiable
% 0.79/0.93  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------