↑ Up

Beagle---0.9.52.UNS-CRf.s

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

% Result   : Unsatisfiable 3.77s 1.84s
% Output   : CNFRefutation 3.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    9 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   20 (   9   ~;   5   |;   4   &)
%                                         (   1 <=>;   1  =>;   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  :   13 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   10 (   8   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rs > rinvS > rinvF1 > rinvF > rf1 > rf > xsd_string > xsd_integer > cp > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_18_59896 > #skF_2 > #skF_1 > #skF_3

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_166,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ( ? [Y] :
            ( rs(X,Y)
            & cp(Y)
            & ? [Z] :
                ( rinvS(Y,Z)
                & cp(Z) ) )
        & ! [Y] :
            ( rs(X,Y)
           => ~ cp(Y) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

tff(f_204,axiom,
    cUnsatisfiable(i2003_11_14_17_18_59896),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).

tff(c_52,plain,
    ! [X_51] :
      ( cp('#skF_2'(X_51))
      | ~ cUnsatisfiable(X_51) ),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_54,plain,
    ! [X_51] :
      ( rs(X_51,'#skF_2'(X_51))
      | ~ cUnsatisfiable(X_51) ),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_137,plain,
    ! [Y_110,X_111] :
      ( ~ cp(Y_110)
      | ~ rs(X_111,Y_110)
      | ~ cUnsatisfiable(X_111) ),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_146,plain,
    ! [X_112] :
      ( ~ cp('#skF_2'(X_112))
      | ~ cUnsatisfiable(X_112) ),
    inference(resolution,[status(thm)],[c_54,c_137]) ).

tff(c_150,plain,
    ! [X_51] : ~ cUnsatisfiable(X_51),
    inference(resolution,[status(thm)],[c_52,c_146]) ).

tff(c_78,plain,
    cUnsatisfiable(i2003_11_14_17_18_59896),
    inference(cnfTransformation,[status(thm)],[f_204]) ).

tff(c_152,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_150,c_78]) ).

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