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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : CAT003-3 : 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:34:35 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ equivalent > there_exists > f1 > compose > #nlpp > domain > codomain > h > g > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(f_169,axiom,
    g != h,
    file(unknown,unknown) ).

tff(f_101,axiom,
    ! [X,Y,Z] : ( compose(X,compose(Y,Z)) = compose(compose(X,Y),Z) ),
    file(unknown,unknown) ).

tff(f_167,axiom,
    compose(h,a) = compose(g,a),
    file(unknown,unknown) ).

tff(f_165,axiom,
    ! [X,Y,Z] :
      ( ( compose(X,compose(a,b)) != Y )
      | ( compose(Z,compose(a,b)) != Y )
      | ( X = Z ) ),
    file(unknown,unknown) ).

tff(c_44,plain,
    h != g,
    inference(cnfTransformation,[status(thm)],[f_169]) ).

tff(c_18,plain,
    ! [X_15,Y_16,Z_17] : ( compose(compose(X_15,Y_16),Z_17) = compose(X_15,compose(Y_16,Z_17)) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_42,plain,
    compose(h,a) = compose(g,a),
    inference(cnfTransformation,[status(thm)],[f_167]) ).

tff(c_217,plain,
    ! [X_59,Y_60,Z_61] : ( compose(compose(X_59,Y_60),Z_61) = compose(X_59,compose(Y_60,Z_61)) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_248,plain,
    ! [Z_61] : ( compose(compose(g,a),Z_61) = compose(h,compose(a,Z_61)) ),
    inference(superposition,[status(thm),theory(equality)],[c_42,c_217]) ).

tff(c_725235,plain,
    ! [Z_102003] : ( compose(h,compose(a,Z_102003)) = compose(g,compose(a,Z_102003)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_248]) ).

tff(c_38,plain,
    ! [Z_34,X_32] :
      ( ( Z_34 = X_32 )
      | ( compose(Z_34,compose(a,b)) != compose(X_32,compose(a,b)) ) ),
    inference(cnfTransformation,[status(thm)],[f_165]) ).

tff(c_725253,plain,
    ! [Z_34] :
      ( ( h = Z_34 )
      | ( compose(g,compose(a,b)) != compose(Z_34,compose(a,b)) ) ),
    inference(superposition,[status(thm),theory(equality)],[c_725235,c_38]) ).

tff(c_1099039,plain,
    h = g,
    inference(reflexivity,[status(thm),theory(equality)],[c_725253]) ).

tff(c_1099041,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_44,c_1099039]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : CAT003-3 : 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.35  % Computer : n012.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Aug  3 17:41:52 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 69.94/52.62  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 69.94/52.62  
% 69.94/52.62  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 69.94/52.64  
% 69.94/52.64  Inference rules
% 69.94/52.64  ----------------------
% 69.94/52.64  #Ref     : 5
% 69.94/52.64  #Sup     : 166379
% 69.94/52.64  #Fact    : 154
% 69.94/52.64  #Define  : 0
% 69.94/52.64  #Split   : 10
% 69.94/52.64  #Chain   : 0
% 69.94/52.64  #Close   : 0
% 69.94/52.64  
% 69.94/52.64  Ordering : KBO
% 69.94/52.64  
% 69.94/52.64  Simplification rules
% 69.94/52.64  ----------------------
% 69.94/52.64  #Subsume      : 82190
% 69.94/52.64  #Demod        : 55423
% 69.94/52.64  #Tautology    : 24986
% 69.94/52.64  #SimpNegUnit  : 2361
% 69.94/52.64  #BackRed      : 81
% 69.94/52.64  
% 69.94/52.64  #Partial instantiations: 205008
% 69.94/52.64  #Strategies tried      : 1
% 69.94/52.65  
% 69.94/52.65  Timing (in seconds)
% 69.94/52.65  ----------------------
% 69.94/52.65  Preprocessing        : 0.52
% 69.94/52.65  Parsing              : 0.25
% 69.94/52.65  CNF conversion       : 0.03
% 69.94/52.65  Main loop            : 51.06
% 69.94/52.65  Inferencing          : 7.72
% 69.94/52.65  Reduction            : 16.10
% 69.94/52.65  Demodulation         : 13.43
% 69.94/52.65  BG Simplification    : 0.62
% 69.94/52.65  Subsumption          : 23.52
% 69.94/52.65  Abstraction          : 1.00
% 69.94/52.65  MUC search           : 0.00
% 69.94/52.65  Cooper               : 0.00
% 69.94/52.65  Total                : 51.62
% 69.94/52.65  Index Insertion      : 0.00
% 69.94/52.65  Index Deletion       : 0.00
% 69.94/52.65  Index Matching       : 0.00
% 69.94/52.65  BG Taut test         : 0.00
%------------------------------------------------------------------------------