↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP162-1 : 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 : n016.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:25:23 PM UTC 2025

% Result   : Unsatisfiable 4.24s 2.24s
% Output   : CNFRefutation 4.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   12 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   12 (  11 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    :    3 (   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    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :    7 (   7   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_118,axiom,
    least_upper_bound(a,c) != c,
    file(unknown,unknown) ).

tff(f_116,axiom,
    least_upper_bound(b,c) = c,
    file(unknown,unknown) ).

tff(f_115,axiom,
    least_upper_bound(a,b) = b,
    file(unknown,unknown) ).

tff(f_95,axiom,
    ! [X,Y,Z] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ),
    file(unknown,unknown) ).

tff(c_36,plain,
    least_upper_bound(a,c) != c,
    inference(cnfTransformation,[status(thm)],[f_118]) ).

tff(c_34,plain,
    least_upper_bound(b,c) = c,
    inference(cnfTransformation,[status(thm)],[f_116]) ).

tff(c_32,plain,
    least_upper_bound(a,b) = b,
    inference(cnfTransformation,[status(thm)],[f_115]) ).

tff(c_391,plain,
    ! [X_53,Y_54,Z_55] : ( least_upper_bound(least_upper_bound(X_53,Y_54),Z_55) = least_upper_bound(X_53,least_upper_bound(Y_54,Z_55)) ),
    inference(cnfTransformation,[status(thm)],[f_95]) ).

tff(c_1139,plain,
    ! [Z_76] : ( least_upper_bound(a,least_upper_bound(b,Z_76)) = least_upper_bound(b,Z_76) ),
    inference(superposition,[status(thm),theory(equality)],[c_32,c_391]) ).

tff(c_1183,plain,
    least_upper_bound(b,c) = least_upper_bound(a,c),
    inference(superposition,[status(thm),theory(equality)],[c_34,c_1139]) ).

tff(c_1193,plain,
    least_upper_bound(a,c) = c,
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_1183]) ).

tff(c_1195,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_36,c_1193]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem  : GRP162-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.09/0.15  % 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.15/0.35  % Computer : n016.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Mon Apr  7 21:29:53 EDT 2025
% 0.15/0.36  % CPUTime  : 
% 4.24/2.24  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.24/2.25  
% 4.24/2.25  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------