↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SWV339-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/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 : n006.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:30:14 PM UTC 2025

% Result   : Unsatisfiable 2.62s 1.69s
% Output   : CNFRefutation 2.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   15 (   6 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    4 (   2   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-1 aty)
%            Number of variables   :    8 (   8   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_in > #nlpp > c_Public_OshrK > c_Message_Omsg_OKey > c_Event_Oused > v_evs3 > v_K > v_B > v_A > tc_Message_Omsg

%Foreground sorts:

%Background operators:

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

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

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

tff(c_in,type,
    c_in: ( $i * $i * $i ) > $o ).

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

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

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

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

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

tff(f_30,axiom,
    ( ( v_K = c_Public_OshrK(v_B) )
    | ( v_K = c_Public_OshrK(v_A) ) ),
    file(unknown,unknown) ).

tff(f_32,axiom,
    ! [V_A,V_evs] : c_in(c_Message_Omsg_OKey(c_Public_OshrK(V_A)),c_Event_Oused(V_evs),tc_Message_Omsg),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ~ c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg),
    file(unknown,unknown) ).

tff(c_4,plain,
    ( ( c_Public_OshrK(v_A) = v_K )
    | ( c_Public_OshrK(v_B) = v_K ) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_7,plain,
    c_Public_OshrK(v_B) = v_K,
    inference(splitLeft,[status(thm)],[c_4]) ).

tff(c_12,plain,
    ! [V_A_3,V_evs_4] : c_in(c_Message_Omsg_OKey(c_Public_OshrK(V_A_3)),c_Event_Oused(V_evs_4),tc_Message_Omsg),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_14,plain,
    ! [V_evs_4] : c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(V_evs_4),tc_Message_Omsg),
    inference(superposition,[status(thm),theory(equality)],[c_7,c_12]) ).

tff(c_2,plain,
    ~ c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

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

tff(c_18,plain,
    c_Public_OshrK(v_A) = v_K,
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_24,plain,
    ! [V_A_5,V_evs_6] : c_in(c_Message_Omsg_OKey(c_Public_OshrK(V_A_5)),c_Event_Oused(V_evs_6),tc_Message_Omsg),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_26,plain,
    ! [V_evs_6] : c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(V_evs_6),tc_Message_Omsg),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_24]) ).

tff(c_29,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_26,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV339-2 : TPTP v9.0.0. Released v3.2.0.
% 0.06/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.13/0.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Apr  9 03:04:52 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.62/1.69  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.62/1.69  
% 2.62/1.69  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------