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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN062-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/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 : n015.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:12 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ big_k > big_j > big_i > big_h > big_g > big_f > #nlpp > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_53,axiom,
    big_k(a),
    file(unknown,unknown) ).

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

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

tff(f_46,axiom,
    ! [X] :
      ( ~ big_i(X)
      | ~ big_h(X)
      | big_j(X) ),
    file(unknown,unknown) ).

tff(f_55,axiom,
    ~ big_j(a),
    file(unknown,unknown) ).

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

tff(c_12,plain,
    big_k(a),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_15,plain,
    ! [X_5] :
      ( big_h(X_5)
      | ~ big_k(X_5) ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_19,plain,
    big_h(a),
    inference(resolution,[status(thm)],[c_12,c_15]) ).

tff(c_34,plain,
    ! [X_8] :
      ( big_i(X_8)
      | ~ big_h(X_8)
      | ~ big_f(X_8) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_20,plain,
    ! [X_6] :
      ( big_j(X_6)
      | ~ big_h(X_6)
      | ~ big_i(X_6) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_14,plain,
    ~ big_j(a),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_23,plain,
    ( ~ big_h(a)
    | ~ big_i(a) ),
    inference(resolution,[status(thm)],[c_20,c_14]) ).

tff(c_26,plain,
    ~ big_i(a),
    inference(demodulation,[status(thm),theory(equality)],[c_19,c_23]) ).

tff(c_37,plain,
    ( ~ big_h(a)
    | ~ big_f(a) ),
    inference(resolution,[status(thm)],[c_34,c_26]) ).

tff(c_41,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_19,c_37]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SYN062-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15  % 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.14/0.36  % Computer : n015.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:42:29 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 2.16/1.59  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.16/1.60  
% 2.16/1.60  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.16/1.62  
% 2.16/1.62  Inference rules
% 2.16/1.62  ----------------------
% 2.16/1.62  #Ref     : 0
% 2.16/1.62  #Sup     : 4
% 2.16/1.62  #Fact    : 0
% 2.16/1.62  #Define  : 0
% 2.16/1.62  #Split   : 0
% 2.16/1.62  #Chain   : 0
% 2.16/1.62  #Close   : 0
% 2.16/1.62  
% 2.16/1.62  Ordering : KBO
% 2.16/1.62  
% 2.16/1.62  Simplification rules
% 2.16/1.62  ----------------------
% 2.16/1.62  #Subsume      : 0
% 2.16/1.62  #Demod        : 4
% 2.16/1.62  #Tautology    : 0
% 2.16/1.62  #SimpNegUnit  : 0
% 2.16/1.62  #BackRed      : 0
% 2.16/1.62  
% 2.16/1.62  #Partial instantiations: 0
% 2.16/1.62  #Strategies tried      : 1
% 2.16/1.62  
% 2.16/1.62  Timing (in seconds)
% 2.16/1.62  ----------------------
% 2.16/1.63  Preprocessing        : 0.39
% 2.16/1.63  Parsing              : 0.22
% 2.16/1.63  CNF conversion       : 0.02
% 2.16/1.63  Main loop            : 0.17
% 2.16/1.63  Inferencing          : 0.09
% 2.16/1.63  Reduction            : 0.03
% 2.16/1.63  Demodulation         : 0.03
% 2.16/1.63  BG Simplification    : 0.01
% 2.16/1.63  Subsumption          : 0.03
% 2.16/1.63  Abstraction          : 0.00
% 2.16/1.63  MUC search           : 0.00
% 2.16/1.63  Cooper               : 0.00
% 2.16/1.63  Total                : 0.60
% 2.16/1.63  Index Insertion      : 0.00
% 2.16/1.63  Index Deletion       : 0.00
% 2.16/1.63  Index Matching       : 0.00
% 2.16/1.63  BG Taut test         : 0.00
%------------------------------------------------------------------------------