↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN334-1 : TPTP v9.0.0. Released v1.2.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 : n019.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:03:14 PM UTC 2025

% Result   : Unsatisfiable 2.89s 1.78s
% Output   : CNFRefutation 2.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   27 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   59 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   63 (  31   ~;  32   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   5 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  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   47 (  47   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ g > f > z > #nlpp

%Foreground sorts:

%Background operators:

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

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

tff(z,type,
    z: ( $i * $i ) > $i ).

tff(f_63,axiom,
    ! [X,Y] :
      ( g(X,Y)
      | g(z(X,Y),z(X,Y)) ),
    file(unknown,unknown) ).

tff(f_59,axiom,
    ! [X,Y] :
      ( ~ g(z(X,Y),z(X,Y))
      | f(X,Y) ),
    file(unknown,unknown) ).

tff(f_34,axiom,
    ! [X,Y] :
      ( ~ f(X,Y)
      | f(X,z(X,Y))
      | ~ g(Y,z(X,Y)) ),
    file(unknown,unknown) ).

tff(f_42,axiom,
    ! [X,Y] :
      ( ~ f(X,Y)
      | ~ f(X,z(X,Y))
      | g(Y,z(X,Y)) ),
    file(unknown,unknown) ).

tff(f_69,axiom,
    ! [X,Y] :
      ( ~ g(X,Y)
      | ~ g(z(X,Y),z(X,Y)) ),
    file(unknown,unknown) ).

tff(f_50,axiom,
    ! [X,Y] :
      ( ~ f(z(X,Y),z(X,Y))
      | g(z(X,Y),z(X,Y))
      | ~ f(X,Y) ),
    file(unknown,unknown) ).

tff(f_54,axiom,
    ! [X,Y] :
      ( f(z(X,Y),z(X,Y))
      | f(X,Y) ),
    file(unknown,unknown) ).

tff(c_12,plain,
    ! [X_11,Y_12] :
      ( g(z(X_11,Y_12),z(X_11,Y_12))
      | g(X_11,Y_12) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_22,plain,
    ! [X_21,Y_22] :
      ( f(X_21,Y_22)
      | ~ g(z(X_21,Y_22),z(X_21,Y_22)) ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_26,plain,
    ! [X_11,Y_12] :
      ( f(X_11,Y_12)
      | g(X_11,Y_12) ),
    inference(resolution,[status(thm)],[c_12,c_22]) ).

tff(c_36,plain,
    ! [Y_25,X_26] :
      ( ~ g(Y_25,z(X_26,Y_25))
      | f(X_26,z(X_26,Y_25))
      | ~ f(X_26,Y_25) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_40,plain,
    ! [X_26,X_11] :
      ( f(X_26,z(X_26,X_11))
      | ~ f(X_26,X_11)
      | f(X_11,z(X_26,X_11)) ),
    inference(resolution,[status(thm)],[c_26,c_36]) ).

tff(c_55,plain,
    ! [X_26] :
      ( ~ f(X_26,X_26)
      | f(X_26,z(X_26,X_26)) ),
    inference(factorization,[status(thm),theory(equality)],[c_40]) ).

tff(c_71,plain,
    ! [X_35] :
      ( ~ f(X_35,X_35)
      | f(X_35,z(X_35,X_35)) ),
    inference(factorization,[status(thm),theory(equality)],[c_40]) ).

tff(c_4,plain,
    ! [Y_4,X_3] :
      ( g(Y_4,z(X_3,Y_4))
      | ~ f(X_3,z(X_3,Y_4))
      | ~ f(X_3,Y_4) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_74,plain,
    ! [X_35] :
      ( g(X_35,z(X_35,X_35))
      | ~ f(X_35,X_35) ),
    inference(resolution,[status(thm)],[c_71,c_4]) ).

tff(c_27,plain,
    ! [X_23,Y_24] :
      ( f(X_23,Y_24)
      | g(X_23,Y_24) ),
    inference(resolution,[status(thm)],[c_12,c_22]) ).

tff(c_14,plain,
    ! [X_13,Y_14] :
      ( ~ g(z(X_13,Y_14),z(X_13,Y_14))
      | ~ g(X_13,Y_14) ),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_35,plain,
    ! [X_13,Y_14] :
      ( ~ g(X_13,Y_14)
      | f(z(X_13,Y_14),z(X_13,Y_14)) ),
    inference(resolution,[status(thm)],[c_27,c_14]) ).

tff(c_62,plain,
    ! [X_33,Y_34] :
      ( ~ f(X_33,Y_34)
      | g(z(X_33,Y_34),z(X_33,Y_34))
      | ~ f(z(X_33,Y_34),z(X_33,Y_34)) ),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_79,plain,
    ! [X_37,Y_38] :
      ( ~ g(X_37,Y_38)
      | ~ f(X_37,Y_38)
      | ~ f(z(X_37,Y_38),z(X_37,Y_38)) ),
    inference(resolution,[status(thm)],[c_62,c_14]) ).

tff(c_88,plain,
    ! [X_39,Y_40] :
      ( ~ f(X_39,Y_40)
      | ~ g(X_39,Y_40) ),
    inference(resolution,[status(thm)],[c_35,c_79]) ).

tff(c_114,plain,
    ! [X_43] :
      ( ~ f(X_43,z(X_43,X_43))
      | ~ f(X_43,X_43) ),
    inference(resolution,[status(thm)],[c_74,c_88]) ).

tff(c_122,plain,
    ! [X_26] : ~ f(X_26,X_26),
    inference(resolution,[status(thm)],[c_55,c_114]) ).

tff(c_8,plain,
    ! [X_7,Y_8] :
      ( f(X_7,Y_8)
      | f(z(X_7,Y_8),z(X_7,Y_8)) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_124,plain,
    ! [X_7,Y_8] : f(X_7,Y_8),
    inference(negUnitSimplification,[status(thm)],[c_122,c_8]) ).

tff(c_138,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_124,c_122]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN334-1 : TPTP v9.0.0. Released v1.2.0.
% 0.11/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 : n019.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 : Wed Apr  9 07:18:17 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.89/1.78  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.89/1.79  
% 2.89/1.79  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------