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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LAT280-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 : n026.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:46:37 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ c_in > c_Relation_Otrans > c_Tarski_Opotype_Oorder > tc_Tarski_Opotype_Opotype__ext__type > #nlpp > v_r > v_cl > tc_Product__Type_Ounit > t_a > c_Tarski_OPartialOrder

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_27,axiom,
    ~ c_Relation_Otrans(v_r,t_a),
    file(unknown,unknown) ).

tff(f_34,axiom,
    v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
    file(unknown,unknown) ).

tff(f_33,axiom,
    c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    file(unknown,unknown) ).

tff(f_32,axiom,
    ! [V_P,T_a] :
      ( ~ c_in(V_P,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(T_a,tc_Product__Type_Ounit))
      | c_Relation_Otrans(c_Tarski_Opotype_Oorder(V_P,T_a,tc_Product__Type_Ounit),T_a) ),
    file(unknown,unknown) ).

tff(c_2,plain,
    ~ c_Relation_Otrans(v_r,t_a),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_8,plain,
    c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit) = v_r,
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_6,plain,
    c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_13,plain,
    ! [V_P_3,T_a_4] :
      ( c_Relation_Otrans(c_Tarski_Opotype_Oorder(V_P_3,T_a_4,tc_Product__Type_Ounit),T_a_4)
      | ~ c_in(V_P_3,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(T_a_4,tc_Product__Type_Ounit)) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_15,plain,
    c_Relation_Otrans(c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),t_a),
    inference(resolution,[status(thm)],[c_6,c_13]) ).

tff(c_17,plain,
    c_Relation_Otrans(v_r,t_a),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_15]) ).

tff(c_19,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_2,c_17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LAT280-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.13/0.35  % Computer : n026.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 13:04:31 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.57/1.84  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.57/1.84  
% 2.57/1.84  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.57/1.87  
% 2.57/1.87  Inference rules
% 2.57/1.87  ----------------------
% 2.57/1.87  #Ref     : 0
% 2.57/1.87  #Sup     : 3
% 2.57/1.87  #Fact    : 0
% 2.57/1.87  #Define  : 0
% 2.57/1.87  #Split   : 0
% 2.57/1.87  #Chain   : 0
% 2.57/1.87  #Close   : 0
% 2.57/1.87  
% 2.57/1.87  Ordering : KBO
% 2.57/1.87  
% 2.57/1.87  Simplification rules
% 2.57/1.87  ----------------------
% 2.57/1.87  #Subsume      : 0
% 2.57/1.87  #Demod        : 1
% 2.57/1.87  #Tautology    : 2
% 2.57/1.87  #SimpNegUnit  : 1
% 2.57/1.87  #BackRed      : 0
% 2.57/1.87  
% 2.57/1.87  #Partial instantiations: 0
% 2.57/1.87  #Strategies tried      : 1
% 2.57/1.87  
% 2.57/1.87  Timing (in seconds)
% 2.57/1.87  ----------------------
% 2.57/1.87  Preprocessing        : 0.49
% 2.57/1.87  Parsing              : 0.29
% 2.57/1.87  CNF conversion       : 0.02
% 2.57/1.87  Main loop            : 0.12
% 2.57/1.87  Inferencing          : 0.06
% 2.57/1.87  Reduction            : 0.03
% 2.57/1.87  Demodulation         : 0.02
% 2.57/1.87  BG Simplification    : 0.01
% 2.57/1.87  Subsumption          : 0.02
% 2.57/1.87  Abstraction          : 0.00
% 2.57/1.87  MUC search           : 0.00
% 2.57/1.87  Cooper               : 0.00
% 2.57/1.87  Total                : 0.65
% 2.57/1.87  Index Insertion      : 0.00
% 2.57/1.87  Index Deletion       : 0.00
% 2.57/1.87  Index Matching       : 0.00
% 2.57/1.87  BG Taut test         : 0.00
%------------------------------------------------------------------------------