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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN373+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 : n032.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:40 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ big_q > big_p > #nlpp > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_36,negated_conjecture,
    ~ ( ? [X] :
          ( big_p(X)
         => big_q(X) )
    <=> ( ! [X] : big_p(X)
       => ? [X] : big_q(X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2124) ).

tff(c_8,plain,
    ! [X_2,X_3] :
      ( ~ big_q(X_2)
      | ~ big_q(X_3) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_58,plain,
    ! [X_3] : ~ big_q(X_3),
    inference(splitLeft,[status(thm)],[c_8]) ).

tff(c_10,plain,
    ! [X_1,X_3] :
      ( big_p(X_1)
      | ~ big_q(X_3) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_19,plain,
    ! [X_3] : ~ big_q(X_3),
    inference(splitLeft,[status(thm)],[c_10]) ).

tff(c_4,plain,
    ! [X_1,X_3] :
      ( big_p(X_1)
      | big_p(X_3) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_21,plain,
    ! [X_3] : big_p(X_3),
    inference(splitLeft,[status(thm)],[c_4]) ).

tff(c_18,plain,
    ( ~ big_p('#skF_2')
    | big_q('#skF_1')
    | big_q('#skF_4')
    | ~ big_p('#skF_3') ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_36,plain,
    ( big_q('#skF_1')
    | big_q('#skF_4') ),
    inference(demodulation,[status(thm),theory(equality)],[c_21,c_21,c_18]) ).

tff(c_37,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_19,c_19,c_36]) ).

tff(c_38,plain,
    ! [X_1] : big_p(X_1),
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_53,plain,
    ( big_q('#skF_1')
    | big_q('#skF_4') ),
    inference(demodulation,[status(thm),theory(equality)],[c_38,c_38,c_18]) ).

tff(c_54,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_19,c_19,c_53]) ).

tff(c_55,plain,
    ! [X_1] : big_p(X_1),
    inference(splitRight,[status(thm)],[c_10]) ).

tff(c_73,plain,
    ( big_q('#skF_1')
    | big_q('#skF_4') ),
    inference(demodulation,[status(thm),theory(equality)],[c_55,c_55,c_18]) ).

tff(c_74,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_58,c_58,c_73]) ).

tff(c_75,plain,
    ! [X_2] : ~ big_q(X_2),
    inference(splitRight,[status(thm)],[c_8]) ).

tff(c_90,plain,
    ( big_q('#skF_1')
    | big_q('#skF_4') ),
    inference(demodulation,[status(thm),theory(equality)],[c_55,c_55,c_18]) ).

tff(c_91,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_75,c_75,c_90]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN373+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.12  % 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.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 300
% 0.11/0.31  % DateTime : Thu Aug  3 17:32:21 EDT 2023
% 0.11/0.31  % CPUTime  : 
% 2.00/1.51  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.00/1.51  
% 2.00/1.51  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.00/1.55  
% 2.00/1.55  Inference rules
% 2.00/1.55  ----------------------
% 2.00/1.55  #Ref     : 0
% 2.00/1.55  #Sup     : 0
% 2.00/1.55  #Fact    : 0
% 2.00/1.55  #Define  : 0
% 2.00/1.55  #Split   : 3
% 2.00/1.55  #Chain   : 0
% 2.00/1.55  #Close   : 0
% 2.00/1.55  
% 2.00/1.55  Ordering : KBO
% 2.00/1.55  
% 2.00/1.55  Simplification rules
% 2.00/1.55  ----------------------
% 2.00/1.55  #Subsume      : 11
% 2.00/1.55  #Demod        : 34
% 2.00/1.55  #Tautology    : 9
% 2.00/1.55  #SimpNegUnit  : 20
% 2.00/1.55  #BackRed      : 0
% 2.00/1.55  
% 2.00/1.55  #Partial instantiations: 0
% 2.00/1.55  #Strategies tried      : 1
% 2.00/1.55  
% 2.00/1.55  Timing (in seconds)
% 2.00/1.55  ----------------------
% 2.00/1.55  Preprocessing        : 0.38
% 2.00/1.55  Parsing              : 0.21
% 2.00/1.55  CNF conversion       : 0.02
% 2.00/1.55  Main loop            : 0.15
% 2.00/1.55  Inferencing          : 0.03
% 2.00/1.55  Reduction            : 0.04
% 2.00/1.55  Demodulation         : 0.03
% 2.00/1.55  BG Simplification    : 0.01
% 2.00/1.55  Subsumption          : 0.04
% 2.00/1.55  Abstraction          : 0.01
% 2.00/1.55  MUC search           : 0.00
% 2.00/1.55  Cooper               : 0.00
% 2.00/1.55  Total                : 0.58
% 2.00/1.55  Index Insertion      : 0.00
% 2.00/1.55  Index Deletion       : 0.00
% 2.00/1.55  Index Matching       : 0.00
% 2.00/1.55  BG Taut test         : 0.00
%------------------------------------------------------------------------------