↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : BOO005-2 : 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 : n007.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.17s 1.79s
% Output   : CNFRefutation 3.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   18 (  18 unt;   0 typ;   0 def)
%            Number of atoms       :   18 (  17 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 (   1 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   :   23 (  23   !;   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_59,axiom,
    ! [X] : ( add(inverse(X),X) = multiplicative_identity ),
    file(unknown,unknown) ).

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

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

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

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

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

tff(c_16,plain,
    ! [X_18] : ( add(inverse(X_18),X_18) = multiplicative_identity ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_22,plain,
    ! [X_21] : ( multiply(X_21,multiplicative_identity) = X_21 ),
    inference(cnfTransformation,[status(thm)],[f_65]) ).

tff(c_24,plain,
    ! [X_22] : ( multiply(multiplicative_identity,X_22) = X_22 ),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_367,plain,
    ! [X_37,Z_38,Y_39] : ( multiply(add(X_37,Z_38),add(Y_39,Z_38)) = add(multiply(X_37,Y_39),Z_38) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_406,plain,
    ! [X_18,Y_39] : ( add(multiply(inverse(X_18),Y_39),X_18) = multiply(multiplicative_identity,add(Y_39,X_18)) ),
    inference(superposition,[status(thm),theory(equality)],[c_16,c_367]) ).

tff(c_430,plain,
    ! [X_40,Y_41] : ( add(multiply(inverse(X_40),Y_41),X_40) = add(Y_41,X_40) ),
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_406]) ).

tff(c_489,plain,
    ! [X_40] : ( add(inverse(X_40),X_40) = add(multiplicative_identity,X_40) ),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_430]) ).

tff(c_537,plain,
    ! [X_43] : ( add(multiplicative_identity,X_43) = multiplicative_identity ),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_489]) ).

tff(c_2,plain,
    ! [Y_2,X_1] : ( add(Y_2,X_1) = add(X_1,Y_2) ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_552,plain,
    ! [X_43] : ( add(X_43,multiplicative_identity) = multiplicative_identity ),
    inference(superposition,[status(thm),theory(equality)],[c_537,c_2]) ).

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

tff(c_682,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_552,c_30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : BOO005-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.11/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.13/0.33  % Computer : n007.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:21:38 EDT 2025
% 0.13/0.33  % CPUTime  : 
% 3.17/1.79  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.17/1.80  
% 3.17/1.80  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------