↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUN088+3 : TPTP v9.0.0. Released v7.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 : n016.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:21:02 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ r4 > r3 > r2 > r1 > #nlpp > #skF_11 > #skF_16 > #skF_6 > #skF_2 > #skF_18 > #skF_19 > #skF_3 > #skF_15 > #skF_12 > #skF_10 > #skF_1 > #skF_8 > #skF_21 > #skF_13 > #skF_17 > #skF_22 > #skF_14 > #skF_7 > #skF_9 > #skF_5 > #skF_4 > #skF_20

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_11',type,
    '#skF_11': ( $i * $i ) > $i ).

tff('#skF_16',type,
    '#skF_16': $i > $i ).

tff('#skF_6',type,
    '#skF_6': ( $i * $i ) > $i ).

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

tff('#skF_18',type,
    '#skF_18': $i > $i ).

tff('#skF_19',type,
    '#skF_19': $i > $i ).

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

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

tff('#skF_15',type,
    '#skF_15': $i > $i ).

tff('#skF_12',type,
    '#skF_12': ( $i * $i ) > $i ).

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

tff('#skF_10',type,
    '#skF_10': ( $i * $i ) > $i ).

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

tff('#skF_8',type,
    '#skF_8': ( $i * $i ) > $i ).

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

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

tff('#skF_13',type,
    '#skF_13': $i > $i ).

tff('#skF_17',type,
    '#skF_17': $i > $i ).

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

tff('#skF_14',type,
    '#skF_14': $i > $i ).

tff('#skF_7',type,
    '#skF_7': ( $i * $i ) > $i ).

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

tff('#skF_9',type,
    '#skF_9': ( $i * $i ) > $i ).

tff('#skF_5',type,
    '#skF_5': ( $i * $i ) > $i ).

tff('#skF_4',type,
    '#skF_4': ( $i * $i ) > $i ).

tff('#skF_20',type,
    '#skF_20': $i > $i ).

tff(f_193,negated_conjecture,
    ~ ! [Y0] :
        ( ! [Y1] :
            ( ( Y0 != Y1 )
            | ~ r2(Y0,Y1) )
        | ~ r1(Y0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerouneqone2) ).

tff(f_180,axiom,
    ! [X7,Y10] :
      ( ! [Y20] :
          ( ~ r1(Y20)
          | ( Y20 != Y10 ) )
      | ~ r2(X7,Y10) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).

tff(c_88,plain,
    '#skF_21' = '#skF_22',
    inference(cnfTransformation,[status(thm)],[f_193]) ).

tff(c_84,plain,
    r1('#skF_21'),
    inference(cnfTransformation,[status(thm)],[f_193]) ).

tff(c_90,plain,
    r1('#skF_22'),
    inference(demodulation,[status(thm),theory(equality)],[c_88,c_84]) ).

tff(c_86,plain,
    r2('#skF_21','#skF_22'),
    inference(cnfTransformation,[status(thm)],[f_193]) ).

tff(c_89,plain,
    r2('#skF_22','#skF_22'),
    inference(demodulation,[status(thm),theory(equality)],[c_88,c_86]) ).

tff(c_181,plain,
    ! [X7_95,Y20_96] :
      ( ~ r2(X7_95,Y20_96)
      | ~ r1(Y20_96) ),
    inference(cnfTransformation,[status(thm)],[f_180]) ).

tff(c_187,plain,
    ~ r1('#skF_22'),
    inference(resolution,[status(thm)],[c_89,c_181]) ).

tff(c_192,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_90,c_187]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUN088+3 : TPTP v9.0.0. Released v7.3.0.
% 0.03/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.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Apr  8 16:15:53 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.47/1.88  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.47/1.88  
% 3.47/1.88  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------