↑ Up

Beagle---0.9.52.THM-CRf.s

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

% Result   : Theorem 3.10s 1.76s
% Output   : CNFRefutation 3.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   28 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   57 (  28   ~;  19   |;   3   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   26 (  26   !;   0   ?;  26   :)

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

%Foreground sorts:
tff(real,type,
    real: $tType ).

tff(unreal,type,
    unreal: $tType ).

%Background operators:

%Foreground operators:
tff(u3r2,type,
    u3r2: unreal > real ).

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

tff(u3r1,type,
    u3r1: unreal > real ).

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

tff(exist,type,
    exist: unreal ).

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

tff(u1r2,type,
    u1r2: unreal > real ).

tff(s,type,
    s: ( unreal * real ) > $o ).

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

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

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

tff(u1r1,type,
    u1r1: unreal > real ).

tff(f,type,
    f: unreal > $o ).

tff(f_97,negated_conjecture,
    ~ ( ~ e(exist)
      | ~ f(exist) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1__clause_2) ).

tff(f_87,axiom,
    ! [X1: unreal] :
      ( e(X1)
     => c(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).

tff(f_91,axiom,
    ! [X1: unreal] :
      ( f(X1)
     => d(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).

tff(f_59,axiom,
    ! [X1: unreal] :
      ( d(X1)
     => s1most(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

tff(f_30,axiom,
    ! [X1: unreal] :
      ( c(X1)
     => s2least(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

tff(f_47,axiom,
    ! [X1: unreal] :
      ( s2least(X1)
     => s(X1,u1r2(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

tff(f_43,axiom,
    ! [X1: unreal] :
      ( s2least(X1)
     => s(X1,u1r1(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

tff(f_71,axiom,
    ! [X2: real,X3: real,X1: unreal] :
      ( ( s1most(X1)
        & s(X1,X3)
        & s(X1,X2) )
     => equalish(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

tff(f_39,axiom,
    ! [X1: unreal] :
      ~ ( s2least(X1)
        & equalish(u1r2(X1),u1r1(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

tff(c_32,plain,
    e(exist),
    inference(cnfTransformation,[status(thm)],[f_97]) ).

tff(c_33,plain,
    ! [X1_19: unreal] :
      ( c(X1_19)
      | ~ e(X1_19) ),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_37,plain,
    c(exist),
    inference(resolution,[status(thm)],[c_32,c_33]) ).

tff(c_30,plain,
    f(exist),
    inference(cnfTransformation,[status(thm)],[f_97]) ).

tff(c_40,plain,
    ! [X1_22: unreal] :
      ( d(X1_22)
      | ~ f(X1_22) ),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_44,plain,
    d(exist),
    inference(resolution,[status(thm)],[c_30,c_40]) ).

tff(c_14,plain,
    ! [X1_9: unreal] :
      ( s1most(X1_9)
      | ~ d(X1_9) ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_2,plain,
    ! [X1_1: unreal] :
      ( s2least(X1_1)
      | ~ c(X1_1) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

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

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

tff(c_61,plain,
    ! [X3_31: real,X2_32: real,X1_33: unreal] :
      ( equalish(X3_31,X2_32)
      | ~ s(X1_33,X2_32)
      | ~ s(X1_33,X3_31)
      | ~ s1most(X1_33) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_89,plain,
    ! [X3_41: real,X1_42: unreal] :
      ( equalish(X3_41,u1r1(X1_42))
      | ~ s(X1_42,X3_41)
      | ~ s1most(X1_42)
      | ~ s2least(X1_42) ),
    inference(resolution,[status(thm)],[c_8,c_61]) ).

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

tff(c_95,plain,
    ! [X1_43: unreal] :
      ( ~ s(X1_43,u1r2(X1_43))
      | ~ s1most(X1_43)
      | ~ s2least(X1_43) ),
    inference(resolution,[status(thm)],[c_89,c_6]) ).

tff(c_100,plain,
    ! [X1_44: unreal] :
      ( ~ s1most(X1_44)
      | ~ s2least(X1_44) ),
    inference(resolution,[status(thm)],[c_10,c_95]) ).

tff(c_105,plain,
    ! [X1_45: unreal] :
      ( ~ s1most(X1_45)
      | ~ c(X1_45) ),
    inference(resolution,[status(thm)],[c_2,c_100]) ).

tff(c_110,plain,
    ! [X1_46: unreal] :
      ( ~ c(X1_46)
      | ~ d(X1_46) ),
    inference(resolution,[status(thm)],[c_14,c_105]) ).

tff(c_113,plain,
    ~ c(exist),
    inference(resolution,[status(thm)],[c_44,c_110]) ).

tff(c_117,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_37,c_113]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : KRS003_1 : TPTP v9.0.0. Released v5.0.0.
% 0.10/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.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Apr  8 02:52:40 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.10/1.76  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.10/1.77  
% 3.10/1.77  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------