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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV242-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 : n032.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:18 EDT 2023

% Result   : Unsatisfiable 2.67s 1.72s
% Output   : CNFRefutation 2.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   33 (  14 unt;   9 typ;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  18   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   4   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   28 (;  28   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_lessequals > c_union > #nlpp > tc_set > c_Message_Oanalz > v_H_H > v_H > v_G_H > v_G > tc_Message_Omsg

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(c_lessequals,type,
    c_lessequals: ( $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_39,axiom,
    ! [V_A,V_B,T_a] : c_lessequals(V_A,c_union(V_A,V_B,T_a),tc_set(T_a)),
    file(unknown,unknown) ).

tff(f_37,axiom,
    ! [V_G,V_H] :
      ( ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg))
      | c_lessequals(c_Message_Oanalz(V_G),c_Message_Oanalz(V_H),tc_set(tc_Message_Omsg)) ),
    file(unknown,unknown) ).

tff(f_26,axiom,
    c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)),
    file(unknown,unknown) ).

tff(f_49,axiom,
    ! [V_B,V_C,T_a,V_A] :
      ( ~ c_lessequals(V_B,V_C,tc_set(T_a))
      | ~ c_lessequals(V_A,V_B,tc_set(T_a))
      | c_lessequals(V_A,V_C,tc_set(T_a)) ),
    file(unknown,unknown) ).

tff(f_41,axiom,
    ! [V_B,V_A,T_a] : c_lessequals(V_B,c_union(V_A,V_B,T_a),tc_set(T_a)),
    file(unknown,unknown) ).

tff(f_27,axiom,
    c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)),
    file(unknown,unknown) ).

tff(f_32,axiom,
    ( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    file(unknown,unknown) ).

tff(c_10,plain,
    ! [V_A_3,V_B_4,T_a_5] : c_lessequals(V_A_3,c_union(V_A_3,V_B_4,T_a_5),tc_set(T_a_5)),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_8,plain,
    ! [V_G_1,V_H_2] :
      ( c_lessequals(c_Message_Oanalz(V_G_1),c_Message_Oanalz(V_H_2),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(V_G_1,V_H_2,tc_set(tc_Message_Omsg)) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_2,plain,
    c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_18,plain,
    ! [V_A_21,V_C_22,T_a_23,V_B_24] :
      ( c_lessequals(V_A_21,V_C_22,tc_set(T_a_23))
      | ~ c_lessequals(V_A_21,V_B_24,tc_set(T_a_23))
      | ~ c_lessequals(V_B_24,V_C_22,tc_set(T_a_23)) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_34,plain,
    ! [V_C_25] :
      ( c_lessequals(v_G,V_C_25,tc_set(tc_Message_Omsg))
      | ~ c_lessequals(c_Message_Oanalz(v_G_H),V_C_25,tc_set(tc_Message_Omsg)) ),
    inference(resolution,[status(thm)],[c_2,c_18]) ).

tff(c_141,plain,
    ! [V_H_41] :
      ( c_lessequals(v_G,c_Message_Oanalz(V_H_41),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(v_G_H,V_H_41,tc_set(tc_Message_Omsg)) ),
    inference(resolution,[status(thm)],[c_8,c_34]) ).

tff(c_12,plain,
    ! [V_B_6,V_A_7,T_a_8] : c_lessequals(V_B_6,c_union(V_A_7,V_B_6,T_a_8),tc_set(T_a_8)),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_4,plain,
    c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_59,plain,
    ! [V_C_28] :
      ( c_lessequals(v_H,V_C_28,tc_set(tc_Message_Omsg))
      | ~ c_lessequals(c_Message_Oanalz(v_H_H),V_C_28,tc_set(tc_Message_Omsg)) ),
    inference(resolution,[status(thm)],[c_4,c_18]) ).

tff(c_98,plain,
    ! [V_H_36] :
      ( c_lessequals(v_H,c_Message_Oanalz(V_H_36),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(v_H_H,V_H_36,tc_set(tc_Message_Omsg)) ),
    inference(resolution,[status(thm)],[c_8,c_59]) ).

tff(c_6,plain,
    ( ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_58,plain,
    ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(splitLeft,[status(thm)],[c_6]) ).

tff(c_101,plain,
    ~ c_lessequals(v_H_H,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    inference(resolution,[status(thm)],[c_98,c_58]) ).

tff(c_107,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_101]) ).

tff(c_108,plain,
    ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(splitRight,[status(thm)],[c_6]) ).

tff(c_144,plain,
    ~ c_lessequals(v_G_H,c_union(v_G_H,v_H_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    inference(resolution,[status(thm)],[c_141,c_108]) ).

tff(c_150,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_144]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWV242-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12  % 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.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 300
% 0.11/0.31  % DateTime : Thu Aug  3 23:09:36 EDT 2023
% 0.11/0.31  % CPUTime  : 
% 2.67/1.72  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.77/1.73  
% 2.77/1.73  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.82/1.76  
% 2.82/1.76  Inference rules
% 2.82/1.76  ----------------------
% 2.82/1.76  #Ref     : 0
% 2.82/1.76  #Sup     : 29
% 2.82/1.76  #Fact    : 0
% 2.82/1.76  #Define  : 0
% 2.82/1.76  #Split   : 1
% 2.82/1.76  #Chain   : 0
% 2.82/1.76  #Close   : 0
% 2.82/1.76  
% 2.82/1.76  Ordering : KBO
% 2.82/1.76  
% 2.82/1.76  Simplification rules
% 2.82/1.76  ----------------------
% 2.82/1.76  #Subsume      : 0
% 2.82/1.76  #Demod        : 2
% 2.82/1.76  #Tautology    : 0
% 2.82/1.76  #SimpNegUnit  : 0
% 2.82/1.76  #BackRed      : 0
% 2.82/1.76  
% 2.82/1.76  #Partial instantiations: 0
% 2.82/1.76  #Strategies tried      : 1
% 2.82/1.76  
% 2.82/1.76  Timing (in seconds)
% 2.82/1.76  ----------------------
% 2.82/1.77  Preprocessing        : 0.44
% 2.82/1.77  Parsing              : 0.25
% 2.82/1.77  CNF conversion       : 0.02
% 2.82/1.77  Main loop            : 0.28
% 2.82/1.77  Inferencing          : 0.11
% 2.82/1.77  Reduction            : 0.07
% 2.82/1.77  Demodulation         : 0.06
% 2.82/1.77  BG Simplification    : 0.01
% 2.82/1.77  Subsumption          : 0.06
% 2.82/1.77  Abstraction          : 0.01
% 2.82/1.77  MUC search           : 0.00
% 2.82/1.77  Cooper               : 0.00
% 2.82/1.77  Total                : 0.78
% 2.82/1.77  Index Insertion      : 0.00
% 2.82/1.77  Index Deletion       : 0.00
% 2.82/1.77  Index Matching       : 0.00
% 2.82/1.77  BG Taut test         : 0.00
%------------------------------------------------------------------------------