↑ Up

Beagle---0.9.52.UNS-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
%$ left > f > #nlpp > u > n3 > n2 > n1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_42,axiom,
    ~ left(n3,u),
    file(unknown,unknown) ).

tff(f_39,axiom,
    u = f(n2,n2),
    file(unknown,unknown) ).

tff(f_37,axiom,
    n2 = f(n1,n1),
    file(unknown,unknown) ).

tff(f_38,axiom,
    n3 = f(n2,n1),
    file(unknown,unknown) ).

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

tff(f_27,axiom,
    ! [X,Y] : left(X,f(X,Y)),
    file(unknown,unknown) ).

tff(c_14,plain,
    ~ left(n3,u),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_12,plain,
    f(n2,n2) = u,
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_8,plain,
    f(n1,n1) = n2,
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_10,plain,
    f(n2,n1) = n3,
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_50,plain,
    ! [X_14,Y_15,Z_16] : ( f(f(X_14,Y_15),f(X_14,Z_16)) = f(X_14,f(Y_15,Z_16)) ),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

tff(c_4,plain,
    ! [X_4,Y_5] : left(X_4,f(X_4,Y_5)),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_128,plain,
    ! [X_23,Y_24,Z_25] : left(f(X_23,Y_24),f(X_23,f(Y_24,Z_25))),
    inference(superposition,[status(thm),theory(equality)],[c_50,c_4]) ).

tff(c_159,plain,
    ! [Z_26] : left(n3,f(n2,f(n1,Z_26))),
    inference(superposition,[status(thm),theory(equality)],[c_10,c_128]) ).

tff(c_163,plain,
    left(n3,f(n2,n2)),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_159]) ).

tff(c_165,plain,
    left(n3,u),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_163]) ).

tff(c_167,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_14,c_165]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LDA003-1 : TPTP v9.0.0. Released v1.0.0.
% 0.07/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.33  % Computer : n008.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Tue Apr  8 07:38:17 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.74/1.69  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.74/1.70  
% 2.74/1.70  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------