↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LAT045-1 : TPTP v9.0.0. Released v2.5.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 : n031.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:15 PM UTC 2025

% Result   : Unsatisfiable 41.31s 29.18s
% Output   : CNFRefutation 41.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   18 (  18 unt;   0 typ;   0 def)
%            Number of atoms       :   18 (  17 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    4 (   2 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;   4 con; 0-2 aty)
%            Number of variables   :   29 (  29   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ meet > join > #nlpp > complement > n1 > n0 > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

tff(f_72,axiom,
    ! [X] : ( join(complement(X),X) = n1 ),
    file(unknown,unknown) ).

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

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

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

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

tff(f_82,axiom,
    join(a,meet(complement(a),join(a,b))) != join(a,b),
    file(unknown,unknown) ).

tff(c_22,plain,
    ! [X_21] : ( join(complement(X_21),X_21) = n1 ),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_86,plain,
    ! [Y_32,X_33] : ( join(Y_32,X_33) = join(X_33,Y_32) ),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_124,plain,
    ! [X_21] : ( join(X_21,complement(X_21)) = n1 ),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_86]) ).

tff(c_156,plain,
    ! [X_36,Y_37] : ( meet(X_36,join(X_36,Y_37)) = X_36 ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_165,plain,
    ! [X_21] : ( meet(X_21,n1) = X_21 ),
    inference(superposition,[status(thm),theory(equality)],[c_124,c_156]) ).

tff(c_1203,plain,
    ! [X_60,Y_61,Z_62] : ( meet(join(X_60,Y_61),join(X_60,Z_62)) = join(X_60,meet(Y_61,join(X_60,Z_62))) ),
    inference(cnfTransformation,[status(thm)],[f_79]) ).

tff(c_10,plain,
    ! [Y_8,X_7] : ( meet(Y_8,X_7) = meet(X_7,Y_8) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_71494,plain,
    ! [X_393,Z_394,Y_395] : ( meet(join(X_393,Z_394),join(X_393,Y_395)) = join(X_393,meet(Y_395,join(X_393,Z_394))) ),
    inference(superposition,[status(thm),theory(equality)],[c_1203,c_10]) ).

tff(c_72206,plain,
    ! [X_21,Z_394] : ( join(X_21,meet(complement(X_21),join(X_21,Z_394))) = meet(join(X_21,Z_394),n1) ),
    inference(superposition,[status(thm),theory(equality)],[c_124,c_71494]) ).

tff(c_72415,plain,
    ! [X_21,Z_394] : ( join(X_21,meet(complement(X_21),join(X_21,Z_394))) = join(X_21,Z_394) ),
    inference(demodulation,[status(thm),theory(equality)],[c_165,c_72206]) ).

tff(c_30,plain,
    join(a,meet(complement(a),join(a,b))) != join(a,b),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_185585,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_72415,c_30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LAT045-1 : TPTP v9.0.0. Released v2.5.0.
% 0.11/0.13  % 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.14/0.34  % Computer : n031.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Tue Apr  8 03:26:22 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 41.31/29.18  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 41.31/29.19  
% 41.31/29.19  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------