↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LDA007-2 : TPTP v9.0.0. Bugfixed v2.6.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 : 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 07:40:37 PM UTC 2025

% Result   : Unsatisfiable 5.89s 2.48s
% Output   : CNFRefutation 5.89s
% 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       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  12 con; 0-2 aty)
%            Number of variables   :    8 (   8   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ less > f > a > #nlpp > critical_point > ttk > tt_ts > tt > tsk > ts > tk > t > stk > st > sk > s > k

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

tff(stk,type,
    stk: $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_79,axiom,
    f(t,tsk) != f(tt_ts,tk),
    file(unknown,unknown) ).

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

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

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

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

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

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

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

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

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

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

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

tff(c_550,plain,
    ! [X_49,Y_50,Z_51] : ( f(f(X_49,Y_50),f(X_49,Z_51)) = f(X_49,f(Y_50,Z_51)) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_1130,plain,
    ! [Z_73] : ( f(tt,f(t,Z_73)) = f(t,f(t,Z_73)) ),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_550]) ).

tff(c_1157,plain,
    f(t,f(t,s)) = f(tt,ts),
    inference(superposition,[status(thm),theory(equality)],[c_24,c_1130]) ).

tff(c_1162,plain,
    f(t,ts) = tt_ts,
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_26,c_1157]) ).

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

tff(c_2798,plain,
    ! [Y_97] : ( f(f(t,Y_97),tk) = f(t,f(Y_97,k)) ),
    inference(superposition,[status(thm),theory(equality)],[c_32,c_550]) ).

tff(c_2843,plain,
    f(t,f(ts,k)) = f(tt_ts,tk),
    inference(superposition,[status(thm),theory(equality)],[c_1162,c_2798]) ).

tff(c_2855,plain,
    f(tt_ts,tk) = f(t,tsk),
    inference(demodulation,[status(thm),theory(equality)],[c_36,c_2843]) ).

tff(c_2857,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_40,c_2855]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LDA007-2 : TPTP v9.0.0. Bugfixed v2.6.0.
% 0.06/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.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 : Tue Apr  8 07:39:32 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 5.89/2.48  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.89/2.48  
% 5.89/2.48  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------