↑ Up

Toma---0.7.UNS-CRf.s

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

% Computer : n003.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 07:43:26 AM UTC 2025

% Result   : Unsatisfiable 0.20s 0.48s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    9 (   9 unt;   0 nHn;   3 RR)
%            Number of literals    :    9 (   8 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 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   :   11 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
    add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
    file('theBenchmark.p',prove_huntingtons_axiom) ).

cnf(c1,axiom,
    negate(negate(X)) = X,
    file('theBenchmark.p',double_negation) ).

cnf(c2,axiom,
    add(X,Y) = add(Y,X),
    file('ROB001-0.ax',commutativity_of_add) ).

cnf(c5,axiom,
    negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))) = X,
    file('ROB001-0.ax',robbins_axiom) ).

cnf(c6,plain,
    add(negate(add(X,Y)),negate(add(X,negate(Y)))) = negate(X),
    inference(equational,[status(thm)],[c1,c5]) ).

cnf(c8,plain,
    add(negate(add(X,Y)),negate(add(negate(Y),X))) = negate(X),
    inference(equational,[status(thm)],[c2,c6]) ).

cnf(c11,plain,
    add(negate(add(X,Y)),negate(add(negate(X),Y))) = negate(Y),
    inference(equational,[status(thm)],[c2,c8]) ).

cnf(g1,plain,
    add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b,
    inference(equational,[status(thm)],[c1,c11]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ROB002-1 : TPTP v9.0.0. Released v1.0.0.
% 0.07/0.12  % Command  : run_Leo-III %s %d THM
% 0.11/0.33  % Computer : n003.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Mon Jul 14 16:38:34 EDT 2025
% 0.11/0.33  % CPUTime  : 
% 0.20/0.48  % SZS status Unsatisfiable
% 0.20/0.48  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------