↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : ROB030-1 : TPTP v9.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n025.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 08:33:53 PM UTC 2025

% Result   : Unsatisfiable 2.55s 1.60s
% Output   : CNFRefutation 2.55s
% 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 (   2 avg)
%            Maximal term depth    :    3 (   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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :    4 (   4   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ add > #nlpp > negate > d > c

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(add,type,
    add: ( $i * $i ) > $i ).

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

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

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

tff(f_55,axiom,
    add(c,d) = d,
    file(unknown,unknown) ).

tff(f_58,axiom,
    ! [A,B] : ( negate(add(A,B)) != negate(B) ),
    file(unknown,unknown) ).

tff(c_8,plain,
    add(c,d) = d,
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_48,plain,
    ! [A_12,B_13] : ( negate(add(A_12,B_13)) != negate(B_13) ),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_59,plain,
    $false,
    inference(superposition,[status(thm),theory(equality)],[c_8,c_48]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ROB030-1 : TPTP v9.0.0. Released v3.1.0.
% 0.06/0.13  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.32  % Computer : n025.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Tue Apr  8 19:01:20 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 2.55/1.60  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.55/1.60  
% 2.55/1.60  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------