↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN072+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 : n007.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:02:31 PM UTC 2025

% Result   : Theorem 2.71s 1.62s
% Output   : CNFRefutation 2.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  23 unt;   0 typ;   0 def)
%            Number of atoms       :   43 (  25 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   20 (  10   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 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  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    6 (   4   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_p > #nlpp > b > a > #skF_2 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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(f_38,negated_conjecture,
    ~ ! [X] : big_p(X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel49) ).

tff(f_31,axiom,
    ? [X,Y] :
    ! [Z] :
      ( ( Z = X )
      | ( Z = Y ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel49_1) ).

tff(f_33,axiom,
    big_p(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel49_3) ).

tff(f_35,axiom,
    a != b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel49_4) ).

tff(f_32,axiom,
    big_p(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel49_2) ).

tff(c_10,plain,
    ~ big_p('#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_75,plain,
    ( ( '#skF_2' = '#skF_3' )
    | ( '#skF_3' = '#skF_1' ) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_17,plain,
    ! [Z_3] :
      ( ( Z_3 = '#skF_2' )
      | ( Z_3 = '#skF_1' ) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_6,plain,
    big_p(b),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_26,plain,
    ( big_p('#skF_2')
    | ( b = '#skF_1' ) ),
    inference(superposition,[status(thm),theory(equality)],[c_17,c_6]) ).

tff(c_43,plain,
    b = '#skF_1',
    inference(splitLeft,[status(thm)],[c_26]) ).

tff(c_44,plain,
    big_p('#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_43,c_6]) ).

tff(c_60,plain,
    ( ( '#skF_2' = '#skF_3' )
    | ( '#skF_3' = '#skF_1' ) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_8,plain,
    b != a,
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_45,plain,
    a != '#skF_1',
    inference(demodulation,[status(thm),theory(equality)],[c_43,c_8]) ).

tff(c_4,plain,
    big_p(a),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_29,plain,
    ( big_p('#skF_2')
    | ( a = '#skF_1' ) ),
    inference(superposition,[status(thm),theory(equality)],[c_17,c_4]) ).

tff(c_59,plain,
    big_p('#skF_2'),
    inference(negUnitSimplification,[status(thm)],[c_45,c_29]) ).

tff(c_61,plain,
    ( big_p('#skF_3')
    | ( '#skF_3' = '#skF_1' ) ),
    inference(superposition,[status(thm),theory(equality)],[c_60,c_59]) ).

tff(c_66,plain,
    '#skF_3' = '#skF_1',
    inference(negUnitSimplification,[status(thm)],[c_10,c_61]) ).

tff(c_69,plain,
    ~ big_p('#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_66,c_10]) ).

tff(c_72,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_44,c_69]) ).

tff(c_73,plain,
    big_p('#skF_2'),
    inference(splitRight,[status(thm)],[c_26]) ).

tff(c_76,plain,
    ( big_p('#skF_3')
    | ( '#skF_3' = '#skF_1' ) ),
    inference(superposition,[status(thm),theory(equality)],[c_75,c_73]) ).

tff(c_81,plain,
    '#skF_3' = '#skF_1',
    inference(negUnitSimplification,[status(thm)],[c_10,c_76]) ).

tff(c_88,plain,
    ~ big_p('#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_81,c_10]) ).

tff(c_2,plain,
    ! [Z_2] :
      ( ( Z_2 = '#skF_2' )
      | ( Z_2 = '#skF_1' ) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_74,plain,
    b != '#skF_1',
    inference(splitRight,[status(thm)],[c_26]) ).

tff(c_32,plain,
    ( ( a != '#skF_2' )
    | ( b = '#skF_1' ) ),
    inference(superposition,[status(thm),theory(equality)],[c_17,c_8]) ).

tff(c_93,plain,
    a != '#skF_2',
    inference(negUnitSimplification,[status(thm)],[c_74,c_32]) ).

tff(c_97,plain,
    a = '#skF_1',
    inference(superposition,[status(thm),theory(equality)],[c_2,c_93]) ).

tff(c_99,plain,
    big_p('#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_97,c_4]) ).

tff(c_102,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_88,c_99]) ).

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