↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : KRS097+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 : n021.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:19 PM UTC 2025

% Result   : Unsatisfiable 3.95s 1.99s
% Output   : CNFRefutation 3.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   40 (   5 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   41 (  19   ~;  13   |;   8   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   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  :   19 (  17 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-1 aty)
%            Number of variables   :   19 (  14   !;   5   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rtt > rt3 > rt2 > rt1 > rr3 > rr2 > rr1 > rr > xsd_string > xsd_integer > cowlThing > cowlNothing > ce > cd > cc > ca > cUnsatisfiable > #nlpp > i2003_11_14_17_20_21603 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_3

%Foreground sorts:

%Background operators:

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

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

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

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

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

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('#skF_1',type,
    '#skF_1': $i > $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_225,axiom,
    cUnsatisfiable(i2003_11_14_17_20_21603),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

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

tff(f_235,axiom,
    ! [X] :
      ~ ( cd(X)
        & cc(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

tff(c_84,plain,
    cUnsatisfiable(i2003_11_14_17_20_21603),
    inference(cnfTransformation,[status(thm)],[f_225]) ).

tff(c_62,plain,
    ! [X_69] :
      ( rr(X_69,'#skF_5'(X_69))
      | ~ cUnsatisfiable(X_69) ),
    inference(cnfTransformation,[status(thm)],[f_216]) ).

tff(c_68,plain,
    ! [X_69] :
      ( rr(X_69,'#skF_4'(X_69))
      | ~ cUnsatisfiable(X_69) ),
    inference(cnfTransformation,[status(thm)],[f_216]) ).

tff(c_151,plain,
    ! [Y1_131,Y0_132,X_133] :
      ( ( Y1_131 = Y0_132 )
      | ~ rr(X_133,Y1_131)
      | ~ rr(X_133,Y0_132)
      | ~ cUnsatisfiable(X_133) ),
    inference(cnfTransformation,[status(thm)],[f_216]) ).

tff(c_161,plain,
    ! [Y0_134,X_135] :
      ( ( Y0_134 = '#skF_4'(X_135) )
      | ~ rr(X_135,Y0_134)
      | ~ cUnsatisfiable(X_135) ),
    inference(resolution,[status(thm)],[c_68,c_151]) ).

tff(c_175,plain,
    ! [X_136] :
      ( ( '#skF_5'(X_136) = '#skF_4'(X_136) )
      | ~ cUnsatisfiable(X_136) ),
    inference(resolution,[status(thm)],[c_62,c_161]) ).

tff(c_179,plain,
    '#skF_5'(i2003_11_14_17_20_21603) = '#skF_4'(i2003_11_14_17_20_21603),
    inference(resolution,[status(thm)],[c_84,c_175]) ).

tff(c_60,plain,
    ! [X_69] :
      ( cc('#skF_5'(X_69))
      | ~ cUnsatisfiable(X_69) ),
    inference(cnfTransformation,[status(thm)],[f_216]) ).

tff(c_189,plain,
    ( cc('#skF_4'(i2003_11_14_17_20_21603))
    | ~ cUnsatisfiable(i2003_11_14_17_20_21603) ),
    inference(superposition,[status(thm),theory(equality)],[c_179,c_60]) ).

tff(c_197,plain,
    cc('#skF_4'(i2003_11_14_17_20_21603)),
    inference(demodulation,[status(thm),theory(equality)],[c_84,c_189]) ).

tff(c_116,plain,
    ! [X_110] :
      ( cd('#skF_4'(X_110))
      | ~ cUnsatisfiable(X_110) ),
    inference(cnfTransformation,[status(thm)],[f_216]) ).

tff(c_88,plain,
    ! [X_87] :
      ( ~ cc(X_87)
      | ~ cd(X_87) ),
    inference(cnfTransformation,[status(thm)],[f_235]) ).

tff(c_123,plain,
    ! [X_110] :
      ( ~ cc('#skF_4'(X_110))
      | ~ cUnsatisfiable(X_110) ),
    inference(resolution,[status(thm)],[c_116,c_88]) ).

tff(c_211,plain,
    ~ cUnsatisfiable(i2003_11_14_17_20_21603),
    inference(resolution,[status(thm)],[c_197,c_123]) ).

tff(c_218,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_84,c_211]) ).

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