↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : CAT007-1 : 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 : n027.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 3.37s 1.92s
% Output   : CNFRefutation 3.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   17 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   26 (   2 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   20 (  11   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 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  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   16 (  16   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ product > defined > identity_map > compose > #nlpp > domain > codomain > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_175,axiom,
    ~ defined(a,b),
    file(unknown,unknown) ).

tff(f_173,axiom,
    domain(a) = codomain(b),
    file(unknown,unknown) ).

tff(f_138,axiom,
    ! [X] : defined(X,domain(X)),
    file(unknown,unknown) ).

tff(f_136,axiom,
    ! [X] : identity_map(codomain(X)),
    file(unknown,unknown) ).

tff(f_140,axiom,
    ! [X] : defined(codomain(X),X),
    file(unknown,unknown) ).

tff(f_131,axiom,
    ! [X,Y,Z] :
      ( ~ defined(X,Y)
      | ~ defined(Y,Z)
      | ~ identity_map(Y)
      | defined(X,Z) ),
    file(unknown,unknown) ).

tff(c_40,plain,
    ~ defined(a,b),
    inference(cnfTransformation,[status(thm)],[f_175]) ).

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

tff(c_24,plain,
    ! [X_41] : defined(X_41,domain(X_41)),
    inference(cnfTransformation,[status(thm)],[f_138]) ).

tff(c_48,plain,
    defined(a,codomain(b)),
    inference(superposition,[status(thm),theory(equality)],[c_38,c_24]) ).

tff(c_22,plain,
    ! [X_40] : identity_map(codomain(X_40)),
    inference(cnfTransformation,[status(thm)],[f_136]) ).

tff(c_26,plain,
    ! [X_42] : defined(codomain(X_42),X_42),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_284,plain,
    ! [X_88,Z_89,Y_90] :
      ( defined(X_88,Z_89)
      | ~ identity_map(Y_90)
      | ~ defined(Y_90,Z_89)
      | ~ defined(X_88,Y_90) ),
    inference(cnfTransformation,[status(thm)],[f_131]) ).

tff(c_294,plain,
    ! [X_88,X_42] :
      ( defined(X_88,X_42)
      | ~ identity_map(codomain(X_42))
      | ~ defined(X_88,codomain(X_42)) ),
    inference(resolution,[status(thm)],[c_26,c_284]) ).

tff(c_505,plain,
    ! [X_107,X_108] :
      ( defined(X_107,X_108)
      | ~ defined(X_107,codomain(X_108)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_294]) ).

tff(c_517,plain,
    defined(a,b),
    inference(resolution,[status(thm)],[c_48,c_505]) ).

tff(c_527,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_40,c_517]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : CAT007-1 : 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.13/0.33  % Computer : n027.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Mon Apr  7 15:38:06 EDT 2025
% 0.13/0.33  % CPUTime  : 
% 3.37/1.92  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.37/1.92  
% 3.37/1.92  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------