↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SET006-1 : TPTP v9.0.0. Released v1.0.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 08:37:25 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ intersection > subset > member > equal_sets > h > member_of_1_not_of_2 > #nlpp > d > a

%Foreground sorts:

%Background operators:

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

tff(member_of_1_not_of_2,type,
    member_of_1_not_of_2: ( $i * $i ) > $i ).

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

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

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

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

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

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

tff(f_157,axiom,
    ~ subset(d,a),
    file(unknown,unknown) ).

tff(f_155,axiom,
    intersection(d,a,d),
    file(unknown,unknown) ).

tff(f_57,axiom,
    ! [Subset,Superset] :
      ( subset(Subset,Superset)
      | member(member_of_1_not_of_2(Subset,Superset),Subset) ),
    file(unknown,unknown) ).

tff(f_118,axiom,
    ! [Set1,Set2,Intersection,Element] :
      ( ~ intersection(Set1,Set2,Intersection)
      | ~ member(Element,Intersection)
      | member(Element,Set2) ),
    file(unknown,unknown) ).

tff(f_62,axiom,
    ! [Subset,Superset] :
      ( ~ member(member_of_1_not_of_2(Subset,Superset),Superset)
      | subset(Subset,Superset) ),
    file(unknown,unknown) ).

tff(c_28,plain,
    ~ subset(d,a),
    inference(cnfTransformation,[status(thm)],[f_157]) ).

tff(c_26,plain,
    intersection(d,a,d),
    inference(cnfTransformation,[status(thm)],[f_155]) ).

tff(c_4,plain,
    ! [Subset_4,Superset_5] :
      ( member(member_of_1_not_of_2(Subset_4,Superset_5),Subset_4)
      | subset(Subset_4,Superset_5) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_102,plain,
    ! [Element_64,Set2_65,Intersection_66,Set1_67] :
      ( member(Element_64,Set2_65)
      | ~ member(Element_64,Intersection_66)
      | ~ intersection(Set1_67,Set2_65,Intersection_66) ),
    inference(cnfTransformation,[status(thm)],[f_118]) ).

tff(c_156,plain,
    ! [Subset_82,Superset_83,Set2_84,Set1_85] :
      ( member(member_of_1_not_of_2(Subset_82,Superset_83),Set2_84)
      | ~ intersection(Set1_85,Set2_84,Subset_82)
      | subset(Subset_82,Superset_83) ),
    inference(resolution,[status(thm)],[c_4,c_102]) ).

tff(c_160,plain,
    ! [Superset_86] :
      ( member(member_of_1_not_of_2(d,Superset_86),a)
      | subset(d,Superset_86) ),
    inference(resolution,[status(thm)],[c_26,c_156]) ).

tff(c_6,plain,
    ! [Subset_6,Superset_7] :
      ( subset(Subset_6,Superset_7)
      | ~ member(member_of_1_not_of_2(Subset_6,Superset_7),Superset_7) ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_174,plain,
    subset(d,a),
    inference(resolution,[status(thm)],[c_160,c_6]) ).

tff(c_183,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_28,c_28,c_174]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET006-1 : TPTP v9.0.0. Released v1.0.0.
% 0.03/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.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 19:39:17 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.35/1.86  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.35/1.86  
% 3.35/1.86  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------