↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : COL066-2 : TPTP v9.0.0. Bugfixed 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 : 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:58 PM UTC 2025

% Result   : Unsatisfiable 6.03s 2.41s
% Output   : CNFRefutation 6.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   15 (  14 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    9 (   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    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   20 (  20   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ apply > #nlpp > z > y > x > w > q > b

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_35,axiom,
    apply(apply(apply(apply(apply(apply(q,q),apply(w,apply(q,apply(q,q)))),x),y),y),z) != apply(apply(x,y),apply(apply(x,y),z)),
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [X_7,Y_8] : ( apply(apply(w,X_7),Y_8) = apply(apply(X_7,Y_8),Y_8) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_129,plain,
    ! [X_15,Y_16,Z_17] : ( apply(apply(apply(q,X_15),Y_16),Z_17) = apply(Y_16,apply(X_15,Z_17)) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_158,plain,
    ! [Y_8,Z_17] : ( apply(apply(apply(w,q),Y_8),Z_17) = apply(Y_8,apply(Y_8,Z_17)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_129]) ).

tff(c_4,plain,
    ! [X_4,Y_5,Z_6] : ( apply(apply(apply(q,X_4),Y_5),Z_6) = apply(Y_5,apply(X_4,Z_6)) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_143,plain,
    ! [X_15,Y_16,Z_17] : ( apply(apply(w,apply(apply(q,X_15),Y_16)),Z_17) = apply(apply(Y_16,apply(X_15,Z_17)),Z_17) ),
    inference(superposition,[status(thm),theory(equality)],[c_129,c_6]) ).

tff(c_147,plain,
    ! [X_15,Z_17] : ( apply(apply(w,apply(q,X_15)),Z_17) = apply(Z_17,apply(X_15,Z_17)) ),
    inference(superposition,[status(thm),theory(equality)],[c_129,c_6]) ).

tff(c_8,plain,
    apply(apply(apply(apply(apply(apply(q,q),apply(w,apply(q,apply(q,q)))),x),y),y),z) != apply(apply(x,y),apply(apply(x,y),z)),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_9,plain,
    apply(apply(apply(w,apply(apply(apply(q,q),apply(w,apply(q,apply(q,q)))),x)),y),z) != apply(apply(x,y),apply(apply(x,y),z)),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_8]) ).

tff(c_10,plain,
    apply(apply(apply(w,apply(apply(w,apply(q,apply(q,q))),apply(q,x))),y),z) != apply(apply(x,y),apply(apply(x,y),z)),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_9]) ).

tff(c_1077,plain,
    apply(apply(apply(w,apply(apply(q,x),apply(apply(q,q),apply(q,x)))),y),z) != apply(apply(x,y),apply(apply(x,y),z)),
    inference(demodulation,[status(thm),theory(equality)],[c_147,c_10]) ).

tff(c_3280,plain,
    apply(apply(apply(apply(apply(q,q),apply(q,x)),apply(x,y)),y),z) != apply(apply(x,y),apply(apply(x,y),z)),
    inference(demodulation,[status(thm),theory(equality)],[c_143,c_1077]) ).

tff(c_3283,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_158,c_6,c_4,c_4,c_3280]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : COL066-2 : TPTP v9.0.0. Bugfixed v1.2.0.
% 0.06/0.12  % 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.31  % Computer : n017.cluster.edu
% 0.12/0.31  % Model    : x86_64 x86_64
% 0.12/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31  % Memory   : 8042.1875MB
% 0.12/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31  % CPULimit : 300
% 0.12/0.31  % WCLimit  : 300
% 0.12/0.31  % DateTime : Mon Apr  7 16:00:10 EDT 2025
% 0.16/0.31  % CPUTime  : 
% 6.03/2.41  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.03/2.41  
% 6.03/2.41  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------