↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : KRS012-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/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 : n022.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:09 PM UTC 2025

% Result   : Unsatisfiable 3.05s 1.81s
% Output   : CNFRefutation 3.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   18 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   43 (  21   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   16 (  16   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r > f > e > d > c > #nlpp > u1r1 > u0r2 > u0r1 > exists

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(u0r1,type,
    u0r1: $i > $i ).

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

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

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

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

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

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

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

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

tff(f_22,axiom,
    c(exists),
    file(unknown,unknown) ).

tff(f_101,axiom,
    ! [X1] :
      ( f(X1)
      | r(X1,u1r1(X1)) ),
    file(unknown,unknown) ).

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

tff(f_35,axiom,
    ! [X3,X1] :
      ( e(X3)
      | ~ c(X1)
      | ~ r(X1,X3)
      | ~ d(X3) ),
    file(unknown,unknown) ).

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

tff(f_24,axiom,
    ~ f(exists),
    file(unknown,unknown) ).

tff(c_2,plain,
    c(exists),
    inference(cnfTransformation,[status(thm)],[f_22]) ).

tff(c_26,plain,
    ! [X1_14] :
      ( r(X1_14,u1r1(X1_14))
      | f(X1_14) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_29,plain,
    ! [X1_17,X2_18] :
      ( ~ r(X1_17,X2_18)
      | ~ c(X1_17)
      | d(X2_18) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_33,plain,
    ! [X1_14] :
      ( ~ c(X1_14)
      | d(u1r1(X1_14))
      | f(X1_14) ),
    inference(resolution,[status(thm)],[c_26,c_29]) ).

tff(c_69,plain,
    ! [X3_27,X1_28] :
      ( ~ d(X3_27)
      | ~ r(X1_28,X3_27)
      | ~ c(X1_28)
      | e(X3_27) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_99,plain,
    ! [X1_30] :
      ( ~ d(u1r1(X1_30))
      | ~ c(X1_30)
      | e(u1r1(X1_30))
      | f(X1_30) ),
    inference(resolution,[status(thm)],[c_26,c_69]) ).

tff(c_24,plain,
    ! [X1_13] :
      ( ~ e(u1r1(X1_13))
      | f(X1_13) ),
    inference(cnfTransformation,[status(thm)],[f_97]) ).

tff(c_105,plain,
    ! [X1_32] :
      ( ~ d(u1r1(X1_32))
      | ~ c(X1_32)
      | f(X1_32) ),
    inference(resolution,[status(thm)],[c_99,c_24]) ).

tff(c_110,plain,
    ! [X1_33] :
      ( ~ c(X1_33)
      | f(X1_33) ),
    inference(resolution,[status(thm)],[c_33,c_105]) ).

tff(c_4,plain,
    ~ f(exists),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : KRS012-1 : TPTP v9.0.0. Released v2.0.0.
% 0.06/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 : n022.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:53:35 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 3.05/1.81  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.05/1.82  
% 3.05/1.82  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------