TSTP Solution File: LCL808-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL808-1 : TPTP v8.1.2. Released v4.1.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 : n019.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:49:04 EDT 2023

% Result   : Unsatisfiable 5.15s 2.22s
% Output   : CNFRefutation 5.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   35
% Syntax   : Number of formulae    :   43 (   9 unt;  30 typ;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   21 (  12   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   34 (  20   >;  14   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-3 aty)
%            Number of functors    :   19 (  19 usr;  10 con; 0-4 aty)
%            Number of variables   :    9 (;   9   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_Type_Otyping > c_HOL_Oord__class_Oless > c_Lambda_Obeta > class_Ring__and__Field_Osemiring__1 > class_Ring__and__Field_Oordered__semidom > class_Ring__and__Field_Oordered__idom > class_Orderings_Opreorder > class_Orderings_Oorder > class_Orderings_Olinorder > class_Nat_Osemiring__char__0 > c_InductTermi_OIT > c_Type_Oshift > c_Lambda_Osubst > c_Nat_Osemiring__1__class_Oof__nat > c_Lambda_Osko__Lambda__Xbeta__cases__2__1 > c_Lambda_Olift > c_Lambda_OdB_OApp > #nlpp > c_Lambda_OdB_OVar > c_Lambda_OdB_OAbs > c_HOL_Ozero__class_Ozero > v_ua______ > v_u____ > v_n____ > v_i____ > v_e____ > v_b____ > v_Ua____ > v_T____ > tc_nat > tc_Type_Otype

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_370,axiom,
    c_Type_Otyping(v_e____,v_u____,v_T____),
    file(unknown,unknown) ).

tff(f_369,axiom,
    c_InductTermi_OIT(v_u____),
    file(unknown,unknown) ).

tff(f_357,axiom,
    c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),v_b____,v_Ua____),
    file(unknown,unknown) ).

tff(f_368,axiom,
    ! [V_ua,V_ia,V_ea,V_T_H] :
      ( c_InductTermi_OIT(c_Lambda_Osubst(v_b____,V_ua,V_ia))
      | ~ c_Type_Otyping(V_ea,V_ua,v_T____)
      | ~ c_InductTermi_OIT(V_ua)
      | ~ c_Type_Otyping(c_Type_Oshift(V_ea,V_ia,v_T____,tc_Type_Otype),v_b____,V_T_H) ),
    file(unknown,unknown) ).

tff(f_372,axiom,
    ~ c_InductTermi_OIT(c_Lambda_Osubst(v_b____,v_u____,v_i____)),
    file(unknown,unknown) ).

tff(c_136,plain,
    c_Type_Otyping(v_e____,v_u____,v_T____),
    inference(cnfTransformation,[status(thm)],[f_370]) ).

tff(c_134,plain,
    c_InductTermi_OIT(v_u____),
    inference(cnfTransformation,[status(thm)],[f_369]) ).

tff(c_130,plain,
    c_Type_Otyping(c_Type_Oshift(v_e____,v_i____,v_T____,tc_Type_Otype),v_b____,v_Ua____),
    inference(cnfTransformation,[status(thm)],[f_357]) ).

tff(c_1697,plain,
    ! [V_ea_378,V_ia_379,V_T_H_380,V_ua_381] :
      ( ~ c_Type_Otyping(c_Type_Oshift(V_ea_378,V_ia_379,v_T____,tc_Type_Otype),v_b____,V_T_H_380)
      | ~ c_InductTermi_OIT(V_ua_381)
      | ~ c_Type_Otyping(V_ea_378,V_ua_381,v_T____)
      | c_InductTermi_OIT(c_Lambda_Osubst(v_b____,V_ua_381,V_ia_379)) ),
    inference(cnfTransformation,[status(thm)],[f_368]) ).

tff(c_1749,plain,
    ! [V_ua_408] :
      ( ~ c_InductTermi_OIT(V_ua_408)
      | ~ c_Type_Otyping(v_e____,V_ua_408,v_T____)
      | c_InductTermi_OIT(c_Lambda_Osubst(v_b____,V_ua_408,v_i____)) ),
    inference(resolution,[status(thm)],[c_130,c_1697]) ).

tff(c_138,plain,
    ~ c_InductTermi_OIT(c_Lambda_Osubst(v_b____,v_u____,v_i____)),
    inference(cnfTransformation,[status(thm)],[f_372]) ).

tff(c_1752,plain,
    ( ~ c_InductTermi_OIT(v_u____)
    | ~ c_Type_Otyping(v_e____,v_u____,v_T____) ),
    inference(resolution,[status(thm)],[c_1749,c_138]) ).

tff(c_1756,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_136,c_134,c_1752]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : LCL808-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/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.18/0.37  % Computer : n019.cluster.edu
% 0.18/0.37  % Model    : x86_64 x86_64
% 0.18/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.37  % Memory   : 8042.1875MB
% 0.18/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.37  % CPULimit : 300
% 0.18/0.37  % WCLimit  : 300
% 0.18/0.37  % DateTime : Thu Aug  3 13:29:31 EDT 2023
% 0.18/0.37  % CPUTime  : 
% 5.15/2.22  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.15/2.22  
% 5.15/2.22  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.15/2.25  
% 5.15/2.25  Inference rules
% 5.15/2.25  ----------------------
% 5.15/2.25  #Ref     : 6
% 5.15/2.25  #Sup     : 338
% 5.15/2.25  #Fact    : 6
% 5.15/2.25  #Define  : 0
% 5.15/2.25  #Split   : 0
% 5.15/2.25  #Chain   : 0
% 5.15/2.25  #Close   : 0
% 5.15/2.25  
% 5.15/2.25  Ordering : KBO
% 5.15/2.25  
% 5.15/2.25  Simplification rules
% 5.15/2.25  ----------------------
% 5.15/2.25  #Subsume      : 110
% 5.15/2.25  #Demod        : 109
% 5.15/2.25  #Tautology    : 98
% 5.15/2.25  #SimpNegUnit  : 24
% 5.15/2.25  #BackRed      : 0
% 5.15/2.25  
% 5.15/2.25  #Partial instantiations: 0
% 5.15/2.25  #Strategies tried      : 1
% 5.15/2.25  
% 5.15/2.25  Timing (in seconds)
% 5.15/2.25  ----------------------
% 5.15/2.25  Preprocessing        : 0.61
% 5.15/2.25  Parsing              : 0.32
% 5.15/2.25  CNF conversion       : 0.04
% 5.15/2.25  Main loop            : 0.62
% 5.15/2.25  Inferencing          : 0.24
% 5.15/2.25  Reduction            : 0.18
% 5.15/2.25  Demodulation         : 0.12
% 5.15/2.25  BG Simplification    : 0.04
% 5.15/2.25  Subsumption          : 0.12
% 5.15/2.25  Abstraction          : 0.03
% 5.15/2.25  MUC search           : 0.00
% 5.15/2.25  Cooper               : 0.00
% 5.15/2.25  Total                : 1.27
% 5.15/2.25  Index Insertion      : 0.00
% 5.15/2.26  Index Deletion       : 0.00
% 5.15/2.26  Index Matching       : 0.00
% 5.15/2.26  BG Taut test         : 0.00
%------------------------------------------------------------------------------