↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : ITP001+2 : TPTP v9.0.0. Bugfixed v7.5.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 : n005.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 06:51:48 PM UTC 2025

% Result   : Theorem 2.56s 1.62s
% Output   : CNFRefutation 2.56s
% 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 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    1 (   1   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   2 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-4 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ mem > p > ne > k > arr > ap > #nlpp > i > c_2Emin_2E_3D > ind > c_2Ebool_2ET > bool > #skF_1

%Foreground sorts:

%Background operators:

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

tff(ne,type,
    ne: $i > $o ).

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

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

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

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

tff(p,type,
    p: $i > $o ).

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

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

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

tff('#skF_1',type,
    '#skF_1': ( $i * $i * $i * $i ) > $i ).

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

tff(f_122,negated_conjecture,
    ~ $true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ebool_2ETRUTH) ).

tff(c_39,plain,
    $false,
    inference(cnfTransformation,[status(thm)],[f_122]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ITP001+2 : TPTP v9.0.0. Bugfixed v7.5.0.
% 0.06/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.11/0.33  % Computer : n005.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Tue Apr  8 00:19:42 EDT 2025
% 0.11/0.33  % CPUTime  : 
% 2.56/1.62  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.56/1.62  
% 2.56/1.62  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------