TSTP Solution File: FLD005-3 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : FLD005-3 : TPTP v8.1.2. Bugfixed v2.1.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 : n014.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:37:25 EDT 2023

% Result   : Unsatisfiable 15.82s 6.87s
% Output   : CNFRefutation 15.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   41 (   9 unt;  12 typ;   0 def)
%            Number of atoms       :   61 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   71 (  39   ~;  32   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   15 (   8   >;   7   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   45 (;  45   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > b > additive_identity > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

tff(additive_inverse,type,
    additive_inverse: $i > $i ).

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

tff(defined,type,
    defined: $i > $o ).

tff(multiplicative_inverse,type,
    multiplicative_inverse: $i > $i ).

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

tff(f_249,axiom,
    defined(a),
    file(unknown,unknown) ).

tff(f_164,axiom,
    ! [X] :
      ( defined(additive_inverse(X))
      | ~ defined(X) ),
    file(unknown,unknown) ).

tff(f_78,axiom,
    ! [X] :
      ( sum(additive_inverse(X),X,additive_identity)
      | ~ defined(X) ),
    file(unknown,unknown) ).

tff(f_83,axiom,
    ! [Y,X,Z] :
      ( sum(Y,X,Z)
      | ~ sum(X,Y,Z) ),
    file(unknown,unknown) ).

tff(f_250,axiom,
    defined(b),
    file(unknown,unknown) ).

tff(f_188,axiom,
    ! [X,Y] :
      ( sum(X,Y,add(X,Y))
      | ~ defined(X)
      | ~ defined(Y) ),
    file(unknown,unknown) ).

tff(f_73,axiom,
    ! [X] :
      ( sum(additive_identity,X,X)
      | ~ defined(X) ),
    file(unknown,unknown) ).

tff(f_57,axiom,
    ! [W,U,Z,X,Y,V] :
      ( sum(X,V,W)
      | ~ sum(X,Y,U)
      | ~ sum(Y,Z,V)
      | ~ sum(U,Z,W) ),
    file(unknown,unknown) ).

tff(f_253,axiom,
    ! [X] : ~ sum(a,X,b),
    file(unknown,unknown) ).

tff(c_54,plain,
    defined(a),
    inference(cnfTransformation,[status(thm)],[f_249]) ).

tff(c_30,plain,
    ! [X_51] :
      ( ~ defined(X_51)
      | defined(additive_inverse(X_51)) ),
    inference(cnfTransformation,[status(thm)],[f_164]) ).

tff(c_8,plain,
    ! [X_14] :
      ( ~ defined(X_14)
      | sum(additive_inverse(X_14),X_14,additive_identity) ),
    inference(cnfTransformation,[status(thm)],[f_78]) ).

tff(c_73,plain,
    ! [X_86,Y_87,Z_88] :
      ( ~ sum(X_86,Y_87,Z_88)
      | sum(Y_87,X_86,Z_88) ),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_78,plain,
    ! [X_14] :
      ( sum(X_14,additive_inverse(X_14),additive_identity)
      | ~ defined(X_14) ),
    inference(resolution,[status(thm)],[c_8,c_73]) ).

tff(c_56,plain,
    defined(b),
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_120,plain,
    ! [Y_102,X_103] :
      ( ~ defined(Y_102)
      | ~ defined(X_103)
      | sum(X_103,Y_102,add(X_103,Y_102)) ),
    inference(cnfTransformation,[status(thm)],[f_188]) ).

tff(c_10,plain,
    ! [X_16,Y_15,Z_17] :
      ( ~ sum(X_16,Y_15,Z_17)
      | sum(Y_15,X_16,Z_17) ),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_123,plain,
    ! [Y_102,X_103] :
      ( sum(Y_102,X_103,add(X_103,Y_102))
      | ~ defined(Y_102)
      | ~ defined(X_103) ),
    inference(resolution,[status(thm)],[c_120,c_10]) ).

tff(c_6,plain,
    ! [X_13] :
      ( ~ defined(X_13)
      | sum(additive_identity,X_13,X_13) ),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_275,plain,
    ! [U_130,W_132,Y_128,V_129,Z_127,X_131] :
      ( ~ sum(U_130,Z_127,W_132)
      | ~ sum(Y_128,Z_127,V_129)
      | ~ sum(X_131,Y_128,U_130)
      | sum(X_131,V_129,W_132) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_2302,plain,
    ! [Y_244,X_245,V_246,X_247] :
      ( ~ sum(Y_244,X_245,V_246)
      | ~ sum(X_247,Y_244,additive_identity)
      | sum(X_247,V_246,X_245)
      | ~ defined(X_245) ),
    inference(resolution,[status(thm)],[c_6,c_275]) ).

tff(c_35592,plain,
    ! [X_582,Y_583,X_584] :
      ( ~ sum(X_582,Y_583,additive_identity)
      | sum(X_582,add(X_584,Y_583),X_584)
      | ~ defined(Y_583)
      | ~ defined(X_584) ),
    inference(resolution,[status(thm)],[c_123,c_2302]) ).

tff(c_58,plain,
    ! [X_74] : ~ sum(a,X_74,b),
    inference(cnfTransformation,[status(thm)],[f_253]) ).

tff(c_35656,plain,
    ! [Y_583] :
      ( ~ sum(a,Y_583,additive_identity)
      | ~ defined(Y_583)
      | ~ defined(b) ),
    inference(resolution,[status(thm)],[c_35592,c_58]) ).

tff(c_35690,plain,
    ! [Y_585] :
      ( ~ sum(a,Y_585,additive_identity)
      | ~ defined(Y_585) ),
    inference(demodulation,[status(thm),theory(equality)],[c_56,c_35656]) ).

tff(c_35734,plain,
    ( ~ defined(additive_inverse(a))
    | ~ defined(a) ),
    inference(resolution,[status(thm)],[c_78,c_35690]) ).

tff(c_35765,plain,
    ~ defined(additive_inverse(a)),
    inference(demodulation,[status(thm),theory(equality)],[c_54,c_35734]) ).

tff(c_35768,plain,
    ~ defined(a),
    inference(resolution,[status(thm)],[c_30,c_35765]) ).

tff(c_35772,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_54,c_35768]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : FLD005-3 : TPTP v8.1.2. Bugfixed v2.1.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.14/0.35  % Computer : n014.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 19:42:48 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 15.82/6.87  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.82/6.88  
% 15.82/6.88  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.91/6.91  
% 15.91/6.91  Inference rules
% 15.91/6.91  ----------------------
% 15.91/6.91  #Ref     : 0
% 15.91/6.91  #Sup     : 7935
% 15.91/6.91  #Fact    : 6
% 15.91/6.91  #Define  : 0
% 15.91/6.91  #Split   : 9
% 15.91/6.91  #Chain   : 0
% 15.91/6.91  #Close   : 0
% 15.91/6.91  
% 15.91/6.91  Ordering : KBO
% 15.91/6.91  
% 15.91/6.91  Simplification rules
% 15.91/6.91  ----------------------
% 15.91/6.91  #Subsume      : 567
% 15.91/6.91  #Demod        : 5923
% 15.91/6.91  #Tautology    : 1738
% 15.91/6.91  #SimpNegUnit  : 203
% 15.91/6.91  #BackRed      : 0
% 15.91/6.91  
% 15.91/6.91  #Partial instantiations: 0
% 15.91/6.91  #Strategies tried      : 1
% 15.91/6.91  
% 15.91/6.91  Timing (in seconds)
% 15.91/6.91  ----------------------
% 15.91/6.91  Preprocessing        : 0.49
% 15.91/6.91  Parsing              : 0.27
% 15.91/6.91  CNF conversion       : 0.03
% 15.91/6.91  Main loop            : 5.36
% 15.91/6.91  Inferencing          : 1.03
% 15.91/6.91  Reduction            : 1.88
% 15.91/6.91  Demodulation         : 1.51
% 15.91/6.91  BG Simplification    : 0.08
% 15.91/6.91  Subsumption          : 1.98
% 15.91/6.91  Abstraction          : 0.08
% 15.91/6.91  MUC search           : 0.00
% 15.91/6.91  Cooper               : 0.00
% 15.91/6.91  Total                : 5.90
% 15.91/6.91  Index Insertion      : 0.00
% 15.91/6.91  Index Deletion       : 0.00
% 15.91/6.91  Index Matching       : 0.00
% 15.91/6.91  BG Taut test         : 0.00
%------------------------------------------------------------------------------