↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : BOO011-1 : 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/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 : n002.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:03 PM UTC 2025

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

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

%Foreground sorts:

%Background operators:

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

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

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_209,axiom,
    inverse(additive_identity) != multiplicative_identity,
    file(unknown,unknown) ).

tff(f_184,axiom,
    ! [X] : sum(X,inverse(X),multiplicative_identity),
    file(unknown,unknown) ).

tff(f_62,axiom,
    ! [X] : sum(additive_identity,X,X),
    file(unknown,unknown) ).

tff(f_197,axiom,
    ! [X,Y,U,V] :
      ( ~ sum(X,Y,U)
      | ~ sum(X,Y,V)
      | ( U = V ) ),
    file(unknown,unknown) ).

tff(c_46,plain,
    inverse(additive_identity) != multiplicative_identity,
    inference(cnfTransformation,[status(thm)],[f_209]) ).

tff(c_36,plain,
    ! [X_72] : sum(X_72,inverse(X_72),multiplicative_identity),
    inference(cnfTransformation,[status(thm)],[f_184]) ).

tff(c_10,plain,
    ! [X_11] : sum(additive_identity,X_11,X_11),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_190,plain,
    ! [V_112,U_113,X_114,Y_115] :
      ( ( V_112 = U_113 )
      | ~ sum(X_114,Y_115,V_112)
      | ~ sum(X_114,Y_115,U_113) ),
    inference(cnfTransformation,[status(thm)],[f_197]) ).

tff(c_236,plain,
    ! [X_117,U_118] :
      ( ( X_117 = U_118 )
      | ~ sum(additive_identity,X_117,U_118) ),
    inference(resolution,[status(thm)],[c_10,c_190]) ).

tff(c_248,plain,
    inverse(additive_identity) = multiplicative_identity,
    inference(resolution,[status(thm)],[c_36,c_236]) ).

tff(c_261,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_46,c_248]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : BOO011-1 : TPTP v9.0.0. Released v1.0.0.
% 0.03/0.12  % 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.34  % Computer : n002.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Apr  7 15:22:17 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 3.64/1.90  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.64/1.90  
% 3.64/1.90  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------