↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SET573+3 : TPTP v9.0.0. Released v2.2.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 : n011.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 08:38:44 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ member > intersect > disjoint > #nlpp > #skF_2 > #skF_3 > #skF_4 > #skF_1

%Foreground sorts:

%Background operators:

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

tff(member,type,
    member: ( $i * $i ) > $o ).

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

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

tff(disjoint,type,
    disjoint: ( $i * $i ) > $o ).

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

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

tff(f_54,negated_conjecture,
    ~ ! [B,C,D] :
        ( ( member(B,C)
          & disjoint(C,D) )
       => ~ member(B,D) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th12) ).

tff(f_34,axiom,
    ! [B,C] :
      ( intersect(B,C)
    <=> ? [D] :
          ( member(D,B)
          & member(D,C) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).

tff(f_40,axiom,
    ! [B,C] :
      ( disjoint(B,C)
    <=> ~ intersect(B,C) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).

tff(c_16,plain,
    disjoint('#skF_3','#skF_4'),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_18,plain,
    member('#skF_2','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_14,plain,
    member('#skF_2','#skF_4'),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_47,plain,
    ! [B_24,C_25,D_26] :
      ( intersect(B_24,C_25)
      | ~ member(D_26,C_25)
      | ~ member(D_26,B_24) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_60,plain,
    ! [B_27] :
      ( intersect(B_27,'#skF_4')
      | ~ member('#skF_2',B_27) ),
    inference(resolution,[status(thm)],[c_14,c_47]) ).

tff(c_68,plain,
    intersect('#skF_3','#skF_4'),
    inference(resolution,[status(thm)],[c_18,c_60]) ).

tff(c_8,plain,
    ! [B_6,C_7] :
      ( ~ intersect(B_6,C_7)
      | ~ disjoint(B_6,C_7) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_79,plain,
    ~ disjoint('#skF_3','#skF_4'),
    inference(resolution,[status(thm)],[c_68,c_8]) ).

tff(c_85,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_79]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET573+3 : TPTP v9.0.0. Released v2.2.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 : n011.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 21:14:33 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.86/1.67  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.86/1.68  
% 2.86/1.68  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------