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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN077-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/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 : n023.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 11:09:31 EDT 2023

% Result   : Unsatisfiable 3.36s 1.85s
% Output   : CNFRefutation 3.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   34 (   4 unt;   6 typ;   0 def)
%            Number of atoms       :   75 (   5 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   94 (  47   ~;  47   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   5   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   47 (;  47   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_f > i > g > #nlpp > h > f > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(a,type,
    a: $i ).

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

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

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

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

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

tff(f_57,axiom,
    ! [X] :
      ( big_f(X,h(X))
      | big_f(X,a) ),
    file(unknown,unknown) ).

tff(f_64,axiom,
    ! [X,Y] :
      ( ~ big_f(X,h(Y))
      | big_f(i(Y,X),X)
      | big_f(Y,a) ),
    file(unknown,unknown) ).

tff(f_71,axiom,
    ! [X,Y] :
      ( big_f(X,a)
      | big_f(i(X,Y),h(X))
      | ~ big_f(Y,h(X)) ),
    file(unknown,unknown) ).

tff(f_41,axiom,
    ! [X,Y] :
      ( ~ big_f(X,a)
      | ~ big_f(X,Y)
      | big_f(g(X,Y),Y) ),
    file(unknown,unknown) ).

tff(f_53,axiom,
    ! [X,Y,Z] :
      ( ~ big_f(X,a)
      | ~ big_f(X,Y)
      | ~ big_f(Z,g(X,Y))
      | ~ big_f(Z,Y) ),
    file(unknown,unknown) ).

tff(f_33,axiom,
    ! [X,Y] :
      ( ( X != Y )
      | big_f(X,f(Y)) ),
    file(unknown,unknown) ).

tff(f_28,axiom,
    ! [X,Y] :
      ( ~ big_f(X,f(Y))
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(c_10,plain,
    ! [X_10] :
      ( big_f(X_10,a)
      | big_f(X_10,h(X_10)) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_12,plain,
    ! [Y_12,X_11] :
      ( big_f(Y_12,a)
      | big_f(i(Y_12,X_11),X_11)
      | ~ big_f(X_11,h(Y_12)) ),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_14,plain,
    ! [Y_14,X_13] :
      ( ~ big_f(Y_14,h(X_13))
      | big_f(i(X_13,Y_14),h(X_13))
      | big_f(X_13,a) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_6,plain,
    ! [X_5,Y_6] :
      ( big_f(g(X_5,Y_6),Y_6)
      | ~ big_f(X_5,Y_6)
      | ~ big_f(X_5,a) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_71,plain,
    ! [Z_30,Y_31,X_32] :
      ( ~ big_f(Z_30,Y_31)
      | ~ big_f(Z_30,g(X_32,Y_31))
      | ~ big_f(X_32,Y_31)
      | ~ big_f(X_32,a) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_211,plain,
    ! [Y_52,X_53,Y_54] :
      ( ~ big_f(i(Y_52,g(X_53,Y_54)),Y_54)
      | ~ big_f(X_53,Y_54)
      | ~ big_f(X_53,a)
      | big_f(Y_52,a)
      | ~ big_f(g(X_53,Y_54),h(Y_52)) ),
    inference(resolution,[status(thm)],[c_12,c_71]) ).

tff(c_225,plain,
    ! [X_55,X_56] :
      ( ~ big_f(X_55,h(X_56))
      | ~ big_f(X_55,a)
      | ~ big_f(g(X_55,h(X_56)),h(X_56))
      | big_f(X_56,a) ),
    inference(resolution,[status(thm)],[c_14,c_211]) ).

tff(c_231,plain,
    ! [X_57,X_58] :
      ( big_f(X_57,a)
      | ~ big_f(X_58,h(X_57))
      | ~ big_f(X_58,a) ),
    inference(resolution,[status(thm)],[c_6,c_225]) ).

tff(c_292,plain,
    ! [X_62,Y_63] :
      ( ~ big_f(i(X_62,Y_63),a)
      | ~ big_f(Y_63,h(X_62))
      | big_f(X_62,a) ),
    inference(resolution,[status(thm)],[c_14,c_231]) ).

tff(c_304,plain,
    ! [Y_64] :
      ( big_f(Y_64,a)
      | ~ big_f(a,h(Y_64)) ),
    inference(resolution,[status(thm)],[c_12,c_292]) ).

tff(c_314,plain,
    big_f(a,a),
    inference(resolution,[status(thm)],[c_10,c_304]) ).

tff(c_4,plain,
    ! [Y_4] : big_f(Y_4,f(Y_4)),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_23,plain,
    ! [X_19,Y_20] :
      ( big_f(g(X_19,Y_20),Y_20)
      | ~ big_f(X_19,Y_20)
      | ~ big_f(X_19,a) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_2,plain,
    ! [Y_2,X_1] :
      ( ( Y_2 = X_1 )
      | ~ big_f(X_1,f(Y_2)) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_36,plain,
    ! [X_25,Y_26] :
      ( ( g(X_25,f(Y_26)) = Y_26 )
      | ~ big_f(X_25,f(Y_26))
      | ~ big_f(X_25,a) ),
    inference(resolution,[status(thm)],[c_23,c_2]) ).

tff(c_50,plain,
    ! [Y_4] :
      ( ( g(Y_4,f(Y_4)) = Y_4 )
      | ~ big_f(Y_4,a) ),
    inference(resolution,[status(thm)],[c_4,c_36]) ).

tff(c_74,plain,
    ! [Z_30,Y_4] :
      ( ~ big_f(Z_30,f(Y_4))
      | ~ big_f(Z_30,Y_4)
      | ~ big_f(Y_4,f(Y_4))
      | ~ big_f(Y_4,a)
      | ~ big_f(Y_4,a) ),
    inference(superposition,[status(thm),theory(equality)],[c_50,c_71]) ).

tff(c_103,plain,
    ! [Z_34,Y_35] :
      ( ~ big_f(Z_34,f(Y_35))
      | ~ big_f(Z_34,Y_35)
      | ~ big_f(Y_35,a) ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_74]) ).

tff(c_117,plain,
    ! [Y_4] :
      ( ~ big_f(Y_4,Y_4)
      | ~ big_f(Y_4,a) ),
    inference(resolution,[status(thm)],[c_4,c_103]) ).

tff(c_316,plain,
    ~ big_f(a,a),
    inference(resolution,[status(thm)],[c_314,c_117]) ).

tff(c_320,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_314,c_316]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : SYN077-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/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.36  % Computer : n023.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 17:39:07 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 3.36/1.85  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.36/1.85  
% 3.36/1.85  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.36/1.88  
% 3.36/1.88  Inference rules
% 3.36/1.88  ----------------------
% 3.36/1.88  #Ref     : 0
% 3.36/1.88  #Sup     : 68
% 3.36/1.88  #Fact    : 0
% 3.36/1.88  #Define  : 0
% 3.36/1.88  #Split   : 0
% 3.36/1.88  #Chain   : 0
% 3.36/1.88  #Close   : 0
% 3.36/1.88  
% 3.36/1.88  Ordering : KBO
% 3.36/1.88  
% 3.36/1.88  Simplification rules
% 3.36/1.88  ----------------------
% 3.36/1.88  #Subsume      : 12
% 3.36/1.88  #Demod        : 12
% 3.36/1.88  #Tautology    : 17
% 3.36/1.88  #SimpNegUnit  : 0
% 3.36/1.88  #BackRed      : 0
% 3.36/1.88  
% 3.36/1.88  #Partial instantiations: 0
% 3.36/1.88  #Strategies tried      : 1
% 3.36/1.88  
% 3.36/1.88  Timing (in seconds)
% 3.36/1.88  ----------------------
% 3.36/1.89  Preprocessing        : 0.43
% 3.36/1.89  Parsing              : 0.23
% 3.36/1.89  CNF conversion       : 0.02
% 3.36/1.89  Main loop            : 0.38
% 3.36/1.89  Inferencing          : 0.17
% 3.36/1.89  Reduction            : 0.08
% 3.36/1.89  Demodulation         : 0.06
% 3.36/1.89  BG Simplification    : 0.02
% 3.36/1.89  Subsumption          : 0.10
% 3.36/1.89  Abstraction          : 0.01
% 3.36/1.89  MUC search           : 0.00
% 3.36/1.89  Cooper               : 0.00
% 3.36/1.89  Total                : 0.86
% 3.36/1.89  Index Insertion      : 0.00
% 3.36/1.89  Index Deletion       : 0.00
% 3.36/1.89  Index Matching       : 0.00
% 3.36/1.89  BG Taut test         : 0.00
%------------------------------------------------------------------------------