↑ Up

Toma---0.7.UNS-CRf.s

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

% Computer : n001.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:45 AM UTC 2025

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

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

cnf(c3,axiom,
    least_upper_bound(identity,X) = X,
    file('theBenchmark.p',p40a_1) ).

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

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

cnf(c7,plain,
    least_upper_bound(X,identity) = X,
    inference(equational,[status(thm)],[c3,c6]) ).

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

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

cnf(c24,plain,
    multiply(inverse(X),multiply(X,Y)) = Y,
    inference(equational,[status(thm)],[c4,c8,c19]) ).

cnf(c26,plain,
    multiply(inverse(inverse(X)),identity) = X,
    inference(equational,[status(thm)],[c8,c24]) ).

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

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

cnf(c31,plain,
    inverse(identity) = identity,
    inference(equational,[status(thm)],[c8,c30]) ).

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

cnf(c36,plain,
    least_upper_bound(X,multiply(X,Y)) = multiply(X,Y),
    inference(equational,[status(thm)],[c3,c30,c35]) ).

cnf(c37,plain,
    inverse(X) = identity,
    inference(equational,[status(thm)],[c7,c8,c36]) ).

cnf(c38,plain,
    identity = X,
    inference(equational,[status(thm)],[c4,c26,c31,c37]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP192-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.11/0.12  % Command  : run_Leo-III %s %d THM
% 0.12/0.34  % Computer : n001.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:16:19 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 0.84/0.97  % SZS status Unsatisfiable
% 0.84/0.97  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------