TSTP Solution File: HEN009-6 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : HEN009-6 : 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 : 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:18 EDT 2023

% Result   : Unsatisfiable 14.92s 5.29s
% Output   : CNFRefutation 15.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   56 (  25 unt;   8 typ;   0 def)
%            Number of atoms       :   76 (  27 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   59 (  31   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   55 (;  55   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ less_equal > divide > #nlpp > zero > identity > d > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_100,axiom,
    b != d,
    file(unknown,unknown) ).

tff(f_98,axiom,
    divide(identity,c) = d,
    file(unknown,unknown) ).

tff(f_74,axiom,
    ! [X] : less_equal(X,identity),
    file(unknown,unknown) ).

tff(f_97,axiom,
    divide(identity,b) = c,
    file(unknown,unknown) ).

tff(f_93,axiom,
    ! [X,Y,Z] :
      ( ~ less_equal(X,Y)
      | less_equal(divide(X,Z),divide(Y,Z)) ),
    file(unknown,unknown) ).

tff(f_88,axiom,
    ! [X,Y,Z] :
      ( ~ less_equal(divide(X,Y),Z)
      | less_equal(divide(X,Z),Y) ),
    file(unknown,unknown) ).

tff(f_71,axiom,
    ! [X,Y] :
      ( ~ less_equal(X,Y)
      | ~ less_equal(Y,X)
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(f_81,axiom,
    ! [X] : ( divide(zero,X) = zero ),
    file(unknown,unknown) ).

tff(f_96,axiom,
    divide(identity,a) = b,
    file(unknown,unknown) ).

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

tff(f_53,axiom,
    ! [X,Y] :
      ( ( divide(X,Y) != zero )
      | less_equal(X,Y) ),
    file(unknown,unknown) ).

tff(c_34,plain,
    d != b,
    inference(cnfTransformation,[status(thm)],[f_100]) ).

tff(c_32,plain,
    divide(identity,c) = d,
    inference(cnfTransformation,[status(thm)],[f_98]) ).

tff(c_14,plain,
    ! [X_13] : less_equal(X_13,identity),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_30,plain,
    divide(identity,b) = c,
    inference(cnfTransformation,[status(thm)],[f_97]) ).

tff(c_311,plain,
    ! [X_45,Z_46,Y_47] :
      ( less_equal(divide(X_45,Z_46),divide(Y_47,Z_46))
      | ~ less_equal(X_45,Y_47) ),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

tff(c_336,plain,
    ! [X_45] :
      ( less_equal(divide(X_45,b),c)
      | ~ less_equal(X_45,identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_30,c_311]) ).

tff(c_548,plain,
    ! [X_53] : less_equal(divide(X_53,b),c),
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_336]) ).

tff(c_22,plain,
    ! [X_17,Z_19,Y_18] :
      ( less_equal(divide(X_17,Z_19),Y_18)
      | ~ less_equal(divide(X_17,Y_18),Z_19) ),
    inference(cnfTransformation,[status(thm)],[f_88]) ).

tff(c_620,plain,
    ! [X_55] : less_equal(divide(X_55,c),b),
    inference(resolution,[status(thm)],[c_548,c_22]) ).

tff(c_632,plain,
    less_equal(d,b),
    inference(superposition,[status(thm),theory(equality)],[c_32,c_620]) ).

tff(c_12,plain,
    ! [Y_12,X_11] :
      ( ( Y_12 = X_11 )
      | ~ less_equal(Y_12,X_11)
      | ~ less_equal(X_11,Y_12) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_683,plain,
    ( ( d = b )
    | ~ less_equal(b,d) ),
    inference(resolution,[status(thm)],[c_632,c_12]) ).

tff(c_689,plain,
    ~ less_equal(b,d),
    inference(negUnitSimplification,[status(thm)],[c_34,c_683]) ).

tff(c_330,plain,
    ! [X_45] :
      ( less_equal(divide(X_45,c),d)
      | ~ less_equal(X_45,identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_32,c_311]) ).

tff(c_488,plain,
    ! [X_51] : less_equal(divide(X_51,c),d),
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_330]) ).

tff(c_507,plain,
    ! [X_51] : less_equal(divide(X_51,d),c),
    inference(resolution,[status(thm)],[c_488,c_22]) ).

tff(c_18,plain,
    ! [X_15] : ( divide(zero,X_15) = zero ),
    inference(cnfTransformation,[status(thm)],[f_81]) ).

tff(c_28,plain,
    divide(identity,a) = b,
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_360,plain,
    ! [X_45] :
      ( less_equal(divide(X_45,a),b)
      | ~ less_equal(X_45,identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_28,c_311]) ).

tff(c_584,plain,
    ! [X_54] : less_equal(divide(X_54,a),b),
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_360]) ).

tff(c_735,plain,
    ! [X_57] : less_equal(divide(X_57,b),a),
    inference(resolution,[status(thm)],[c_584,c_22]) ).

tff(c_749,plain,
    less_equal(c,a),
    inference(superposition,[status(thm),theory(equality)],[c_30,c_735]) ).

tff(c_2,plain,
    ! [X_1,Y_2] :
      ( ( divide(X_1,Y_2) = zero )
      | ~ less_equal(X_1,Y_2) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_770,plain,
    divide(c,a) = zero,
    inference(resolution,[status(thm)],[c_749,c_2]) ).

tff(c_24,plain,
    ! [X_20,Z_22,Y_21] :
      ( less_equal(divide(X_20,Z_22),divide(Y_21,Z_22))
      | ~ less_equal(X_20,Y_21) ),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

tff(c_9073,plain,
    ! [X_186] :
      ( less_equal(divide(X_186,a),zero)
      | ~ less_equal(X_186,c) ),
    inference(superposition,[status(thm),theory(equality)],[c_770,c_24]) ).

tff(c_4,plain,
    ! [X_3,Y_4] :
      ( less_equal(X_3,Y_4)
      | ( divide(X_3,Y_4) != zero ) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_191,plain,
    ! [Y_36,X_37] :
      ( ( Y_36 = X_37 )
      | ~ less_equal(Y_36,X_37)
      | ~ less_equal(X_37,Y_36) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_200,plain,
    ! [Y_4,X_3] :
      ( ( Y_4 = X_3 )
      | ~ less_equal(Y_4,X_3)
      | ( divide(X_3,Y_4) != zero ) ),
    inference(resolution,[status(thm)],[c_4,c_191]) ).

tff(c_9076,plain,
    ! [X_186] :
      ( ( divide(X_186,a) = zero )
      | ( divide(zero,divide(X_186,a)) != zero )
      | ~ less_equal(X_186,c) ),
    inference(resolution,[status(thm)],[c_9073,c_200]) ).

tff(c_9139,plain,
    ! [X_187] :
      ( ( divide(X_187,a) = zero )
      | ~ less_equal(X_187,c) ),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_9076]) ).

tff(c_9202,plain,
    ! [X_51] : ( divide(divide(X_51,d),a) = zero ),
    inference(resolution,[status(thm)],[c_507,c_9139]) ).

tff(c_222,plain,
    ! [X_39,Z_40,Y_41] :
      ( less_equal(divide(X_39,Z_40),Y_41)
      | ~ less_equal(divide(X_39,Y_41),Z_40) ),
    inference(cnfTransformation,[status(thm)],[f_88]) ).

tff(c_8167,plain,
    ! [X_174,Y_175,Y_176] :
      ( less_equal(divide(X_174,Y_175),Y_176)
      | ( divide(divide(X_174,Y_176),Y_175) != zero ) ),
    inference(resolution,[status(thm)],[c_4,c_222]) ).

tff(c_31831,plain,
    ! [Y_309] :
      ( less_equal(b,Y_309)
      | ( divide(divide(identity,Y_309),a) != zero ) ),
    inference(superposition,[status(thm),theory(equality)],[c_28,c_8167]) ).

tff(c_31849,plain,
    less_equal(b,d),
    inference(superposition,[status(thm),theory(equality)],[c_9202,c_31831]) ).

tff(c_31881,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_689,c_31849]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : HEN009-6 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14  % 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.14/0.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 13:04:22 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 14.92/5.29  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.92/5.29  
% 14.92/5.29  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.29/5.32  
% 15.29/5.32  Inference rules
% 15.29/5.32  ----------------------
% 15.29/5.32  #Ref     : 0
% 15.29/5.32  #Sup     : 8115
% 15.29/5.32  #Fact    : 0
% 15.29/5.32  #Define  : 0
% 15.29/5.32  #Split   : 11
% 15.29/5.32  #Chain   : 0
% 15.29/5.32  #Close   : 0
% 15.29/5.32  
% 15.29/5.32  Ordering : KBO
% 15.29/5.32  
% 15.29/5.32  Simplification rules
% 15.29/5.32  ----------------------
% 15.29/5.32  #Subsume      : 1660
% 15.29/5.32  #Demod        : 8506
% 15.29/5.32  #Tautology    : 4543
% 15.29/5.32  #SimpNegUnit  : 194
% 15.29/5.32  #BackRed      : 28
% 15.29/5.32  
% 15.29/5.32  #Partial instantiations: 0
% 15.29/5.32  #Strategies tried      : 1
% 15.29/5.32  
% 15.29/5.32  Timing (in seconds)
% 15.29/5.32  ----------------------
% 15.29/5.33  Preprocessing        : 0.47
% 15.29/5.33  Parsing              : 0.24
% 15.29/5.33  CNF conversion       : 0.02
% 15.29/5.33  Main loop            : 3.80
% 15.29/5.33  Inferencing          : 0.85
% 15.29/5.33  Reduction            : 1.98
% 15.29/5.33  Demodulation         : 1.57
% 15.29/5.33  BG Simplification    : 0.06
% 15.29/5.33  Subsumption          : 0.72
% 15.29/5.33  Abstraction          : 0.07
% 15.29/5.33  MUC search           : 0.00
% 15.29/5.33  Cooper               : 0.00
% 15.29/5.33  Total                : 4.32
% 15.29/5.33  Index Insertion      : 0.00
% 15.29/5.33  Index Deletion       : 0.00
% 15.29/5.33  Index Matching       : 0.00
% 15.29/5.33  BG Taut test         : 0.00
%------------------------------------------------------------------------------