↑ Up

Toma---0.7.UNS-CRf.s

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

% Computer : n012.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:18:09 AM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
    f(t,tsk) != f(tt_ts,tk),
    file('theBenchmark.p',prove_equation) ).

cnf(c1,axiom,
    tt = f(t,t),
    file('theBenchmark.p',clause_1) ).

cnf(c2,axiom,
    ts = f(t,s),
    file('theBenchmark.p',clause_2) ).

cnf(c3,axiom,
    tt_ts = f(tt,ts),
    file('theBenchmark.p',clause_3) ).

cnf(c4,plain,
    tt_ts = f(f(t,t),f(t,s)),
    inference(equational,[status(thm)],[c1,c2,c3]) ).

cnf(c5,axiom,
    tk = f(t,k),
    file('theBenchmark.p',clause_4) ).

cnf(c6,axiom,
    tsk = f(ts,k),
    file('theBenchmark.p',clause_5) ).

cnf(c7,plain,
    tsk = f(f(t,s),k),
    inference(equational,[status(thm)],[c2,c6]) ).

cnf(c8,axiom,
    f(X,f(Y,Z)) = f(f(X,Y),f(X,Z)),
    file('theBenchmark.p',a1) ).

cnf(c9,plain,
    f(f(X,Y),f(X,Z)) = f(X,f(Y,Z)),
    inference(equational,[status(thm)],[c8]) ).

cnf(g1,plain,
    f(t,tsk) = f(tt_ts,tk),
    inference(equational,[status(thm)],[c4,c5,c7,c9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem  : LDA007-3 : TPTP v9.0.0. Released v1.0.0.
% 0.05/0.10  % Command  : run_Leo-III %s %d THM
% 0.09/0.30  % Computer : n012.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Mon Jul 14 13:51:34 EDT 2025
% 0.09/0.30  % CPUTime  : 
% 0.16/0.44  % SZS status Unsatisfiable
% 0.16/0.44  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------