↑ Up

Toma---0.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Toma---0.7
% Problem  : SYN170-10 : TPTP v9.0.0. Released v7.5.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 08:34:49 AM UTC 2025

% Result   : Unsatisfiable 61.17s 61.37s
% Output   : CNFRefutation 61.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   18 (  17 unt;   0 def)
%            Number of atoms       :   20 (  19 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :    5 (   3   ~;   0   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-4 aty)
%            Number of variables   :   23 (  10 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
    p4(X,c,Y) != true,
    file('theBenchmark.p',prove_this) ).

fof(e,plain,
    ! [X,Y] :
      ( true0 != false
      & eq(X,X) = true0
      & eq(p4(X,c,Y),true) = false ),
    inference(encode_existential,[status(esa)],[g0]) ).

cnf(g1,plain,
    true0 != false,
    inference(split_conjunct,[status(thm)],[e]) ).

cnf(c9,plain,
    eq(X,X) = true0,
    inference(split_conjunct,[status(thm)],[e]) ).

cnf(c10,axiom,
    p0(b,X) = true,
    file('theBenchmark.p',axiom_14) ).

cnf(c34,axiom,
    ifeq(X,X,Y,Z) = Y,
    file('theBenchmark.p',ifeq_axiom) ).

cnf(c35,plain,
    eq(p4(X,c,Y),true) = false,
    inference(split_conjunct,[status(thm)],[e]) ).

cnf(c58,axiom,
    ifeq(p1(X,Y,Z),true,n2(Z),true) = true,
    file('theBenchmark.p',rule_137) ).

cnf(c66,axiom,
    ifeq(n2(X),true,k3(X,X,X),true) = true,
    file('theBenchmark.p',rule_210) ).

cnf(c154,axiom,
    ifeq(p0(X,Y),true,p1(Y,Y,Y),true) = true,
    file('theBenchmark.p',rule_085) ).

cnf(c155,plain,
    p1(X,X,X) = true,
    inference(equational,[status(thm)],[c10,c34,c154]) ).

cnf(c156,plain,
    n2(X) = true,
    inference(equational,[status(thm)],[c34,c58,c155]) ).

cnf(c160,plain,
    k3(X,X,X) = true,
    inference(equational,[status(thm)],[c34,c66,c156]) ).

cnf(c229,axiom,
    ifeq(k3(X,X,Y),true,p4(X,Y,X),true) = true,
    file('theBenchmark.p',rule_287) ).

cnf(c231,plain,
    p4(X,X,X) = true,
    inference(equational,[status(thm)],[c34,c160,c229]) ).

cnf(c232,plain,
    true0 = false,
    inference(equational,[status(thm)],[c9,c35,c231]) ).

cnf(g2,plain,
    true0 = false,
    inference(equational,[status(thm)],[c232]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN170-10 : TPTP v9.0.0. Released v7.5.0.
% 0.00/0.12  % Command  : run_Leo-III %s %d THM
% 0.12/0.33  % Computer : n012.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 22:07:19 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 61.17/61.37  % SZS status Unsatisfiable
% 61.17/61.37  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------