TSTP Solution File: ANA139_1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ANA139_1 : TPTP v8.2.0. Released v8.2.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 : n023.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:32:59 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp > #skF_2

%Foreground sorts:

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

tff(c,type,
    c: $real ).

tff(a,type,
    a: $real ).

%Foreground operators:
tff('#skF_2',type,
    '#skF_2': $real > $real ).

tff(f_59,negated_conjecture,
    ~ ! [Epsilona: $real] :
        ( $less(0,Epsilona)
       => ? [Deltaa: $real] :
            ( $less(0,Deltaa)
            & ! [Xa: $real] :
                ( ( ( Xa != a )
                  & ( $greatereq($difference(Xa,a),0)
                   => $less($difference(Xa,a),Deltaa) )
                  & ( ~ $greatereq($difference(Xa,a),0)
                   => $less($uminus($difference(Xa,a)),Deltaa) ) )
               => ( ( $greatereq($difference(c,c),0)
                   => $less($difference(c,c),Epsilona) )
                  & ( ~ $greatereq($difference(c,c),0)
                   => $less($uminus($difference(c,c)),Epsilona) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_1) ).

tff(c_11,plain,
    ! [Delta_4a: $real] :
      ( ~ $less(0,Delta_4a)
      | ~ $greatereq($difference(c,c),0)
      | ~ $less($difference(c,c),'#skF_1') ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_12,plain,
    ! [Delta_4a: $real] :
      ( ~ $less(0,Delta_4a)
      | ~ $lesseq(0,$difference(c,c))
      | ~ $less($difference(c,c),'#skF_1') ),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_11]) ).

tff(c_27,plain,
    ~ $less($difference(c,c),'#skF_1'),
    inference(splitLeft,[status(thm)],[c_12]) ).

tff(c_1,plain,
    $less(0,'#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_2,plain,
    ~ $lesseq('#skF_1',0),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).

tff(c_28,plain,
    $false,
    inference(close,[status(thm),theory('LFA')],[c_27,c_2]) ).

tff(c_29,plain,
    ! [Delta_4a: $real] :
      ( ~ $lesseq(0,$difference(c,c))
      | ~ $less(0,Delta_4a) ),
    inference(splitRight,[status(thm)],[c_12]) ).

tff(c_32,plain,
    ~ $lesseq(0,$difference(c,c)),
    inference(splitLeft,[status(thm)],[c_29]) ).

tff(c_33,plain,
    $false,
    inference(close,[status(thm),theory('LFA')],[c_32]) ).

tff(c_34,plain,
    ! [Delta_4a: $real] : ~ $less(0,Delta_4a),
    inference(splitRight,[status(thm)],[c_29]) ).

tff(c_38,plain,
    $false,
    inference(quantifierElimination,[status(thm),theory('LFA')],[c_34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem  : ANA139_1 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.15  % 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.15/0.36  % Computer : n023.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 15:47:07 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 3.18/1.82  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.18/1.83  
% 3.18/1.83  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.18/1.86  
% 3.18/1.86  Inference rules
% 3.18/1.86  ----------------------
% 3.18/1.86  #Ref     : 0
% 3.18/1.86  #Sup     : 0
% 3.18/1.86  #Fact    : 0
% 3.18/1.86  #Define  : 0
% 3.18/1.86  #Split   : 4
% 3.18/1.86  #Chain   : 0
% 3.18/1.86  #Close   : 2
% 3.18/1.86  
% 3.18/1.86  Ordering : LPO
% 3.18/1.86  
% 3.18/1.86  Simplification rules
% 3.18/1.86  ----------------------
% 3.18/1.86  #Subsume      : 1
% 3.18/1.86  #Demod        : 0
% 3.18/1.86  #Tautology    : 0
% 3.18/1.86  #SimpNegUnit  : 0
% 3.18/1.86  #BackRed      : 0
% 3.18/1.86  
% 3.18/1.86  #Partial instantiations: 0
% 3.18/1.86  #Strategies tried      : 1
% 3.18/1.86  
% 3.18/1.86  Timing (in seconds)
% 3.18/1.86  ----------------------
% 3.18/1.86  Preprocessing        : 0.57
% 3.18/1.86  Parsing              : 0.27
% 3.18/1.86  CNF conversion       : 0.03
% 3.18/1.86  Main loop            : 0.22
% 3.18/1.86  Inferencing          : 0.01
% 3.18/1.86  Reduction            : 0.02
% 3.18/1.86  Demodulation         : 0.01
% 3.18/1.86  BG Simplification    : 0.02
% 3.18/1.86  Subsumption          : 0.02
% 3.18/1.86  Abstraction          : 0.01
% 3.18/1.86  MUC search           : 0.06
% 3.18/1.86  Cooper               : 0.00
% 3.18/1.86  Total                : 0.83
% 3.18/1.86  Index Insertion      : 0.00
% 3.18/1.86  Index Deletion       : 0.00
% 3.18/1.86  Index Matching       : 0.00
% 3.18/1.86  BG Taut test         : 0.00
%------------------------------------------------------------------------------