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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN365+1 : TPTP v8.1.2. Released v2.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 : n024.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:10:38 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ big_r > big_p > #nlpp > h > g > #skF_1 > #skF_2

%Foreground sorts:

%Background operators:

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

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

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

tff('#skF_2',type,
    '#skF_2': $i ).

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

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

tff(f_48,negated_conjecture,
    ~ ( ( ! [X] :
          ? [Y] :
            ( big_p(X)
           => ( big_r(X,g(h(Y)))
              & big_p(Y) ) )
        & ! [W] :
            ( big_p(W)
           => ( big_p(g(W))
              & big_p(h(W)) ) ) )
     => ! [X] :
          ( big_p(X)
         => ? [Y] :
              ( big_r(X,Y)
              & big_p(Y) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2116) ).

tff(c_4,plain,
    big_p('#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_10,plain,
    ! [X_1] :
      ( big_p('#skF_1'(X_1))
      | ~ big_p(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_6,plain,
    ! [W_3] :
      ( big_p(h(W_3))
      | ~ big_p(W_3) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_8,plain,
    ! [W_3] :
      ( big_p(g(W_3))
      | ~ big_p(W_3) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_17,plain,
    ! [X_10] :
      ( big_r(X_10,g(h('#skF_1'(X_10))))
      | ~ big_p(X_10) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_2,plain,
    ! [Y_5] :
      ( ~ big_p(Y_5)
      | ~ big_r('#skF_2',Y_5) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_21,plain,
    ( ~ big_p(g(h('#skF_1'('#skF_2'))))
    | ~ big_p('#skF_2') ),
    inference(resolution,[status(thm)],[c_17,c_2]) ).

tff(c_24,plain,
    ~ big_p(g(h('#skF_1'('#skF_2')))),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_21]) ).

tff(c_28,plain,
    ~ big_p(h('#skF_1'('#skF_2'))),
    inference(resolution,[status(thm)],[c_8,c_24]) ).

tff(c_32,plain,
    ~ big_p('#skF_1'('#skF_2')),
    inference(resolution,[status(thm)],[c_6,c_28]) ).

tff(c_35,plain,
    ~ big_p('#skF_2'),
    inference(resolution,[status(thm)],[c_10,c_32]) ).

tff(c_39,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN365+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/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 : n024.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:14:15 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 2.66/1.71  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.66/1.72  
% 2.66/1.72  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.77/1.75  
% 2.77/1.75  Inference rules
% 2.77/1.75  ----------------------
% 2.77/1.75  #Ref     : 0
% 2.77/1.75  #Sup     : 4
% 2.77/1.75  #Fact    : 0
% 2.77/1.75  #Define  : 0
% 2.77/1.75  #Split   : 0
% 2.77/1.75  #Chain   : 0
% 2.77/1.75  #Close   : 0
% 2.77/1.75  
% 2.77/1.75  Ordering : KBO
% 2.77/1.75  
% 2.77/1.75  Simplification rules
% 2.77/1.75  ----------------------
% 2.77/1.75  #Subsume      : 0
% 2.77/1.75  #Demod        : 2
% 2.77/1.75  #Tautology    : 0
% 2.77/1.75  #SimpNegUnit  : 0
% 2.77/1.75  #BackRed      : 0
% 2.77/1.75  
% 2.77/1.75  #Partial instantiations: 0
% 2.77/1.75  #Strategies tried      : 1
% 2.77/1.75  
% 2.77/1.75  Timing (in seconds)
% 2.77/1.75  ----------------------
% 2.80/1.75  Preprocessing        : 0.45
% 2.80/1.75  Parsing              : 0.24
% 2.80/1.75  CNF conversion       : 0.03
% 2.80/1.75  Main loop            : 0.19
% 2.80/1.75  Inferencing          : 0.10
% 2.80/1.75  Reduction            : 0.03
% 2.80/1.75  Demodulation         : 0.03
% 2.80/1.75  BG Simplification    : 0.01
% 2.80/1.75  Subsumption          : 0.04
% 2.80/1.75  Abstraction          : 0.01
% 2.80/1.75  MUC search           : 0.00
% 2.80/1.75  Cooper               : 0.00
% 2.80/1.75  Total                : 0.69
% 2.80/1.75  Index Insertion      : 0.00
% 2.80/1.75  Index Deletion       : 0.00
% 2.80/1.75  Index Matching       : 0.00
% 2.80/1.75  BG Taut test         : 0.00
%------------------------------------------------------------------------------