↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SET001-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 : 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:37:24 PM UTC 2025

% Result   : Unsatisfiable 2.77s 1.72s
% Output   : CNFRefutation 2.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   23 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   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 (  14   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ subset > member > equal_sets > member_of_1_not_of_2 > #nlpp > element_of_b > bb > b

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(bb,type,
    bb: $i ).

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

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

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

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

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

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

tff(f_82,axiom,
    equal_sets(b,bb),
    file(unknown,unknown) ).

tff(f_83,axiom,
    member(element_of_b,b),
    file(unknown,unknown) ).

tff(f_66,axiom,
    ! [Subset,Superset] :
      ( ~ equal_sets(Subset,Superset)
      | subset(Subset,Superset) ),
    file(unknown,unknown) ).

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

tff(f_85,axiom,
    ~ member(element_of_b,bb),
    file(unknown,unknown) ).

tff(c_14,plain,
    equal_sets(b,bb),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_16,plain,
    member(element_of_b,b),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_8,plain,
    ! [Subset_8,Superset_9] :
      ( subset(Subset_8,Superset_9)
      | ~ equal_sets(Subset_8,Superset_9) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_29,plain,
    ! [Element_23,Superset_24,Subset_25] :
      ( member(Element_23,Superset_24)
      | ~ subset(Subset_25,Superset_24)
      | ~ member(Element_23,Subset_25) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_79,plain,
    ! [Element_33,Superset_34,Subset_35] :
      ( member(Element_33,Superset_34)
      | ~ member(Element_33,Subset_35)
      | ~ equal_sets(Subset_35,Superset_34) ),
    inference(resolution,[status(thm)],[c_8,c_29]) ).

tff(c_93,plain,
    ! [Superset_39] :
      ( member(element_of_b,Superset_39)
      | ~ equal_sets(b,Superset_39) ),
    inference(resolution,[status(thm)],[c_16,c_79]) ).

tff(c_18,plain,
    ~ member(element_of_b,bb),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

tff(c_100,plain,
    ~ equal_sets(b,bb),
    inference(resolution,[status(thm)],[c_93,c_18]) ).

tff(c_106,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_100]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET001-1 : TPTP v9.0.0. Released v1.0.0.
% 0.06/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 : 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 19:37:48 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.77/1.72  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.77/1.72  
% 2.77/1.72  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------