TSTP Solution File: ARI215_1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ARI215_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/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 : n002.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:24 EDT 2023

% Result   : Theorem 2.32s 1.54s
% Output   : CNFRefutation 2.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    3 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :    3 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :    8 (   2 atm;   2 fun;   2 num;   2 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    :    2 (   0 usr;   1 con; 0-1 aty)
%            Number of variables   :    2 (;   1   !;   1   ?;   2   :)

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

%Foreground sorts:

%Background operators:

%Foreground operators:

tff(f_30,negated_conjecture,
    ~ ? [Xa: $rat] : $lesseq(Xa,$uminus(3/5)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rat_lesseq_problem_13) ).

tff(c_1,plain,
    ! [X_1a: $rat] : ~ $lesseq(X_1a,$uminus(3/5)),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_2,plain,
    $false,
    inference(simple,[status(thm)],[c_1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : ARI215_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.14  % 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.18/0.36  % Computer : n002.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 : Fri Aug  4 00:27:02 EDT 2023
% 0.18/0.36  % CPUTime  : 
% 2.32/1.54  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.32/1.55  
% 2.32/1.55  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.41/1.58  
% 2.41/1.58  Inference rules
% 2.41/1.58  ----------------------
% 2.41/1.58  #Ref     : 0
% 2.41/1.58  #Sup     : 0
% 2.41/1.58  #Fact    : 0
% 2.41/1.58  #Define  : 0
% 2.41/1.58  #Split   : 0
% 2.41/1.58  #Chain   : 0
% 2.41/1.58  #Close   : 0
% 2.41/1.58  
% 2.41/1.58  Ordering : LPO
% 2.41/1.58  
% 2.41/1.58  Simplification rules
% 2.41/1.58  ----------------------
% 2.41/1.58  #Subsume      : 0
% 2.41/1.58  #Demod        : 0
% 2.41/1.58  #Tautology    : 0
% 2.41/1.58  #SimpNegUnit  : 0
% 2.41/1.58  #BackRed      : 0
% 2.41/1.58  
% 2.41/1.58  #Partial instantiations: 0
% 2.41/1.58  #Strategies tried      : 1
% 2.41/1.58  
% 2.41/1.58  Timing (in seconds)
% 2.41/1.58  ----------------------
% 2.41/1.58  Preprocessing        : 0.41
% 2.41/1.58  Parsing              : 0.24
% 2.41/1.58  CNF conversion       : 0.02
% 2.41/1.58  Main loop            : 0.05
% 2.41/1.58  Inferencing          : 0.00
% 2.41/1.58  Reduction            : 0.01
% 2.41/1.58  Demodulation         : 0.00
% 2.41/1.58  BG Simplification    : 0.01
% 2.41/1.58  Subsumption          : 0.02
% 2.47/1.58  Abstraction          : 0.00
% 2.47/1.58  MUC search           : 0.00
% 2.47/1.58  Cooper               : 0.00
% 2.47/1.58  Total                : 0.50
% 2.47/1.58  Index Insertion      : 0.00
% 2.47/1.58  Index Deletion       : 0.00
% 2.47/1.58  Index Matching       : 0.00
% 2.47/1.58  BG Taut test         : 0.00
%------------------------------------------------------------------------------