↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : KRS127+1 : TPTP v9.0.0. Released v3.1.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 : n007.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 07:07:24 PM UTC 2025

% Result   : Unsatisfiable 3.47s 1.68s
% Output   : CNFRefutation 3.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   51 (   5 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   52 (  25   ~;  17   |;   5   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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  :   12 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-1 aty)
%            Number of variables   :   27 (  23   !;   4   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rr > ra_Px1 > xsd_string > xsd_integer > cowlThing > cowlNothing > cdxcomp > cd > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_22_27794 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_3 > #skF_6

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_153,axiom,
    cUnsatisfiable(i2003_11_14_17_22_27794),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

tff(f_133,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ( ? [Y] :
            ( rr(X,Y)
            & cc(Y) )
        & ? [Y] :
            ( rr(X,Y)
            & cd(Y) )
        & ! [Y0,Y1] :
            ( ( rr(X,Y0)
              & rr(X,Y1) )
           => ( Y0 = Y1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

tff(f_138,axiom,
    ! [X] :
      ( cc(X)
     => cdxcomp(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

tff(f_151,axiom,
    ! [X] :
      ( cdxcomp(X)
    <=> ? [Y0] : ra_Px1(X,Y0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

tff(f_145,axiom,
    ! [X] :
      ( cd(X)
    <=> ~ ? [Y] : ra_Px1(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

tff(c_60,plain,
    cUnsatisfiable(i2003_11_14_17_22_27794),
    inference(cnfTransformation,[status(thm)],[f_153]) ).

tff(c_40,plain,
    ! [X_31] :
      ( cc('#skF_3'(X_31))
      | ~ cUnsatisfiable(X_31) ),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_38,plain,
    ! [X_31] :
      ( rr(X_31,'#skF_4'(X_31))
      | ~ cUnsatisfiable(X_31) ),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_42,plain,
    ! [X_31] :
      ( rr(X_31,'#skF_3'(X_31))
      | ~ cUnsatisfiable(X_31) ),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_110,plain,
    ! [Y1_72,Y0_73,X_74] :
      ( ( Y1_72 = Y0_73 )
      | ~ rr(X_74,Y1_72)
      | ~ rr(X_74,Y0_73)
      | ~ cUnsatisfiable(X_74) ),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_124,plain,
    ! [Y0_78,X_79] :
      ( ( Y0_78 = '#skF_3'(X_79) )
      | ~ rr(X_79,Y0_78)
      | ~ cUnsatisfiable(X_79) ),
    inference(resolution,[status(thm)],[c_42,c_110]) ).

tff(c_134,plain,
    ! [X_80] :
      ( ( '#skF_4'(X_80) = '#skF_3'(X_80) )
      | ~ cUnsatisfiable(X_80) ),
    inference(resolution,[status(thm)],[c_38,c_124]) ).

tff(c_138,plain,
    '#skF_4'(i2003_11_14_17_22_27794) = '#skF_3'(i2003_11_14_17_22_27794),
    inference(resolution,[status(thm)],[c_60,c_134]) ).

tff(c_36,plain,
    ! [X_31] :
      ( cd('#skF_4'(X_31))
      | ~ cUnsatisfiable(X_31) ),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_50,plain,
    ! [X_44] :
      ( cdxcomp(X_44)
      | ~ cc(X_44) ),
    inference(cnfTransformation,[status(thm)],[f_138]) ).

tff(c_74,plain,
    ! [X_64] :
      ( ra_Px1(X_64,'#skF_6'(X_64))
      | ~ cdxcomp(X_64) ),
    inference(cnfTransformation,[status(thm)],[f_151]) ).

tff(c_52,plain,
    ! [X_45,Y_48] :
      ( ~ ra_Px1(X_45,Y_48)
      | ~ cd(X_45) ),
    inference(cnfTransformation,[status(thm)],[f_145]) ).

tff(c_83,plain,
    ! [X_65] :
      ( ~ cd(X_65)
      | ~ cdxcomp(X_65) ),
    inference(resolution,[status(thm)],[c_74,c_52]) ).

tff(c_88,plain,
    ! [X_66] :
      ( ~ cd(X_66)
      | ~ cc(X_66) ),
    inference(resolution,[status(thm)],[c_50,c_83]) ).

tff(c_92,plain,
    ! [X_31] :
      ( ~ cc('#skF_4'(X_31))
      | ~ cUnsatisfiable(X_31) ),
    inference(resolution,[status(thm)],[c_36,c_88]) ).

tff(c_145,plain,
    ( ~ cc('#skF_3'(i2003_11_14_17_22_27794))
    | ~ cUnsatisfiable(i2003_11_14_17_22_27794) ),
    inference(superposition,[status(thm),theory(equality)],[c_138,c_92]) ).

tff(c_154,plain,
    ~ cc('#skF_3'(i2003_11_14_17_22_27794)),
    inference(demodulation,[status(thm),theory(equality)],[c_60,c_145]) ).

tff(c_160,plain,
    ~ cUnsatisfiable(i2003_11_14_17_22_27794),
    inference(resolution,[status(thm)],[c_40,c_154]) ).

tff(c_164,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_60,c_160]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.07  % Problem  : KRS127+1 : TPTP v9.0.0. Released v3.1.0.
% 0.05/0.07  % 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.06/0.26  % Computer : n007.cluster.edu
% 0.06/0.26  % Model    : x86_64 x86_64
% 0.06/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26  % Memory   : 8042.1875MB
% 0.06/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26  % CPULimit : 300
% 0.06/0.26  % WCLimit  : 300
% 0.06/0.26  % DateTime : Tue Apr  8 02:59:53 EDT 2025
% 0.06/0.26  % CPUTime  : 
% 3.47/1.68  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.47/1.68  
% 3.47/1.68  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------