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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN386+1 : TPTP v8.1.2. Released v2.0.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 : n017.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 11:10:42 EDT 2023

% Result   : Theorem 2.74s 1.66s
% Output   : CNFRefutation 2.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   22 (   7 unt;  10 typ;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   25 (   9   ~;   7   |;   3   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   15 (   9   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-2 aty)
%            Number of variables   :   43 (;  37   !;   6   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_d > big_s > big_f > #nlpp > #skF_5 > #skF_6 > #skF_4 > #skF_1 > #skF_2 > #skF_3 > #skF_7

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(f_60,negated_conjecture,
    ~ ( ( ! [X] :
          ? [Y] : big_f(X,Y)
        & ? [X] :
          ! [E] :
          ? [N] :
          ! [W] :
            ( big_s(N,W)
           => big_d(W,X,E) )
        & ! [E] :
          ? [D] :
          ! [A,B] :
            ( big_d(A,B,D)
           => ! [Y,Z] :
                ( ( big_f(A,Y)
                  & big_f(B,Z) )
               => big_d(Y,Z,E) ) ) )
     => ? [Y] :
        ! [E] :
        ? [M] :
        ! [W] :
          ( big_s(M,W)
         => ! [Z] :
              ( big_f(W,Z)
             => big_d(Z,Y,E) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2138) ).

tff(c_6,plain,
    ! [M_65,Y_42] : big_s(M_65,'#skF_6'(Y_42,M_65)),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_17,plain,
    ! [W_77,E_78] :
      ( big_d(W_77,'#skF_2',E_78)
      | ~ big_s('#skF_3'(E_78),W_77) ),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_22,plain,
    ! [Y_42,E_78] : big_d('#skF_6'(Y_42,'#skF_3'(E_78)),'#skF_2',E_78),
    inference(resolution,[status(thm)],[c_6,c_17]) ).

tff(c_4,plain,
    ! [Y_42,M_65] : big_f('#skF_6'(Y_42,M_65),'#skF_7'(Y_42,M_65)),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_12,plain,
    ! [X_1] : big_f(X_1,'#skF_1'(X_1)),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_23,plain,
    ! [B_83,E_80,A_81,Z_82,Y_79] :
      ( big_d(Y_79,Z_82,E_80)
      | ~ big_f(B_83,Z_82)
      | ~ big_f(A_81,Y_79)
      | ~ big_d(A_81,B_83,'#skF_4'(E_80)) ),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_31,plain,
    ! [Y_86,X_87,E_88,A_89] :
      ( big_d(Y_86,'#skF_1'(X_87),E_88)
      | ~ big_f(A_89,Y_86)
      | ~ big_d(A_89,X_87,'#skF_4'(E_88)) ),
    inference(resolution,[status(thm)],[c_12,c_23]) ).

tff(c_39,plain,
    ! [Y_93,M_94,X_95,E_96] :
      ( big_d('#skF_7'(Y_93,M_94),'#skF_1'(X_95),E_96)
      | ~ big_d('#skF_6'(Y_93,M_94),X_95,'#skF_4'(E_96)) ),
    inference(resolution,[status(thm)],[c_4,c_31]) ).

tff(c_45,plain,
    ! [Y_97,E_98] : big_d('#skF_7'(Y_97,'#skF_3'('#skF_4'(E_98))),'#skF_1'('#skF_2'),E_98),
    inference(resolution,[status(thm)],[c_22,c_39]) ).

tff(c_2,plain,
    ! [Y_42,M_65] : ~ big_d('#skF_7'(Y_42,M_65),Y_42,'#skF_5'(Y_42)),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_50,plain,
    $false,
    inference(resolution,[status(thm)],[c_45,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SYN386+1 : TPTP v8.1.2. Released v2.0.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.14/0.36  % Computer : n017.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 16:36:06 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 2.74/1.66  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.66  
% 2.74/1.66  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.74/1.69  
% 2.74/1.69  Inference rules
% 2.74/1.69  ----------------------
% 2.74/1.69  #Ref     : 0
% 2.74/1.69  #Sup     : 7
% 2.74/1.69  #Fact    : 0
% 2.74/1.69  #Define  : 0
% 2.74/1.69  #Split   : 0
% 2.74/1.69  #Chain   : 0
% 2.74/1.69  #Close   : 0
% 2.74/1.69  
% 2.74/1.69  Ordering : KBO
% 2.74/1.69  
% 2.74/1.69  Simplification rules
% 2.74/1.69  ----------------------
% 2.74/1.69  #Subsume      : 0
% 2.74/1.69  #Demod        : 0
% 2.74/1.69  #Tautology    : 0
% 2.74/1.69  #SimpNegUnit  : 0
% 2.74/1.69  #BackRed      : 0
% 2.74/1.69  
% 2.74/1.69  #Partial instantiations: 0
% 2.74/1.69  #Strategies tried      : 1
% 2.74/1.69  
% 2.74/1.69  Timing (in seconds)
% 2.74/1.69  ----------------------
% 2.74/1.69  Preprocessing        : 0.43
% 2.74/1.69  Parsing              : 0.23
% 2.74/1.69  CNF conversion       : 0.04
% 2.74/1.69  Main loop            : 0.18
% 2.74/1.70  Inferencing          : 0.09
% 2.74/1.70  Reduction            : 0.04
% 2.74/1.70  Demodulation         : 0.03
% 2.74/1.70  BG Simplification    : 0.01
% 2.74/1.70  Subsumption          : 0.03
% 2.74/1.70  Abstraction          : 0.01
% 2.74/1.70  MUC search           : 0.00
% 2.74/1.70  Cooper               : 0.00
% 2.74/1.70  Total                : 0.66
% 2.74/1.70  Index Insertion      : 0.00
% 2.74/1.70  Index Deletion       : 0.00
% 2.74/1.70  Index Matching       : 0.00
% 2.74/1.70  BG Taut test         : 0.00
%------------------------------------------------------------------------------