TSTP Solution File: ARI020_1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ARI020_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 : n029.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:02 EDT 2023

% Result   : Theorem 2.07s 1.41s
% Output   : CNFRefutation 2.07s
% 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 :    2 (   2 avg)
%            Maximal term depth    :    2 (   2 avg)
%            Number arithmetic     :   10 (   2 atm;   4 fun;   4 num;   0 var)
%            Number of types       :    0 (   0 usr)
%            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   :    0 (;   0   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

%Foreground operators:

tff(f_29,negated_conjecture,
    ~ $lesseq($uminus(2),$uminus(2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n2_lesseq_n2) ).

tff(c_1,plain,
    ~ $lesseq($uminus(2),$uminus(2)),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_2,plain,
    $false,
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : ARI020_1 : TPTP v8.1.2. Released v5.0.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.18/0.35  % Computer : n029.cluster.edu
% 0.18/0.35  % Model    : x86_64 x86_64
% 0.18/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35  % Memory   : 8042.1875MB
% 0.18/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35  % CPULimit : 300
% 0.18/0.35  % WCLimit  : 300
% 0.18/0.35  % DateTime : Fri Aug  4 00:25:53 EDT 2023
% 0.18/0.35  % CPUTime  : 
% 2.07/1.41  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.07/1.41  
% 2.07/1.41  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.07/1.44  
% 2.07/1.44  Inference rules
% 2.07/1.44  ----------------------
% 2.07/1.44  #Ref     : 0
% 2.07/1.44  #Sup     : 0
% 2.07/1.44  #Fact    : 0
% 2.07/1.44  #Define  : 0
% 2.07/1.44  #Split   : 0
% 2.07/1.44  #Chain   : 0
% 2.07/1.44  #Close   : 0
% 2.07/1.44  
% 2.07/1.44  Ordering : LPO
% 2.07/1.44  
% 2.07/1.44  Simplification rules
% 2.07/1.44  ----------------------
% 2.07/1.44  #Subsume      : 0
% 2.07/1.44  #Demod        : 0
% 2.07/1.44  #Tautology    : 0
% 2.07/1.44  #SimpNegUnit  : 0
% 2.07/1.44  #BackRed      : 0
% 2.07/1.44  
% 2.07/1.44  #Partial instantiations: 0
% 2.07/1.44  #Strategies tried      : 1
% 2.07/1.44  
% 2.07/1.44  Timing (in seconds)
% 2.07/1.44  ----------------------
% 2.07/1.45  Preprocessing        : 0.36
% 2.07/1.45  Parsing              : 0.20
% 2.07/1.45  CNF conversion       : 0.01
% 2.07/1.45  Main loop            : 0.02
% 2.07/1.45  Inferencing          : 0.00
% 2.07/1.45  Reduction            : 0.00
% 2.07/1.45  Demodulation         : 0.00
% 2.07/1.45  BG Simplification    : 0.01
% 2.07/1.45  Subsumption          : 0.02
% 2.07/1.45  Abstraction          : 0.00
% 2.07/1.45  MUC search           : 0.00
% 2.07/1.45  Cooper               : 0.00
% 2.07/1.45  Total                : 0.43
% 2.07/1.45  Index Insertion      : 0.00
% 2.07/1.45  Index Deletion       : 0.00
% 2.07/1.45  Index Matching       : 0.00
% 2.07/1.45  BG Taut test         : 0.00
%------------------------------------------------------------------------------