↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LDA007-3 : 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/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 : n023.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 07:40:37 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ f > #nlpp > tt_ts > tt > tsk > ts > tk > t > s > k

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_34,axiom,
    f(t,tsk) != f(tt_ts,tk),
    file(unknown,unknown) ).

tff(f_31,axiom,
    tsk = f(ts,k),
    file(unknown,unknown) ).

tff(f_28,axiom,
    ts = f(t,s),
    file(unknown,unknown) ).

tff(f_29,axiom,
    tt_ts = f(tt,ts),
    file(unknown,unknown) ).

tff(f_27,axiom,
    tt = f(t,t),
    file(unknown,unknown) ).

tff(f_26,axiom,
    ! [X,Y,Z] : ( f(X,f(Y,Z)) = f(f(X,Y),f(X,Z)) ),
    file(unknown,unknown) ).

tff(f_30,axiom,
    tk = f(t,k),
    file(unknown,unknown) ).

tff(c_14,plain,
    f(tt_ts,tk) != f(t,tsk),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_12,plain,
    f(ts,k) = tsk,
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_6,plain,
    f(t,s) = ts,
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_8,plain,
    f(tt,ts) = tt_ts,
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_4,plain,
    f(t,t) = tt,
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_35,plain,
    ! [X_4,Y_5,Z_6] : ( f(f(X_4,Y_5),f(X_4,Z_6)) = f(X_4,f(Y_5,Z_6)) ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_180,plain,
    ! [Y_9] : ( f(f(t,Y_9),ts) = f(t,f(Y_9,s)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_35]) ).

tff(c_210,plain,
    f(t,f(t,s)) = f(tt,ts),
    inference(superposition,[status(thm),theory(equality)],[c_4,c_180]) ).

tff(c_214,plain,
    f(t,ts) = tt_ts,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_8,c_210]) ).

tff(c_10,plain,
    f(t,k) = tk,
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_416,plain,
    ! [Y_12] : ( f(f(t,Y_12),tk) = f(t,f(Y_12,k)) ),
    inference(superposition,[status(thm),theory(equality)],[c_10,c_35]) ).

tff(c_449,plain,
    f(t,f(ts,k)) = f(tt_ts,tk),
    inference(superposition,[status(thm),theory(equality)],[c_214,c_416]) ).

tff(c_470,plain,
    f(tt_ts,tk) = f(t,tsk),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_449]) ).

tff(c_472,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_14,c_470]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : LDA007-3 : TPTP v9.0.0. Released v1.0.0.
% 0.00/0.10  % 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.09/0.30  % Computer : n023.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Tue Apr  8 07:40:39 EDT 2025
% 0.09/0.30  % CPUTime  : 
% 3.81/2.46  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.81/2.46  
% 3.81/2.46  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------