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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ANA024-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 : n010.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:49 EDT 2023

% Result   : Unsatisfiable 2.66s 1.73s
% Output   : CNFRefutation 2.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   30 (   9 unt;  11 typ;   0 def)
%            Number of atoms       :   34 (   2 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   33 (  18   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   15 (   9   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   24 (;  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_lessequals > class_Ring__and__Field_Oordered__idom > class_OrderedGroup_Opordered__ab__group__add > class_OrderedGroup_Oab__group__add > c_plus > c_minus > #nlpp > v_k > v_g > v_f > v_x > t_b

%Foreground sorts:

%Background operators:

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

tff(c_minus,type,
    c_minus: ( $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(c_plus,type,
    c_plus: ( $i * $i * $i ) > $i ).

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

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

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

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

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

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

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

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

tff(f_47,axiom,
    ! [T] :
      ( ~ class_OrderedGroup_Opordered__ab__group__add(T)
      | class_OrderedGroup_Oab__group__add(T) ),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ! [V_U] : c_lessequals(v_k(V_U),v_f(V_U),t_b),
    file(unknown,unknown) ).

tff(f_30,axiom,
    ! [T_a,V_a,V_b] :
      ( ~ class_OrderedGroup_Oab__group__add(T_a)
      | ( V_a = c_plus(c_minus(V_a,V_b,T_a),V_b,T_a) ) ),
    file(unknown,unknown) ).

tff(f_38,axiom,
    ! [T_a,V_a,V_b,V_c] :
      ( ~ class_OrderedGroup_Opordered__ab__group__add(T_a)
      | ~ c_lessequals(c_plus(V_a,V_b,T_a),V_c,T_a)
      | c_lessequals(V_a,c_minus(V_c,V_b,T_a),T_a) ),
    file(unknown,unknown) ).

tff(f_42,axiom,
    ~ c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    file(unknown,unknown) ).

tff(c_14,plain,
    class_Ring__and__Field_Oordered__idom(t_b),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_15,plain,
    ! [T_11] :
      ( class_OrderedGroup_Opordered__ab__group__add(T_11)
      | ~ class_Ring__and__Field_Oordered__idom(T_11) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_19,plain,
    class_OrderedGroup_Opordered__ab__group__add(t_b),
    inference(resolution,[status(thm)],[c_14,c_15]) ).

tff(c_20,plain,
    ! [T_12] :
      ( class_OrderedGroup_Oab__group__add(T_12)
      | ~ class_OrderedGroup_Opordered__ab__group__add(T_12) ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_24,plain,
    class_OrderedGroup_Oab__group__add(t_b),
    inference(resolution,[status(thm)],[c_19,c_20]) ).

tff(c_6,plain,
    ! [V_U_8] : c_lessequals(v_k(V_U_8),v_f(V_U_8),t_b),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_2,plain,
    ! [V_a_2,V_b_3,T_a_1] :
      ( ( c_plus(c_minus(V_a_2,V_b_3,T_a_1),V_b_3,T_a_1) = V_a_2 )
      | ~ class_OrderedGroup_Oab__group__add(T_a_1) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_35,plain,
    ! [V_a_17,V_c_18,V_b_19,T_a_20] :
      ( c_lessequals(V_a_17,c_minus(V_c_18,V_b_19,T_a_20),T_a_20)
      | ~ c_lessequals(c_plus(V_a_17,V_b_19,T_a_20),V_c_18,T_a_20)
      | ~ class_OrderedGroup_Opordered__ab__group__add(T_a_20) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_39,plain,
    ! [V_a_21,V_b_22,T_a_23,V_c_24] :
      ( c_lessequals(c_minus(V_a_21,V_b_22,T_a_23),c_minus(V_c_24,V_b_22,T_a_23),T_a_23)
      | ~ c_lessequals(V_a_21,V_c_24,T_a_23)
      | ~ class_OrderedGroup_Opordered__ab__group__add(T_a_23)
      | ~ class_OrderedGroup_Oab__group__add(T_a_23) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_35]) ).

tff(c_8,plain,
    ~ c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_42,plain,
    ( ~ c_lessequals(v_k(v_x),v_f(v_x),t_b)
    | ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
    | ~ class_OrderedGroup_Oab__group__add(t_b) ),
    inference(resolution,[status(thm)],[c_39,c_8]) ).

tff(c_46,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_19,c_6,c_42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : ANA024-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.15/0.35  % Computer : n010.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Aug  3 15:16:59 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 2.66/1.73  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.66/1.73  
% 2.66/1.73  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.86/1.76  
% 2.86/1.76  Inference rules
% 2.86/1.76  ----------------------
% 2.86/1.76  #Ref     : 0
% 2.86/1.76  #Sup     : 6
% 2.86/1.76  #Fact    : 0
% 2.86/1.76  #Define  : 0
% 2.86/1.76  #Split   : 0
% 2.86/1.76  #Chain   : 0
% 2.86/1.76  #Close   : 0
% 2.86/1.76  
% 2.86/1.76  Ordering : KBO
% 2.86/1.76  
% 2.86/1.76  Simplification rules
% 2.86/1.76  ----------------------
% 2.86/1.76  #Subsume      : 0
% 2.86/1.76  #Demod        : 3
% 2.86/1.76  #Tautology    : 2
% 2.86/1.76  #SimpNegUnit  : 0
% 2.86/1.76  #BackRed      : 0
% 2.86/1.76  
% 2.86/1.76  #Partial instantiations: 0
% 2.86/1.76  #Strategies tried      : 1
% 2.86/1.76  
% 2.86/1.76  Timing (in seconds)
% 2.86/1.76  ----------------------
% 2.86/1.77  Preprocessing        : 0.42
% 2.86/1.77  Parsing              : 0.24
% 2.86/1.77  CNF conversion       : 0.02
% 2.86/1.77  Main loop            : 0.17
% 2.86/1.77  Inferencing          : 0.08
% 2.86/1.77  Reduction            : 0.04
% 2.86/1.77  Demodulation         : 0.03
% 2.86/1.77  BG Simplification    : 0.01
% 2.86/1.77  Subsumption          : 0.03
% 2.86/1.77  Abstraction          : 0.01
% 2.86/1.77  MUC search           : 0.00
% 2.86/1.77  Cooper               : 0.00
% 2.86/1.77  Total                : 0.64
% 2.86/1.77  Index Insertion      : 0.00
% 2.86/1.77  Index Deletion       : 0.00
% 2.86/1.77  Index Matching       : 0.00
% 2.86/1.77  BG Taut test         : 0.00
%------------------------------------------------------------------------------