↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN053+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/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 10:02:18 PM UTC 2025

% Result   : Theorem 2.36s 1.50s
% Output   : CNFRefutation 2.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   13 (   6   ~;   6   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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   :   10 (  10   !;   0   ?;   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_35,negated_conjecture,
    ~ ( ! [X] :
          ( p
          | big_f(X) )
    <=> ( p
        | ! [X1] : big_f(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel23) ).

tff(c_10,plain,
    ~ p,
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_18,plain,
    ! [X_1,X1_2] :
      ( big_f(X_1)
      | big_f(X1_2)
      | p ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_19,plain,
    ! [X_1,X1_2] :
      ( big_f(X_1)
      | big_f(X1_2) ),
    inference(negUnitSimplification,[status(thm)],[c_10,c_18]) ).

tff(c_33,plain,
    ! [X1_2] : big_f(X1_2),
    inference(splitLeft,[status(thm)],[c_19]) ).

tff(c_23,plain,
    ! [X1_2] : big_f(X1_2),
    inference(splitLeft,[status(thm)],[c_19]) ).

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

tff(c_22,plain,
    ~ big_f('#skF_2'),
    inference(splitLeft,[status(thm)],[c_2]) ).

tff(c_26,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_23,c_22]) ).

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

tff(c_30,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_27,c_22]) ).

tff(c_31,plain,
    ~ big_f('#skF_1'),
    inference(splitRight,[status(thm)],[c_2]) ).

tff(c_37,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_33,c_31]) ).

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

tff(c_42,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_38,c_31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN053+1 : TPTP v9.0.0. Released v2.0.0.
% 0.03/0.12  % 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 : Wed Apr  9 06:54:02 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.36/1.50  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.36/1.51  
% 2.36/1.51  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------