↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : PHI011+1 : TPTP v9.0.0. Released v7.2.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 : n003.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 08:22:25 PM UTC 2025

% Result   : Theorem 3.00s 2.00s
% Output   : CNFRefutation 3.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   25 (   1 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   22 (   7   ~;   5   |;   4   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 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  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    8 (   7   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ is_the > exemplifies_property > property > object > #nlpp > #skF_2 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

tff(f_69,negated_conjecture,
    ~ ! [F] :
        ( property(F)
       => ( ? [Y] :
              ( object(Y)
              & is_the(Y,F) )
         => ! [Z] :
              ( object(Z)
             => ( is_the(Z,F)
               => exemplifies_property(F,Z) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_2) ).

tff(f_54,axiom,
    ! [X,F,Y] :
      ( ( object(X)
        & property(F)
        & object(Y) )
     => ( ( is_the(X,F)
          & ( X = Y ) )
       => exemplifies_property(F,Y) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_1) ).

tff(c_14,plain,
    ~ exemplifies_property('#skF_1','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_18,plain,
    object('#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_24,plain,
    property('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_16,plain,
    is_the('#skF_3','#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_54,plain,
    ! [F_20,Y_21] :
      ( exemplifies_property(F_20,Y_21)
      | ~ is_the(Y_21,F_20)
      | ~ property(F_20)
      | ~ object(Y_21) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_60,plain,
    ( exemplifies_property('#skF_1','#skF_3')
    | ~ property('#skF_1')
    | ~ object('#skF_3') ),
    inference(resolution,[status(thm)],[c_16,c_54]) ).

tff(c_66,plain,
    exemplifies_property('#skF_1','#skF_3'),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_24,c_60]) ).

tff(c_68,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_14,c_66]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : PHI011+1 : TPTP v9.0.0. Released v7.2.0.
% 0.07/0.14  % 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.13/0.35  % Computer : n003.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Tue Apr  8 16:28:03 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 3.00/2.00  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.00/2.01  
% 3.00/2.01  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------