TSTP Solution File: HEN002-2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : HEN002-2 : TPTP v8.1.2. Released v1.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 : n012.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:42:11 EDT 2023

% Result   : Unsatisfiable 2.64s 1.68s
% Output   : CNFRefutation 2.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   14 (   6 unt;   6 typ;   0 def)
%            Number of atoms       :   10 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   5   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   3   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :    6 (;   6   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ quotient > less_equal > divide > #nlpp > zero > x > identity

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(less_equal,type,
    less_equal: ( $i * $i ) > $o ).

tff(divide,type,
    divide: ( $i * $i ) > $i ).

tff(x,type,
    x: $i ).

tff(quotient,type,
    quotient: ( $i * $i * $i ) > $o ).

tff(identity,type,
    identity: $i ).

tff(zero,type,
    zero: $i ).

tff(f_80,axiom,
    ! [X] : less_equal(zero,X),
    file(unknown,unknown) ).

tff(f_48,axiom,
    ! [X,Y] :
      ( ~ less_equal(X,Y)
      | quotient(X,Y,zero) ),
    file(unknown,unknown) ).

tff(f_111,axiom,
    ~ quotient(zero,x,zero),
    file(unknown,unknown) ).

tff(c_10,plain,
    ! [X_16] : less_equal(zero,X_16),
    inference(cnfTransformation,[status(thm)],[f_80]) ).

tff(c_44,plain,
    ! [X_39,Y_40] :
      ( quotient(X_39,Y_40,zero)
      | ~ less_equal(X_39,Y_40) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_22,plain,
    ~ quotient(zero,x,zero),
    inference(cnfTransformation,[status(thm)],[f_111]) ).

tff(c_53,plain,
    ~ less_equal(zero,x),
    inference(resolution,[status(thm)],[c_44,c_22]) ).

tff(c_60,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : HEN002-2 : TPTP v8.1.2. Released v1.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.15/0.36  % Computer : n012.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 13:04:07 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 2.64/1.68  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.69  
% 2.64/1.69  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.79/1.71  
% 2.79/1.71  Inference rules
% 2.79/1.71  ----------------------
% 2.79/1.71  #Ref     : 0
% 2.79/1.71  #Sup     : 6
% 2.79/1.71  #Fact    : 0
% 2.79/1.71  #Define  : 0
% 2.79/1.71  #Split   : 0
% 2.79/1.71  #Chain   : 0
% 2.79/1.71  #Close   : 0
% 2.79/1.71  
% 2.79/1.71  Ordering : KBO
% 2.79/1.71  
% 2.79/1.71  Simplification rules
% 2.79/1.71  ----------------------
% 2.79/1.71  #Subsume      : 0
% 2.79/1.71  #Demod        : 4
% 2.79/1.71  #Tautology    : 4
% 2.79/1.71  #SimpNegUnit  : 0
% 2.79/1.71  #BackRed      : 0
% 2.79/1.71  
% 2.79/1.71  #Partial instantiations: 0
% 2.79/1.71  #Strategies tried      : 1
% 2.79/1.71  
% 2.79/1.71  Timing (in seconds)
% 2.79/1.71  ----------------------
% 2.79/1.72  Preprocessing        : 0.44
% 2.79/1.72  Parsing              : 0.24
% 2.79/1.72  CNF conversion       : 0.02
% 2.79/1.72  Main loop            : 0.18
% 2.79/1.72  Inferencing          : 0.08
% 2.79/1.72  Reduction            : 0.04
% 2.79/1.72  Demodulation         : 0.03
% 2.79/1.72  BG Simplification    : 0.02
% 2.79/1.72  Subsumption          : 0.04
% 2.79/1.72  Abstraction          : 0.01
% 2.79/1.72  MUC search           : 0.00
% 2.79/1.72  Cooper               : 0.00
% 2.79/1.72  Total                : 0.66
% 2.79/1.72  Index Insertion      : 0.00
% 2.79/1.72  Index Deletion       : 0.00
% 2.79/1.72  Index Matching       : 0.00
% 2.79/1.72  BG Taut test         : 0.00
%------------------------------------------------------------------------------