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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : FLD037-1 : 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/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 : 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:37:33 EDT 2023

% Result   : Unsatisfiable 24.67s 12.67s
% Output   : CNFRefutation 24.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   38 (  11 unt;  11 typ;   0 def)
%            Number of atoms       :   59 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   63 (  31   ~;  32   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (   7   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   27 (;  27   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

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

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

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(equalish,type,
    equalish: ( $i * $i ) > $o ).

tff(f_239,axiom,
    ~ equalish(a,additive_identity),
    file(unknown,unknown) ).

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

tff(f_147,axiom,
    ! [X] :
      ( defined(multiplicative_inverse(X))
      | ~ defined(X)
      | equalish(X,additive_identity) ),
    file(unknown,unknown) ).

tff(f_240,axiom,
    equalish(a,b),
    file(unknown,unknown) ).

tff(f_98,axiom,
    ! [X] :
      ( equalish(multiply(X,multiplicative_inverse(X)),multiplicative_identity)
      | ~ defined(X)
      | equalish(X,additive_identity) ),
    file(unknown,unknown) ).

tff(f_199,axiom,
    ! [X,Y] :
      ( equalish(X,Y)
      | ~ equalish(Y,X) ),
    file(unknown,unknown) ).

tff(f_223,axiom,
    ! [X,Z,Y] :
      ( equalish(multiply(X,Z),multiply(Y,Z))
      | ~ defined(Z)
      | ~ equalish(X,Y) ),
    file(unknown,unknown) ).

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

tff(f_242,axiom,
    ~ equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))),
    file(unknown,unknown) ).

tff(c_60,plain,
    ~ equalish(a,additive_identity),
    inference(cnfTransformation,[status(thm)],[f_239]) ).

tff(c_56,plain,
    defined(a),
    inference(cnfTransformation,[status(thm)],[f_236]) ).

tff(c_30,plain,
    ! [X_23] :
      ( equalish(X_23,additive_identity)
      | ~ defined(X_23)
      | defined(multiplicative_inverse(X_23)) ),
    inference(cnfTransformation,[status(thm)],[f_147]) ).

tff(c_62,plain,
    equalish(a,b),
    inference(cnfTransformation,[status(thm)],[f_240]) ).

tff(c_418,plain,
    ! [X_87] :
      ( equalish(X_87,additive_identity)
      | ~ defined(X_87)
      | equalish(multiply(X_87,multiplicative_inverse(X_87)),multiplicative_identity) ),
    inference(cnfTransformation,[status(thm)],[f_98]) ).

tff(c_44,plain,
    ! [Y_38,X_37] :
      ( ~ equalish(Y_38,X_37)
      | equalish(X_37,Y_38) ),
    inference(cnfTransformation,[status(thm)],[f_199]) ).

tff(c_427,plain,
    ! [X_87] :
      ( equalish(multiplicative_identity,multiply(X_87,multiplicative_inverse(X_87)))
      | equalish(X_87,additive_identity)
      | ~ defined(X_87) ),
    inference(resolution,[status(thm)],[c_418,c_44]) ).

tff(c_686,plain,
    ! [X_98,Y_99,Z_100] :
      ( ~ equalish(X_98,Y_99)
      | ~ defined(Z_100)
      | equalish(multiply(X_98,Z_100),multiply(Y_99,Z_100)) ),
    inference(cnfTransformation,[status(thm)],[f_223]) ).

tff(c_46,plain,
    ! [Y_41,Z_40,X_39] :
      ( ~ equalish(Y_41,Z_40)
      | ~ equalish(X_39,Y_41)
      | equalish(X_39,Z_40) ),
    inference(cnfTransformation,[status(thm)],[f_207]) ).

tff(c_8575,plain,
    ! [X_285,X_286,Z_287,Y_288] :
      ( ~ equalish(X_285,multiply(X_286,Z_287))
      | equalish(X_285,multiply(Y_288,Z_287))
      | ~ equalish(X_286,Y_288)
      | ~ defined(Z_287) ),
    inference(resolution,[status(thm)],[c_686,c_46]) ).

tff(c_77469,plain,
    ! [Y_841,X_842] :
      ( equalish(multiplicative_identity,multiply(Y_841,multiplicative_inverse(X_842)))
      | ~ equalish(X_842,Y_841)
      | ~ defined(multiplicative_inverse(X_842))
      | equalish(X_842,additive_identity)
      | ~ defined(X_842) ),
    inference(resolution,[status(thm)],[c_427,c_8575]) ).

tff(c_64,plain,
    ~ equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))),
    inference(cnfTransformation,[status(thm)],[f_242]) ).

tff(c_77516,plain,
    ( ~ equalish(a,b)
    | ~ defined(multiplicative_inverse(a))
    | equalish(a,additive_identity)
    | ~ defined(a) ),
    inference(resolution,[status(thm)],[c_77469,c_64]) ).

tff(c_77545,plain,
    ( ~ defined(multiplicative_inverse(a))
    | equalish(a,additive_identity) ),
    inference(demodulation,[status(thm),theory(equality)],[c_56,c_62,c_77516]) ).

tff(c_77546,plain,
    ~ defined(multiplicative_inverse(a)),
    inference(negUnitSimplification,[status(thm)],[c_60,c_77545]) ).

tff(c_77550,plain,
    ( equalish(a,additive_identity)
    | ~ defined(a) ),
    inference(resolution,[status(thm)],[c_30,c_77546]) ).

tff(c_77553,plain,
    equalish(a,additive_identity),
    inference(demodulation,[status(thm),theory(equality)],[c_56,c_77550]) ).

tff(c_77555,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_60,c_77553]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : FLD037-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.13  % 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.12/0.34  % Computer : n004.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Thu Aug  3 19:43:56 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 24.67/12.67  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 24.74/12.68  
% 24.74/12.68  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 24.74/12.70  
% 24.74/12.70  Inference rules
% 24.74/12.70  ----------------------
% 24.74/12.70  #Ref     : 0
% 24.74/12.70  #Sup     : 15515
% 24.74/12.70  #Fact    : 12
% 24.74/12.70  #Define  : 0
% 24.74/12.70  #Split   : 16
% 24.74/12.70  #Chain   : 0
% 24.74/12.70  #Close   : 0
% 24.74/12.70  
% 24.74/12.70  Ordering : KBO
% 24.74/12.70  
% 24.74/12.70  Simplification rules
% 24.74/12.70  ----------------------
% 24.74/12.70  #Subsume      : 4623
% 24.74/12.70  #Demod        : 9432
% 24.74/12.70  #Tautology    : 3304
% 24.74/12.70  #SimpNegUnit  : 1066
% 24.74/12.70  #BackRed      : 0
% 24.74/12.70  
% 24.74/12.70  #Partial instantiations: 0
% 24.74/12.70  #Strategies tried      : 1
% 24.74/12.70  
% 24.74/12.70  Timing (in seconds)
% 24.74/12.70  ----------------------
% 24.74/12.71  Preprocessing        : 0.49
% 24.74/12.71  Parsing              : 0.27
% 24.74/12.71  CNF conversion       : 0.03
% 24.74/12.71  Main loop            : 11.16
% 24.74/12.71  Inferencing          : 2.04
% 24.74/12.71  Reduction            : 4.04
% 24.74/12.71  Demodulation         : 2.85
% 24.74/12.71  BG Simplification    : 0.09
% 24.74/12.71  Subsumption          : 4.29
% 24.74/12.71  Abstraction          : 0.12
% 24.74/12.71  MUC search           : 0.00
% 24.74/12.71  Cooper               : 0.00
% 24.74/12.71  Total                : 11.70
% 24.74/12.71  Index Insertion      : 0.00
% 24.74/12.71  Index Deletion       : 0.00
% 24.74/12.71  Index Matching       : 0.00
% 24.74/12.71  BG Taut test         : 0.00
%------------------------------------------------------------------------------