TSTP Solution File: SYN918+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN918+1 : TPTP v8.1.2. Released v3.1.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 : n021.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:16:51 EDT 2023

% Result   : Theorem 2.81s 1.64s
% Output   : CNFRefutation 2.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (   6 unt;   4 typ;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :   15 (   2 avg)
%            Number of connectives :   59 (  27   ~;  19   |;   6   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   25 (;  23   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ h > g > f > #nlpp > #skF_1

%Foreground sorts:

%Background operators:

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

tff('#skF_1',type,
    '#skF_1': $i > $i ).

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

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

tff(f_63,negated_conjecture,
    ~ ( ( ! [X] :
            ( ( ( f(X)
                & g(X) )
             => h(X) )
           => ? [Y] :
                ( f(Y)
                & ~ g(Y) ) )
        & ( ! [W] :
              ( f(W)
             => g(W) )
          | ! [Z] :
              ( f(Z)
             => h(Z) ) ) )
     => ( ! [R] :
            ( ( f(R)
              & h(R) )
           => g(R) )
       => ? [V] :
            ( f(V)
            & g(V)
            & ~ h(V) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tff(c_14,plain,
    ! [X_1] :
      ( ~ h(X_1)
      | f('#skF_1'(X_1)) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_6,plain,
    ! [Z_4,W_3] :
      ( h(Z_4)
      | ~ f(Z_4)
      | g(W_3)
      | ~ f(W_3) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_31,plain,
    ! [W_3] :
      ( g(W_3)
      | ~ f(W_3) ),
    inference(splitLeft,[status(thm)],[c_6]) ).

tff(c_32,plain,
    ! [W_15] :
      ( g(W_15)
      | ~ f(W_15) ),
    inference(splitLeft,[status(thm)],[c_6]) ).

tff(c_8,plain,
    ! [X_1] :
      ( ~ h(X_1)
      | ~ g('#skF_1'(X_1)) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_45,plain,
    ! [X_16] :
      ( ~ h(X_16)
      | ~ f('#skF_1'(X_16)) ),
    inference(resolution,[status(thm)],[c_32,c_8]) ).

tff(c_55,plain,
    ! [X_1] : ~ h(X_1),
    inference(resolution,[status(thm)],[c_14,c_45]) ).

tff(c_2,plain,
    ! [V_6] :
      ( h(V_6)
      | ~ g(V_6)
      | ~ f(V_6) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_60,plain,
    ! [V_18] :
      ( ~ g(V_18)
      | ~ f(V_18) ),
    inference(negUnitSimplification,[status(thm)],[c_55,c_2]) ).

tff(c_64,plain,
    ! [W_3] : ~ f(W_3),
    inference(resolution,[status(thm)],[c_31,c_60]) ).

tff(c_18,plain,
    ! [X_1] :
      ( f(X_1)
      | f('#skF_1'(X_1)) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_68,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_64,c_64,c_18]) ).

tff(c_70,plain,
    ! [Z_19] :
      ( h(Z_19)
      | ~ f(Z_19) ),
    inference(splitRight,[status(thm)],[c_6]) ).

tff(c_4,plain,
    ! [R_5] :
      ( g(R_5)
      | ~ h(R_5)
      | ~ f(R_5) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_75,plain,
    ! [Z_20] :
      ( g(Z_20)
      | ~ f(Z_20) ),
    inference(resolution,[status(thm)],[c_70,c_4]) ).

tff(c_88,plain,
    ! [X_21] :
      ( ~ h(X_21)
      | ~ f('#skF_1'(X_21)) ),
    inference(resolution,[status(thm)],[c_75,c_8]) ).

tff(c_98,plain,
    ! [X_1] : ~ h(X_1),
    inference(resolution,[status(thm)],[c_14,c_88]) ).

tff(c_69,plain,
    ! [Z_4] :
      ( h(Z_4)
      | ~ f(Z_4) ),
    inference(splitRight,[status(thm)],[c_6]) ).

tff(c_101,plain,
    ! [Z_4] : ~ f(Z_4),
    inference(negUnitSimplification,[status(thm)],[c_98,c_69]) ).

tff(c_106,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_101,c_101,c_18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN918+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13  % 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.34  % Computer : n021.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Aug  3 17:16:36 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 2.81/1.64  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.81/1.65  
% 2.81/1.65  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.81/1.68  
% 2.81/1.68  Inference rules
% 2.81/1.68  ----------------------
% 2.81/1.68  #Ref     : 0
% 2.81/1.68  #Sup     : 15
% 2.81/1.68  #Fact    : 0
% 2.81/1.68  #Define  : 0
% 2.81/1.68  #Split   : 1
% 2.81/1.68  #Chain   : 0
% 2.81/1.68  #Close   : 0
% 2.81/1.68  
% 2.81/1.68  Ordering : KBO
% 2.81/1.68  
% 2.81/1.68  Simplification rules
% 2.81/1.68  ----------------------
% 2.81/1.68  #Subsume      : 12
% 2.81/1.68  #Demod        : 0
% 2.81/1.68  #Tautology    : 1
% 2.81/1.68  #SimpNegUnit  : 8
% 2.81/1.68  #BackRed      : 8
% 2.81/1.68  
% 2.81/1.68  #Partial instantiations: 0
% 2.81/1.68  #Strategies tried      : 1
% 2.81/1.68  
% 2.81/1.68  Timing (in seconds)
% 2.81/1.68  ----------------------
% 2.81/1.68  Preprocessing        : 0.41
% 2.81/1.68  Parsing              : 0.23
% 2.81/1.68  CNF conversion       : 0.03
% 2.81/1.68  Main loop            : 0.22
% 2.81/1.68  Inferencing          : 0.11
% 2.81/1.68  Reduction            : 0.02
% 2.81/1.68  Demodulation         : 0.01
% 2.81/1.68  BG Simplification    : 0.01
% 2.81/1.68  Subsumption          : 0.05
% 2.81/1.68  Abstraction          : 0.01
% 2.81/1.68  MUC search           : 0.00
% 2.81/1.68  Cooper               : 0.00
% 2.81/1.68  Total                : 0.67
% 2.81/1.68  Index Insertion      : 0.00
% 2.81/1.68  Index Deletion       : 0.00
% 2.81/1.68  Index Matching       : 0.00
% 2.81/1.68  BG Taut test         : 0.00
%------------------------------------------------------------------------------