↑ Up

Beagle---0.9.52.UNS-CRf.s

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

% Result   : Unsatisfiable 15.14s 4.80s
% Output   : CNFRefutation 15.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   11 (  10 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    5 (   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    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   22 (  22   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ pair > n > apply > #nlpp > c > b > projection2 > projection1 > k > eq > abstraction

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

tff(f_44,axiom,
    ! [X,Y,Z] : ( apply(apply(apply(abstraction,X),Y),Z) = apply(apply(X,apply(k,Z)),apply(Y,Z)) ),
    file(unknown,unknown) ).

tff(f_61,axiom,
    ! [Y] : ( apply(apply(Y,b(Y)),c(Y)) != apply(b(Y),b(Y)) ),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [X_1,Y_2] : ( apply(apply(k,X_1),Y_2) = X_1 ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_12,plain,
    ! [X_11,Z_13,Y_12] : ( apply(apply(X_11,apply(k,Z_13)),apply(Y_12,Z_13)) = apply(apply(apply(abstraction,X_11),Y_12),Z_13) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_420,plain,
    ! [X_50,Z_51,Y_52] : ( apply(apply(X_50,apply(k,Z_51)),apply(Y_52,Z_51)) = apply(apply(apply(abstraction,X_50),Y_52),Z_51) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_7060,plain,
    ! [X_157,X_158,Y_159] : ( apply(apply(apply(abstraction,X_157),apply(k,X_158)),Y_159) = apply(apply(X_157,apply(k,Y_159)),X_158) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_420]) ).

tff(c_7209,plain,
    ! [Z_13,Y_159] : ( apply(apply(apply(k,Z_13),apply(k,Y_159)),Z_13) = apply(apply(apply(apply(abstraction,abstraction),k),Z_13),Y_159) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_7060]) ).

tff(c_17778,plain,
    ! [Z_242,Y_243] : ( apply(apply(apply(apply(abstraction,abstraction),k),Z_242),Y_243) = apply(Z_242,Z_242) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_7209]) ).

tff(c_22,plain,
    ! [Y_19] : ( apply(apply(Y_19,b(Y_19)),c(Y_19)) != apply(b(Y_19),b(Y_19)) ),
    inference(cnfTransformation,[status(thm)],[f_61]) ).

tff(c_18277,plain,
    $false,
    inference(superposition,[status(thm),theory(equality)],[c_17778,c_22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : COL075-1 : TPTP v9.0.0. Released v1.2.0.
% 0.03/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.13/0.34  % Computer : n016.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 : Mon Apr  7 16:00:38 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 15.14/4.80  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.14/4.80  
% 15.14/4.80  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------