TSTP Solution File: ARI297_1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ARI297_1 : TPTP v8.1.2. Released v5.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 : n032.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:33:34 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp

%Foreground sorts:

%Background operators:
tff('#skF_1',type,
    '#skF_1': $rat ).

%Foreground operators:

tff(f_32,negated_conjecture,
    ~ ! [Xa: $rat] :
        ( ( $product(Xa,2/5) = 1/4 )
       => ( Xa = 5/8 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rat_product_problem_14) ).

tff(c_2,plain,
    $product('#skF_1',2/5) = 1/4,
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_1,plain,
    '#skF_1' != 5/8,
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_3,plain,
    $false,
    inference(close,[status(thm),theory('LRA')],[c_2,c_1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : ARI297_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.10  % 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.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 300
% 0.10/0.29  % DateTime : Fri Aug  4 00:12:21 EDT 2023
% 0.10/0.30  % CPUTime  : 
% 2.24/1.61  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.24/1.62  
% 2.24/1.62  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.38/1.64  
% 2.38/1.64  Inference rules
% 2.38/1.64  ----------------------
% 2.38/1.64  #Ref     : 0
% 2.38/1.64  #Sup     : 0
% 2.38/1.64  #Fact    : 0
% 2.38/1.64  #Define  : 0
% 2.38/1.64  #Split   : 0
% 2.38/1.64  #Chain   : 0
% 2.38/1.64  #Close   : 1
% 2.38/1.64  
% 2.38/1.64  Ordering : LPO
% 2.38/1.64  
% 2.38/1.64  Simplification rules
% 2.38/1.64  ----------------------
% 2.38/1.64  #Subsume      : 0
% 2.38/1.64  #Demod        : 0
% 2.38/1.64  #Tautology    : 0
% 2.38/1.64  #SimpNegUnit  : 0
% 2.38/1.64  #BackRed      : 0
% 2.38/1.64  
% 2.38/1.64  #Partial instantiations: 0
% 2.38/1.64  #Strategies tried      : 1
% 2.38/1.64  
% 2.38/1.64  Timing (in seconds)
% 2.38/1.64  ----------------------
% 2.38/1.65  Preprocessing        : 0.40
% 2.38/1.65  Parsing              : 0.24
% 2.38/1.65  CNF conversion       : 0.02
% 2.38/1.65  Main loop            : 0.26
% 2.38/1.65  Inferencing          : 0.00
% 2.38/1.65  Reduction            : 0.01
% 2.38/1.65  Demodulation         : 0.01
% 2.38/1.65  BG Simplification    : 0.01
% 2.38/1.65  Subsumption          : 0.02
% 2.38/1.65  Abstraction          : 0.00
% 2.38/1.65  MUC search           : 0.00
% 2.38/1.65  Cooper               : 0.00
% 2.38/1.65  Total                : 0.70
% 2.38/1.65  Index Insertion      : 0.00
% 2.38/1.65  Index Deletion       : 0.00
% 2.38/1.65  Index Matching       : 0.00
% 2.38/1.65  BG Taut test         : 0.00
%------------------------------------------------------------------------------