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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN069-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 : n005.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:29 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ big_j > big_h > big_l > big_k > big_g > big_f > #nlpp > g > f > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_70,axiom,
    big_f(a),
    file(unknown,unknown) ).

tff(f_93,axiom,
    ! [X] :
      ( ~ big_f(X)
      | big_h(X,g(X)) ),
    file(unknown,unknown) ).

tff(f_75,axiom,
    ! [X] :
      ( ~ big_h(a,X)
      | big_l(X) ),
    file(unknown,unknown) ).

tff(f_69,axiom,
    ! [X] :
      ( ~ big_l(X)
      | ~ big_k(X) ),
    file(unknown,unknown) ).

tff(f_88,axiom,
    ! [X] :
      ( ~ big_f(X)
      | big_g(g(X)) ),
    file(unknown,unknown) ).

tff(f_36,axiom,
    ! [X,Y] :
      ( ~ big_f(X)
      | big_g(f(X))
      | ~ big_g(Y)
      | ~ big_h(X,Y)
      | big_k(Y) ),
    file(unknown,unknown) ).

tff(f_49,axiom,
    ! [X,Y] :
      ( ~ big_f(X)
      | big_h(X,f(X))
      | ~ big_g(Y)
      | ~ big_h(X,Y)
      | big_k(Y) ),
    file(unknown,unknown) ).

tff(f_83,axiom,
    ! [X] :
      ( ~ big_g(X)
      | ~ big_h(a,X)
      | big_j(a,X) ),
    file(unknown,unknown) ).

tff(f_63,axiom,
    ! [X,Y] :
      ( ~ big_f(X)
      | ~ big_j(X,f(X))
      | ~ big_g(Y)
      | ~ big_h(X,Y)
      | big_k(Y) ),
    file(unknown,unknown) ).

tff(c_10,plain,
    big_f(a),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_22,plain,
    ! [X_15] :
      ( big_h(X_15,g(X_15))
      | ~ big_f(X_15) ),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

tff(c_12,plain,
    ! [X_8] :
      ( big_l(X_8)
      | ~ big_h(a,X_8) ),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

tff(c_26,plain,
    ( big_l(g(a))
    | ~ big_f(a) ),
    inference(resolution,[status(thm)],[c_22,c_12]) ).

tff(c_29,plain,
    big_l(g(a)),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_26]) ).

tff(c_8,plain,
    ! [X_7] :
      ( ~ big_k(X_7)
      | ~ big_l(X_7) ),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_34,plain,
    ~ big_k(g(a)),
    inference(resolution,[status(thm)],[c_29,c_8]) ).

tff(c_16,plain,
    ! [X_10] :
      ( big_g(g(X_10))
      | ~ big_f(X_10) ),
    inference(cnfTransformation,[status(thm)],[f_88]) ).

tff(c_18,plain,
    ! [X_11] :
      ( big_h(X_11,g(X_11))
      | ~ big_f(X_11) ),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

tff(c_35,plain,
    ! [Y_17,X_18] :
      ( big_k(Y_17)
      | ~ big_h(X_18,Y_17)
      | ~ big_g(Y_17)
      | big_g(f(X_18))
      | ~ big_f(X_18) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_43,plain,
    ! [X_21] :
      ( big_k(g(X_21))
      | ~ big_g(g(X_21))
      | big_g(f(X_21))
      | ~ big_f(X_21) ),
    inference(resolution,[status(thm)],[c_18,c_35]) ).

tff(c_46,plain,
    ( ~ big_g(g(a))
    | big_g(f(a))
    | ~ big_f(a) ),
    inference(resolution,[status(thm)],[c_43,c_34]) ).

tff(c_49,plain,
    ( ~ big_g(g(a))
    | big_g(f(a)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_46]) ).

tff(c_50,plain,
    ~ big_g(g(a)),
    inference(splitLeft,[status(thm)],[c_49]) ).

tff(c_53,plain,
    ~ big_f(a),
    inference(resolution,[status(thm)],[c_16,c_50]) ).

tff(c_57,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_53]) ).

tff(c_59,plain,
    big_g(g(a)),
    inference(splitRight,[status(thm)],[c_49]) ).

tff(c_39,plain,
    ! [Y_19,X_20] :
      ( big_k(Y_19)
      | ~ big_h(X_20,Y_19)
      | ~ big_g(Y_19)
      | big_h(X_20,f(X_20))
      | ~ big_f(X_20) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_42,plain,
    ! [X_11] :
      ( big_k(g(X_11))
      | ~ big_g(g(X_11))
      | big_h(X_11,f(X_11))
      | ~ big_f(X_11) ),
    inference(resolution,[status(thm)],[c_18,c_39]) ).

tff(c_58,plain,
    big_g(f(a)),
    inference(splitRight,[status(thm)],[c_49]) ).

tff(c_14,plain,
    ! [X_9] :
      ( big_j(a,X_9)
      | ~ big_h(a,X_9)
      | ~ big_g(X_9) ),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_60,plain,
    ! [Y_22,X_23] :
      ( big_k(Y_22)
      | ~ big_h(X_23,Y_22)
      | ~ big_g(Y_22)
      | ~ big_j(X_23,f(X_23))
      | ~ big_f(X_23) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_86,plain,
    ! [X_25] :
      ( big_k(g(X_25))
      | ~ big_g(g(X_25))
      | ~ big_j(X_25,f(X_25))
      | ~ big_f(X_25) ),
    inference(resolution,[status(thm)],[c_18,c_60]) ).

tff(c_90,plain,
    ( big_k(g(a))
    | ~ big_g(g(a))
    | ~ big_f(a)
    | ~ big_h(a,f(a))
    | ~ big_g(f(a)) ),
    inference(resolution,[status(thm)],[c_14,c_86]) ).

tff(c_93,plain,
    ( big_k(g(a))
    | ~ big_h(a,f(a)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_58,c_10,c_59,c_90]) ).

tff(c_94,plain,
    ~ big_h(a,f(a)),
    inference(negUnitSimplification,[status(thm)],[c_34,c_93]) ).

tff(c_97,plain,
    ( big_k(g(a))
    | ~ big_g(g(a))
    | ~ big_f(a) ),
    inference(resolution,[status(thm)],[c_42,c_94]) ).

tff(c_100,plain,
    big_k(g(a)),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_59,c_97]) ).

tff(c_102,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_34,c_100]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN069-1 : 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.13/0.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit : 300
% 0.13/0.36  % WCLimit  : 300
% 0.13/0.36  % DateTime : Thu Aug  3 17:15:27 EDT 2023
% 0.13/0.36  % CPUTime  : 
% 2.78/1.67  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.78/1.68  
% 2.78/1.68  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.78/1.71  
% 2.78/1.71  Inference rules
% 2.78/1.71  ----------------------
% 2.78/1.71  #Ref     : 0
% 2.78/1.71  #Sup     : 14
% 2.78/1.71  #Fact    : 0
% 2.78/1.71  #Define  : 0
% 2.78/1.71  #Split   : 1
% 2.78/1.71  #Chain   : 0
% 2.78/1.71  #Close   : 0
% 2.78/1.71  
% 2.78/1.71  Ordering : KBO
% 2.78/1.71  
% 2.78/1.71  Simplification rules
% 2.78/1.71  ----------------------
% 2.78/1.71  #Subsume      : 2
% 2.78/1.71  #Demod        : 10
% 2.78/1.71  #Tautology    : 0
% 2.78/1.71  #SimpNegUnit  : 3
% 2.78/1.71  #BackRed      : 0
% 2.78/1.71  
% 2.78/1.71  #Partial instantiations: 0
% 2.78/1.71  #Strategies tried      : 1
% 2.78/1.71  
% 2.78/1.71  Timing (in seconds)
% 2.78/1.71  ----------------------
% 3.03/1.71  Preprocessing        : 0.40
% 3.03/1.71  Parsing              : 0.22
% 3.03/1.71  CNF conversion       : 0.02
% 3.03/1.71  Main loop            : 0.24
% 3.03/1.71  Inferencing          : 0.10
% 3.03/1.71  Reduction            : 0.05
% 3.03/1.71  Demodulation         : 0.04
% 3.03/1.71  BG Simplification    : 0.02
% 3.03/1.71  Subsumption          : 0.05
% 3.03/1.71  Abstraction          : 0.01
% 3.03/1.71  MUC search           : 0.00
% 3.03/1.71  Cooper               : 0.00
% 3.03/1.71  Total                : 0.68
% 3.03/1.71  Index Insertion      : 0.00
% 3.03/1.71  Index Deletion       : 0.00
% 3.03/1.71  Index Matching       : 0.00
% 3.03/1.71  BG Taut test         : 0.00
%------------------------------------------------------------------------------