TSTP Solution File: SYN002-1.007.008 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN002-1.007.008 : 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 : 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:08:29 EDT 2023

% Result   : Unsatisfiable 2.70s 1.72s
% Output   : CNFRefutation 2.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   2 unt;   2 typ;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   37 (  23   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   4 avg)
%            Maximal term depth    :    9 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   15 (;  15   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p > #nlpp > f

%Foreground sorts:

%Background operators:

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

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

tff(f_28,axiom,
    ! [X] :
      ( p(X)
      | p(f(f(f(f(f(f(f(X)))))))) ),
    file(unknown,unknown) ).

tff(f_34,axiom,
    ! [X] :
      ( ~ p(X)
      | ~ p(f(f(f(f(f(f(f(f(X))))))))) ),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [X_1] :
      ( p(f(f(f(f(f(f(f(X_1))))))))
      | p(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_6,plain,
    ! [X_4] :
      ( ~ p(f(f(f(f(f(f(f(f(X_4)))))))))
      | ~ p(X_4) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_10,plain,
    ! [X_4] :
      ( ~ p(X_4)
      | p(f(X_4)) ),
    inference(resolution,[status(thm)],[c_2,c_6]) ).

tff(c_11,plain,
    ! [X_5] :
      ( ~ p(X_5)
      | p(f(X_5)) ),
    inference(resolution,[status(thm)],[c_2,c_6]) ).

tff(c_4,plain,
    ! [X_2] :
      ( ~ p(f(f(f(f(f(f(f(f(X_2)))))))))
      | ~ p(X_2) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_16,plain,
    ! [X_6] :
      ( ~ p(X_6)
      | ~ p(f(f(f(f(f(f(f(X_6)))))))) ),
    inference(resolution,[status(thm)],[c_11,c_4]) ).

tff(c_25,plain,
    ! [X_7] :
      ( ~ p(X_7)
      | ~ p(f(f(f(f(f(f(X_7))))))) ),
    inference(resolution,[status(thm)],[c_10,c_16]) ).

tff(c_43,plain,
    ! [X_9] :
      ( ~ p(X_9)
      | ~ p(f(f(f(f(f(X_9)))))) ),
    inference(resolution,[status(thm)],[c_10,c_25]) ).

tff(c_61,plain,
    ! [X_11] :
      ( ~ p(X_11)
      | ~ p(f(f(f(f(X_11))))) ),
    inference(resolution,[status(thm)],[c_10,c_43]) ).

tff(c_79,plain,
    ! [X_13] :
      ( ~ p(X_13)
      | ~ p(f(f(f(X_13)))) ),
    inference(resolution,[status(thm)],[c_10,c_61]) ).

tff(c_88,plain,
    ! [X_14] :
      ( ~ p(X_14)
      | ~ p(f(f(X_14))) ),
    inference(resolution,[status(thm)],[c_10,c_79]) ).

tff(c_97,plain,
    ! [X_15] :
      ( ~ p(X_15)
      | ~ p(f(X_15)) ),
    inference(resolution,[status(thm)],[c_10,c_88]) ).

tff(c_104,plain,
    ! [X_4] : ~ p(X_4),
    inference(resolution,[status(thm)],[c_10,c_97]) ).

tff(c_111,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_104,c_104,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SYN002-1.007.008 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14  % 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.15/0.36  % Computer : n005.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 17:20:41 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 2.70/1.72  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.70/1.72  
% 2.70/1.72  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.70/1.76  
% 2.70/1.76  Inference rules
% 2.70/1.76  ----------------------
% 2.70/1.76  #Ref     : 0
% 2.70/1.76  #Sup     : 22
% 2.70/1.76  #Fact    : 0
% 2.70/1.76  #Define  : 0
% 2.70/1.76  #Split   : 0
% 2.70/1.76  #Chain   : 0
% 2.70/1.76  #Close   : 0
% 2.70/1.76  
% 2.70/1.76  Ordering : KBO
% 2.70/1.76  
% 2.70/1.76  Simplification rules
% 2.70/1.76  ----------------------
% 2.70/1.76  #Subsume      : 14
% 2.70/1.76  #Demod        : 0
% 2.70/1.76  #Tautology    : 2
% 2.70/1.76  #SimpNegUnit  : 5
% 2.70/1.76  #BackRed      : 1
% 2.70/1.76  
% 2.70/1.76  #Partial instantiations: 0
% 2.70/1.76  #Strategies tried      : 1
% 2.70/1.76  
% 2.70/1.76  Timing (in seconds)
% 2.70/1.76  ----------------------
% 2.70/1.76  Preprocessing        : 0.39
% 2.70/1.76  Parsing              : 0.21
% 2.70/1.76  CNF conversion       : 0.02
% 2.70/1.76  Main loop            : 0.21
% 2.70/1.76  Inferencing          : 0.11
% 2.70/1.76  Reduction            : 0.02
% 2.70/1.76  Demodulation         : 0.01
% 2.70/1.76  BG Simplification    : 0.01
% 2.70/1.76  Subsumption          : 0.05
% 2.70/1.76  Abstraction          : 0.01
% 2.70/1.76  MUC search           : 0.00
% 2.70/1.76  Cooper               : 0.00
% 2.70/1.76  Total                : 0.66
% 2.70/1.76  Index Insertion      : 0.00
% 2.70/1.76  Index Deletion       : 0.00
% 2.70/1.76  Index Matching       : 0.00
% 2.70/1.76  BG Taut test         : 0.00
%------------------------------------------------------------------------------