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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ANA013-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 : 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:47 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ c_lessequals > class_Ring__and__Field_Oordered__idom > class_Orderings_Oorder > c_times > c_HOL_Oabs > #nlpp > v_x > v_f > v_c > t_b

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

tff(f_34,axiom,
    ! [T_a,V_x] :
      ( ~ class_Orderings_Oorder(T_a)
      | c_lessequals(V_x,V_x,T_a) ),
    file(unknown,unknown) ).

tff(f_28,axiom,
    ! [V_U] : ~ c_lessequals(c_times(c_HOL_Oabs(v_c,t_b),c_HOL_Oabs(v_f(v_x(V_U)),t_b),t_b),c_times(V_U,c_HOL_Oabs(v_f(v_x(V_U)),t_b),t_b),t_b),
    file(unknown,unknown) ).

tff(c_4,plain,
    class_Ring__and__Field_Oordered__idom(t_b),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_9,plain,
    ! [T_5] :
      ( class_Orderings_Oorder(T_5)
      | ~ class_Ring__and__Field_Oordered__idom(T_5) ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_13,plain,
    class_Orderings_Oorder(t_b),
    inference(resolution,[status(thm)],[c_4,c_9]) ).

tff(c_6,plain,
    ! [V_x_3,T_a_2] :
      ( c_lessequals(V_x_3,V_x_3,T_a_2)
      | ~ class_Orderings_Oorder(T_a_2) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_15,plain,
    ! [V_U_8] : ~ c_lessequals(c_times(c_HOL_Oabs(v_c,t_b),c_HOL_Oabs(v_f(v_x(V_U_8)),t_b),t_b),c_times(V_U_8,c_HOL_Oabs(v_f(v_x(V_U_8)),t_b),t_b),t_b),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_19,plain,
    ~ class_Orderings_Oorder(t_b),
    inference(resolution,[status(thm)],[c_6,c_15]) ).

tff(c_23,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_13,c_19]) ).

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