↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : ARI709_1 : TPTP v9.0.0. Released v6.3.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 : n018.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:40:52 PM UTC 2025

% Result   : Theorem 2.35s 1.52s
% Output   : CNFRefutation 2.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    6 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :    6 (   5 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :    9 (   0 atm;   2 fun;   7 num;   0 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   1 usr;   3 con; 0-2 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp

%Foreground sorts:

%Background operators:
tff(a,type,
    a: $int ).

%Foreground operators:

tff(f_32,negated_conjecture,
    a != 3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

tff(f_30,axiom,
    $product(1,a) = 3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',eq) ).

tff(c_4,plain,
    a != 3,
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_1,plain,
    $product(1,a) = 3,
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_5,plain,
    a = 3,
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).

tff(c_6,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_4,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ARI709_1 : TPTP v9.0.0. Released v6.3.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.12/0.34  % Computer : n018.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Apr  7 15:18:02 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.35/1.52  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.35/1.52  
% 2.35/1.53  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------