TSTP Solution File: ARI619_2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ARI619_2 : TPTP v8.1.2. Released v5.1.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 : n022.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:34:08 EDT 2023

% Result   : Theorem 3.06s 1.83s
% Output   : CNFRefutation 3.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   6 unt;   2 typ;   0 def)
%            Number of atoms       :   40 (  19 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   30 (   8   ~;  18   |;   2   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   60 (   3 atm;   5 fun;  46 num;   6 var)
%            Number of types       :    2 (   0 usr;   1 ari)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   1 usr;   5 con; 0-2 aty)
%            Number of variables   :    6 (;   5   !;   1   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
%$ pow2 > #nlpp > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(pow2,type,
    pow2: $rat > $o ).

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

tff(f_42,negated_conjecture,
    ~ ( ! [Xa: $rat] :
          ( pow2(Xa)
        <=> ( ( Xa = 1 )
            | ( $lesseq(2,Xa)
              & ? [Ya: $rat] :
                  ( ( $product(2,Ya) = Xa )
                  & pow2(Ya) ) ) ) )
     => ~ pow2(5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_pow_of_2_5) ).

tff(c_2,plain,
    pow2(5),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_28,plain,
    ! [X_9a: $rat] :
      ( ( $product(2,'#skF_1'(X_9a)) = X_9a )
      | ~ pow2(X_9a)
      | ( X_9a = 1 ) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_35,plain,
    ( ( $product(2,'#skF_1'(5)) = 5 )
    | ( 5 = 1 ) ),
    inference(resolution,[status(thm)],[c_2,c_28]) ).

tff(c_36,plain,
    '#skF_1'(5) = 5/2,
    inference(backgroundSimplification,[status(thm),theory('LRA')],[c_35]) ).

tff(c_3,plain,
    ! [X_1a: $rat] :
      ( pow2('#skF_1'(X_1a))
      | ~ pow2(X_1a)
      | ( X_1a = 1 ) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_165,plain,
    ( pow2(5/2)
    | ~ pow2(5)
    | ( 5 = 1 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_36,c_3]) ).

tff(c_169,plain,
    ( pow2(5/2)
    | ( 5 = 1 ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_165]) ).

tff(c_170,plain,
    pow2(5/2),
    inference(backgroundSimplification,[status(thm),theory('LRA')],[c_169]) ).

tff(c_4,plain,
    ! [X_1a: $rat] :
      ( ( $product(2,'#skF_1'(X_1a)) = X_1a )
      | ~ pow2(X_1a)
      | ( X_1a = 1 ) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_288,plain,
    ( ( $product(2,'#skF_1'(5/2)) = 5/2 )
    | ( 5/2 = 1 ) ),
    inference(resolution,[status(thm)],[c_170,c_4]) ).

tff(c_289,plain,
    '#skF_1'(5/2) = 5/4,
    inference(backgroundSimplification,[status(thm),theory('LRA')],[c_288]) ).

tff(c_316,plain,
    ( pow2(5/4)
    | ~ pow2(5/2)
    | ( 5/2 = 1 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_289,c_3]) ).

tff(c_320,plain,
    ( pow2(5/4)
    | ( 5/2 = 1 ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_170,c_316]) ).

tff(c_321,plain,
    pow2(5/4),
    inference(backgroundSimplification,[status(thm),theory('LRA')],[c_320]) ).

tff(c_5,plain,
    ! [X_1a: $rat] :
      ( ~ pow2(X_1a)
      | ( X_1a = 1 )
      | $lesseq(2,X_1a) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_335,plain,
    ( ( 5/4 = 1 )
    | $lesseq(2,5/4) ),
    inference(resolution,[status(thm)],[c_321,c_5]) ).

tff(c_337,plain,
    $false,
    inference(backgroundSimplification,[status(thm),theory('LRA')],[c_335]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : ARI619_2 : TPTP v8.1.2. Released v5.1.0.
% 0.00/0.13  % 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.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Fri Aug  4 00:08:34 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 3.06/1.83  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.06/1.83  
% 3.06/1.83  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.06/1.85  
% 3.06/1.85  Inference rules
% 3.06/1.85  ----------------------
% 3.06/1.85  #Ref     : 0
% 3.06/1.85  #Sup     : 78
% 3.06/1.85  #Fact    : 0
% 3.06/1.85  #Define  : 0
% 3.06/1.85  #Split   : 0
% 3.06/1.85  #Chain   : 0
% 3.06/1.85  #Close   : 0
% 3.06/1.85  
% 3.06/1.85  Ordering : LPO
% 3.06/1.85  
% 3.06/1.85  Simplification rules
% 3.06/1.85  ----------------------
% 3.06/1.85  #Subsume      : 0
% 3.06/1.85  #Demod        : 23
% 3.06/1.85  #Tautology    : 49
% 3.06/1.85  #SimpNegUnit  : 0
% 3.06/1.85  #BackRed      : 0
% 3.06/1.85  
% 3.06/1.85  #Partial instantiations: 0
% 3.06/1.85  #Strategies tried      : 1
% 3.06/1.85  
% 3.06/1.85  Timing (in seconds)
% 3.06/1.85  ----------------------
% 3.06/1.86  Preprocessing        : 0.45
% 3.06/1.86  Parsing              : 0.25
% 3.06/1.86  CNF conversion       : 0.02
% 3.06/1.86  Main loop            : 0.30
% 3.06/1.86  Inferencing          : 0.12
% 3.06/1.86  Reduction            : 0.08
% 3.06/1.86  Demodulation         : 0.06
% 3.06/1.86  BG Simplification    : 0.03
% 3.06/1.86  Subsumption          : 0.06
% 3.06/1.86  Abstraction          : 0.01
% 3.06/1.86  MUC search           : 0.00
% 3.06/1.86  Cooper               : 0.00
% 3.06/1.86  Total                : 0.79
% 3.06/1.86  Index Insertion      : 0.00
% 3.06/1.86  Index Deletion       : 0.00
% 3.06/1.86  Index Matching       : 0.00
% 3.06/1.86  BG Taut test         : 0.00
%------------------------------------------------------------------------------