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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN070-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 : n020.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.66s 1.67s
% Output   : CNFRefutation 2.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   50 (  18 unt;   7 typ;   0 def)
%            Number of atoms       :   95 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  100 (  48   ~;  52   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   5   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   24 (;  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_j > big_h > big_g > big_f > #nlpp > f > b > 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(b,type,
    b: $i ).

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

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

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

tff(f_85,axiom,
    big_f(b),
    file(unknown,unknown) ).

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

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

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

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

tff(f_72,axiom,
    ! [X,Y] :
      ( ~ big_f(X)
      | big_g(X)
      | ~ big_f(Y)
      | big_g(Y)
      | big_j(a,Y) ),
    file(unknown,unknown) ).

tff(f_84,axiom,
    ! [X,Y] :
      ( ~ big_f(X)
      | ~ big_f(Y)
      | ~ big_h(X,Y)
      | ~ big_j(Y,X) ),
    file(unknown,unknown) ).

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

tff(f_87,axiom,
    ~ big_g(b),
    file(unknown,unknown) ).

tff(c_16,plain,
    big_f(b),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

tff(c_10,plain,
    ! [X_5] :
      ( ~ big_g(a)
      | big_g(X_5)
      | ~ big_f(X_5) ),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_19,plain,
    ~ big_g(a),
    inference(splitLeft,[status(thm)],[c_10]) ).

tff(c_8,plain,
    ! [X_4] :
      ( big_f(a)
      | big_g(X_4)
      | ~ big_f(X_4) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_20,plain,
    big_f(a),
    inference(splitLeft,[status(thm)],[c_8]) ).

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

tff(c_4,plain,
    ! [X_2] :
      ( big_g(X_2)
      | big_h(f(X_2),X_2)
      | ~ big_f(X_2) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_12,plain,
    ! [Y_7,X_6] :
      ( big_j(a,Y_7)
      | big_g(Y_7)
      | ~ big_f(Y_7)
      | big_g(X_6)
      | ~ big_f(X_6) ),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_26,plain,
    ! [X_15] :
      ( big_g(X_15)
      | ~ big_f(X_15) ),
    inference(splitLeft,[status(thm)],[c_12]) ).

tff(c_29,plain,
    ~ big_f(a),
    inference(resolution,[status(thm)],[c_26,c_19]) ).

tff(c_36,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_20,c_29]) ).

tff(c_38,plain,
    ! [Y_16] :
      ( big_j(a,Y_16)
      | big_g(Y_16)
      | ~ big_f(Y_16) ),
    inference(splitRight,[status(thm)],[c_12]) ).

tff(c_14,plain,
    ! [Y_9,X_8] :
      ( ~ big_j(Y_9,X_8)
      | ~ big_h(X_8,Y_9)
      | ~ big_f(Y_9)
      | ~ big_f(X_8) ),
    inference(cnfTransformation,[status(thm)],[f_84]) ).

tff(c_41,plain,
    ! [Y_16] :
      ( ~ big_h(Y_16,a)
      | ~ big_f(a)
      | big_g(Y_16)
      | ~ big_f(Y_16) ),
    inference(resolution,[status(thm)],[c_38,c_14]) ).

tff(c_45,plain,
    ! [Y_17] :
      ( ~ big_h(Y_17,a)
      | big_g(Y_17)
      | ~ big_f(Y_17) ),
    inference(demodulation,[status(thm),theory(equality)],[c_20,c_41]) ).

tff(c_49,plain,
    ( big_g(f(a))
    | ~ big_f(f(a))
    | big_g(a)
    | ~ big_f(a) ),
    inference(resolution,[status(thm)],[c_4,c_45]) ).

tff(c_52,plain,
    ( big_g(f(a))
    | ~ big_f(f(a))
    | big_g(a) ),
    inference(demodulation,[status(thm),theory(equality)],[c_20,c_49]) ).

tff(c_53,plain,
    ( big_g(f(a))
    | ~ big_f(f(a)) ),
    inference(negUnitSimplification,[status(thm)],[c_19,c_52]) ).

tff(c_54,plain,
    ~ big_f(f(a)),
    inference(splitLeft,[status(thm)],[c_53]) ).

tff(c_57,plain,
    ( big_g(a)
    | ~ big_f(a) ),
    inference(resolution,[status(thm)],[c_2,c_54]) ).

tff(c_60,plain,
    big_g(a),
    inference(demodulation,[status(thm),theory(equality)],[c_20,c_57]) ).

tff(c_62,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_19,c_60]) ).

tff(c_63,plain,
    big_g(f(a)),
    inference(splitRight,[status(thm)],[c_53]) ).

tff(c_6,plain,
    ! [X_3] :
      ( big_g(X_3)
      | ~ big_g(f(X_3))
      | ~ big_f(X_3) ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_67,plain,
    ( big_g(a)
    | ~ big_f(a) ),
    inference(resolution,[status(thm)],[c_63,c_6]) ).

tff(c_70,plain,
    big_g(a),
    inference(demodulation,[status(thm),theory(equality)],[c_20,c_67]) ).

tff(c_72,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_19,c_70]) ).

tff(c_75,plain,
    ! [X_18] :
      ( big_g(X_18)
      | ~ big_f(X_18) ),
    inference(splitRight,[status(thm)],[c_8]) ).

tff(c_18,plain,
    ~ big_g(b),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_81,plain,
    ~ big_f(b),
    inference(resolution,[status(thm)],[c_75,c_18]) ).

tff(c_86,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_81]) ).

tff(c_90,plain,
    ! [X_19] :
      ( big_g(X_19)
      | ~ big_f(X_19) ),
    inference(splitRight,[status(thm)],[c_10]) ).

tff(c_93,plain,
    ~ big_f(b),
    inference(resolution,[status(thm)],[c_90,c_18]) ).

tff(c_97,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_93]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN070-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 : n020.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.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 17:08:52 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.66/1.67  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.66/1.68  
% 2.66/1.68  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.66/1.71  
% 2.66/1.71  Inference rules
% 2.66/1.71  ----------------------
% 2.66/1.71  #Ref     : 0
% 2.66/1.71  #Sup     : 9
% 2.66/1.71  #Fact    : 0
% 2.66/1.71  #Define  : 0
% 2.66/1.71  #Split   : 5
% 2.66/1.71  #Chain   : 0
% 2.66/1.71  #Close   : 0
% 2.66/1.71  
% 2.66/1.71  Ordering : KBO
% 2.66/1.71  
% 2.66/1.71  Simplification rules
% 2.66/1.71  ----------------------
% 2.66/1.71  #Subsume      : 4
% 2.66/1.71  #Demod        : 7
% 2.66/1.71  #Tautology    : 0
% 2.66/1.71  #SimpNegUnit  : 3
% 2.66/1.71  #BackRed      : 0
% 2.66/1.71  
% 2.66/1.71  #Partial instantiations: 0
% 2.66/1.71  #Strategies tried      : 1
% 2.66/1.71  
% 2.66/1.71  Timing (in seconds)
% 2.66/1.71  ----------------------
% 2.66/1.71  Preprocessing        : 0.41
% 2.66/1.71  Parsing              : 0.22
% 2.66/1.71  CNF conversion       : 0.02
% 2.66/1.71  Main loop            : 0.23
% 2.66/1.71  Inferencing          : 0.10
% 2.66/1.71  Reduction            : 0.05
% 2.66/1.71  Demodulation         : 0.03
% 2.66/1.71  BG Simplification    : 0.01
% 2.66/1.71  Subsumption          : 0.05
% 2.66/1.71  Abstraction          : 0.01
% 2.66/1.71  MUC search           : 0.00
% 2.66/1.71  Cooper               : 0.00
% 2.66/1.71  Total                : 0.69
% 2.66/1.71  Index Insertion      : 0.00
% 2.66/1.71  Index Deletion       : 0.00
% 2.66/1.71  Index Matching       : 0.00
% 2.66/1.71  BG Taut test         : 0.00
%------------------------------------------------------------------------------