↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYO611-1 : TPTP v9.0.0. Released v7.1.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 : n010.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:37:58 PM UTC 2025

% Result   : Unsatisfiable 2.47s 1.54s
% Output   : CNFRefutation 2.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    8 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   12 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   11 (   7   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ le > eq > max > #nlpp > s > f > a0

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_25,axiom,
    ! [A] : le(A,A),
    file(unknown,unknown) ).

tff(f_37,axiom,
    ! [A] : eq(f(A),a0),
    file(unknown,unknown) ).

tff(f_46,axiom,
    ! [A0,A1] :
      ( ~ eq(f(A0),a0)
      | ~ eq(f(A1),a0)
      | ~ le(s(A0),A1) ),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [A_1] : le(A_1,A_1),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_8,plain,
    ! [A_8] : eq(f(A_8),a0),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_10,plain,
    ! [A0_9,A1_10] :
      ( ~ le(s(A0_9),A1_10)
      | ~ eq(f(A1_10),a0)
      | ~ eq(f(A0_9),a0) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_14,plain,
    ! [A0_12,A1_13] : ~ le(s(A0_12),A1_13),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_8,c_10]) ).

tff(c_19,plain,
    $false,
    inference(resolution,[status(thm)],[c_2,c_14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYO611-1 : TPTP v9.0.0. Released v7.1.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.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Wed Apr  9 09:35:34 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 2.47/1.54  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.47/1.54  
% 2.47/1.54  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------