TSTP Solution File: SET004-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SET004-1 : TPTP v8.1.2. 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 : n018.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 : Tue Aug 22 10:55:28 EDT 2023

% Result   : Unsatisfiable 4.05s 1.96s
% Output   : CNFRefutation 4.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   23 (   6 unt;   9 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  :   14 (   6   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-3 aty)
%            Number of variables   :   21 (;  21   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ union > subset > member > equal_sets > g > member_of_1_not_of_2 > #nlpp > b > aUb > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_156,axiom,
    ~ subset(a,aUb),
    file(unknown,unknown) ).

tff(f_154,axiom,
    union(a,b,aUb),
    file(unknown,unknown) ).

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

tff(f_119,axiom,
    ! [Set1,Set2,Union,Element] :
      ( ~ union(Set1,Set2,Union)
      | ~ member(Element,Set1)
      | member(Element,Union) ),
    file(unknown,unknown) ).

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

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

tff(c_26,plain,
    union(a,b,aUb),
    inference(cnfTransformation,[status(thm)],[f_154]) ).

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_56]) ).

tff(c_102,plain,
    ! [Element_64,Union_65,Set1_66,Set2_67] :
      ( member(Element_64,Union_65)
      | ~ member(Element_64,Set1_66)
      | ~ union(Set1_66,Set2_67,Union_65) ),
    inference(cnfTransformation,[status(thm)],[f_119]) ).

tff(c_599,plain,
    ! [Subset_111,Superset_112,Union_113,Set2_114] :
      ( member(member_of_1_not_of_2(Subset_111,Superset_112),Union_113)
      | ~ union(Subset_111,Set2_114,Union_113)
      | subset(Subset_111,Superset_112) ),
    inference(resolution,[status(thm)],[c_4,c_102]) ).

tff(c_603,plain,
    ! [Superset_115] :
      ( member(member_of_1_not_of_2(a,Superset_115),aUb)
      | subset(a,Superset_115) ),
    inference(resolution,[status(thm)],[c_26,c_599]) ).

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_61]) ).

tff(c_619,plain,
    subset(a,aUb),
    inference(resolution,[status(thm)],[c_603,c_6]) ).

tff(c_629,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_28,c_28,c_619]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SET004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14  % 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.14/0.36  % Computer : n018.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 16:38:35 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 4.05/1.96  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.05/1.96  
% 4.05/1.96  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.05/1.99  
% 4.05/1.99  Inference rules
% 4.05/1.99  ----------------------
% 4.05/1.99  #Ref     : 0
% 4.05/1.99  #Sup     : 139
% 4.05/1.99  #Fact    : 6
% 4.05/1.99  #Define  : 0
% 4.05/1.99  #Split   : 1
% 4.05/1.99  #Chain   : 0
% 4.05/1.99  #Close   : 0
% 4.05/1.99  
% 4.05/1.99  Ordering : KBO
% 4.05/1.99  
% 4.05/1.99  Simplification rules
% 4.05/1.99  ----------------------
% 4.05/1.99  #Subsume      : 29
% 4.05/1.99  #Demod        : 12
% 4.05/1.99  #Tautology    : 10
% 4.05/1.99  #SimpNegUnit  : 1
% 4.05/1.99  #BackRed      : 0
% 4.05/1.99  
% 4.05/1.99  #Partial instantiations: 0
% 4.05/1.99  #Strategies tried      : 1
% 4.05/1.99  
% 4.05/1.99  Timing (in seconds)
% 4.05/1.99  ----------------------
% 4.05/2.00  Preprocessing        : 0.44
% 4.05/2.00  Parsing              : 0.25
% 4.05/2.00  CNF conversion       : 0.03
% 4.05/2.00  Main loop            : 0.47
% 4.05/2.00  Inferencing          : 0.19
% 4.05/2.00  Reduction            : 0.10
% 4.05/2.00  Demodulation         : 0.07
% 4.05/2.00  BG Simplification    : 0.02
% 4.05/2.00  Subsumption          : 0.13
% 4.05/2.00  Abstraction          : 0.02
% 4.05/2.00  MUC search           : 0.00
% 4.05/2.00  Cooper               : 0.00
% 4.05/2.00  Total                : 0.96
% 4.05/2.00  Index Insertion      : 0.00
% 4.05/2.00  Index Deletion       : 0.00
% 4.05/2.00  Index Matching       : 0.00
% 4.05/2.00  BG Taut test         : 0.00
%------------------------------------------------------------------------------