↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN051+1 : TPTP v9.0.0. Released v2.0.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 : n006.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:02:17 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ big_f > #nlpp > p > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(p,type,
    p: $o ).

tff('#skF_2',type,
    '#skF_2': $i ).

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

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

tff(f_40,negated_conjecture,
    ~ ? [X] :
        ( p
      <=> big_f(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel21) ).

tff(f_31,axiom,
    ? [X] :
      ( p
     => big_f(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel21_1) ).

tff(f_35,axiom,
    ? [X] :
      ( big_f(X)
     => p ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel21_2) ).

tff(c_12,plain,
    ! [X_1] :
      ( p
      | big_f(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_13,plain,
    p,
    inference(splitLeft,[status(thm)],[c_12]) ).

tff(c_6,plain,
    ! [X_1] :
      ( ~ big_f(X_1)
      | ~ p ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_15,plain,
    ! [X_1] : ~ big_f(X_1),
    inference(demodulation,[status(thm),theory(equality)],[c_13,c_6]) ).

tff(c_2,plain,
    ( big_f('#skF_1')
    | ~ p ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_19,plain,
    big_f('#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_13,c_2]) ).

tff(c_20,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_15,c_19]) ).

tff(c_22,plain,
    ~ p,
    inference(splitRight,[status(thm)],[c_12]) ).

tff(c_21,plain,
    ! [X_1] : big_f(X_1),
    inference(splitRight,[status(thm)],[c_12]) ).

tff(c_4,plain,
    ( p
    | ~ big_f('#skF_2') ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_25,plain,
    p,
    inference(demodulation,[status(thm),theory(equality)],[c_21,c_4]) ).

tff(c_26,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_22,c_25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13  % Problem  : SYN051+1 : TPTP v9.0.0. Released v2.0.0.
% 0.13/0.14  % 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.14/0.35  % Computer : n006.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.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Wed Apr  9 06:53:22 EDT 2025
% 0.14/0.36  % CPUTime  : 
% 2.41/1.57  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.41/1.58  
% 2.41/1.58  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------