TSTP Solution File: SEU306+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU306+1 : TPTP v8.1.2. Released v3.3.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 : n011.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:58:21 EDT 2023

% Result   : Theorem 3.76s 1.90s
% Output   : CNFRefutation 3.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   27
% Syntax   : Number of formulae    :   32 (   4 unt;  25 typ;   0 def)
%            Number of atoms       :   10 (   5 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   3   ~;   1   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   24 (  21   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :   17 (  15 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-1 aty)
%            Number of variables   :    3 (;   3   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ subset > in > element > v5_membered > v4_membered > v3_membered > v2_membered > v1_xreal_0 > v1_xcmplx_0 > v1_rat_1 > v1_membered > v1_int_1 > one_sorted_str > natural > empty > #nlpp > the_carrier > powerset > cast_as_carrier_subset > empty_set > #skF_2 > #skF_4 > #skF_5 > #skF_6 > #skF_1 > #skF_3

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_2',type,
    '#skF_2': $i > $i ).

tff('#skF_4',type,
    '#skF_4': $i > $i ).

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

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

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

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

tff('#skF_5',type,
    '#skF_5': $i ).

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

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

tff('#skF_6',type,
    '#skF_6': $i ).

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

tff('#skF_1',type,
    '#skF_1': $i ).

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

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

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

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

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

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

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

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

tff('#skF_3',type,
    '#skF_3': $i > $i ).

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

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

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

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

tff(f_275,negated_conjecture,
    ~ ! [A] :
        ( one_sorted_str(A)
       => ( cast_as_carrier_subset(A) = the_carrier(A) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_pre_topc) ).

tff(f_270,axiom,
    ! [A] :
      ( one_sorted_str(A)
     => ( cast_as_carrier_subset(A) = the_carrier(A) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).

tff(c_154,plain,
    the_carrier('#skF_6') != cast_as_carrier_subset('#skF_6'),
    inference(cnfTransformation,[status(thm)],[f_275]) ).

tff(c_156,plain,
    one_sorted_str('#skF_6'),
    inference(cnfTransformation,[status(thm)],[f_275]) ).

tff(c_251,plain,
    ! [A_89] :
      ( ( the_carrier(A_89) = cast_as_carrier_subset(A_89) )
      | ~ one_sorted_str(A_89) ),
    inference(cnfTransformation,[status(thm)],[f_270]) ).

tff(c_257,plain,
    the_carrier('#skF_6') = cast_as_carrier_subset('#skF_6'),
    inference(resolution,[status(thm)],[c_156,c_251]) ).

tff(c_262,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_154,c_257]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SEU306+1 : TPTP v8.1.2. Released v3.3.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.15/0.36  % Computer : n011.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 12:07:21 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 3.76/1.90  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.76/1.90  
% 3.76/1.90  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.76/1.92  
% 3.76/1.92  Inference rules
% 3.76/1.92  ----------------------
% 3.76/1.92  #Ref     : 0
% 3.76/1.92  #Sup     : 18
% 3.76/1.92  #Fact    : 0
% 3.76/1.92  #Define  : 0
% 3.76/1.92  #Split   : 0
% 3.76/1.92  #Chain   : 0
% 3.76/1.92  #Close   : 0
% 3.76/1.92  
% 3.76/1.92  Ordering : KBO
% 3.76/1.92  
% 3.76/1.92  Simplification rules
% 3.76/1.92  ----------------------
% 3.76/1.92  #Subsume      : 4
% 3.76/1.92  #Demod        : 11
% 3.76/1.92  #Tautology    : 17
% 3.76/1.92  #SimpNegUnit  : 1
% 3.76/1.92  #BackRed      : 1
% 3.76/1.92  
% 3.76/1.92  #Partial instantiations: 0
% 3.76/1.92  #Strategies tried      : 1
% 3.76/1.92  
% 3.76/1.92  Timing (in seconds)
% 3.76/1.92  ----------------------
% 3.76/1.93  Preprocessing        : 0.58
% 3.76/1.93  Parsing              : 0.30
% 3.76/1.93  CNF conversion       : 0.05
% 3.76/1.93  Main loop            : 0.28
% 3.76/1.93  Inferencing          : 0.09
% 3.76/1.93  Reduction            : 0.10
% 3.76/1.93  Demodulation         : 0.07
% 3.76/1.93  BG Simplification    : 0.03
% 3.76/1.93  Subsumption          : 0.05
% 3.76/1.93  Abstraction          : 0.01
% 3.76/1.93  MUC search           : 0.00
% 3.76/1.93  Cooper               : 0.00
% 3.76/1.93  Total                : 0.90
% 3.76/1.93  Index Insertion      : 0.00
% 3.76/1.93  Index Deletion       : 0.00
% 3.76/1.93  Index Matching       : 0.00
% 3.76/1.93  BG Taut test         : 0.00
%------------------------------------------------------------------------------