↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SWV262-2 : TPTP v9.0.0. Released v3.2.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 : 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 09:29:56 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ c_union > c_insert > #nlpp > c_Message_Oparts > v_Y > v_X > v_H > tc_Message_Omsg > c_emptyset

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_31,axiom,
    ! [V_y,T_a] : ( c_union(c_emptyset,V_y,T_a) = V_y ),
    file(unknown,unknown) ).

tff(f_33,axiom,
    ! [V_a,V_B,T_a,V_C] : ( c_union(c_insert(V_a,V_B,T_a),V_C,T_a) = c_insert(V_a,c_union(V_B,V_C,T_a),T_a) ),
    file(unknown,unknown) ).

tff(f_29,axiom,
    ! [V_G,V_H] : ( c_Message_Oparts(c_union(V_G,V_H,tc_Message_Omsg)) = c_union(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_Message_Omsg) ),
    file(unknown,unknown) ).

tff(f_27,axiom,
    c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [V_y_3,T_a_4] : ( c_union(c_emptyset,V_y_3,T_a_4) = V_y_3 ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_8,plain,
    ! [V_a_5,V_B_6,T_a_7,V_C_8] : ( c_union(c_insert(V_a_5,V_B_6,T_a_7),V_C_8,T_a_7) = c_insert(V_a_5,c_union(V_B_6,V_C_8,T_a_7),T_a_7) ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_4,plain,
    ! [V_G_1,V_H_2] : ( c_union(c_Message_Oparts(V_G_1),c_Message_Oparts(V_H_2),tc_Message_Omsg) = c_Message_Oparts(c_union(V_G_1,V_H_2,tc_Message_Omsg)) ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_2,plain,
    c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg) != c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_10,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_8,c_8,c_4,c_6,c_8,c_4,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV262-2 : TPTP v9.0.0. Released v3.2.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.12/0.34  % Computer : n018.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 : Wed Apr  9 02:54:47 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.29/1.48  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.29/1.48  
% 2.29/1.48  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------