TSTP Solution File: SWV322-2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV322-2 : TPTP v8.1.2. 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 : n023.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 : Tue Aug 22 11:03:42 EDT 2023

% Result   : Unsatisfiable 2.27s 1.56s
% Output   : CNFRefutation 2.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   21 (   9 unt;  10 typ;   0 def)
%            Number of atoms       :   13 (   3 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   4   ~;   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  :    6 (   4   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-1 aty)
%            Number of variables   :    5 (;   5   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_in > #nlpp > c_Public_OshrK > c_Message_Omsg_OKey > c_Event_Oused > v_evs3 > v_KAB > v_A > tc_Message_Omsg > tc_Message_Oagent > c_Event_Obad

%Foreground sorts:

%Background operators:

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

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

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

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

tff(tc_Message_Oagent,type,
    tc_Message_Oagent: $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_A,type,
    v_A: $i ).

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

tff(f_29,axiom,
    ~ c_in(v_A,c_Event_Obad,tc_Message_Oagent),
    file(unknown,unknown) ).

tff(f_32,axiom,
    ( ( c_Public_OshrK(v_A) = v_KAB )
    | c_in(v_A,c_Event_Obad,tc_Message_Oagent) ),
    file(unknown,unknown) ).

tff(f_34,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_KAB),c_Event_Oused(v_evs3),tc_Message_Omsg),
    file(unknown,unknown) ).

tff(c_4,plain,
    ~ c_in(v_A,c_Event_Obad,tc_Message_Oagent),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_6,plain,
    ( c_in(v_A,c_Event_Obad,tc_Message_Oagent)
    | ( c_Public_OshrK(v_A) = v_KAB ) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_9,plain,
    c_Public_OshrK(v_A) = v_KAB,
    inference(negUnitSimplification,[status(thm)],[c_4,c_6]) ).

tff(c_14,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_34]) ).

tff(c_16,plain,
    ! [V_evs_4] : c_in(c_Message_Omsg_OKey(v_KAB),c_Event_Oused(V_evs_4),tc_Message_Omsg),
    inference(superposition,[status(thm),theory(equality)],[c_9,c_14]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SWV322-2 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.14  % 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.36  % Computer : n023.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 22:44:52 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 2.27/1.56  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.27/1.56  
% 2.27/1.56  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.55/1.60  
% 2.55/1.60  Inference rules
% 2.55/1.60  ----------------------
% 2.55/1.60  #Ref     : 0
% 2.55/1.60  #Sup     : 3
% 2.55/1.60  #Fact    : 0
% 2.55/1.60  #Define  : 0
% 2.55/1.60  #Split   : 0
% 2.55/1.60  #Chain   : 0
% 2.55/1.60  #Close   : 0
% 2.55/1.60  
% 2.55/1.60  Ordering : KBO
% 2.55/1.60  
% 2.55/1.60  Simplification rules
% 2.55/1.60  ----------------------
% 2.55/1.60  #Subsume      : 0
% 2.55/1.60  #Demod        : 1
% 2.55/1.60  #Tautology    : 2
% 2.55/1.60  #SimpNegUnit  : 1
% 2.55/1.60  #BackRed      : 1
% 2.55/1.60  
% 2.55/1.60  #Partial instantiations: 0
% 2.55/1.60  #Strategies tried      : 1
% 2.55/1.60  
% 2.55/1.60  Timing (in seconds)
% 2.55/1.60  ----------------------
% 2.55/1.61  Preprocessing        : 0.39
% 2.55/1.61  Parsing              : 0.22
% 2.55/1.61  CNF conversion       : 0.02
% 2.55/1.61  Main loop            : 0.12
% 2.55/1.61  Inferencing          : 0.05
% 2.55/1.61  Reduction            : 0.03
% 2.55/1.61  Demodulation         : 0.02
% 2.55/1.61  BG Simplification    : 0.01
% 2.55/1.61  Subsumption          : 0.02
% 2.55/1.61  Abstraction          : 0.00
% 2.55/1.61  MUC search           : 0.00
% 2.55/1.61  Cooper               : 0.00
% 2.55/1.61  Total                : 0.56
% 2.55/1.61  Index Insertion      : 0.00
% 2.55/1.61  Index Deletion       : 0.00
% 2.55/1.61  Index Matching       : 0.00
% 2.55/1.61  BG Taut test         : 0.00
%------------------------------------------------------------------------------