↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP144-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/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 : n018.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:20 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > 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(f_89,axiom,
    ! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
    file(unknown,unknown) ).

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

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

tff(f_116,axiom,
    least_upper_bound(greatest_lower_bound(a,b),b) != b,
    file(unknown,unknown) ).

tff(c_8,plain,
    ! [Y_7,X_6] : ( greatest_lower_bound(Y_7,X_6) = greatest_lower_bound(X_6,Y_7) ),
    inference(cnfTransformation,[status(thm)],[f_89]) ).

tff(c_153,plain,
    ! [X_44,Y_45] : ( least_upper_bound(X_44,greatest_lower_bound(X_44,Y_45)) = X_44 ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_168,plain,
    ! [X_6,Y_7] : ( least_upper_bound(X_6,greatest_lower_bound(Y_7,X_6)) = X_6 ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_153]) ).

tff(c_10,plain,
    ! [Y_9,X_8] : ( least_upper_bound(Y_9,X_8) = least_upper_bound(X_8,Y_9) ),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

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

tff(c_33,plain,
    least_upper_bound(b,greatest_lower_bound(a,b)) != b,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_32]) ).

tff(c_244,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_168,c_33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09  % Problem  : GRP144-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.04/0.09  % 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.29  % Computer : n018.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 300
% 0.10/0.29  % DateTime : Mon Apr  7 21:28:47 EDT 2025
% 0.10/0.29  % CPUTime  : 
% 2.79/1.60  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.60  
% 2.79/1.60  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------