↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : CAT003-4 : 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 : n031.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:25 PM UTC 2025

% Result   : Unsatisfiable 9.29s 3.24s
% Output   : CNFRefutation 9.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   18 (  17 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   10 (   6   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   17 (  17   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ equivalent > there_exists > compose > #nlpp > domain > codomain > h > g > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_120,axiom,
    g != h,
    file(unknown,unknown) ).

tff(f_101,axiom,
    ! [X,Y,Z] : ( compose(X,compose(Y,Z)) = compose(compose(X,Y),Z) ),
    file(unknown,unknown) ).

tff(f_118,axiom,
    compose(h,a) = compose(g,a),
    file(unknown,unknown) ).

tff(f_116,axiom,
    ! [X,Y,Z] :
      ( ( compose(X,compose(a,b)) != Y )
      | ( compose(Z,compose(a,b)) != Y )
      | ( X = Z ) ),
    file(unknown,unknown) ).

tff(c_32,plain,
    h != g,
    inference(cnfTransformation,[status(thm)],[f_120]) ).

tff(c_18,plain,
    ! [X_15,Y_16,Z_17] : ( compose(compose(X_15,Y_16),Z_17) = compose(X_15,compose(Y_16,Z_17)) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_30,plain,
    compose(h,a) = compose(g,a),
    inference(cnfTransformation,[status(thm)],[f_118]) ).

tff(c_127,plain,
    ! [X_37,Y_38,Z_39] : ( compose(compose(X_37,Y_38),Z_39) = compose(X_37,compose(Y_38,Z_39)) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_152,plain,
    ! [Z_39] : ( compose(compose(g,a),Z_39) = compose(h,compose(a,Z_39)) ),
    inference(superposition,[status(thm),theory(equality)],[c_30,c_127]) ).

tff(c_1015,plain,
    ! [Z_63] : ( compose(h,compose(a,Z_63)) = compose(g,compose(a,Z_63)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_152]) ).

tff(c_26,plain,
    ! [Z_22,X_20] :
      ( ( Z_22 = X_20 )
      | ( compose(Z_22,compose(a,b)) != compose(X_20,compose(a,b)) ) ),
    inference(cnfTransformation,[status(thm)],[f_116]) ).

tff(c_1027,plain,
    ! [X_20] :
      ( ( h = X_20 )
      | ( compose(g,compose(a,b)) != compose(X_20,compose(a,b)) ) ),
    inference(superposition,[status(thm),theory(equality)],[c_1015,c_26]) ).

tff(c_15291,plain,
    h = g,
    inference(reflexivity,[status(thm),theory(equality)],[c_1027]) ).

tff(c_15293,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_32,c_15291]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : CAT003-4 : TPTP v9.0.0. Released v1.0.0.
% 0.03/0.14  % 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.14/0.35  % Computer : n031.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Mon Apr  7 15:37:37 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 9.29/3.24  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.29/3.24  
% 9.29/3.24  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------