↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN083-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 : n028.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 10:02:34 PM UTC 2025

% Result   : Unsatisfiable 2.24s 1.49s
% Output   : CNFRefutation 2.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    5 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :    5 (   4 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    :    4 (   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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :    6 (   6   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ f > #nlpp > d > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_25,axiom,
    f(a,f(b,f(c,d))) != f(f(f(a,b),c),d),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [X_1,Y_2,Z_3] : ( f(f(X_1,Y_2),Z_3) = f(X_1,f(Y_2,Z_3)) ),
    inference(cnfTransformation,[status(thm)],[f_23]) ).

tff(c_4,plain,
    f(f(f(a,b),c),d) != f(a,f(b,f(c,d))),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN083-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.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Wed Apr  9 06:56:49 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 2.24/1.49  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.24/1.50  
% 2.24/1.50  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------