↑ Up

Toma---0.7.UNS-CRf.s

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

% Computer : n008.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:36 AM UTC 2025

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

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

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

cnf(c4,axiom,
    least_upper_bound(a,identity) = a,
    file('theBenchmark.p',lat1a_1) ).

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

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

cnf(c48,plain,
    least_upper_bound(X,multiply(a,X)) = multiply(a,X),
    inference(equational,[status(thm)],[c3,c4,c6,c47]) ).

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

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

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