↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : BOO005-4 : TPTP v9.0.0. Bugfixed v1.2.1.
% 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 : n013.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 2.99s 1.79s
% Output   : CNFRefutation 2.99s
% 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_57,axiom,
    ! [X] : ( add(X,inverse(X)) = multiplicative_identity ),
    file(unknown,unknown) ).

tff(f_55,axiom,
    ! [X] : ( multiply(X,multiplicative_identity) = X ),
    file(unknown,unknown) ).

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

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

tff(f_63,axiom,
    add(a,multiplicative_identity) != multiplicative_identity,
    file(unknown,unknown) ).

tff(c_14,plain,
    ! [X_13] : ( add(X_13,inverse(X_13)) = multiplicative_identity ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_12,plain,
    ! [X_12] : ( multiply(X_12,multiplicative_identity) = X_12 ),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_156,plain,
    ! [Y_22,X_23] : ( multiply(Y_22,X_23) = multiply(X_23,Y_22) ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_194,plain,
    ! [X_12] : ( multiply(multiplicative_identity,X_12) = X_12 ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_156]) ).

tff(c_263,plain,
    ! [X_25,Y_26,Z_27] : ( multiply(add(X_25,Y_26),add(X_25,Z_27)) = add(X_25,multiply(Y_26,Z_27)) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_302,plain,
    ! [X_13,Z_27] : ( add(X_13,multiply(inverse(X_13),Z_27)) = multiply(multiplicative_identity,add(X_13,Z_27)) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_263]) ).

tff(c_389,plain,
    ! [X_31,Z_32] : ( add(X_31,multiply(inverse(X_31),Z_32)) = add(X_31,Z_32) ),
    inference(demodulation,[status(thm),theory(equality)],[c_194,c_302]) ).

tff(c_431,plain,
    ! [X_31] : ( add(X_31,inverse(X_31)) = add(X_31,multiplicative_identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_389]) ).

tff(c_440,plain,
    ! [X_31] : ( add(X_31,multiplicative_identity) = multiplicative_identity ),
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_431]) ).

tff(c_18,plain,
    add(a,multiplicative_identity) != multiplicative_identity,
    inference(cnfTransformation,[status(thm)],[f_63]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : BOO005-4 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.07/0.13  % 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 : n013.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:21:02 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.99/1.79  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.79  
% 2.99/1.79  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------