↑ Up

Beagle---0.9.52.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd473 > vd471 > vd470 > vd469 > v1 > #skF_3 > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(vd473,type,
    vd473: $i ).

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

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

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

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

tff('#skF_3',type,
    '#skF_3': ( $i * $i ) > $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(vd471,type,
    vd471: $i ).

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

tff(vmul,type,
    vmul: ( $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(f_31,axiom,
    vd470 = vplus(vd471,vd473),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conseq_conjunct1(conseq(302)),474,0)) ).

tff(f_36,axiom,
    ! [Vd432,Vd433,Vd434] : ( vmul(Vd432,vplus(Vd433,Vd434)) = vplus(vmul(Vd432,Vd433),vmul(Vd432,Vd434)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(281,0),0)) ).

tff(f_38,axiom,
    ! [Vd418,Vd419] : ( vmul(Vd418,Vd419) = vmul(Vd419,Vd418) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(270,0),0)) ).

tff(f_29,negated_conjecture,
    vmul(vplus(vd471,vd473),vd469) != vplus(vmul(vd471,vd469),vmul(vd473,vd469)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conseq_conjunct2(conseq(302)),475,1)) ).

tff(c_6,plain,
    vplus(vd471,vd473) = vd470,
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_12,plain,
    ! [Vd432_4,Vd433_5,Vd434_6] : ( vplus(vmul(Vd432_4,Vd433_5),vmul(Vd432_4,Vd434_6)) = vmul(Vd432_4,vplus(Vd433_5,Vd434_6)) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_14,plain,
    ! [Vd419_8,Vd418_7] : ( vmul(Vd419_8,Vd418_7) = vmul(Vd418_7,Vd419_8) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_2,plain,
    vplus(vmul(vd471,vd469),vmul(vd473,vd469)) != vmul(vplus(vd471,vd473),vd469),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_66,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_12,c_6,c_14,c_14,c_14,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM851+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 : n024.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:34:36 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.13/1.85  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.13/1.85  
% 3.13/1.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------