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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU406+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 : n016.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:38 EDT 2023

% Result   : Theorem 6.54s 2.59s
% Output   : CNFRefutation 6.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   52 (  22 unt;  15 typ;   0 def)
%            Number of atoms       :   68 (   5 equ)
%            Maximal formula atoms :   10 (   1 avg)
%            Number of connectives :   60 (  29   ~;  20   |;   9   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (   8   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-3 aty)
%            Number of variables   :   34 (;  34   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r2_hidden > m1_subset_1 > v1_xboole_0 > k4_xboole_0 > k2_xboole_0 > #nlpp > k1_xboole_0 > #skF_7 > #skF_6 > #skF_5 > #skF_2 > #skF_3 > #skF_1 > #skF_9 > #skF_8 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_55,negated_conjecture,
    ~ ! [A,B,C,D] :
        ~ ( r2_hidden(A,k2_xboole_0(C,D))
          & r2_hidden(B,k2_xboole_0(C,D))
          & ~ ( r2_hidden(A,k4_xboole_0(C,D))
              & r2_hidden(B,k4_xboole_0(C,D)) )
          & ~ ( r2_hidden(A,D)
              & r2_hidden(B,D) )
          & ~ ( r2_hidden(A,k4_xboole_0(C,D))
              & r2_hidden(B,D) )
          & ~ ( r2_hidden(A,D)
              & r2_hidden(B,k4_xboole_0(C,D)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_latsum_1) ).

tff(f_62,axiom,
    ! [A,B] : ( k2_xboole_0(A,B) = k2_xboole_0(B,A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).

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

tff(f_71,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/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).

tff(c_6,plain,
    ( ~ r2_hidden('#skF_2','#skF_4')
    | ~ r2_hidden('#skF_1','#skF_4') ),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_124,plain,
    ~ r2_hidden('#skF_1','#skF_4'),
    inference(splitLeft,[status(thm)],[c_6]) ).

tff(c_16,plain,
    ! [B_4,A_3] : ( k2_xboole_0(B_4,A_3) = k2_xboole_0(A_3,B_4) ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_12,plain,
    r2_hidden('#skF_1',k2_xboole_0('#skF_3','#skF_4')),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_75,plain,
    r2_hidden('#skF_1',k2_xboole_0('#skF_4','#skF_3')),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_12]) ).

tff(c_64,plain,
    ! [A_24,B_25] : ( k2_xboole_0(A_24,k4_xboole_0(B_25,A_24)) = k2_xboole_0(A_24,B_25) ),
    inference(cnfTransformation,[status(thm)],[f_109]) ).

tff(c_534,plain,
    ! [D_80,B_81,A_82] :
      ( r2_hidden(D_80,B_81)
      | r2_hidden(D_80,A_82)
      | ~ r2_hidden(D_80,k2_xboole_0(A_82,B_81)) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_1549,plain,
    ! [D_172,B_173,A_174] :
      ( r2_hidden(D_172,k4_xboole_0(B_173,A_174))
      | r2_hidden(D_172,A_174)
      | ~ r2_hidden(D_172,k2_xboole_0(A_174,B_173)) ),
    inference(superposition,[status(thm),theory(equality)],[c_64,c_534]) ).

tff(c_4,plain,
    ( ~ r2_hidden('#skF_2','#skF_4')
    | ~ r2_hidden('#skF_1',k4_xboole_0('#skF_3','#skF_4')) ),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_224,plain,
    ~ r2_hidden('#skF_1',k4_xboole_0('#skF_3','#skF_4')),
    inference(splitLeft,[status(thm)],[c_4]) ).

tff(c_1611,plain,
    ( r2_hidden('#skF_1','#skF_4')
    | ~ r2_hidden('#skF_1',k2_xboole_0('#skF_4','#skF_3')) ),
    inference(resolution,[status(thm)],[c_1549,c_224]) ).

tff(c_1649,plain,
    r2_hidden('#skF_1','#skF_4'),
    inference(demodulation,[status(thm),theory(equality)],[c_75,c_1611]) ).

tff(c_1651,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_124,c_1649]) ).

tff(c_1652,plain,
    ~ r2_hidden('#skF_2','#skF_4'),
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_10,plain,
    r2_hidden('#skF_2',k2_xboole_0('#skF_3','#skF_4')),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_76,plain,
    r2_hidden('#skF_2',k2_xboole_0('#skF_4','#skF_3')),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_10]) ).

tff(c_1942,plain,
    ! [D_205,B_206,A_207] :
      ( r2_hidden(D_205,B_206)
      | r2_hidden(D_205,A_207)
      | ~ r2_hidden(D_205,k2_xboole_0(A_207,B_206)) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_3032,plain,
    ! [D_303,B_304,A_305] :
      ( r2_hidden(D_303,k4_xboole_0(B_304,A_305))
      | r2_hidden(D_303,A_305)
      | ~ r2_hidden(D_303,k2_xboole_0(A_305,B_304)) ),
    inference(superposition,[status(thm),theory(equality)],[c_64,c_1942]) ).

tff(c_1653,plain,
    r2_hidden('#skF_1',k4_xboole_0('#skF_3','#skF_4')),
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_8,plain,
    ( ~ r2_hidden('#skF_2',k4_xboole_0('#skF_3','#skF_4'))
    | ~ r2_hidden('#skF_1',k4_xboole_0('#skF_3','#skF_4')) ),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_1723,plain,
    ~ r2_hidden('#skF_2',k4_xboole_0('#skF_3','#skF_4')),
    inference(demodulation,[status(thm),theory(equality)],[c_1653,c_8]) ).

tff(c_3092,plain,
    ( r2_hidden('#skF_2','#skF_4')
    | ~ r2_hidden('#skF_2',k2_xboole_0('#skF_4','#skF_3')) ),
    inference(resolution,[status(thm)],[c_3032,c_1723]) ).

tff(c_3131,plain,
    r2_hidden('#skF_2','#skF_4'),
    inference(demodulation,[status(thm),theory(equality)],[c_76,c_3092]) ).

tff(c_3133,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_1652,c_3131]) ).

tff(c_3134,plain,
    ~ r2_hidden('#skF_2','#skF_4'),
    inference(splitRight,[status(thm)],[c_6]) ).

tff(c_3571,plain,
    ! [D_349,B_350,A_351] :
      ( r2_hidden(D_349,B_350)
      | r2_hidden(D_349,A_351)
      | ~ r2_hidden(D_349,k2_xboole_0(A_351,B_350)) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_4494,plain,
    ! [D_438,B_439,A_440] :
      ( r2_hidden(D_438,k4_xboole_0(B_439,A_440))
      | r2_hidden(D_438,A_440)
      | ~ r2_hidden(D_438,k2_xboole_0(A_440,B_439)) ),
    inference(superposition,[status(thm),theory(equality)],[c_64,c_3571]) ).

tff(c_3135,plain,
    r2_hidden('#skF_1','#skF_4'),
    inference(splitRight,[status(thm)],[c_6]) ).

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

tff(c_3155,plain,
    ~ r2_hidden('#skF_2',k4_xboole_0('#skF_3','#skF_4')),
    inference(demodulation,[status(thm),theory(equality)],[c_3135,c_2]) ).

tff(c_4559,plain,
    ( r2_hidden('#skF_2','#skF_4')
    | ~ r2_hidden('#skF_2',k2_xboole_0('#skF_4','#skF_3')) ),
    inference(resolution,[status(thm)],[c_4494,c_3155]) ).

tff(c_4592,plain,
    r2_hidden('#skF_2','#skF_4'),
    inference(demodulation,[status(thm),theory(equality)],[c_76,c_4559]) ).

tff(c_4594,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_3134,c_4592]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SEU406+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/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.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 12:19:37 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 6.54/2.59  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.54/2.60  
% 6.54/2.60  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.54/2.62  
% 6.54/2.62  Inference rules
% 6.54/2.62  ----------------------
% 6.54/2.62  #Ref     : 0
% 6.54/2.62  #Sup     : 1156
% 6.54/2.62  #Fact    : 6
% 6.54/2.62  #Define  : 0
% 6.54/2.62  #Split   : 24
% 6.54/2.62  #Chain   : 0
% 6.54/2.62  #Close   : 0
% 6.54/2.62  
% 6.54/2.63  Ordering : KBO
% 6.54/2.63  
% 6.54/2.63  Simplification rules
% 6.54/2.63  ----------------------
% 6.54/2.63  #Subsume      : 407
% 6.54/2.63  #Demod        : 278
% 6.54/2.63  #Tautology    : 257
% 6.54/2.63  #SimpNegUnit  : 38
% 6.54/2.63  #BackRed      : 3
% 6.54/2.63  
% 6.54/2.63  #Partial instantiations: 0
% 6.54/2.63  #Strategies tried      : 1
% 6.54/2.63  
% 6.54/2.63  Timing (in seconds)
% 6.54/2.63  ----------------------
% 6.54/2.63  Preprocessing        : 0.53
% 6.54/2.63  Parsing              : 0.28
% 6.54/2.63  CNF conversion       : 0.04
% 6.54/2.63  Main loop            : 1.04
% 6.54/2.63  Inferencing          : 0.34
% 6.54/2.63  Reduction            : 0.33
% 6.54/2.63  Demodulation         : 0.25
% 6.54/2.63  BG Simplification    : 0.04
% 6.54/2.63  Subsumption          : 0.25
% 6.54/2.63  Abstraction          : 0.04
% 6.54/2.63  MUC search           : 0.00
% 6.54/2.63  Cooper               : 0.00
% 6.54/2.63  Total                : 1.61
% 6.54/2.63  Index Insertion      : 0.00
% 6.54/2.63  Index Deletion       : 0.00
% 6.54/2.63  Index Matching       : 0.00
% 6.54/2.63  BG Taut test         : 0.00
%------------------------------------------------------------------------------