↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : FLD006-1 : TPTP v9.0.0. Bugfixed v2.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 : n005.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 06:10:36 PM UTC 2025

% Result   : Unsatisfiable 4.83s 2.46s
% Output   : CNFRefutation 4.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  22   ~;  18   |;   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 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   19 (  19   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ less_or_equal > equalish > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > additive_identity

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_237,axiom,
    ~ equalish(additive_inverse(additive_identity),additive_identity),
    file(unknown,unknown) ).

tff(f_126,axiom,
    defined(additive_identity),
    file(unknown,unknown) ).

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

tff(f_67,axiom,
    ! [X] :
      ( equalish(add(X,additive_inverse(X)),additive_identity)
      | ~ defined(X) ),
    file(unknown,unknown) ).

tff(f_199,axiom,
    ! [X,Y] :
      ( equalish(X,Y)
      | ~ equalish(Y,X) ),
    file(unknown,unknown) ).

tff(f_62,axiom,
    ! [X] :
      ( equalish(add(additive_identity,X),X)
      | ~ defined(X) ),
    file(unknown,unknown) ).

tff(f_207,axiom,
    ! [X,Z,Y] :
      ( equalish(X,Z)
      | ~ equalish(X,Y)
      | ~ equalish(Y,Z) ),
    file(unknown,unknown) ).

tff(c_56,plain,
    ~ equalish(additive_inverse(additive_identity),additive_identity),
    inference(cnfTransformation,[status(thm)],[f_237]) ).

tff(c_22,plain,
    defined(additive_identity),
    inference(cnfTransformation,[status(thm)],[f_126]) ).

tff(c_24,plain,
    ! [X_20] :
      ( ~ defined(X_20)
      | defined(additive_inverse(X_20)) ),
    inference(cnfTransformation,[status(thm)],[f_131]) ).

tff(c_81,plain,
    ! [X_62] :
      ( ~ defined(X_62)
      | equalish(add(X_62,additive_inverse(X_62)),additive_identity) ),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_44,plain,
    ! [Y_38,X_37] :
      ( ~ equalish(Y_38,X_37)
      | equalish(X_37,Y_38) ),
    inference(cnfTransformation,[status(thm)],[f_199]) ).

tff(c_84,plain,
    ! [X_62] :
      ( equalish(additive_identity,add(X_62,additive_inverse(X_62)))
      | ~ defined(X_62) ),
    inference(resolution,[status(thm)],[c_81,c_44]) ).

tff(c_4,plain,
    ! [X_4] :
      ( ~ defined(X_4)
      | equalish(add(additive_identity,X_4),X_4) ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_86,plain,
    ! [Y_65,Z_66,X_67] :
      ( ~ equalish(Y_65,Z_66)
      | ~ equalish(X_67,Y_65)
      | equalish(X_67,Z_66) ),
    inference(cnfTransformation,[status(thm)],[f_207]) ).

tff(c_272,plain,
    ! [X_90,X_91] :
      ( ~ equalish(X_90,add(additive_identity,X_91))
      | equalish(X_90,X_91)
      | ~ defined(X_91) ),
    inference(resolution,[status(thm)],[c_4,c_86]) ).

tff(c_280,plain,
    ( equalish(additive_identity,additive_inverse(additive_identity))
    | ~ defined(additive_inverse(additive_identity))
    | ~ defined(additive_identity) ),
    inference(resolution,[status(thm)],[c_84,c_272]) ).

tff(c_299,plain,
    ( equalish(additive_identity,additive_inverse(additive_identity))
    | ~ defined(additive_inverse(additive_identity)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_280]) ).

tff(c_304,plain,
    ~ defined(additive_inverse(additive_identity)),
    inference(splitLeft,[status(thm)],[c_299]) ).

tff(c_307,plain,
    ~ defined(additive_identity),
    inference(resolution,[status(thm)],[c_24,c_304]) ).

tff(c_311,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_307]) ).

tff(c_312,plain,
    equalish(additive_identity,additive_inverse(additive_identity)),
    inference(splitRight,[status(thm)],[c_299]) ).

tff(c_319,plain,
    equalish(additive_inverse(additive_identity),additive_identity),
    inference(resolution,[status(thm)],[c_312,c_44]) ).

tff(c_325,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_56,c_319]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : FLD006-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.02/0.11  % 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.10/0.31  % Computer : n005.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Mon Apr  7 18:38:42 EDT 2025
% 0.10/0.31  % CPUTime  : 
% 4.83/2.46  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.83/2.47  
% 4.83/2.47  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------