↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN951+1 : TPTP v9.0.0. Released v3.1.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 : n004.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:08:30 PM UTC 2025

% Result   : Theorem 2.48s 1.58s
% Output   : CNFRefutation 2.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   20 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   35 (  19   ~;  11   |;   2   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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  :    5 (   4 usr;   4 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   12 (  10   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p > #nlpp > q > b > a > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(q,type,
    q: $o ).

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

tff(b,type,
    b: $o ).

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

tff(a,type,
    a: $o ).

tff(f_41,negated_conjecture,
    ~ ( ? [X] : p(X)
     => ( ? [X] : p(X)
        & ( a
         => ( ( b
              | ~ b )
            & ( q
             => q ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

tff(c_12,plain,
    ! [X_1] :
      ( ~ b
      | q
      | ~ p(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_17,plain,
    ~ b,
    inference(splitLeft,[status(thm)],[c_12]) ).

tff(c_6,plain,
    ! [X_1] :
      ( b
      | ~ q
      | ~ p(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_18,plain,
    ! [X_1] :
      ( ~ q
      | ~ p(X_1) ),
    inference(negUnitSimplification,[status(thm)],[c_17,c_6]) ).

tff(c_19,plain,
    ~ q,
    inference(splitLeft,[status(thm)],[c_18]) ).

tff(c_10,plain,
    ! [X_1] :
      ( b
      | q
      | ~ p(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_20,plain,
    ! [X_1] : ~ p(X_1),
    inference(negUnitSimplification,[status(thm)],[c_19,c_17,c_10]) ).

tff(c_2,plain,
    p('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_22,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_20,c_2]) ).

tff(c_23,plain,
    ! [X_1] : ~ p(X_1),
    inference(splitRight,[status(thm)],[c_18]) ).

tff(c_32,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_23,c_2]) ).

tff(c_33,plain,
    ! [X_1] :
      ( ~ p(X_1)
      | q ),
    inference(splitRight,[status(thm)],[c_12]) ).

tff(c_35,plain,
    ! [X_1] : ~ p(X_1),
    inference(splitLeft,[status(thm)],[c_33]) ).

tff(c_37,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_35,c_2]) ).

tff(c_38,plain,
    q,
    inference(splitRight,[status(thm)],[c_33]) ).

tff(c_34,plain,
    b,
    inference(splitRight,[status(thm)],[c_12]) ).

tff(c_8,plain,
    ! [X_1] :
      ( ~ b
      | ~ q
      | ~ p(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_42,plain,
    ! [X_1] : ~ p(X_1),
    inference(demodulation,[status(thm),theory(equality)],[c_38,c_34,c_8]) ).

tff(c_44,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_42,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN951+1 : TPTP v9.0.0. Released v3.1.0.
% 0.03/0.13  % 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.13/0.32  % Computer : n004.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit : 300
% 0.13/0.32  % WCLimit  : 300
% 0.13/0.32  % DateTime : Wed Apr  9 08:42:22 EDT 2025
% 0.13/0.32  % CPUTime  : 
% 2.48/1.58  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.48/1.58  
% 2.48/1.58  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------