↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SWW469+1 : TPTP v9.0.0. Released v5.3.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 : n019.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 09:52:41 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ is_state > #nlpp > undefined_state > state > induct_true > induct_false > hoare_165779456gleton > #skF_2 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(undefined_state,type,
    undefined_state: $i > $i ).

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

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

tff(f_45,hypothesis,
    hoare_165779456gleton,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f_39,axiom,
    ( hoare_165779456gleton
  <=> ? [S,T] :
        ( is_state(S)
        & is_state(T)
        & ( S != T ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).

tff(f_54,negated_conjecture,
    ~ ! [T] :
        ( is_state(T)
       => ~ ! [S] :
              ( is_state(S)
             => ( S = T ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

tff(c_18,plain,
    hoare_165779456gleton,
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_6,plain,
    ( ( '#skF_2' != '#skF_1' )
    | ~ hoare_165779456gleton ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_29,plain,
    '#skF_2' != '#skF_1',
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_6]) ).

tff(c_10,plain,
    ( is_state('#skF_1')
    | ~ hoare_165779456gleton ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_25,plain,
    is_state('#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_10]) ).

tff(c_31,plain,
    ! [S_5] :
      ( ( S_5 = '#skF_3' )
      | ~ is_state(S_5) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_47,plain,
    '#skF_3' = '#skF_1',
    inference(resolution,[status(thm)],[c_25,c_31]) ).

tff(c_8,plain,
    ( is_state('#skF_2')
    | ~ hoare_165779456gleton ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_27,plain,
    is_state('#skF_2'),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_8]) ).

tff(c_48,plain,
    '#skF_2' = '#skF_3',
    inference(resolution,[status(thm)],[c_27,c_31]) ).

tff(c_56,plain,
    '#skF_2' = '#skF_1',
    inference(demodulation,[status(thm),theory(equality)],[c_47,c_48]) ).

tff(c_57,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_29,c_56]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWW469+1 : TPTP v9.0.0. Released v5.3.0.
% 0.12/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.12/0.34  % Computer : n019.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 05:50:47 EDT 2025
% 0.19/0.34  % CPUTime  : 
% 2.82/1.63  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.82/1.63  
% 2.82/1.63  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------