↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM907_1 : TPTP v9.0.0. Bugfixed v5.4.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 : n003.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 07:57:29 PM UTC 2025

% Result   : Theorem 2.90s 1.86s
% Output   : CNFRefutation 2.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   32 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :   51 (  44 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   46 (  27   ~;  17   |;   1   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   68 (   0 atm;  65 fun;   0 num;   3 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   6 usr;   6 con; 0-2 aty)
%            Number of variables   :    3 (   3   !;   0   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp

%Foreground sorts:

%Background operators:
tff('#skF_2',type,
    '#skF_2': $rat ).

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

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

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

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

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

%Foreground operators:

tff(f_35,negated_conjecture,
    ~ ! [Xa: $rat,Ya: $rat,Za: $rat] :
        ( ( $sum(Xa,Ya) = Za )
      <=> ( ( $difference(Za,Ya) = Xa )
          & ( $difference(Za,Xa) = Ya ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rat_combined_problem_2) ).

tff(c_4,plain,
    ( ( '#skF_6' = $sum('#skF_4','#skF_5') )
    | ( '#skF_3' != $sum('#skF_1','#skF_2') ) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_8,plain,
    '#skF_3' != $sum('#skF_1','#skF_2'),
    inference(splitLeft,[status(thm)],[c_4]) ).

tff(c_6,plain,
    ( ( '#skF_6' = $sum('#skF_4','#skF_5') )
    | ( $difference('#skF_3','#skF_2') = '#skF_1' ) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_7,plain,
    $difference('#skF_3','#skF_2') = '#skF_1',
    inference(splitLeft,[status(thm)],[c_6]) ).

tff(c_9,plain,
    $false,
    inference(close,[status(thm),theory('LRA')],[c_8,c_7]) ).

tff(c_11,plain,
    '#skF_3' = $sum('#skF_1','#skF_2'),
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_10,plain,
    '#skF_6' = $sum('#skF_4','#skF_5'),
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_2,plain,
    ( ( $difference('#skF_6','#skF_5') != '#skF_4' )
    | ( $difference('#skF_6','#skF_4') != '#skF_5' )
    | ( $difference('#skF_3','#skF_1') = '#skF_2' ) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_16,plain,
    ( ( $difference($sum('#skF_4','#skF_5'),'#skF_5') != '#skF_4' )
    | ( $difference($sum('#skF_4','#skF_5'),'#skF_4') != '#skF_5' )
    | ( $difference($sum('#skF_1','#skF_2'),'#skF_1') = '#skF_2' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_11,c_10,c_10,c_2]) ).

tff(c_17,plain,
    ( ( $sum('#skF_4',$difference('#skF_5','#skF_5')) != '#skF_4' )
    | ( $sum('#skF_4',$difference('#skF_5','#skF_4')) != '#skF_5' )
    | ( $sum('#skF_1',$difference('#skF_2','#skF_1')) = '#skF_2' ) ),
    inference(backgroundSimplification,[status(thm),theory('LRA')],[c_16]) ).

tff(c_18,plain,
    $sum('#skF_4',$difference('#skF_5','#skF_4')) != '#skF_5',
    inference(splitLeft,[status(thm)],[c_17]) ).

tff(c_21,plain,
    $false,
    inference(close,[status(thm),theory('LRA')],[c_18]) ).

tff(c_23,plain,
    $sum('#skF_4',$difference('#skF_5','#skF_4')) = '#skF_5',
    inference(splitRight,[status(thm)],[c_17]) ).

tff(c_1,plain,
    ( ( $difference('#skF_6','#skF_5') != '#skF_4' )
    | ( $difference('#skF_6','#skF_4') != '#skF_5' )
    | ( '#skF_3' != $sum('#skF_1','#skF_2') ) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_25,plain,
    ( ( $difference($sum('#skF_4','#skF_5'),'#skF_5') != '#skF_4' )
    | ( $difference($sum('#skF_4','#skF_5'),'#skF_4') != '#skF_5' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_11,c_10,c_10,c_1]) ).

tff(c_26,plain,
    ( ( $sum('#skF_4',$difference('#skF_5','#skF_5')) != '#skF_4' )
    | ( $sum('#skF_4',$difference('#skF_5','#skF_4')) != '#skF_5' ) ),
    inference(backgroundSimplification,[status(thm),theory('LRA')],[c_25]) ).

tff(c_27,plain,
    $sum('#skF_4',$difference('#skF_5','#skF_4')) != '#skF_5',
    inference(splitLeft,[status(thm)],[c_26]) ).

tff(c_30,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_23,c_27]) ).

tff(c_31,plain,
    $sum('#skF_4',$difference('#skF_5','#skF_5')) != '#skF_4',
    inference(splitRight,[status(thm)],[c_26]) ).

tff(c_34,plain,
    $false,
    inference(close,[status(thm),theory('LRA')],[c_31]) ).

tff(c_35,plain,
    '#skF_6' = $sum('#skF_4','#skF_5'),
    inference(splitRight,[status(thm)],[c_6]) ).

tff(c_39,plain,
    ( ( $difference($sum('#skF_4','#skF_5'),'#skF_5') != '#skF_4' )
    | ( $difference($sum('#skF_4','#skF_5'),'#skF_4') != '#skF_5' )
    | ( $difference('#skF_3','#skF_1') = '#skF_2' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_35,c_35,c_2]) ).

tff(c_40,plain,
    ( ( $sum('#skF_4',$difference('#skF_5','#skF_5')) != '#skF_4' )
    | ( $sum('#skF_4',$difference('#skF_5','#skF_4')) != '#skF_5' )
    | ( $difference('#skF_3','#skF_1') = '#skF_2' ) ),
    inference(backgroundSimplification,[status(thm),theory('LRA')],[c_39]) ).

tff(c_41,plain,
    $sum('#skF_4',$difference('#skF_5','#skF_4')) != '#skF_5',
    inference(splitLeft,[status(thm)],[c_40]) ).

tff(c_46,plain,
    $false,
    inference(close,[status(thm),theory('LRA')],[c_41]) ).

tff(c_47,plain,
    ( ( $sum('#skF_4',$difference('#skF_5','#skF_5')) != '#skF_4' )
    | ( $difference('#skF_3','#skF_1') = '#skF_2' ) ),
    inference(splitRight,[status(thm)],[c_40]) ).

tff(c_49,plain,
    $sum('#skF_4',$difference('#skF_5','#skF_5')) != '#skF_4',
    inference(splitLeft,[status(thm)],[c_47]) ).

tff(c_50,plain,
    $false,
    inference(close,[status(thm),theory('LRA')],[c_49]) ).

tff(c_51,plain,
    $difference('#skF_3','#skF_1') = '#skF_2',
    inference(splitRight,[status(thm)],[c_47]) ).

tff(c_36,plain,
    $difference('#skF_3','#skF_2') != '#skF_1',
    inference(splitRight,[status(thm)],[c_6]) ).

tff(c_53,plain,
    $false,
    inference(close,[status(thm),theory('LRA')],[c_51,c_36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM907_1 : TPTP v9.0.0. Bugfixed v5.4.0.
% 0.03/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 : n003.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 : Tue Apr  8 15:40:33 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.90/1.86  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.90/1.86  
% 2.90/1.86  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------