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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LAT300+1 : TPTP v8.1.2. Released v3.4.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 : n018.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:42 EDT 2023

% Result   : Theorem 8.50s 2.94s
% Output   : CNFRefutation 8.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   46
% Syntax   : Number of formulae    :   72 (   9 unt;  40 typ;   0 def)
%            Number of atoms       :  109 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  131 (  54   ~;  60   |;   9   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   38 (  30   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :   21 (  20 usr;   1 prp; 0-3 aty)
%            Number of functors    :   20 (  20 usr;  10 con; 0-2 aty)
%            Number of variables   :   43 (;  41   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ m1_struct_0 > r2_hidden > r1_tarski > m2_lattice4 > m2_filter_2 > m1_subset_1 > v9_lattices > v8_lattices > v7_lattices > v6_lattices > v5_lattices > v4_lattices > v3_struct_0 > v1_xboole_0 > v1_funct_1 > v10_lattices > l3_lattices > l2_lattices > l1_struct_0 > l1_lattices > #nlpp > u1_struct_0 > k1_zfmisc_1 > k1_xboole_0 > #skF_9 > #skF_15 > #skF_8 > #skF_16 > #skF_5 > #skF_10 > #skF_6 > #skF_13 > #skF_2 > #skF_3 > #skF_1 > #skF_4 > #skF_17 > #skF_11 > #skF_14 > #skF_12 > #skF_7

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_45,negated_conjecture,
    ~ ! [A] :
        ( ( ~ v3_struct_0(A)
          & v10_lattices(A)
          & l3_lattices(A) )
       => ! [B] :
            ( m2_filter_2(B,A)
           => ? [C] :
                ( m1_subset_1(C,u1_struct_0(A))
                & r2_hidden(C,B) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_filter_2) ).

tff(f_143,axiom,
    ! [A] :
      ( ( ~ v3_struct_0(A)
        & v10_lattices(A)
        & l3_lattices(A) )
     => ! [B] :
          ( m2_filter_2(B,A)
         => ( ~ v1_xboole_0(B)
            & m2_lattice4(B,A) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m2_filter_2) ).

tff(f_179,axiom,
    ! [A] :
    ? [B] : m1_subset_1(B,A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).

tff(f_286,axiom,
    ! [A,B] :
      ( m1_subset_1(A,B)
     => ( v1_xboole_0(B)
        | r2_hidden(A,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).

tff(f_155,axiom,
    ! [A] :
      ( ( ~ v3_struct_0(A)
        & v10_lattices(A)
        & l3_lattices(A) )
     => ! [B] :
          ( m2_lattice4(B,A)
         => m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m2_lattice4) ).

tff(f_296,axiom,
    ! [A,B,C] :
      ( ( r2_hidden(A,B)
        & m1_subset_1(B,k1_zfmisc_1(C)) )
     => m1_subset_1(A,C) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).

tff(c_10,plain,
    ~ v3_struct_0('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_8,plain,
    v10_lattices('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_6,plain,
    l3_lattices('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_4,plain,
    m2_filter_2('#skF_2','#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_399,plain,
    ! [B_139,A_140] :
      ( ~ v1_xboole_0(B_139)
      | ~ m2_filter_2(B_139,A_140)
      | ~ l3_lattices(A_140)
      | ~ v10_lattices(A_140)
      | v3_struct_0(A_140) ),
    inference(cnfTransformation,[status(thm)],[f_143]) ).

tff(c_405,plain,
    ( ~ v1_xboole_0('#skF_2')
    | ~ l3_lattices('#skF_1')
    | ~ v10_lattices('#skF_1')
    | v3_struct_0('#skF_1') ),
    inference(resolution,[status(thm)],[c_4,c_399]) ).

tff(c_409,plain,
    ( ~ v1_xboole_0('#skF_2')
    | v3_struct_0('#skF_1') ),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_6,c_405]) ).

tff(c_410,plain,
    ~ v1_xboole_0('#skF_2'),
    inference(negUnitSimplification,[status(thm)],[c_10,c_409]) ).

tff(c_70,plain,
    ! [A_27] : m1_subset_1('#skF_8'(A_27),A_27),
    inference(cnfTransformation,[status(thm)],[f_179]) ).

tff(c_114,plain,
    ! [A_51,B_52] :
      ( r2_hidden(A_51,B_52)
      | v1_xboole_0(B_52)
      | ~ m1_subset_1(A_51,B_52) ),
    inference(cnfTransformation,[status(thm)],[f_286]) ).

tff(c_52,plain,
    ! [B_20,A_18] :
      ( m2_lattice4(B_20,A_18)
      | ~ m2_filter_2(B_20,A_18)
      | ~ l3_lattices(A_18)
      | ~ v10_lattices(A_18)
      | v3_struct_0(A_18) ),
    inference(cnfTransformation,[status(thm)],[f_143]) ).

tff(c_455,plain,
    ! [B_155,A_156] :
      ( m1_subset_1(B_155,k1_zfmisc_1(u1_struct_0(A_156)))
      | ~ m2_lattice4(B_155,A_156)
      | ~ l3_lattices(A_156)
      | ~ v10_lattices(A_156)
      | v3_struct_0(A_156) ),
    inference(cnfTransformation,[status(thm)],[f_155]) ).

tff(c_120,plain,
    ! [A_55,C_57,B_56] :
      ( m1_subset_1(A_55,C_57)
      | ~ m1_subset_1(B_56,k1_zfmisc_1(C_57))
      | ~ r2_hidden(A_55,B_56) ),
    inference(cnfTransformation,[status(thm)],[f_296]) ).

tff(c_1030,plain,
    ! [A_213,A_214,B_215] :
      ( m1_subset_1(A_213,u1_struct_0(A_214))
      | ~ r2_hidden(A_213,B_215)
      | ~ m2_lattice4(B_215,A_214)
      | ~ l3_lattices(A_214)
      | ~ v10_lattices(A_214)
      | v3_struct_0(A_214) ),
    inference(resolution,[status(thm)],[c_455,c_120]) ).

tff(c_2347,plain,
    ! [A_280,A_281,B_282] :
      ( m1_subset_1(A_280,u1_struct_0(A_281))
      | ~ m2_lattice4(B_282,A_281)
      | ~ l3_lattices(A_281)
      | ~ v10_lattices(A_281)
      | v3_struct_0(A_281)
      | v1_xboole_0(B_282)
      | ~ m1_subset_1(A_280,B_282) ),
    inference(resolution,[status(thm)],[c_114,c_1030]) ).

tff(c_3598,plain,
    ! [A_318,A_319,B_320] :
      ( m1_subset_1(A_318,u1_struct_0(A_319))
      | v1_xboole_0(B_320)
      | ~ m1_subset_1(A_318,B_320)
      | ~ m2_filter_2(B_320,A_319)
      | ~ l3_lattices(A_319)
      | ~ v10_lattices(A_319)
      | v3_struct_0(A_319) ),
    inference(resolution,[status(thm)],[c_52,c_2347]) ).

tff(c_3732,plain,
    ! [A_323,A_324] :
      ( m1_subset_1('#skF_8'(A_323),u1_struct_0(A_324))
      | v1_xboole_0(A_323)
      | ~ m2_filter_2(A_323,A_324)
      | ~ l3_lattices(A_324)
      | ~ v10_lattices(A_324)
      | v3_struct_0(A_324) ),
    inference(resolution,[status(thm)],[c_70,c_3598]) ).

tff(c_2,plain,
    ! [C_5] :
      ( ~ r2_hidden(C_5,'#skF_2')
      | ~ m1_subset_1(C_5,u1_struct_0('#skF_1')) ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_3740,plain,
    ! [A_323] :
      ( ~ r2_hidden('#skF_8'(A_323),'#skF_2')
      | v1_xboole_0(A_323)
      | ~ m2_filter_2(A_323,'#skF_1')
      | ~ l3_lattices('#skF_1')
      | ~ v10_lattices('#skF_1')
      | v3_struct_0('#skF_1') ),
    inference(resolution,[status(thm)],[c_3732,c_2]) ).

tff(c_3772,plain,
    ! [A_323] :
      ( ~ r2_hidden('#skF_8'(A_323),'#skF_2')
      | v1_xboole_0(A_323)
      | ~ m2_filter_2(A_323,'#skF_1')
      | v3_struct_0('#skF_1') ),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_6,c_3740]) ).

tff(c_3779,plain,
    ! [A_325] :
      ( ~ r2_hidden('#skF_8'(A_325),'#skF_2')
      | v1_xboole_0(A_325)
      | ~ m2_filter_2(A_325,'#skF_1') ),
    inference(negUnitSimplification,[status(thm)],[c_10,c_3772]) ).

tff(c_3809,plain,
    ! [A_325] :
      ( v1_xboole_0(A_325)
      | ~ m2_filter_2(A_325,'#skF_1')
      | v1_xboole_0('#skF_2')
      | ~ m1_subset_1('#skF_8'(A_325),'#skF_2') ),
    inference(resolution,[status(thm)],[c_114,c_3779]) ).

tff(c_3840,plain,
    ! [A_327] :
      ( v1_xboole_0(A_327)
      | ~ m2_filter_2(A_327,'#skF_1')
      | ~ m1_subset_1('#skF_8'(A_327),'#skF_2') ),
    inference(negUnitSimplification,[status(thm)],[c_410,c_3809]) ).

tff(c_3891,plain,
    ( v1_xboole_0('#skF_2')
    | ~ m2_filter_2('#skF_2','#skF_1') ),
    inference(resolution,[status(thm)],[c_70,c_3840]) ).

tff(c_3910,plain,
    v1_xboole_0('#skF_2'),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_3891]) ).

tff(c_3912,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_410,c_3910]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : LAT300+1 : TPTP v8.1.2. Released v3.4.0.
% 0.08/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.14/0.36  % Computer : n018.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 12:43:35 EDT 2023
% 0.21/0.36  % CPUTime  : 
% 8.50/2.94  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.50/2.94  
% 8.50/2.94  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.50/2.97  
% 8.50/2.97  Inference rules
% 8.50/2.97  ----------------------
% 8.50/2.97  #Ref     : 0
% 8.50/2.97  #Sup     : 881
% 8.50/2.97  #Fact    : 0
% 8.50/2.97  #Define  : 0
% 8.50/2.97  #Split   : 41
% 8.50/2.97  #Chain   : 0
% 8.50/2.97  #Close   : 0
% 8.50/2.97  
% 8.50/2.97  Ordering : KBO
% 8.50/2.97  
% 8.50/2.97  Simplification rules
% 8.50/2.97  ----------------------
% 8.50/2.97  #Subsume      : 423
% 8.50/2.97  #Demod        : 142
% 8.50/2.97  #Tautology    : 82
% 8.50/2.97  #SimpNegUnit  : 198
% 8.50/2.97  #BackRed      : 8
% 8.50/2.97  
% 8.50/2.97  #Partial instantiations: 0
% 8.50/2.97  #Strategies tried      : 1
% 8.50/2.97  
% 8.50/2.97  Timing (in seconds)
% 8.50/2.97  ----------------------
% 8.50/2.98  Preprocessing        : 0.58
% 8.50/2.98  Parsing              : 0.32
% 8.50/2.98  CNF conversion       : 0.05
% 8.50/2.98  Main loop            : 1.32
% 8.50/2.98  Inferencing          : 0.49
% 8.50/2.98  Reduction            : 0.38
% 8.50/2.98  Demodulation         : 0.24
% 8.50/2.98  BG Simplification    : 0.04
% 8.50/2.98  Subsumption          : 0.31
% 8.50/2.98  Abstraction          : 0.04
% 8.50/2.98  MUC search           : 0.00
% 8.81/2.98  Cooper               : 0.00
% 8.81/2.98  Total                : 1.95
% 8.81/2.98  Index Insertion      : 0.00
% 8.81/2.98  Index Deletion       : 0.00
% 8.81/2.98  Index Matching       : 0.00
% 8.81/2.98  BG Taut test         : 0.00
%------------------------------------------------------------------------------