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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV243-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 : n001.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.25s 1.58s
% Output   : CNFRefutation 2.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   15 (   9 unt;   6 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 :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    5 (   3   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   10 (;  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_union > #nlpp > c_Message_Osynth > c_Message_Oanalz > v_H > tc_Message_Omsg > c_emptyset

%Foreground sorts:

%Background operators:

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

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

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

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_31,axiom,
    ! [V_y,T_a] : ( c_union(V_y,c_emptyset,T_a) = V_y ),
    file(unknown,unknown) ).

tff(f_29,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_27,axiom,
    c_Message_Oanalz(c_Message_Osynth(v_H)) != c_union(c_Message_Oanalz(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),
    file(unknown,unknown) ).

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

tff(c_16,plain,
    ! [V_G_7,V_H_8] : ( c_union(c_Message_Oanalz(c_union(V_G_7,V_H_8,tc_Message_Omsg)),c_Message_Osynth(V_G_7),tc_Message_Omsg) = c_Message_Oanalz(c_union(c_Message_Osynth(V_G_7),V_H_8,tc_Message_Omsg)) ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_32,plain,
    ! [V_y_3] : ( c_union(c_Message_Oanalz(V_y_3),c_Message_Osynth(V_y_3),tc_Message_Omsg) = c_Message_Oanalz(c_union(c_Message_Osynth(V_y_3),c_emptyset,tc_Message_Omsg)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_16]) ).

tff(c_35,plain,
    ! [V_y_3] : ( c_union(c_Message_Oanalz(V_y_3),c_Message_Osynth(V_y_3),tc_Message_Omsg) = c_Message_Oanalz(c_Message_Osynth(V_y_3)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_32]) ).

tff(c_2,plain,
    c_union(c_Message_Oanalz(v_H),c_Message_Osynth(v_H),tc_Message_Omsg) != c_Message_Oanalz(c_Message_Osynth(v_H)),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SWV243-2 : TPTP v8.1.2. Released v3.2.0.
% 0.15/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 : n001.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.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 23:10:11 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 2.25/1.58  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.25/1.58  
% 2.25/1.58  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.25/1.60  
% 2.25/1.60  Inference rules
% 2.25/1.60  ----------------------
% 2.25/1.60  #Ref     : 0
% 2.25/1.60  #Sup     : 7
% 2.25/1.60  #Fact    : 0
% 2.25/1.60  #Define  : 0
% 2.25/1.60  #Split   : 0
% 2.25/1.60  #Chain   : 0
% 2.25/1.60  #Close   : 0
% 2.25/1.60  
% 2.25/1.60  Ordering : KBO
% 2.25/1.60  
% 2.25/1.60  Simplification rules
% 2.25/1.60  ----------------------
% 2.25/1.60  #Subsume      : 0
% 2.25/1.60  #Demod        : 2
% 2.25/1.60  #Tautology    : 4
% 2.25/1.60  #SimpNegUnit  : 0
% 2.25/1.60  #BackRed      : 1
% 2.25/1.60  
% 2.25/1.60  #Partial instantiations: 0
% 2.25/1.60  #Strategies tried      : 1
% 2.25/1.60  
% 2.25/1.60  Timing (in seconds)
% 2.25/1.60  ----------------------
% 2.25/1.61  Preprocessing        : 0.38
% 2.25/1.61  Parsing              : 0.21
% 2.25/1.61  CNF conversion       : 0.02
% 2.25/1.61  Main loop            : 0.15
% 2.25/1.61  Inferencing          : 0.08
% 2.25/1.61  Reduction            : 0.03
% 2.25/1.61  Demodulation         : 0.03
% 2.25/1.61  BG Simplification    : 0.01
% 2.25/1.61  Subsumption          : 0.03
% 2.25/1.61  Abstraction          : 0.01
% 2.25/1.61  MUC search           : 0.00
% 2.25/1.61  Cooper               : 0.00
% 2.25/1.61  Total                : 0.58
% 2.25/1.61  Index Insertion      : 0.00
% 2.25/1.61  Index Deletion       : 0.00
% 2.25/1.61  Index Matching       : 0.00
% 2.25/1.61  BG Taut test         : 0.00
%------------------------------------------------------------------------------