↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : CAT013-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n022.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:29 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ equivalent > there_exists > f1 > compose > #nlpp > domain > codomain > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(equivalent,type,
    equivalent: ( $i * $i ) > $o ).

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

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

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

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

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

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

tff(f_157,axiom,
    there_exists(codomain(a)),
    file(unknown,unknown) ).

tff(f_81,axiom,
    ! [X] :
      ( ~ there_exists(codomain(X))
      | there_exists(X) ),
    file(unknown,unknown) ).

tff(f_105,axiom,
    ! [X] : ( compose(codomain(X),X) = X ),
    file(unknown,unknown) ).

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

tff(f_159,axiom,
    domain(codomain(a)) != codomain(a),
    file(unknown,unknown) ).

tff(c_36,plain,
    there_exists(codomain(a)),
    inference(cnfTransformation,[status(thm)],[f_157]) ).

tff(c_43,plain,
    ! [X_39] :
      ( there_exists(X_39)
      | ~ there_exists(codomain(X_39)) ),
    inference(cnfTransformation,[status(thm)],[f_81]) ).

tff(c_47,plain,
    there_exists(a),
    inference(resolution,[status(thm)],[c_36,c_43]) ).

tff(c_22,plain,
    ! [X_19] : ( compose(codomain(X_19),X_19) = X_19 ),
    inference(cnfTransformation,[status(thm)],[f_105]) ).

tff(c_115,plain,
    ! [X_53,Y_54] :
      ( ( domain(X_53) = codomain(Y_54) )
      | ~ there_exists(compose(X_53,Y_54)) ),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_162,plain,
    ! [X_58] :
      ( ( domain(codomain(X_58)) = codomain(X_58) )
      | ~ there_exists(X_58) ),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_115]) ).

tff(c_38,plain,
    domain(codomain(a)) != codomain(a),
    inference(cnfTransformation,[status(thm)],[f_159]) ).

tff(c_180,plain,
    ~ there_exists(a),
    inference(superposition,[status(thm),theory(equality)],[c_162,c_38]) ).

tff(c_188,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_47,c_180]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : CAT013-3 : TPTP v9.0.0. Released v1.0.0.
% 0.06/0.12  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.33  % Computer : n022.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 Apr  7 15:39:06 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 3.34/1.75  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.34/1.75  
% 3.34/1.75  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------