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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV250-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 : 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 : Tue Aug 22 11:03:20 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ c_in > c_union > #nlpp > c_Message_Osynth > c_Message_Oanalz > v_x > v_H > v_G > tc_Message_Omsg

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_44,axiom,
    ! [V_c,V_A,T_a,V_B] :
      ( ~ c_in(V_c,V_A,T_a)
      | c_in(V_c,c_union(V_A,V_B,T_a),T_a) ),
    file(unknown,unknown) ).

tff(f_28,axiom,
    ~ c_in(v_x,c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_Message_Omsg),
    file(unknown,unknown) ).

tff(f_49,axiom,
    ! [V_c,V_B,T_a,V_A] :
      ( ~ c_in(V_c,V_B,T_a)
      | c_in(V_c,c_union(V_A,V_B,T_a),T_a) ),
    file(unknown,unknown) ).

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

tff(f_26,axiom,
    c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
    file(unknown,unknown) ).

tff(f_32,axiom,
    ! [V_G,V_H] : ( c_Message_Oanalz(c_union(c_Message_Osynth(V_G),V_H,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(V_G,V_H,tc_Message_Omsg)),c_Message_Osynth(V_G),tc_Message_Omsg) ),
    file(unknown,unknown) ).

tff(f_39,axiom,
    ! [V_c,V_A,V_B,T_a] :
      ( ~ c_in(V_c,c_union(V_A,V_B,T_a),T_a)
      | c_in(V_c,V_B,T_a)
      | c_in(V_c,V_A,T_a) ),
    file(unknown,unknown) ).

tff(c_12,plain,
    ! [V_c_9,V_A_10,V_B_12,T_a_11] :
      ( c_in(V_c_9,c_union(V_A_10,V_B_12,T_a_11),T_a_11)
      | ~ c_in(V_c_9,V_A_10,T_a_11) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_4,plain,
    ~ c_in(v_x,c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_Message_Omsg),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_41,plain,
    ~ c_in(v_x,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
    inference(resolution,[status(thm)],[c_12,c_4]) ).

tff(c_14,plain,
    ! [V_c_13,V_A_16,V_B_14,T_a_15] :
      ( c_in(V_c_13,c_union(V_A_16,V_B_14,T_a_15),T_a_15)
      | ~ c_in(V_c_13,V_B_14,T_a_15) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_40,plain,
    ~ c_in(v_x,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),
    inference(resolution,[status(thm)],[c_14,c_4]) ).

tff(c_6,plain,
    ! [V_G_1,V_H_2] : ( c_Message_Oanalz(c_union(c_Message_Oanalz(V_G_1),V_H_2,tc_Message_Omsg)) = c_Message_Oanalz(c_union(V_G_1,V_H_2,tc_Message_Omsg)) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_2,plain,
    c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_8,plain,
    ! [V_G_3,V_H_4] : ( c_union(c_Message_Oanalz(c_union(V_G_3,V_H_4,tc_Message_Omsg)),c_Message_Osynth(V_G_3),tc_Message_Omsg) = c_Message_Oanalz(c_union(c_Message_Osynth(V_G_3),V_H_4,tc_Message_Omsg)) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_70,plain,
    ! [V_c_32,V_A_33,T_a_34,V_B_35] :
      ( c_in(V_c_32,V_A_33,T_a_34)
      | c_in(V_c_32,V_B_35,T_a_34)
      | ~ c_in(V_c_32,c_union(V_A_33,V_B_35,T_a_34),T_a_34) ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_209,plain,
    ! [V_c_46,V_G_47,V_H_48] :
      ( c_in(V_c_46,c_Message_Oanalz(c_union(V_G_47,V_H_48,tc_Message_Omsg)),tc_Message_Omsg)
      | c_in(V_c_46,c_Message_Osynth(V_G_47),tc_Message_Omsg)
      | ~ c_in(V_c_46,c_Message_Oanalz(c_union(c_Message_Osynth(V_G_47),V_H_48,tc_Message_Omsg)),tc_Message_Omsg) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_70]) ).

tff(c_218,plain,
    ( c_in(v_x,c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(v_x,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg) ),
    inference(resolution,[status(thm)],[c_2,c_209]) ).

tff(c_222,plain,
    ( c_in(v_x,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(v_x,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_218]) ).

tff(c_224,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_41,c_40,c_222]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SWV250-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.15  % 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.15/0.36  % Computer : n007.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 22:17:24 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 3.05/1.84  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.05/1.84  
% 3.05/1.84  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.05/1.87  
% 3.05/1.87  Inference rules
% 3.05/1.87  ----------------------
% 3.05/1.87  #Ref     : 0
% 3.05/1.87  #Sup     : 54
% 3.05/1.87  #Fact    : 0
% 3.05/1.87  #Define  : 0
% 3.05/1.87  #Split   : 0
% 3.05/1.87  #Chain   : 0
% 3.05/1.87  #Close   : 0
% 3.05/1.87  
% 3.05/1.87  Ordering : KBO
% 3.05/1.87  
% 3.05/1.87  Simplification rules
% 3.05/1.87  ----------------------
% 3.05/1.87  #Subsume      : 1
% 3.05/1.87  #Demod        : 22
% 3.05/1.87  #Tautology    : 17
% 3.05/1.87  #SimpNegUnit  : 1
% 3.05/1.87  #BackRed      : 0
% 3.05/1.87  
% 3.05/1.87  #Partial instantiations: 0
% 3.05/1.87  #Strategies tried      : 1
% 3.05/1.87  
% 3.05/1.87  Timing (in seconds)
% 3.05/1.87  ----------------------
% 3.05/1.87  Preprocessing        : 0.42
% 3.05/1.87  Parsing              : 0.23
% 3.05/1.87  CNF conversion       : 0.02
% 3.05/1.87  Main loop            : 0.31
% 3.05/1.87  Inferencing          : 0.13
% 3.05/1.87  Reduction            : 0.09
% 3.05/1.87  Demodulation         : 0.07
% 3.05/1.88  BG Simplification    : 0.02
% 3.05/1.88  Subsumption          : 0.06
% 3.05/1.88  Abstraction          : 0.02
% 3.05/1.88  MUC search           : 0.00
% 3.05/1.88  Cooper               : 0.00
% 3.05/1.88  Total                : 0.78
% 3.05/1.88  Index Insertion      : 0.00
% 3.05/1.88  Index Deletion       : 0.00
% 3.05/1.88  Index Matching       : 0.00
% 3.05/1.88  BG Taut test         : 0.00
%------------------------------------------------------------------------------