↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : COL083-1 : TPTP v9.0.0. Released 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 : n002.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:48:00 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ response > compose > #nlpp > mocking_bird > a

%Foreground sorts:

%Background operators:

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

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

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

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

tff(f_28,axiom,
    ! [A,B] : ( response(a,A) != B ),
    file(unknown,unknown) ).

tff(c_6,plain,
    $false,
    inference(cnfTransformation,[status(thm)],[f_28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : COL083-1 : TPTP v9.0.0. Released v2.6.0.
% 0.03/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 : n002.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 : Mon Apr  7 16:02:31 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 2.21/1.47  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.21/1.47  
% 2.21/1.47  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------