↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : KRS002-1 : TPTP v9.0.0. Released v2.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 : n026.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:08 PM UTC 2025

% Result   : Unsatisfiable 3.00s 1.72s
% Output   : CNFRefutation 3.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   30 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   67 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   82 (  45   ~;  37   |;   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  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-1 aty)
%            Number of variables   :   36 (  36   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ s > r > equalish > s2least > s1most > e > d > c > #nlpp > u4r2 > u4r1 > u3r2 > u3r1 > u1r2 > u1r1 > exist

%Foreground sorts:

%Background operators:

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

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

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

tff(u3r1,type,
    u3r1: $i > $i ).

tff(u1r1,type,
    u1r1: $i > $i ).

tff(u4r1,type,
    u4r1: $i > $i ).

tff(u3r2,type,
    u3r2: $i > $i ).

tff(u4r2,type,
    u4r2: $i > $i ).

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

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

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

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

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

tff(u1r2,type,
    u1r2: $i > $i ).

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

tff(f_97,axiom,
    ! [X1] :
      ( r(X1,u4r2(X1))
      | ~ e(X1) ),
    file(unknown,unknown) ).

tff(f_113,axiom,
    ! [X2,X1] :
      ( c(X2)
      | ~ e(X1)
      | ~ r(X1,X2) ),
    file(unknown,unknown) ).

tff(f_105,axiom,
    ! [X2,X1] :
      ( d(X2)
      | ~ e(X1)
      | ~ r(X1,X2) ),
    file(unknown,unknown) ).

tff(f_63,axiom,
    ! [X1] :
      ( s1most(X1)
      | ~ d(X1) ),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ! [X1] :
      ( s2least(X1)
      | ~ c(X1) ),
    file(unknown,unknown) ).

tff(f_48,axiom,
    ! [X1] :
      ( s(X1,u1r2(X1))
      | ~ s2least(X1) ),
    file(unknown,unknown) ).

tff(f_43,axiom,
    ! [X1] :
      ( s(X1,u1r1(X1))
      | ~ s2least(X1) ),
    file(unknown,unknown) ).

tff(f_79,axiom,
    ! [X3,X2,X1] :
      ( equalish(X3,X2)
      | ~ s1most(X1)
      | ~ s(X1,X3)
      | ~ s(X1,X2) ),
    file(unknown,unknown) ).

tff(f_38,axiom,
    ! [X1] :
      ( ~ s2least(X1)
      | ~ equalish(u1r2(X1),u1r1(X1)) ),
    file(unknown,unknown) ).

tff(f_22,axiom,
    e(exist),
    file(unknown,unknown) ).

tff(c_28,plain,
    ! [X1_17] :
      ( ~ e(X1_17)
      | r(X1_17,u4r2(X1_17)) ),
    inference(cnfTransformation,[status(thm)],[f_97]) ).

tff(c_55,plain,
    ! [X1_36,X2_37] :
      ( ~ r(X1_36,X2_37)
      | ~ e(X1_36)
      | c(X2_37) ),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

tff(c_59,plain,
    ! [X1_17] :
      ( c(u4r2(X1_17))
      | ~ e(X1_17) ),
    inference(resolution,[status(thm)],[c_28,c_55]) ).

tff(c_62,plain,
    ! [X1_40,X2_41] :
      ( ~ r(X1_40,X2_41)
      | ~ e(X1_40)
      | d(X2_41) ),
    inference(cnfTransformation,[status(thm)],[f_105]) ).

tff(c_66,plain,
    ! [X1_17] :
      ( d(u4r2(X1_17))
      | ~ e(X1_17) ),
    inference(resolution,[status(thm)],[c_28,c_62]) ).

tff(c_16,plain,
    ! [X1_9] :
      ( ~ d(X1_9)
      | s1most(X1_9) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_4,plain,
    ! [X1_1] :
      ( ~ c(X1_1)
      | s2least(X1_1) ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_12,plain,
    ! [X1_5] :
      ( ~ s2least(X1_5)
      | s(X1_5,u1r2(X1_5)) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_10,plain,
    ! [X1_4] :
      ( ~ s2least(X1_4)
      | s(X1_4,u1r1(X1_4)) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_89,plain,
    ! [X1_50,X2_51,X3_52] :
      ( ~ s(X1_50,X2_51)
      | ~ s(X1_50,X3_52)
      | ~ s1most(X1_50)
      | equalish(X3_52,X2_51) ),
    inference(cnfTransformation,[status(thm)],[f_79]) ).

tff(c_124,plain,
    ! [X1_59,X3_60] :
      ( ~ s(X1_59,X3_60)
      | ~ s1most(X1_59)
      | equalish(X3_60,u1r1(X1_59))
      | ~ s2least(X1_59) ),
    inference(resolution,[status(thm)],[c_10,c_89]) ).

tff(c_8,plain,
    ! [X1_3] :
      ( ~ equalish(u1r2(X1_3),u1r1(X1_3))
      | ~ s2least(X1_3) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_130,plain,
    ! [X1_61] :
      ( ~ s(X1_61,u1r2(X1_61))
      | ~ s1most(X1_61)
      | ~ s2least(X1_61) ),
    inference(resolution,[status(thm)],[c_124,c_8]) ).

tff(c_135,plain,
    ! [X1_62] :
      ( ~ s1most(X1_62)
      | ~ s2least(X1_62) ),
    inference(resolution,[status(thm)],[c_12,c_130]) ).

tff(c_144,plain,
    ! [X1_63] :
      ( ~ s1most(X1_63)
      | ~ c(X1_63) ),
    inference(resolution,[status(thm)],[c_4,c_135]) ).

tff(c_153,plain,
    ! [X1_64] :
      ( ~ c(X1_64)
      | ~ d(X1_64) ),
    inference(resolution,[status(thm)],[c_16,c_144]) ).

tff(c_162,plain,
    ! [X1_65] :
      ( ~ c(u4r2(X1_65))
      | ~ e(X1_65) ),
    inference(resolution,[status(thm)],[c_66,c_153]) ).

tff(c_166,plain,
    ! [X1_17] : ~ e(X1_17),
    inference(resolution,[status(thm)],[c_59,c_162]) ).

tff(c_2,plain,
    e(exist),
    inference(cnfTransformation,[status(thm)],[f_22]) ).

tff(c_169,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_166,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS002-1 : TPTP v9.0.0. Released v2.0.0.
% 0.03/0.13  % 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.12/0.34  % Computer : n026.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:52:38 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 3.00/1.72  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.00/1.72  
% 3.00/1.72  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------