↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SET013-4 : TPTP v9.0.0. Bugfixed v1.2.1.
% 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 : n015.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:28 PM UTC 2025

% Result   : Unsatisfiable 5.80s 2.50s
% Output   : CNFRefutation 6.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   32 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   67 (  17 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   62 (  27   ~;  35   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   35 (  35   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ member > little_set > intersection > f1 > #nlpp > universal_set > empty_set > ds > cs > bs > as

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(f_80,axiom,
    cs != ds,
    file(unknown,unknown) ).

tff(f_39,axiom,
    ! [X,Y] :
      ( member(f1(X,Y),X)
      | member(f1(X,Y),Y)
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(f_78,axiom,
    intersection(bs,as) = ds,
    file(unknown,unknown) ).

tff(f_58,axiom,
    ! [Z,X,Y] :
      ( ~ member(Z,intersection(X,Y))
      | member(Z,Y) ),
    file(unknown,unknown) ).

tff(f_77,axiom,
    intersection(as,bs) = cs,
    file(unknown,unknown) ).

tff(f_53,axiom,
    ! [Z,X,Y] :
      ( ~ member(Z,intersection(X,Y))
      | member(Z,X) ),
    file(unknown,unknown) ).

tff(f_66,axiom,
    ! [Z,X,Y] :
      ( member(Z,intersection(X,Y))
      | ~ member(Z,X)
      | ~ member(Z,Y) ),
    file(unknown,unknown) ).

tff(f_47,axiom,
    ! [X,Y] :
      ( ~ member(f1(X,Y),X)
      | ~ member(f1(X,Y),Y)
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(c_24,plain,
    ds != cs,
    inference(cnfTransformation,[status(thm)],[f_80]) ).

tff(c_107,plain,
    ! [Y_40,X_41] :
      ( ( Y_40 = X_41 )
      | member(f1(X_41,Y_40),Y_40)
      | member(f1(X_41,Y_40),X_41) ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_22,plain,
    intersection(bs,as) = ds,
    inference(cnfTransformation,[status(thm)],[f_78]) ).

tff(c_41,plain,
    ! [Z_26,Y_27,X_28] :
      ( member(Z_26,Y_27)
      | ~ member(Z_26,intersection(X_28,Y_27)) ),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_47,plain,
    ! [Z_26] :
      ( member(Z_26,as)
      | ~ member(Z_26,ds) ),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_41]) ).

tff(c_2240,plain,
    ! [X_105] :
      ( member(f1(X_105,ds),as)
      | ( ds = X_105 )
      | member(f1(X_105,ds),X_105) ),
    inference(resolution,[status(thm)],[c_107,c_47]) ).

tff(c_20,plain,
    intersection(as,bs) = cs,
    inference(cnfTransformation,[status(thm)],[f_77]) ).

tff(c_49,plain,
    ! [Z_30,X_31,Y_32] :
      ( member(Z_30,X_31)
      | ~ member(Z_30,intersection(X_31,Y_32)) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_52,plain,
    ! [Z_30] :
      ( member(Z_30,as)
      | ~ member(Z_30,cs) ),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_49]) ).

tff(c_2254,plain,
    ( member(f1(cs,ds),as)
    | ( ds = cs ) ),
    inference(resolution,[status(thm)],[c_2240,c_52]) ).

tff(c_2284,plain,
    member(f1(cs,ds),as),
    inference(negUnitSimplification,[status(thm)],[c_24,c_2254]) ).

tff(c_55,plain,
    ! [Z_30] :
      ( member(Z_30,bs)
      | ~ member(Z_30,ds) ),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_49]) ).

tff(c_1244,plain,
    ! [X_75] :
      ( member(f1(X_75,ds),bs)
      | ( ds = X_75 )
      | member(f1(X_75,ds),X_75) ),
    inference(resolution,[status(thm)],[c_107,c_55]) ).

tff(c_44,plain,
    ! [Z_26] :
      ( member(Z_26,bs)
      | ~ member(Z_26,cs) ),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_41]) ).

tff(c_1270,plain,
    ( member(f1(cs,ds),bs)
    | ( ds = cs ) ),
    inference(resolution,[status(thm)],[c_1244,c_44]) ).

tff(c_1294,plain,
    member(f1(cs,ds),bs),
    inference(negUnitSimplification,[status(thm)],[c_24,c_1270]) ).

tff(c_59,plain,
    ! [Z_36,Y_37,X_38] :
      ( ~ member(Z_36,Y_37)
      | ~ member(Z_36,X_38)
      | member(Z_36,intersection(X_38,Y_37)) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_71,plain,
    ! [Z_36] :
      ( ~ member(Z_36,bs)
      | ~ member(Z_36,as)
      | member(Z_36,cs) ),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_59]) ).

tff(c_469,plain,
    ! [Z_53] :
      ( ~ member(Z_53,as)
      | ~ member(Z_53,bs)
      | member(Z_53,ds) ),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_59]) ).

tff(c_8,plain,
    ! [Y_8,X_7] :
      ( ( Y_8 = X_7 )
      | ~ member(f1(X_7,Y_8),Y_8)
      | ~ member(f1(X_7,Y_8),X_7) ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_3442,plain,
    ! [X_158] :
      ( ( ds = X_158 )
      | ~ member(f1(X_158,ds),X_158)
      | ~ member(f1(X_158,ds),as)
      | ~ member(f1(X_158,ds),bs) ),
    inference(resolution,[status(thm)],[c_469,c_8]) ).

tff(c_3468,plain,
    ( ( ds = cs )
    | ~ member(f1(cs,ds),bs)
    | ~ member(f1(cs,ds),as) ),
    inference(resolution,[status(thm)],[c_71,c_3442]) ).

tff(c_3492,plain,
    ds = cs,
    inference(demodulation,[status(thm),theory(equality)],[c_2284,c_1294,c_3468]) ).

tff(c_3494,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_24,c_3492]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET013-4 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.11/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.14/0.34  % Computer : n015.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Tue Apr  8 19:40:35 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 5.80/2.50  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.19/2.50  
% 6.19/2.50  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------