↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM843+2 : TPTP v9.0.0. Released v4.1.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 : n004.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:57:18 PM UTC 2025

% Result   : Theorem 7.37s 2.69s
% Output   : CNFRefutation 7.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   41 (  10 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   29 (  12   ~;  14   |;   0   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (  19   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > #nlpp > vsucc > vskolem2 > vd391 > vd390 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_128,axiom,
    ! [Vd244,Vd245] :
      ( geq(Vd245,Vd244)
    <=> ( greater(Vd245,Vd244)
        | ( Vd245 = Vd244 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),16),1)) ).

tff(f_29,negated_conjecture,
    ~ greater(vd390,vd391),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(244,394,0)) ).

tff(f_142,axiom,
    ! [Vd203,Vd204] :
      ( ( Vd203 = Vd204 )
      | greater(Vd203,Vd204)
      | less(Vd203,Vd204) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(goal(130),0),0)) ).

tff(f_122,axiom,
    ! [Vd249,Vd250] :
      ( leq(Vd250,Vd249)
    <=> ( less(Vd250,Vd249)
        | ( Vd250 = Vd249 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),17),1)) ).

tff(f_31,axiom,
    ~ leq(vd390,vd391),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conjunct2(243),393,0)) ).

tff(f_116,axiom,
    ! [Vd254,Vd255] :
      ( geq(Vd254,Vd255)
     => leq(Vd255,Vd254) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(158,0),0)) ).

tff(c_55,plain,
    ! [Vd245_52] : geq(Vd245_52,Vd245_52),
    inference(cnfTransformation,[status(thm)],[f_128]) ).

tff(c_2,plain,
    ~ greater(vd390,vd391),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_868,plain,
    ! [Vd203_202,Vd204_203] :
      ( less(Vd203_202,Vd204_203)
      | greater(Vd203_202,Vd204_203)
      | ( Vd204_203 = Vd203_202 ) ),
    inference(cnfTransformation,[status(thm)],[f_142]) ).

tff(c_51,plain,
    ! [Vd250_50,Vd249_49] :
      ( ~ less(Vd250_50,Vd249_49)
      | leq(Vd250_50,Vd249_49) ),
    inference(cnfTransformation,[status(thm)],[f_122]) ).

tff(c_4810,plain,
    ! [Vd203_363,Vd204_364] :
      ( leq(Vd203_363,Vd204_364)
      | greater(Vd203_363,Vd204_364)
      | ( Vd204_364 = Vd203_363 ) ),
    inference(resolution,[status(thm)],[c_868,c_51]) ).

tff(c_4,plain,
    ~ leq(vd390,vd391),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_4824,plain,
    ( greater(vd390,vd391)
    | ( vd391 = vd390 ) ),
    inference(resolution,[status(thm)],[c_4810,c_4]) ).

tff(c_4831,plain,
    vd391 = vd390,
    inference(negUnitSimplification,[status(thm)],[c_2,c_4824]) ).

tff(c_927,plain,
    ! [Vd245_208,Vd244_209] :
      ( ( Vd245_208 = Vd244_209 )
      | greater(Vd245_208,Vd244_209)
      | ~ geq(Vd245_208,Vd244_209) ),
    inference(cnfTransformation,[status(thm)],[f_128]) ).

tff(c_982,plain,
    ( ( vd391 = vd390 )
    | ~ geq(vd390,vd391) ),
    inference(resolution,[status(thm)],[c_927,c_2]) ).

tff(c_1016,plain,
    ~ geq(vd390,vd391),
    inference(splitLeft,[status(thm)],[c_982]) ).

tff(c_4849,plain,
    ~ geq(vd390,vd390),
    inference(demodulation,[status(thm),theory(equality)],[c_4831,c_1016]) ).

tff(c_4869,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_55,c_4849]) ).

tff(c_4870,plain,
    vd391 = vd390,
    inference(splitRight,[status(thm)],[c_982]) ).

tff(c_276,plain,
    ! [Vd255_147,Vd254_148] :
      ( leq(Vd255_147,Vd254_148)
      | ~ geq(Vd254_148,Vd255_147) ),
    inference(cnfTransformation,[status(thm)],[f_116]) ).

tff(c_284,plain,
    ~ geq(vd391,vd390),
    inference(resolution,[status(thm)],[c_276,c_4]) ).

tff(c_4875,plain,
    ~ geq(vd390,vd390),
    inference(demodulation,[status(thm),theory(equality)],[c_4870,c_284]) ).

tff(c_4884,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_55,c_4875]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : NUM843+2 : TPTP v9.0.0. Released v4.1.0.
% 0.03/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.14/0.35  % Computer : n004.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue Apr  8 15:34:07 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 7.37/2.69  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.37/2.69  
% 7.37/2.69  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------