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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN077+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/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 : n019.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:09:31 EDT 2023

% Result   : Theorem 3.42s 1.84s
% Output   : CNFRefutation 3.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   29 (   4 unt;   6 typ;   0 def)
%            Number of atoms       :   63 (   4 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   80 (  40   ~;  35   |;   2   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   5   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   41 (;  37   !;   4   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_f > #nlpp > #skF_1 > #skF_2 > #skF_3 > #skF_5 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_51,negated_conjecture,
    ~ ~ ? [W] :
        ! [X] :
          ( big_f(X,W)
        <=> ! [U] :
              ( big_f(X,U)
             => ? [Y] :
                  ( big_f(Y,U)
                  & ~ ? [Z] :
                        ( big_f(Z,U)
                        & big_f(Z,Y) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel54) ).

tff(f_34,axiom,
    ! [Y] :
    ? [Z] :
    ! [X] :
      ( big_f(X,Z)
    <=> ( X = Y ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel54_1) ).

tff(c_10,plain,
    ! [X_36] :
      ( big_f(X_36,'#skF_3'(X_36))
      | big_f(X_36,'#skF_2') ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_12,plain,
    ! [X_36,Y_54] :
      ( big_f('#skF_4'(X_36,Y_54),Y_54)
      | ~ big_f(Y_54,'#skF_3'(X_36))
      | big_f(X_36,'#skF_2') ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_14,plain,
    ! [X_36,Y_54] :
      ( big_f('#skF_4'(X_36,Y_54),'#skF_3'(X_36))
      | ~ big_f(Y_54,'#skF_3'(X_36))
      | big_f(X_36,'#skF_2') ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_8,plain,
    ! [X_36,U_56] :
      ( big_f('#skF_5'(X_36,U_56),U_56)
      | ~ big_f(X_36,U_56)
      | ~ big_f(X_36,'#skF_2') ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_71,plain,
    ! [Z_77,X_78,U_79] :
      ( ~ big_f(Z_77,'#skF_5'(X_78,U_79))
      | ~ big_f(Z_77,U_79)
      | ~ big_f(X_78,U_79)
      | ~ big_f(X_78,'#skF_2') ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_211,plain,
    ! [X_99,X_100,U_101] :
      ( ~ big_f('#skF_4'(X_99,'#skF_5'(X_100,U_101)),U_101)
      | ~ big_f(X_100,U_101)
      | ~ big_f(X_100,'#skF_2')
      | ~ big_f('#skF_5'(X_100,U_101),'#skF_3'(X_99))
      | big_f(X_99,'#skF_2') ),
    inference(resolution,[status(thm)],[c_12,c_71]) ).

tff(c_225,plain,
    ! [X_102,X_103] :
      ( ~ big_f(X_102,'#skF_3'(X_103))
      | ~ big_f(X_102,'#skF_2')
      | ~ big_f('#skF_5'(X_102,'#skF_3'(X_103)),'#skF_3'(X_103))
      | big_f(X_103,'#skF_2') ),
    inference(resolution,[status(thm)],[c_14,c_211]) ).

tff(c_231,plain,
    ! [X_104,X_105] :
      ( big_f(X_104,'#skF_2')
      | ~ big_f(X_105,'#skF_3'(X_104))
      | ~ big_f(X_105,'#skF_2') ),
    inference(resolution,[status(thm)],[c_8,c_225]) ).

tff(c_292,plain,
    ! [X_109,Y_110] :
      ( ~ big_f('#skF_4'(X_109,Y_110),'#skF_2')
      | ~ big_f(Y_110,'#skF_3'(X_109))
      | big_f(X_109,'#skF_2') ),
    inference(resolution,[status(thm)],[c_14,c_231]) ).

tff(c_304,plain,
    ! [X_111] :
      ( ~ big_f('#skF_2','#skF_3'(X_111))
      | big_f(X_111,'#skF_2') ),
    inference(resolution,[status(thm)],[c_12,c_292]) ).

tff(c_314,plain,
    big_f('#skF_2','#skF_2'),
    inference(resolution,[status(thm)],[c_10,c_304]) ).

tff(c_4,plain,
    ! [Y_1] : big_f(Y_1,'#skF_1'(Y_1)),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_23,plain,
    ! [X_66,U_67] :
      ( big_f('#skF_5'(X_66,U_67),U_67)
      | ~ big_f(X_66,U_67)
      | ~ big_f(X_66,'#skF_2') ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_2,plain,
    ! [Y_1,X_6] :
      ( ( Y_1 = X_6 )
      | ~ big_f(X_6,'#skF_1'(Y_1)) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_36,plain,
    ! [X_72,Y_73] :
      ( ( '#skF_5'(X_72,'#skF_1'(Y_73)) = Y_73 )
      | ~ big_f(X_72,'#skF_1'(Y_73))
      | ~ big_f(X_72,'#skF_2') ),
    inference(resolution,[status(thm)],[c_23,c_2]) ).

tff(c_50,plain,
    ! [Y_1] :
      ( ( '#skF_5'(Y_1,'#skF_1'(Y_1)) = Y_1 )
      | ~ big_f(Y_1,'#skF_2') ),
    inference(resolution,[status(thm)],[c_4,c_36]) ).

tff(c_74,plain,
    ! [Z_77,Y_1] :
      ( ~ big_f(Z_77,Y_1)
      | ~ big_f(Z_77,'#skF_1'(Y_1))
      | ~ big_f(Y_1,'#skF_1'(Y_1))
      | ~ big_f(Y_1,'#skF_2')
      | ~ big_f(Y_1,'#skF_2') ),
    inference(superposition,[status(thm),theory(equality)],[c_50,c_71]) ).

tff(c_103,plain,
    ! [Z_81,Y_82] :
      ( ~ big_f(Z_81,Y_82)
      | ~ big_f(Z_81,'#skF_1'(Y_82))
      | ~ big_f(Y_82,'#skF_2') ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_74]) ).

tff(c_117,plain,
    ! [Y_1] :
      ( ~ big_f(Y_1,Y_1)
      | ~ big_f(Y_1,'#skF_2') ),
    inference(resolution,[status(thm)],[c_4,c_103]) ).

tff(c_316,plain,
    ~ big_f('#skF_2','#skF_2'),
    inference(resolution,[status(thm)],[c_314,c_117]) ).

tff(c_320,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_314,c_316]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SYN077+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/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.18/0.36  % Computer : n019.cluster.edu
% 0.18/0.36  % Model    : x86_64 x86_64
% 0.18/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36  % Memory   : 8042.1875MB
% 0.18/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36  % CPULimit : 300
% 0.18/0.36  % WCLimit  : 300
% 0.18/0.36  % DateTime : Thu Aug  3 17:30:01 EDT 2023
% 0.18/0.36  % CPUTime  : 
% 3.42/1.84  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.42/1.85  
% 3.42/1.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.42/1.88  
% 3.42/1.88  Inference rules
% 3.42/1.88  ----------------------
% 3.42/1.88  #Ref     : 0
% 3.42/1.88  #Sup     : 68
% 3.42/1.88  #Fact    : 0
% 3.42/1.88  #Define  : 0
% 3.42/1.88  #Split   : 0
% 3.42/1.88  #Chain   : 0
% 3.42/1.88  #Close   : 0
% 3.42/1.88  
% 3.42/1.88  Ordering : KBO
% 3.42/1.88  
% 3.42/1.88  Simplification rules
% 3.42/1.88  ----------------------
% 3.42/1.88  #Subsume      : 12
% 3.42/1.88  #Demod        : 12
% 3.42/1.88  #Tautology    : 17
% 3.42/1.88  #SimpNegUnit  : 0
% 3.42/1.88  #BackRed      : 0
% 3.42/1.88  
% 3.42/1.88  #Partial instantiations: 0
% 3.42/1.88  #Strategies tried      : 1
% 3.42/1.88  
% 3.42/1.88  Timing (in seconds)
% 3.42/1.88  ----------------------
% 3.42/1.88  Preprocessing        : 0.43
% 3.42/1.88  Parsing              : 0.22
% 3.42/1.88  CNF conversion       : 0.04
% 3.42/1.88  Main loop            : 0.38
% 3.42/1.88  Inferencing          : 0.17
% 3.42/1.88  Reduction            : 0.07
% 3.42/1.88  Demodulation         : 0.06
% 3.42/1.88  BG Simplification    : 0.02
% 3.42/1.88  Subsumption          : 0.10
% 3.42/1.88  Abstraction          : 0.01
% 3.42/1.88  MUC search           : 0.00
% 3.42/1.88  Cooper               : 0.00
% 3.42/1.88  Total                : 0.85
% 3.42/1.88  Index Insertion      : 0.00
% 3.42/1.88  Index Deletion       : 0.00
% 3.42/1.88  Index Matching       : 0.00
% 3.42/1.88  BG Taut test         : 0.00
%------------------------------------------------------------------------------