TSTP Solution File: ARI653_1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ARI653_1 : TPTP v8.1.2. Released v6.3.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 : n004.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:11 EDT 2023

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

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

%Foreground sorts:

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

%Foreground operators:

tff(f_30,axiom,
    $greatereq(6,$product(7,a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

tff(f_31,axiom,
    $lesseq(1,$product(5,a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_001) ).

tff(c_1,plain,
    $greatereq(6,$product(7,a)),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_6,plain,
    ~ $less(0,a),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).

tff(c_3,plain,
    $lesseq(1,$product(5,a)),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

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

tff(c_7,plain,
    $false,
    inference(close,[status(thm),theory('LIA')],[c_6,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : ARI653_1 : TPTP v8.1.2. Released v6.3.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.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Fri Aug  4 00:05:41 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 2.45/1.59  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.45/1.60  
% 2.45/1.60  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.60/1.64  
% 2.60/1.64  Inference rules
% 2.60/1.64  ----------------------
% 2.60/1.64  #Ref     : 0
% 2.60/1.64  #Sup     : 0
% 2.60/1.64  #Fact    : 0
% 2.60/1.64  #Define  : 0
% 2.60/1.64  #Split   : 0
% 2.60/1.64  #Chain   : 0
% 2.60/1.64  #Close   : 1
% 2.60/1.64  
% 2.60/1.64  Ordering : LPO
% 2.60/1.64  
% 2.60/1.64  Simplification rules
% 2.60/1.64  ----------------------
% 2.60/1.64  #Subsume      : 0
% 2.60/1.64  #Demod        : 0
% 2.60/1.64  #Tautology    : 0
% 2.60/1.64  #SimpNegUnit  : 0
% 2.60/1.64  #BackRed      : 0
% 2.60/1.64  
% 2.60/1.64  #Partial instantiations: 0
% 2.60/1.64  #Strategies tried      : 1
% 2.60/1.64  
% 2.60/1.64  Timing (in seconds)
% 2.60/1.64  ----------------------
% 2.60/1.64  Preprocessing        : 0.46
% 2.60/1.64  Parsing              : 0.26
% 2.60/1.64  CNF conversion       : 0.02
% 2.60/1.64  Main loop            : 0.08
% 2.60/1.64  Inferencing          : 0.00
% 2.60/1.64  Reduction            : 0.01
% 2.60/1.64  Demodulation         : 0.00
% 2.60/1.64  BG Simplification    : 0.02
% 2.60/1.64  Subsumption          : 0.02
% 2.60/1.64  Abstraction          : 0.00
% 2.60/1.64  MUC search           : 0.00
% 2.60/1.64  Cooper               : 0.02
% 2.60/1.64  Total                : 0.59
% 2.60/1.64  Index Insertion      : 0.00
% 2.60/1.64  Index Deletion       : 0.00
% 2.60/1.64  Index Matching       : 0.00
% 2.60/1.65  BG Taut test         : 0.00
%------------------------------------------------------------------------------