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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SET850-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 : n008.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 10:57:12 EDT 2023

% Result   : Unsatisfiable 2.61s 1.69s
% Output   : CNFRefutation 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   18 (   8 unt;   7 typ;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   12 (   7   ~;   5   |;   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  :    7 (   3   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-3 aty)
%            Number of variables   :   16 (;  16   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_lessequals > c_Zorn_Osucc > #nlpp > tc_set > v_y > v_x > v_S > t_a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

tff(f_35,axiom,
    ! [V_x,V_S,T_a] : c_lessequals(V_x,c_Zorn_Osucc(V_S,V_x,T_a),tc_set(tc_set(T_a))),
    file(unknown,unknown) ).

tff(f_36,axiom,
    c_lessequals(v_x,v_y,tc_set(tc_set(t_a))),
    file(unknown,unknown) ).

tff(f_33,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_38,axiom,
    ~ c_lessequals(v_x,c_Zorn_Osucc(v_S,v_y,t_a),tc_set(tc_set(t_a))),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [V_x_5,V_S_6,T_a_7] : c_lessequals(V_x_5,c_Zorn_Osucc(V_S_6,V_x_5,T_a_7),tc_set(tc_set(T_a_7))),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_6,plain,
    c_lessequals(v_x,v_y,tc_set(tc_set(t_a))),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_10,plain,
    ! [V_A_11,V_C_12,T_a_13,V_B_14] :
      ( c_lessequals(V_A_11,V_C_12,tc_set(T_a_13))
      | ~ c_lessequals(V_A_11,V_B_14,tc_set(T_a_13))
      | ~ c_lessequals(V_B_14,V_C_12,tc_set(T_a_13)) ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_17,plain,
    ! [V_C_15] :
      ( c_lessequals(v_x,V_C_15,tc_set(tc_set(t_a)))
      | ~ c_lessequals(v_y,V_C_15,tc_set(tc_set(t_a))) ),
    inference(resolution,[status(thm)],[c_6,c_10]) ).

tff(c_22,plain,
    ! [V_S_6] : c_lessequals(v_x,c_Zorn_Osucc(V_S_6,v_y,t_a),tc_set(tc_set(t_a))),
    inference(resolution,[status(thm)],[c_4,c_17]) ).

tff(c_8,plain,
    ~ c_lessequals(v_x,c_Zorn_Osucc(v_S,v_y,t_a),tc_set(tc_set(t_a))),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_31,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SET850-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/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 : n008.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 16:55:04 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 2.61/1.69  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.61/1.70  
% 2.61/1.70  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.72/1.72  
% 2.72/1.72  Inference rules
% 2.72/1.72  ----------------------
% 2.72/1.72  #Ref     : 0
% 2.72/1.72  #Sup     : 4
% 2.72/1.72  #Fact    : 0
% 2.72/1.72  #Define  : 0
% 2.72/1.72  #Split   : 0
% 2.72/1.72  #Chain   : 0
% 2.72/1.72  #Close   : 0
% 2.72/1.72  
% 2.72/1.72  Ordering : KBO
% 2.72/1.72  
% 2.72/1.72  Simplification rules
% 2.72/1.72  ----------------------
% 2.72/1.72  #Subsume      : 0
% 2.72/1.72  #Demod        : 1
% 2.72/1.72  #Tautology    : 0
% 2.72/1.72  #SimpNegUnit  : 0
% 2.72/1.72  #BackRed      : 1
% 2.72/1.72  
% 2.72/1.72  #Partial instantiations: 0
% 2.72/1.72  #Strategies tried      : 1
% 2.72/1.72  
% 2.72/1.72  Timing (in seconds)
% 2.72/1.72  ----------------------
% 2.72/1.72  Preprocessing        : 0.42
% 2.72/1.73  Parsing              : 0.23
% 2.72/1.73  CNF conversion       : 0.02
% 2.72/1.73  Main loop            : 0.16
% 2.72/1.73  Inferencing          : 0.07
% 2.72/1.73  Reduction            : 0.04
% 2.72/1.73  Demodulation         : 0.03
% 2.72/1.73  BG Simplification    : 0.01
% 2.72/1.73  Subsumption          : 0.03
% 2.72/1.73  Abstraction          : 0.01
% 2.72/1.73  MUC search           : 0.00
% 2.72/1.73  Cooper               : 0.00
% 2.72/1.73  Total                : 0.63
% 2.72/1.73  Index Insertion      : 0.00
% 2.72/1.73  Index Deletion       : 0.00
% 2.72/1.73  Index Matching       : 0.00
% 2.72/1.73  BG Taut test         : 0.00
%------------------------------------------------------------------------------