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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SET824-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 : n027.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:57:05 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ c_in > c_uminus > #nlpp > tc_set > v_a > tc_IntDef_Oint

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(f_33,axiom,
    ! [V_U] : c_in(v_a,V_U,tc_IntDef_Oint),
    file(unknown,unknown) ).

tff(f_31,axiom,
    ! [V_c,V_A,T_a] :
      ( ~ c_in(V_c,V_A,T_a)
      | ~ c_in(V_c,c_uminus(V_A,tc_set(T_a)),T_a) ),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [V_U_4] : c_in(v_a,V_U_4,tc_IntDef_Oint),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_6,plain,
    ! [V_c_6,V_A_7,T_a_8] :
      ( ~ c_in(V_c_6,c_uminus(V_A_7,tc_set(T_a_8)),T_a_8)
      | ~ c_in(V_c_6,V_A_7,T_a_8) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_10,plain,
    ! [V_A_7] : ~ c_in(v_a,V_A_7,tc_IntDef_Oint),
    inference(resolution,[status(thm)],[c_4,c_6]) ).

tff(c_14,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET824-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % 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.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu Aug  3 16:37:24 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.03/1.53  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.03/1.53  
% 2.03/1.53  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.24/1.57  
% 2.24/1.57  Inference rules
% 2.24/1.57  ----------------------
% 2.24/1.57  #Ref     : 0
% 2.24/1.57  #Sup     : 1
% 2.24/1.57  #Fact    : 0
% 2.24/1.57  #Define  : 0
% 2.24/1.57  #Split   : 0
% 2.24/1.57  #Chain   : 0
% 2.24/1.57  #Close   : 0
% 2.24/1.57  
% 2.24/1.57  Ordering : KBO
% 2.24/1.57  
% 2.24/1.57  Simplification rules
% 2.24/1.57  ----------------------
% 2.24/1.57  #Subsume      : 0
% 2.24/1.57  #Demod        : 1
% 2.24/1.57  #Tautology    : 0
% 2.24/1.57  #SimpNegUnit  : 0
% 2.24/1.57  #BackRed      : 0
% 2.24/1.57  
% 2.24/1.57  #Partial instantiations: 0
% 2.24/1.57  #Strategies tried      : 1
% 2.24/1.57  
% 2.24/1.57  Timing (in seconds)
% 2.24/1.57  ----------------------
% 2.24/1.57  Preprocessing        : 0.38
% 2.24/1.57  Parsing              : 0.21
% 2.24/1.57  CNF conversion       : 0.02
% 2.24/1.57  Main loop            : 0.12
% 2.24/1.57  Inferencing          : 0.06
% 2.24/1.57  Reduction            : 0.02
% 2.24/1.57  Demodulation         : 0.02
% 2.24/1.57  BG Simplification    : 0.01
% 2.24/1.57  Subsumption          : 0.02
% 2.24/1.57  Abstraction          : 0.00
% 2.24/1.57  MUC search           : 0.00
% 2.24/1.57  Cooper               : 0.00
% 2.24/1.57  Total                : 0.56
% 2.24/1.57  Index Insertion      : 0.00
% 2.24/1.57  Index Deletion       : 0.00
% 2.24/1.57  Index Matching       : 0.00
% 2.24/1.57  BG Taut test         : 0.00
%------------------------------------------------------------------------------