↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : BOO006-4 : TPTP v9.0.0. Released v1.1.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:45:01 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > add > #nlpp > inverse > multiplicative_identity > additive_identity > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_58,axiom,
    ! [X] : ( multiply(X,inverse(X)) = additive_identity ),
    file(unknown,unknown) ).

tff(f_44,axiom,
    ! [X,Y] : ( add(X,Y) = add(Y,X) ),
    file(unknown,unknown) ).

tff(f_52,axiom,
    ! [X] : ( add(X,additive_identity) = X ),
    file(unknown,unknown) ).

tff(f_50,axiom,
    ! [X,Y,Z] : ( multiply(X,add(Y,Z)) = add(multiply(X,Y),multiply(X,Z)) ),
    file(unknown,unknown) ).

tff(f_62,axiom,
    multiply(a,additive_identity) != additive_identity,
    file(unknown,unknown) ).

tff(c_16,plain,
    ! [X_14] : ( multiply(X_14,inverse(X_14)) = additive_identity ),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_51,plain,
    ! [Y_19,X_20] : ( add(Y_19,X_20) = add(X_20,Y_19) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_10,plain,
    ! [X_11] : ( add(X_11,additive_identity) = X_11 ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_67,plain,
    ! [X_20] : ( add(additive_identity,X_20) = X_20 ),
    inference(superposition,[status(thm),theory(equality)],[c_51,c_10]) ).

tff(c_321,plain,
    ! [X_28,Y_29,Z_30] : ( add(multiply(X_28,Y_29),multiply(X_28,Z_30)) = multiply(X_28,add(Y_29,Z_30)) ),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_375,plain,
    ! [X_14,Y_29] : ( multiply(X_14,add(Y_29,inverse(X_14))) = add(multiply(X_14,Y_29),additive_identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_16,c_321]) ).

tff(c_747,plain,
    ! [X_39,Y_40] : ( multiply(X_39,add(Y_40,inverse(X_39))) = multiply(X_39,Y_40) ),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_375]) ).

tff(c_800,plain,
    ! [X_39] : ( multiply(X_39,inverse(X_39)) = multiply(X_39,additive_identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_67,c_747]) ).

tff(c_826,plain,
    ! [X_39] : ( multiply(X_39,additive_identity) = additive_identity ),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_800]) ).

tff(c_18,plain,
    multiply(a,additive_identity) != additive_identity,
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_830,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_826,c_18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : BOO006-4 : TPTP v9.0.0. Released v1.1.0.
% 0.07/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 : n008.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:21:32 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 3.18/1.92  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.18/1.93  
% 3.18/1.93  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------