↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LAT034-1 : TPTP v9.0.0. Bugfixed v2.5.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 : 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 07:11:14 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > xx

%Foreground sorts:

%Background operators:

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

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

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

tff(f_30,axiom,
    ! [X,Y] : ( join(X,meet(X,Y)) = X ),
    file(unknown,unknown) ).

tff(f_28,axiom,
    ! [X,Y] : ( meet(X,join(X,Y)) = X ),
    file(unknown,unknown) ).

tff(f_40,axiom,
    meet(xx,xx) != xx,
    file(unknown,unknown) ).

tff(c_96,plain,
    ! [X_21,Y_22] : ( join(X_21,meet(X_21,Y_22)) = X_21 ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_2,plain,
    ! [X_1,Y_2] : ( meet(X_1,join(X_1,Y_2)) = X_1 ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_102,plain,
    ! [X_21] : ( meet(X_21,X_21) = X_21 ),
    inference(superposition,[status(thm),theory(equality)],[c_96,c_2]) ).

tff(c_14,plain,
    meet(xx,xx) != xx,
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_170,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_102,c_14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LAT034-1 : TPTP v9.0.0. Bugfixed v2.5.0.
% 0.07/0.13  % 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.12/0.34  % Computer : n007.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 : Tue Apr  8 03:25:53 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.73/1.69  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.73/1.69  
% 2.73/1.69  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------