↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SET627+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 : 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 08:38:56 PM UTC 2025

% Result   : Theorem 2.77s 1.64s
% Output   : CNFRefutation 2.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   16 (   8   ~;   4   |;   1   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   20 (  19   !;   1   ?;   0   :)

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

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_2',type,
    '#skF_2': $i > $i ).

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

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

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

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

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

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

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

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

tff(f_49,axiom,
    ! [B,C] :
      ( intersect(B,C)
     => intersect(C,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_intersect) ).

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

tff(f_30,axiom,
    ! [B] : ~ member(B,empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).

tff(f_60,negated_conjecture,
    ~ ! [B] : disjoint(B,empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th104) ).

tff(c_12,plain,
    ! [B_7,C_8] :
      ( disjoint(B_7,C_8)
      | intersect(B_7,C_8) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_24,plain,
    ! [C_20,B_21] :
      ( intersect(C_20,B_21)
      | ~ intersect(B_21,C_20) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_27,plain,
    ! [C_8,B_7] :
      ( intersect(C_8,B_7)
      | disjoint(B_7,C_8) ),
    inference(resolution,[status(thm)],[c_12,c_24]) ).

tff(c_51,plain,
    ! [B_27,C_28] :
      ( member('#skF_1'(B_27,C_28),B_27)
      | ~ intersect(B_27,C_28) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_2,plain,
    ! [B_1] : ~ member(B_1,empty_set),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_61,plain,
    ! [C_29] : ~ intersect(empty_set,C_29),
    inference(resolution,[status(thm)],[c_51,c_2]) ).

tff(c_70,plain,
    ! [B_7] : disjoint(B_7,empty_set),
    inference(resolution,[status(thm)],[c_27,c_61]) ).

tff(c_20,plain,
    ~ disjoint('#skF_3',empty_set),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_74,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_70,c_20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET627+3 : TPTP v9.0.0. Released v2.2.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 : n019.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:20:32 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.77/1.64  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.77/1.64  
% 2.77/1.64  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------