↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM837+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 : n018.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.40s 2.09s
% Output   : CNFRefutation 4.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   11 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   15 (   4 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   5   ~;   2   |;   0   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   11 (   9   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > #nlpp > vsucc > vd271 > vd269 > vd268 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(vd268,type,
    vd268: $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(vd271,type,
    vd271: $i ).

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

tff(f_94,axiom,
    ! [Vd193,Vd194] :
      ( greater(Vd194,Vd193)
    <=> ? [Vd196] : ( Vd194 = vplus(Vd193,Vd196) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),11),1)) ).

tff(f_30,negated_conjecture,
    ~ ? [Vd273] : ( vd269 = vplus(vd268,Vd273) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',qe(171)) ).

tff(f_32,axiom,
    less(vd268,vd269),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conjunct1(170),270,0)) ).

tff(f_56,axiom,
    ! [Vd226,Vd227] :
      ( less(Vd226,Vd227)
     => greater(Vd227,Vd226) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(147,0),0)) ).

tff(c_602,plain,
    ! [Vd193_149,Vd194_150] :
      ( ( vplus(Vd193_149,'#skF_2'(Vd193_149,Vd194_150)) = Vd194_150 )
      | ~ greater(Vd194_150,Vd193_149) ),
    inference(cnfTransformation,[status(thm)],[f_94]) ).

tff(c_2,plain,
    ! [Vd273_1] : ( vplus(vd268,Vd273_1) != vd269 ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_689,plain,
    ~ greater(vd269,vd268),
    inference(superposition,[status(thm),theory(equality)],[c_602,c_2]) ).

tff(c_6,plain,
    less(vd268,vd269),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_93,plain,
    ! [Vd227_74,Vd226_75] :
      ( greater(Vd227_74,Vd226_75)
      | ~ less(Vd226_75,Vd227_74) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_111,plain,
    greater(vd269,vd268),
    inference(resolution,[status(thm)],[c_6,c_93]) ).

tff(c_691,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_689,c_111]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM837+2 : TPTP v9.0.0. Released v4.1.0.
% 0.07/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 : n018.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 15:33:47 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 4.40/2.09  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.40/2.09  
% 4.40/2.09  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------