↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : ALG201+1 : TPTP v9.0.0. Released v2.7.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 : n020.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:24:45 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ sorti2 > sorti1 > op2 > op1 > #nlpp > j > h > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

tff(f_50,axiom,
    ~ ! [U] :
        ( sorti2(U)
       => ( op2(U,U) != U ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).

tff(f_87,negated_conjecture,
    ~ ( ( ! [U] :
            ( sorti1(U)
           => sorti2(h(U)) )
        & ! [V] :
            ( sorti2(V)
           => sorti1(j(V)) ) )
     => ~ ( ! [W] :
              ( sorti1(W)
             => ! [X] :
                  ( sorti1(X)
                 => ( h(op1(W,X)) = op2(h(W),h(X)) ) ) )
          & ! [Y] :
              ( sorti2(Y)
             => ! [Z] :
                  ( sorti2(Z)
                 => ( j(op2(Y,Z)) = op1(j(Y),j(Z)) ) ) )
          & ! [X1] :
              ( sorti2(X1)
             => ( h(j(X1)) = X1 ) )
          & ! [X2] :
              ( sorti1(X2)
             => ( j(h(X2)) = X2 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(f_44,axiom,
    ! [U] :
      ( sorti1(U)
     => ( op1(U,U) != U ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).

tff(c_10,plain,
    sorti2('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_20,plain,
    ! [V_9] :
      ( sorti1(j(V_9))
      | ~ sorti2(V_9) ),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_8,plain,
    op2('#skF_1','#skF_1') = '#skF_1',
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_69,plain,
    ! [Y_27,Z_28] :
      ( ( op1(j(Y_27),j(Z_28)) = j(op2(Y_27,Z_28)) )
      | ~ sorti2(Z_28)
      | ~ sorti2(Y_27) ),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_6,plain,
    ! [U_7] :
      ( ( op1(U_7,U_7) != U_7 )
      | ~ sorti1(U_7) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_108,plain,
    ! [Z_31] :
      ( ( j(op2(Z_31,Z_31)) != j(Z_31) )
      | ~ sorti1(j(Z_31))
      | ~ sorti2(Z_31)
      | ~ sorti2(Z_31) ),
    inference(superposition,[status(thm),theory(equality)],[c_69,c_6]) ).

tff(c_113,plain,
    ( ~ sorti1(j('#skF_1'))
    | ~ sorti2('#skF_1') ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_108]) ).

tff(c_116,plain,
    ~ sorti1(j('#skF_1')),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_113]) ).

tff(c_119,plain,
    ~ sorti2('#skF_1'),
    inference(resolution,[status(thm)],[c_20,c_116]) ).

tff(c_123,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_119]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13  % Problem  : ALG201+1 : TPTP v9.0.0. Released v2.7.0.
% 0.09/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.13/0.35  % Computer : n020.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.36  % CPULimit : 300
% 0.13/0.36  % WCLimit  : 300
% 0.13/0.36  % DateTime : Sun Apr  6 07:08:49 EDT 2025
% 0.13/0.36  % CPUTime  : 
% 2.98/1.73  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.98/1.73  
% 2.98/1.73  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------