TSTP Solution File: ARI608_1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ARI608_1 : 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/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 : n007.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:06 EDT 2023

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

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

%Foreground sorts:

%Background operators:
tff(c,type,
    c: $int ).

tff('#skE_2',type,
    '#skE_2': $int ).

tff('#skE_1',type,
    '#skE_1': $int ).

tff(b,type,
    b: $int ).

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

%Foreground operators:
tff(f,type,
    f: $int > $int ).

tff(f_38,negated_conjecture,
    ~ ( ( ! [Xa: $int,Ya: $int] :
            ( $lesseq(Xa,Ya)
           => $lesseq(f(Xa),f(Ya)) )
        & $lesseq(a,b)
        & $less(b,c) )
     => $lesseq(f(a),f(c)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f_mon_implies_trans) ).

tff(c_2,plain,
    ~ $lesseq(f(a),f(c)),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_15,plain,
    $less(f(c),f(a)),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).

tff(c_20,plain,
    f(a) = '#skE_2',
    inference(define,[status(thm),theory(equality)],[c_15]) ).

tff(c_19,plain,
    f(c) = '#skE_1',
    inference(define,[status(thm),theory(equality)],[c_15]) ).

tff(c_17,plain,
    $less(f(c),f(a)),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).

tff(c_31,plain,
    $less('#skE_1','#skE_2'),
    inference(demodulation,[status(thm),theory(equality)],[c_20,c_19,c_17]) ).

tff(c_27,plain,
    f(c) = '#skE_1',
    inference(define,[status(thm),theory(equality)],[c_15]) ).

tff(c_63,plain,
    f(a) = '#skE_2',
    inference(define,[status(thm),theory(equality)],[c_15]) ).

tff(c_7,plain,
    ! [X_1a: $int,Y_2a: $int] :
      ( $lesseq(f(X_1a),f(Y_2a))
      | ~ $lesseq(X_1a,Y_2a) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_9,plain,
    ! [Y_2a: $int,X_1a: $int] :
      ( ~ $less(f(Y_2a),f(X_1a))
      | $less(Y_2a,X_1a) ),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_7]) ).

tff(c_104,plain,
    ! [Y_23a: $int] :
      ( ~ $less(f(Y_23a),'#skE_2')
      | $less(Y_23a,a) ),
    inference(superposition,[status(thm),theory(equality)],[c_63,c_9]) ).

tff(c_110,plain,
    ( ~ $less('#skE_1','#skE_2')
    | $less(c,a) ),
    inference(superposition,[status(thm),theory(equality)],[c_27,c_104]) ).

tff(c_117,plain,
    $less(c,a),
    inference(demodulation,[status(thm),theory(equality)],[c_31,c_110]) ).

tff(c_11,plain,
    $less(b,c),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_5,plain,
    $lesseq(a,b),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_10,plain,
    ~ $less(b,a),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).

tff(c_118,plain,
    $false,
    inference(close,[status(thm),theory('LIA')],[c_117,c_11,c_10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : ARI608_1 : TPTP v8.1.2. Released v5.1.0.
% 0.00/0.15  % 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.17/0.36  % Computer : n007.cluster.edu
% 0.17/0.36  % Model    : x86_64 x86_64
% 0.17/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36  % Memory   : 8042.1875MB
% 0.17/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36  % CPULimit : 300
% 0.17/0.36  % WCLimit  : 300
% 0.17/0.36  % DateTime : Fri Aug  4 00:00:09 EDT 2023
% 0.17/0.36  % CPUTime  : 
% 3.13/1.92  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.13/1.93  
% 3.13/1.93  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.25/1.96  
% 3.25/1.96  Inference rules
% 3.25/1.96  ----------------------
% 3.25/1.96  #Ref     : 0
% 3.25/1.96  #Sup     : 12
% 3.25/1.96  #Fact    : 0
% 3.25/1.96  #Define  : 2
% 3.25/1.96  #Split   : 1
% 3.25/1.96  #Chain   : 0
% 3.25/1.96  #Close   : 1
% 3.25/1.96  
% 3.25/1.96  Ordering : LPO
% 3.25/1.96  
% 3.25/1.96  Simplification rules
% 3.25/1.96  ----------------------
% 3.25/1.96  #Subsume      : 0
% 3.25/1.96  #Demod        : 3
% 3.25/1.96  #Tautology    : 5
% 3.25/1.96  #SimpNegUnit  : 0
% 3.25/1.96  #BackRed      : 0
% 3.25/1.96  
% 3.25/1.96  #Partial instantiations: 0
% 3.25/1.96  #Strategies tried      : 1
% 3.25/1.96  
% 3.25/1.96  Timing (in seconds)
% 3.25/1.96  ----------------------
% 3.25/1.97  Preprocessing        : 0.58
% 3.25/1.97  Parsing              : 0.32
% 3.25/1.97  CNF conversion       : 0.02
% 3.25/1.97  Main loop            : 0.25
% 3.25/1.97  Inferencing          : 0.06
% 3.25/1.97  Reduction            : 0.04
% 3.25/1.97  Demodulation         : 0.03
% 3.25/1.97  BG Simplification    : 0.03
% 3.25/1.97  Subsumption          : 0.05
% 3.25/1.97  Abstraction          : 0.01
% 3.25/1.97  MUC search           : 0.01
% 3.25/1.97  Cooper               : 0.04
% 3.25/1.97  Total                : 0.89
% 3.25/1.97  Index Insertion      : 0.00
% 3.25/1.97  Index Deletion       : 0.00
% 3.25/1.97  Index Matching       : 0.00
% 3.25/1.97  BG Taut test         : 0.00
%------------------------------------------------------------------------------