↑ Up

Toma---0.7.UNS-CRf.s

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

% Computer : n013.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:17:25 AM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
    response(b,B) != A,
    file('theBenchmark.p',prove_birds_are_compatible_2) ).

fof(e,plain,
    ! [A,B] :
      ( true != false
      & eq(A,A) = true
      & eq(response(b,B),A) = false ),
    inference(encode_existential,[status(esa)],[g0]) ).

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

cnf(c1,plain,
    eq(response(b,X),Y) = false,
    inference(split_conjunct,[status(thm)],[e]) ).

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

cnf(c3,plain,
    true = false,
    inference(equational,[status(thm)],[c1,c2]) ).

cnf(g2,plain,
    true = false,
    inference(equational,[status(thm)],[c3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : COL084-1 : TPTP v9.0.0. Released v2.6.0.
% 0.11/0.12  % Command  : run_Leo-III %s %d THM
% 0.12/0.33  % Computer : n013.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 04:58:19 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  % SZS status Unsatisfiable
% 0.19/0.45  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------