↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : COL033-1 : TPTP v9.0.0. Released v1.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 05:47:49 PM UTC 2025

% Result   : Unsatisfiable 9.12s 3.58s
% Output   : CNFRefutation 9.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   14 (  13 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ apply > #nlpp > f > m > l > b

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(f_32,axiom,
    ! [X] : ( apply(m,X) = apply(X,X) ),
    file(unknown,unknown) ).

tff(f_30,axiom,
    ! [X,Y] : ( apply(apply(l,X),Y) = apply(X,apply(Y,Y)) ),
    file(unknown,unknown) ).

tff(f_28,axiom,
    ! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
    file(unknown,unknown) ).

tff(f_35,axiom,
    ! [Y] : ( apply(Y,f(Y)) != apply(f(Y),apply(Y,f(Y))) ),
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [X_6] : ( apply(m,X_6) = apply(X_6,X_6) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_26,plain,
    ! [X_9,Y_10] : ( apply(apply(l,X_9),Y_10) = apply(X_9,apply(Y_10,Y_10)) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_70,plain,
    ! [X_11,X_12] : ( apply(apply(l,X_11),X_12) = apply(X_11,apply(m,X_12)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_26]) ).

tff(c_106,plain,
    ! [X_11] : ( apply(X_11,apply(m,apply(l,X_11))) = apply(m,apply(l,X_11)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_70]) ).

tff(c_2,plain,
    ! [X_1,Y_2,Z_3] : ( apply(apply(apply(b,X_1),Y_2),Z_3) = apply(X_1,apply(Y_2,Z_3)) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_233,plain,
    ! [X_16,Y_17,Z_18] : ( apply(apply(apply(b,X_16),Y_17),Z_18) = apply(X_16,apply(Y_17,Z_18)) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_8,plain,
    ! [Y_7] : ( apply(f(Y_7),apply(Y_7,f(Y_7))) != apply(Y_7,f(Y_7)) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_240,plain,
    ! [X_16,Y_17] : ( apply(f(apply(apply(b,X_16),Y_17)),apply(X_16,apply(Y_17,f(apply(apply(b,X_16),Y_17))))) != apply(apply(apply(b,X_16),Y_17),f(apply(apply(b,X_16),Y_17))) ),
    inference(superposition,[status(thm),theory(equality)],[c_233,c_8]) ).

tff(c_11187,plain,
    ! [X_66,Y_67] : ( apply(f(apply(apply(b,X_66),Y_67)),apply(X_66,apply(Y_67,f(apply(apply(b,X_66),Y_67))))) != apply(X_66,apply(Y_67,f(apply(apply(b,X_66),Y_67)))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_240]) ).

tff(c_11579,plain,
    $false,
    inference(superposition,[status(thm),theory(equality)],[c_106,c_11187]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : COL033-1 : TPTP v9.0.0. Released v1.0.0.
% 0.06/0.12  % 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.11/0.33  % Computer : n017.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Mon Apr  7 15:54:55 EDT 2025
% 0.11/0.33  % CPUTime  : 
% 9.12/3.58  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.12/3.59  
% 9.12/3.59  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------