↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM838+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 : n021.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:17 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ less > leq > greater > vskolem7 > vplus > #nlpp > vsucc > vd303 > vd302 > vd301 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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_30,axiom,
    greater(vd301,vd302),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(antec(195),304,0)) ).

tff(f_50,axiom,
    ! [Vd310,Vd311,Vd312] :
      ( greater(Vd311,Vd312)
     => greater(vplus(Vd311,Vd310),vplus(Vd312,Vd310)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(proof(196),0),4)) ).

tff(f_29,negated_conjecture,
    ~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conseq(195),305,0)) ).

tff(c_4,plain,
    greater(vd301,vd302),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_1179,plain,
    ! [Vd311_166,Vd310_167,Vd312_168] :
      ( greater(vplus(Vd311_166,Vd310_167),vplus(Vd312_168,Vd310_167))
      | ~ greater(Vd311_166,Vd312_168) ),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_2,plain,
    ~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_1188,plain,
    ~ greater(vd301,vd302),
    inference(resolution,[status(thm)],[c_1179,c_2]) ).

tff(c_1258,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_1188]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07  % Problem  : NUM838+2 : TPTP v9.0.0. Released v4.1.0.
% 0.02/0.08  % 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.07/0.27  % Computer : n021.cluster.edu
% 0.07/0.27  % Model    : x86_64 x86_64
% 0.07/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27  % Memory   : 8042.1875MB
% 0.07/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27  % CPULimit : 300
% 0.07/0.27  % WCLimit  : 300
% 0.07/0.27  % DateTime : Tue Apr  8 15:33:58 EDT 2025
% 0.07/0.27  % CPUTime  : 
% 4.38/2.13  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.38/2.13  
% 4.38/2.13  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------