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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU407+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/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 : n029.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:39 EDT 2023

% Result   : Theorem 7.08s 2.55s
% Output   : CNFRefutation 7.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   45
% Syntax   : Number of formulae    :   79 (  19 unt;  36 typ;   0 def)
%            Number of atoms       :   95 (   7 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   97 (  45   ~;  31   |;   7   &)
%                                         (   3 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   51 (  27   >;  24   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  11 usr;   1 prp; 0-3 aty)
%            Number of functors    :   25 (  25 usr;   9 con; 0-6 aty)
%            Number of variables   :   40 (;  40   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ m2_relset_1 > m1_relset_1 > r2_hidden > r1_tarski > m1_subset_1 > v3_struct_0 > v1_xboole_0 > v1_relat_1 > v1_orders_2 > l1_struct_0 > l1_orders_2 > k7_relset_1 > k5_relat_1 > k4_xboole_0 > k2_zfmisc_1 > k2_xboole_0 > k1_latsum_1 > g1_orders_2 > #nlpp > u1_struct_0 > u1_orders_2 > k1_zfmisc_1 > k1_xboole_0 > #skF_9 > #skF_11 > #skF_4 > #skF_7 > #skF_6 > #skF_13 > #skF_5 > #skF_2 > #skF_10 > #skF_3 > #skF_1 > #skF_8 > #skF_14 > #skF_12

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_48,negated_conjecture,
    ~ ! [A] :
        ( ( ~ v3_struct_0(A)
          & l1_orders_2(A) )
       => ! [B] :
            ( ( ~ v3_struct_0(B)
              & l1_orders_2(B) )
           => ! [C] :
                ( m1_subset_1(C,u1_struct_0(k1_latsum_1(A,B)))
               => ( r2_hidden(C,u1_struct_0(A))
                  | r2_hidden(C,k4_xboole_0(u1_struct_0(B),u1_struct_0(A))) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_latsum_1) ).

tff(f_121,axiom,
    ! [A] :
      ( l1_orders_2(A)
     => l1_struct_0(A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_orders_2) ).

tff(f_104,axiom,
    ! [A,B] :
      ( ( l1_orders_2(A)
        & l1_orders_2(B) )
     => ( v1_orders_2(k1_latsum_1(A,B))
        & l1_orders_2(k1_latsum_1(A,B)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_latsum_1) ).

tff(f_81,axiom,
    ! [A] :
      ( l1_orders_2(A)
     => ! [B] :
          ( l1_orders_2(B)
         => ! [C] :
              ( ( v1_orders_2(C)
                & l1_orders_2(C) )
             => ( ( C = k1_latsum_1(A,B) )
              <=> ( ( u1_struct_0(C) = k2_xboole_0(u1_struct_0(A),u1_struct_0(B)) )
                  & ( u1_orders_2(C) = k2_xboole_0(k2_xboole_0(u1_orders_2(A),u1_orders_2(B)),k7_relset_1(u1_struct_0(A),u1_struct_0(A),u1_struct_0(B),u1_struct_0(B),u1_orders_2(A),u1_orders_2(B))) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_latsum_1) ).

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

tff(f_245,axiom,
    ! [A,B] : ( k2_xboole_0(A,k4_xboole_0(B,A)) = k2_xboole_0(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_xboole_1) ).

tff(f_90,axiom,
    ! [A,B,C] :
      ( ( C = k2_xboole_0(A,B) )
    <=> ! [D] :
          ( r2_hidden(D,C)
        <=> ( r2_hidden(D,A)
            | r2_hidden(D,B) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).

tff(f_187,axiom,
    ! [A,B] :
      ( ~ v1_xboole_0(A)
     => ~ v1_xboole_0(k2_xboole_0(B,A)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc3_xboole_0) ).

tff(f_162,axiom,
    ! [A] :
      ( ( ~ v3_struct_0(A)
        & l1_struct_0(A) )
     => ~ v1_xboole_0(u1_struct_0(A)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_struct_0) ).

tff(c_8,plain,
    l1_orders_2('#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_70,plain,
    ! [A_38] :
      ( l1_struct_0(A_38)
      | ~ l1_orders_2(A_38) ),
    inference(cnfTransformation,[status(thm)],[f_121]) ).

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

tff(c_12,plain,
    l1_orders_2('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_52,plain,
    ! [A_28,B_29] :
      ( l1_orders_2(k1_latsum_1(A_28,B_29))
      | ~ l1_orders_2(B_29)
      | ~ l1_orders_2(A_28) ),
    inference(cnfTransformation,[status(thm)],[f_104]) ).

tff(c_54,plain,
    ! [A_28,B_29] :
      ( v1_orders_2(k1_latsum_1(A_28,B_29))
      | ~ l1_orders_2(B_29)
      | ~ l1_orders_2(A_28) ),
    inference(cnfTransformation,[status(thm)],[f_104]) ).

tff(c_6,plain,
    m1_subset_1('#skF_3',u1_struct_0(k1_latsum_1('#skF_1','#skF_2'))),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_28,plain,
    ! [A_13,B_17] :
      ( ( k2_xboole_0(u1_struct_0(A_13),u1_struct_0(B_17)) = u1_struct_0(k1_latsum_1(A_13,B_17)) )
      | ~ l1_orders_2(k1_latsum_1(A_13,B_17))
      | ~ v1_orders_2(k1_latsum_1(A_13,B_17))
      | ~ l1_orders_2(B_17)
      | ~ l1_orders_2(A_13) ),
    inference(cnfTransformation,[status(thm)],[f_81]) ).

tff(c_140,plain,
    ! [A_84,B_85] :
      ( r2_hidden(A_84,B_85)
      | v1_xboole_0(B_85)
      | ~ m1_subset_1(A_84,B_85) ),
    inference(cnfTransformation,[status(thm)],[f_243]) ).

tff(c_4,plain,
    ~ r2_hidden('#skF_3',u1_struct_0('#skF_1')),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_142,plain,
    ! [A_86,B_87] : ( k2_xboole_0(A_86,k4_xboole_0(B_87,A_86)) = k2_xboole_0(A_86,B_87) ),
    inference(cnfTransformation,[status(thm)],[f_245]) ).

tff(c_975,plain,
    ! [D_259,B_260,A_261] :
      ( r2_hidden(D_259,B_260)
      | r2_hidden(D_259,A_261)
      | ~ r2_hidden(D_259,k2_xboole_0(A_261,B_260)) ),
    inference(cnfTransformation,[status(thm)],[f_90]) ).

tff(c_2891,plain,
    ! [D_414,B_415,A_416] :
      ( r2_hidden(D_414,k4_xboole_0(B_415,A_416))
      | r2_hidden(D_414,A_416)
      | ~ r2_hidden(D_414,k2_xboole_0(A_416,B_415)) ),
    inference(superposition,[status(thm),theory(equality)],[c_142,c_975]) ).

tff(c_2,plain,
    ~ r2_hidden('#skF_3',k4_xboole_0(u1_struct_0('#skF_2'),u1_struct_0('#skF_1'))),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_2955,plain,
    ( r2_hidden('#skF_3',u1_struct_0('#skF_1'))
    | ~ r2_hidden('#skF_3',k2_xboole_0(u1_struct_0('#skF_1'),u1_struct_0('#skF_2'))) ),
    inference(resolution,[status(thm)],[c_2891,c_2]) ).

tff(c_2999,plain,
    ~ r2_hidden('#skF_3',k2_xboole_0(u1_struct_0('#skF_1'),u1_struct_0('#skF_2'))),
    inference(negUnitSimplification,[status(thm)],[c_4,c_2955]) ).

tff(c_3027,plain,
    ( v1_xboole_0(k2_xboole_0(u1_struct_0('#skF_1'),u1_struct_0('#skF_2')))
    | ~ m1_subset_1('#skF_3',k2_xboole_0(u1_struct_0('#skF_1'),u1_struct_0('#skF_2'))) ),
    inference(resolution,[status(thm)],[c_140,c_2999]) ).

tff(c_3034,plain,
    ~ m1_subset_1('#skF_3',k2_xboole_0(u1_struct_0('#skF_1'),u1_struct_0('#skF_2'))),
    inference(splitLeft,[status(thm)],[c_3027]) ).

tff(c_3037,plain,
    ( ~ m1_subset_1('#skF_3',u1_struct_0(k1_latsum_1('#skF_1','#skF_2')))
    | ~ l1_orders_2(k1_latsum_1('#skF_1','#skF_2'))
    | ~ v1_orders_2(k1_latsum_1('#skF_1','#skF_2'))
    | ~ l1_orders_2('#skF_2')
    | ~ l1_orders_2('#skF_1') ),
    inference(superposition,[status(thm),theory(equality)],[c_28,c_3034]) ).

tff(c_3045,plain,
    ( ~ l1_orders_2(k1_latsum_1('#skF_1','#skF_2'))
    | ~ v1_orders_2(k1_latsum_1('#skF_1','#skF_2')) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_8,c_6,c_3037]) ).

tff(c_3048,plain,
    ~ v1_orders_2(k1_latsum_1('#skF_1','#skF_2')),
    inference(splitLeft,[status(thm)],[c_3045]) ).

tff(c_3051,plain,
    ( ~ l1_orders_2('#skF_2')
    | ~ l1_orders_2('#skF_1') ),
    inference(resolution,[status(thm)],[c_54,c_3048]) ).

tff(c_3055,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_8,c_3051]) ).

tff(c_3056,plain,
    ~ l1_orders_2(k1_latsum_1('#skF_1','#skF_2')),
    inference(splitRight,[status(thm)],[c_3045]) ).

tff(c_3154,plain,
    ( ~ l1_orders_2('#skF_2')
    | ~ l1_orders_2('#skF_1') ),
    inference(resolution,[status(thm)],[c_52,c_3056]) ).

tff(c_3158,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_8,c_3154]) ).

tff(c_3159,plain,
    v1_xboole_0(k2_xboole_0(u1_struct_0('#skF_1'),u1_struct_0('#skF_2'))),
    inference(splitRight,[status(thm)],[c_3027]) ).

tff(c_108,plain,
    ! [B_59,A_58] :
      ( ~ v1_xboole_0(k2_xboole_0(B_59,A_58))
      | v1_xboole_0(A_58) ),
    inference(cnfTransformation,[status(thm)],[f_187]) ).

tff(c_3213,plain,
    v1_xboole_0(u1_struct_0('#skF_2')),
    inference(resolution,[status(thm)],[c_3159,c_108]) ).

tff(c_98,plain,
    ! [A_53] :
      ( ~ v1_xboole_0(u1_struct_0(A_53))
      | ~ l1_struct_0(A_53)
      | v3_struct_0(A_53) ),
    inference(cnfTransformation,[status(thm)],[f_162]) ).

tff(c_3238,plain,
    ( ~ l1_struct_0('#skF_2')
    | v3_struct_0('#skF_2') ),
    inference(resolution,[status(thm)],[c_3213,c_98]) ).

tff(c_3250,plain,
    ~ l1_struct_0('#skF_2'),
    inference(negUnitSimplification,[status(thm)],[c_10,c_3238]) ).

tff(c_3255,plain,
    ~ l1_orders_2('#skF_2'),
    inference(resolution,[status(thm)],[c_70,c_3250]) ).

tff(c_3259,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_3255]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SEU407+1 : TPTP v8.1.2. Released v3.4.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.14/0.33  % Computer : n029.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 300
% 0.14/0.33  % DateTime : Thu Aug  3 11:56:52 EDT 2023
% 0.14/0.33  % CPUTime  : 
% 7.08/2.55  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.08/2.56  
% 7.08/2.56  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.08/2.59  
% 7.08/2.59  Inference rules
% 7.08/2.59  ----------------------
% 7.08/2.59  #Ref     : 2
% 7.08/2.59  #Sup     : 803
% 7.08/2.59  #Fact    : 6
% 7.08/2.59  #Define  : 0
% 7.08/2.59  #Split   : 8
% 7.08/2.59  #Chain   : 0
% 7.08/2.59  #Close   : 0
% 7.08/2.59  
% 7.08/2.59  Ordering : KBO
% 7.08/2.59  
% 7.08/2.59  Simplification rules
% 7.08/2.59  ----------------------
% 7.08/2.59  #Subsume      : 242
% 7.08/2.59  #Demod        : 161
% 7.08/2.59  #Tautology    : 148
% 7.08/2.59  #SimpNegUnit  : 11
% 7.08/2.59  #BackRed      : 4
% 7.08/2.59  
% 7.08/2.59  #Partial instantiations: 0
% 7.08/2.59  #Strategies tried      : 1
% 7.08/2.59  
% 7.08/2.59  Timing (in seconds)
% 7.08/2.59  ----------------------
% 7.08/2.59  Preprocessing        : 0.65
% 7.08/2.59  Parsing              : 0.32
% 7.08/2.59  CNF conversion       : 0.06
% 7.08/2.59  Main loop            : 0.96
% 7.08/2.59  Inferencing          : 0.33
% 7.08/2.59  Reduction            : 0.29
% 7.08/2.59  Demodulation         : 0.21
% 7.08/2.59  BG Simplification    : 0.05
% 7.08/2.59  Subsumption          : 0.23
% 7.08/2.59  Abstraction          : 0.03
% 7.08/2.59  MUC search           : 0.00
% 7.08/2.59  Cooper               : 0.00
% 7.08/2.59  Total                : 1.66
% 7.08/2.59  Index Insertion      : 0.00
% 7.08/2.59  Index Deletion       : 0.00
% 7.08/2.59  Index Matching       : 0.00
% 7.08/2.59  BG Taut test         : 0.00
%------------------------------------------------------------------------------