↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN375+1 : TPTP v9.0.0. Released v2.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 : n013.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 : Wed Apr  9 10:03:23 PM UTC 2025

% Result   : Theorem 2.44s 1.63s
% Output   : CNFRefutation 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   36 (  24 unt;   0 typ;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   49 (  22   ~;  24   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-1 aty)
%            Number of variables   :   41 (  39   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_p > #nlpp > #skF_1 > #skF_7 > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_8 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_37,negated_conjecture,
    ~ ( ! [X] :
          ( big_p(X)
        <=> ? [Y] : big_p(Y) )
    <=> ( ! [X] : big_p(X)
      <=> ? [Y] : big_p(Y) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2126) ).

tff(c_52,plain,
    ! [X_1,Y_4,X_8,Y_7] :
      ( big_p(X_1)
      | ~ big_p(Y_4)
      | big_p(X_8)
      | ~ big_p(Y_7) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_81,plain,
    ! [Y_7] : ~ big_p(Y_7),
    inference(splitLeft,[status(thm)],[c_52]) ).

tff(c_60,plain,
    ! [X_5,X_8,Y_7] :
      ( big_p(X_5)
      | big_p('#skF_2')
      | big_p(X_8)
      | ~ big_p(Y_7) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_73,plain,
    ! [Y_7] : ~ big_p(Y_7),
    inference(splitLeft,[status(thm)],[c_60]) ).

tff(c_48,plain,
    ! [X_5] :
      ( big_p(X_5)
      | big_p('#skF_2')
      | big_p('#skF_7')
      | big_p('#skF_8') ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_77,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_73,c_73,c_73,c_73,c_48]) ).

tff(c_78,plain,
    ! [X_5,X_8] :
      ( big_p('#skF_2')
      | big_p(X_5)
      | big_p(X_8) ),
    inference(splitRight,[status(thm)],[c_60]) ).

tff(c_79,plain,
    big_p('#skF_2'),
    inference(splitLeft,[status(thm)],[c_78]) ).

tff(c_83,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_81,c_79]) ).

tff(c_84,plain,
    ! [Y_4,X_1,X_8] :
      ( ~ big_p(Y_4)
      | big_p(X_1)
      | big_p(X_8) ),
    inference(splitRight,[status(thm)],[c_52]) ).

tff(c_85,plain,
    ! [Y_4] : ~ big_p(Y_4),
    inference(splitLeft,[status(thm)],[c_84]) ).

tff(c_87,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_85,c_79]) ).

tff(c_88,plain,
    ! [X_8,X_1] :
      ( big_p(X_8)
      | big_p(X_1) ),
    inference(splitRight,[status(thm)],[c_84]) ).

tff(c_89,plain,
    ! [X_1] : big_p(X_1),
    inference(splitLeft,[status(thm)],[c_88]) ).

tff(c_4,plain,
    ! [X_1,Y_4,Y_11] :
      ( big_p(X_1)
      | ~ big_p(Y_4)
      | ~ big_p('#skF_6')
      | ~ big_p(Y_11) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_80,plain,
    ~ big_p('#skF_6'),
    inference(splitLeft,[status(thm)],[c_4]) ).

tff(c_93,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_89,c_80]) ).

tff(c_94,plain,
    ! [X_8] : big_p(X_8),
    inference(splitRight,[status(thm)],[c_88]) ).

tff(c_98,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_94,c_80]) ).

tff(c_99,plain,
    ! [Y_11,Y_4,X_1] :
      ( ~ big_p(Y_11)
      | ~ big_p(Y_4)
      | big_p(X_1) ),
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_106,plain,
    ! [Y_11] : ~ big_p(Y_11),
    inference(splitLeft,[status(thm)],[c_99]) ).

tff(c_100,plain,
    big_p('#skF_6'),
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_109,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_106,c_100]) ).

tff(c_110,plain,
    ! [Y_4,X_1] :
      ( ~ big_p(Y_4)
      | big_p(X_1) ),
    inference(splitRight,[status(thm)],[c_99]) ).

tff(c_111,plain,
    ! [Y_4] : ~ big_p(Y_4),
    inference(splitLeft,[status(thm)],[c_110]) ).

tff(c_114,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_111,c_100]) ).

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

tff(c_6,plain,
    ! [Y_6,Y_11] :
      ( ~ big_p(Y_6)
      | ~ big_p('#skF_3')
      | ~ big_p('#skF_6')
      | ~ big_p(Y_11) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_123,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_115,c_115,c_115,c_115,c_6]) ).

tff(c_124,plain,
    ! [X_8,X_5] :
      ( big_p(X_8)
      | big_p(X_5) ),
    inference(splitRight,[status(thm)],[c_78]) ).

tff(c_141,plain,
    ! [X_5] : big_p(X_5),
    inference(splitLeft,[status(thm)],[c_124]) ).

tff(c_125,plain,
    ~ big_p('#skF_2'),
    inference(splitRight,[status(thm)],[c_78]) ).

tff(c_145,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_141,c_125]) ).

tff(c_146,plain,
    ! [X_8] : big_p(X_8),
    inference(splitRight,[status(thm)],[c_124]) ).

tff(c_153,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_146,c_125]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN375+1 : TPTP v9.0.0. Released v2.0.0.
% 0.11/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.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Apr  9 07:21:17 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.44/1.63  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.44/1.63  
% 2.44/1.63  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------