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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : HEN002-1 : 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/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 : n020.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.69s 1.71s
% Output   : CNFRefutation 2.84s
% 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_108,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_31,plain,
    ! [X_37,Y_38] :
      ( quotient(X_37,Y_38,zero)
      | ~ less_equal(X_37,Y_38) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

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

tff(c_40,plain,
    ~ less_equal(zero,x),
    inference(resolution,[status(thm)],[c_31,c_20]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : HEN002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.15/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.16/0.37  % Computer : n020.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu Aug  3 13:08:07 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 2.69/1.71  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.69/1.71  
% 2.69/1.71  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.84/1.74  
% 2.84/1.74  Inference rules
% 2.84/1.74  ----------------------
% 2.84/1.74  #Ref     : 0
% 2.84/1.74  #Sup     : 4
% 2.84/1.74  #Fact    : 0
% 2.84/1.74  #Define  : 0
% 2.84/1.74  #Split   : 0
% 2.84/1.74  #Chain   : 0
% 2.84/1.74  #Close   : 0
% 2.84/1.74  
% 2.84/1.74  Ordering : KBO
% 2.84/1.74  
% 2.84/1.74  Simplification rules
% 2.84/1.74  ----------------------
% 2.84/1.74  #Subsume      : 0
% 2.84/1.74  #Demod        : 2
% 2.84/1.74  #Tautology    : 2
% 2.84/1.74  #SimpNegUnit  : 0
% 2.84/1.74  #BackRed      : 0
% 2.84/1.74  
% 2.84/1.74  #Partial instantiations: 0
% 2.84/1.74  #Strategies tried      : 1
% 2.84/1.74  
% 2.84/1.74  Timing (in seconds)
% 2.84/1.74  ----------------------
% 2.84/1.74  Preprocessing        : 0.43
% 2.84/1.74  Parsing              : 0.24
% 2.84/1.74  CNF conversion       : 0.02
% 2.84/1.74  Main loop            : 0.16
% 2.84/1.74  Inferencing          : 0.07
% 2.84/1.74  Reduction            : 0.04
% 2.84/1.74  Demodulation         : 0.03
% 2.84/1.74  BG Simplification    : 0.01
% 2.84/1.74  Subsumption          : 0.04
% 2.84/1.74  Abstraction          : 0.01
% 2.84/1.74  MUC search           : 0.00
% 2.84/1.74  Cooper               : 0.00
% 2.84/1.74  Total                : 0.63
% 2.84/1.74  Index Insertion      : 0.00
% 2.84/1.74  Index Deletion       : 0.00
% 2.84/1.74  Index Matching       : 0.00
% 2.84/1.74  BG Taut test         : 0.00
%------------------------------------------------------------------------------