↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM429+3 : TPTP v9.0.0. Released v4.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 : n022.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 07:55:53 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aDivisorOf0 > aInteger0 > sdtpldt0 > sdtasdt0 > #nlpp > smndt0 > xq > xc > xb > xa > sz10 > sz00 > #skF_2 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

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

tff(xq,type,
    xq: $i ).

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

tff(xa,type,
    xa: $i ).

tff(sz10,type,
    sz10: $i ).

tff(sz00,type,
    sz00: $i ).

tff(xc,type,
    xc: $i ).

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

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

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

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

tff(xb,type,
    xb: $i ).

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

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

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

tff(f_202,hypothesis,
    ( ? [W0] :
        ( aInteger0(W0)
        & ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb)) ) )
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & ? [W0] :
        ( aInteger0(W0)
        & ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xc)) ) )
    & aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    & sdteqdtlpzmzozddtrp0(xb,xc,xq) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__853) ).

tff(f_207,negated_conjecture,
    ~ ? [W0] :
        ( aInteger0(W0)
        & ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

tff(c_90,plain,
    aInteger0('#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_202]) ).

tff(c_88,plain,
    sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,'#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_202]) ).

tff(c_92,plain,
    ! [W0_45] :
      ( ( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,W0_45) )
      | ~ aInteger0(W0_45) ),
    inference(cnfTransformation,[status(thm)],[f_207]) ).

tff(c_96,plain,
    ! [W0_46] :
      ( ( sdtasdt0(xq,W0_46) != sdtasdt0(xq,'#skF_3') )
      | ~ aInteger0(W0_46) ),
    inference(demodulation,[status(thm),theory(equality)],[c_88,c_92]) ).

tff(c_129,plain,
    $false,
    inference(resolution,[status(thm)],[c_90,c_96]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : NUM429+3 : TPTP v9.0.0. Released v4.0.0.
% 0.08/0.13  % 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.34  % Computer : n022.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 12:18:36 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.31/1.89  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.31/1.89  
% 3.31/1.89  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------