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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ANA044-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/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 10:32:53 EDT 2023

% Result   : Unsatisfiable 2.82s 1.75s
% Output   : CNFRefutation 2.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   35 (  12 unt;  13 typ;   0 def)
%            Number of atoms       :   43 (   5 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   47 (  26   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (   9   >;   7   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-3 aty)
%            Number of variables   :   23 (;  23   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_lessequals > class_Ring__and__Field_Opordered__cancel__semiring > class_Ring__and__Field_Oordered__idom > class_OrderedGroup_Olordered__ab__group__abs > c_times > v_l > v_k > c_HOL_Oabs > #nlpp > v_h > v_xa > v_x > t_b > c_0

%Foreground sorts:

%Background operators:

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

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

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

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

tff(class_OrderedGroup_Olordered__ab__group__abs,type,
    class_OrderedGroup_Olordered__ab__group__abs: $i > $o ).

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

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

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

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

tff(class_Ring__and__Field_Oordered__idom,type,
    class_Ring__and__Field_Oordered__idom: $i > $o ).

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

tff(class_Ring__and__Field_Opordered__cancel__semiring,type,
    class_Ring__and__Field_Opordered__cancel__semiring: $i > $o ).

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

tff(f_32,axiom,
    class_Ring__and__Field_Oordered__idom(t_b),
    file(unknown,unknown) ).

tff(f_56,axiom,
    ! [T] :
      ( ~ class_Ring__and__Field_Oordered__idom(T)
      | class_Ring__and__Field_Opordered__cancel__semiring(T) ),
    file(unknown,unknown) ).

tff(f_29,axiom,
    ! [V_U] : c_lessequals(c_0,v_h(V_U),t_b),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ! [V_U,V_V] : c_lessequals(c_0,v_l(V_U,V_V),t_b),
    file(unknown,unknown) ).

tff(f_61,axiom,
    ! [T] :
      ( ~ class_Ring__and__Field_Oordered__idom(T)
      | class_OrderedGroup_Olordered__ab__group__abs(T) ),
    file(unknown,unknown) ).

tff(f_51,axiom,
    ! [T_a,V_b,V_a] :
      ( ~ class_Ring__and__Field_Opordered__cancel__semiring(T_a)
      | ~ c_lessequals(c_0,V_b,T_a)
      | ~ c_lessequals(c_0,V_a,T_a)
      | c_lessequals(c_0,c_times(V_a,V_b,T_a),T_a) ),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ! [T_a,V_y] :
      ( ~ class_OrderedGroup_Olordered__ab__group__abs(T_a)
      | ~ c_lessequals(c_0,V_y,T_a)
      | ( c_HOL_Oabs(V_y,T_a) = V_y ) ),
    file(unknown,unknown) ).

tff(f_31,axiom,
    c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b) != c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b),
    file(unknown,unknown) ).

tff(c_8,plain,
    class_Ring__and__Field_Oordered__idom(t_b),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_14,plain,
    ! [T_9] :
      ( class_Ring__and__Field_Opordered__cancel__semiring(T_9)
      | ~ class_Ring__and__Field_Oordered__idom(T_9) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_4,plain,
    ! [V_U_3] : c_lessequals(c_0,v_h(V_U_3),t_b),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_2,plain,
    ! [V_U_1,V_V_2] : c_lessequals(c_0,v_l(V_U_1,V_V_2),t_b),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_17,plain,
    ! [T_11] :
      ( class_OrderedGroup_Olordered__ab__group__abs(T_11)
      | ~ class_Ring__and__Field_Oordered__idom(T_11) ),
    inference(cnfTransformation,[status(thm)],[f_61]) ).

tff(c_21,plain,
    class_OrderedGroup_Olordered__ab__group__abs(t_b),
    inference(resolution,[status(thm)],[c_8,c_17]) ).

tff(c_56,plain,
    ! [V_a_21,V_b_22,T_a_23] :
      ( c_lessequals(c_0,c_times(V_a_21,V_b_22,T_a_23),T_a_23)
      | ~ c_lessequals(c_0,V_a_21,T_a_23)
      | ~ c_lessequals(c_0,V_b_22,T_a_23)
      | ~ class_Ring__and__Field_Opordered__cancel__semiring(T_a_23) ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_10,plain,
    ! [V_y_5,T_a_4] :
      ( ( c_HOL_Oabs(V_y_5,T_a_4) = V_y_5 )
      | ~ c_lessequals(c_0,V_y_5,T_a_4)
      | ~ class_OrderedGroup_Olordered__ab__group__abs(T_a_4) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_61,plain,
    ! [V_a_24,V_b_25,T_a_26] :
      ( ( c_HOL_Oabs(c_times(V_a_24,V_b_25,T_a_26),T_a_26) = c_times(V_a_24,V_b_25,T_a_26) )
      | ~ class_OrderedGroup_Olordered__ab__group__abs(T_a_26)
      | ~ c_lessequals(c_0,V_a_24,T_a_26)
      | ~ c_lessequals(c_0,V_b_25,T_a_26)
      | ~ class_Ring__and__Field_Opordered__cancel__semiring(T_a_26) ),
    inference(resolution,[status(thm)],[c_56,c_10]) ).

tff(c_6,plain,
    c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b) != c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_67,plain,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
    | ~ c_lessequals(c_0,v_l(v_x,v_xa),t_b)
    | ~ c_lessequals(c_0,v_h(v_k(v_x,v_xa)),t_b)
    | ~ class_Ring__and__Field_Opordered__cancel__semiring(t_b) ),
    inference(superposition,[status(thm),theory(equality)],[c_61,c_6]) ).

tff(c_74,plain,
    ~ class_Ring__and__Field_Opordered__cancel__semiring(t_b),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_2,c_21,c_67]) ).

tff(c_78,plain,
    ~ class_Ring__and__Field_Oordered__idom(t_b),
    inference(resolution,[status(thm)],[c_14,c_74]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : ANA044-2 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.15  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/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.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 15:16:53 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 2.82/1.75  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.82/1.75  
% 2.82/1.75  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.94/1.78  
% 2.94/1.78  Inference rules
% 2.94/1.78  ----------------------
% 2.94/1.78  #Ref     : 0
% 2.94/1.78  #Sup     : 12
% 2.94/1.78  #Fact    : 0
% 2.94/1.78  #Define  : 0
% 2.94/1.78  #Split   : 0
% 2.94/1.78  #Chain   : 0
% 2.94/1.78  #Close   : 0
% 2.94/1.78  
% 2.94/1.78  Ordering : KBO
% 2.94/1.78  
% 2.94/1.78  Simplification rules
% 2.94/1.78  ----------------------
% 2.94/1.78  #Subsume      : 0
% 2.94/1.78  #Demod        : 6
% 2.94/1.78  #Tautology    : 6
% 2.94/1.78  #SimpNegUnit  : 0
% 2.94/1.78  #BackRed      : 0
% 2.94/1.78  
% 2.94/1.78  #Partial instantiations: 0
% 2.94/1.78  #Strategies tried      : 1
% 2.94/1.78  
% 2.94/1.78  Timing (in seconds)
% 2.94/1.78  ----------------------
% 2.94/1.79  Preprocessing        : 0.43
% 2.94/1.79  Parsing              : 0.24
% 2.94/1.79  CNF conversion       : 0.02
% 2.94/1.79  Main loop            : 0.19
% 2.94/1.79  Inferencing          : 0.09
% 2.94/1.79  Reduction            : 0.05
% 2.94/1.79  Demodulation         : 0.04
% 2.94/1.79  BG Simplification    : 0.01
% 2.94/1.79  Subsumption          : 0.03
% 2.94/1.79  Abstraction          : 0.01
% 2.94/1.79  MUC search           : 0.00
% 2.94/1.79  Cooper               : 0.00
% 2.94/1.79  Total                : 0.67
% 2.94/1.79  Index Insertion      : 0.00
% 2.94/1.79  Index Deletion       : 0.00
% 2.94/1.79  Index Matching       : 0.00
% 2.94/1.79  BG Taut test         : 0.00
%------------------------------------------------------------------------------