↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN009-2 : TPTP v9.0.0. Released v2.5.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 : n009.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 10:01:51 PM UTC 2025

% Result   : Unsatisfiable 2.77s 1.67s
% Output   : CNFRefutation 2.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   18 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   41 (  22   ~;  19   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   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-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   24 (  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ t > r > q > p > s > #nlpp > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_43,axiom,
    t(c,c,c),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ! [X,Y,Z] :
      ( ~ p(X,Y,Z)
      | ~ t(X,Y,Z) ),
    file(unknown,unknown) ).

tff(f_33,axiom,
    ! [X,Y,Z] :
      ( ~ q(X,Y,Z)
      | ~ t(Y,Z,X) ),
    file(unknown,unknown) ).

tff(f_42,axiom,
    s(c),
    file(unknown,unknown) ).

tff(f_58,axiom,
    ! [X,Y,Z] :
      ( ~ s(X)
      | ~ s(Y)
      | ~ s(Z)
      | p(X,Y,Z)
      | q(Y,Z,X)
      | r(Z,X,Y) ),
    file(unknown,unknown) ).

tff(f_39,axiom,
    ! [X,Y,Z] :
      ( ~ r(X,Y,Z)
      | ~ t(Z,X,Y) ),
    file(unknown,unknown) ).

tff(c_14,plain,
    t(c,c,c),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_22,plain,
    ! [X_16,Y_17,Z_18] :
      ( ~ t(X_16,Y_17,Z_18)
      | ~ p(X_16,Y_17,Z_18) ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_26,plain,
    ~ p(c,c,c),
    inference(resolution,[status(thm)],[c_14,c_22]) ).

tff(c_17,plain,
    ! [Y_13,Z_14,X_15] :
      ( ~ t(Y_13,Z_14,X_15)
      | ~ q(X_15,Y_13,Z_14) ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_21,plain,
    ~ q(c,c,c),
    inference(resolution,[status(thm)],[c_14,c_17]) ).

tff(c_12,plain,
    s(c),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_16,plain,
    ! [Z_12,X_10,Y_11] :
      ( r(Z_12,X_10,Y_11)
      | q(Y_11,Z_12,X_10)
      | p(X_10,Y_11,Z_12)
      | ~ s(Z_12)
      | ~ s(Y_11)
      | ~ s(X_10) ),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_27,plain,
    ! [Z_19,X_20,Y_21] :
      ( ~ t(Z_19,X_20,Y_21)
      | ~ r(X_20,Y_21,Z_19) ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_31,plain,
    ~ r(c,c,c),
    inference(resolution,[status(thm)],[c_14,c_27]) ).

tff(c_35,plain,
    ( q(c,c,c)
    | p(c,c,c)
    | ~ s(c) ),
    inference(resolution,[status(thm)],[c_16,c_31]) ).

tff(c_38,plain,
    ( q(c,c,c)
    | p(c,c,c) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_35]) ).

tff(c_40,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_26,c_21,c_38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYN009-2 : TPTP v9.0.0. Released v2.5.0.
% 0.12/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 : n009.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 : Wed Apr  9 06:50:41 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.77/1.67  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.77/1.68  
% 2.77/1.68  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------