↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : CAT007-3 : TPTP v9.0.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n008.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 : Wed Apr  9 05:46:27 PM UTC 2025

% Result   : Unsatisfiable 2.77s 1.77s
% Output   : CNFRefutation 3.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   11 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   12 (   7   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :    4 (   4   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ equalish > there_exists > f1 > compose > #nlpp > domain > codomain > c2 > c1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(c1,type,
    c1: $i ).

tff(domain,type,
    domain: $i > $i ).

tff(there_exists,type,
    there_exists: $i > $o ).

tff(c2,type,
    c2: $i ).

tff(codomain,type,
    codomain: $i > $i ).

tff(compose,type,
    compose: ( $i * $i ) > $i ).

tff(equalish,type,
    equalish: ( $i * $i ) > $o ).

tff(f1,type,
    f1: ( $i * $i ) > $i ).

tff(f_78,axiom,
    ~ there_exists(compose(c2,c1)),
    file(unknown,unknown) ).

tff(f_74,axiom,
    there_exists(domain(c2)),
    file(unknown,unknown) ).

tff(f_76,axiom,
    equalish(domain(c2),codomain(c1)),
    file(unknown,unknown) ).

tff(f_54,axiom,
    ! [X,Y] :
      ( ~ there_exists(domain(X))
      | ~ equalish(domain(X),codomain(Y))
      | there_exists(compose(X,Y)) ),
    file(unknown,unknown) ).

tff(c_24,plain,
    ~ there_exists(compose(c2,c1)),
    inference(cnfTransformation,[status(thm)],[f_78]) ).

tff(c_18,plain,
    there_exists(domain(c2)),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_22,plain,
    equalish(domain(c2),codomain(c1)),
    inference(cnfTransformation,[status(thm)],[f_76]) ).

tff(c_91,plain,
    ! [X_28,Y_29] :
      ( there_exists(compose(X_28,Y_29))
      | ~ equalish(domain(X_28),codomain(Y_29))
      | ~ there_exists(domain(X_28)) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_94,plain,
    ( there_exists(compose(c2,c1))
    | ~ there_exists(domain(c2)) ),
    inference(resolution,[status(thm)],[c_22,c_91]) ).

tff(c_97,plain,
    there_exists(compose(c2,c1)),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_94]) ).

tff(c_99,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_24,c_97]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem  : CAT007-3 : TPTP v9.0.0. Released v1.0.0.
% 0.02/0.11  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.11/0.32  % Computer : n008.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Mon Apr  7 15:38:02 EDT 2025
% 0.11/0.32  % CPUTime  : 
% 2.77/1.77  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.77/1.77  
% 2.77/1.77  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------