↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : ARI684_1 : TPTP v9.0.0. Released v6.3.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 05:40:50 PM UTC 2025

% Result   : Theorem 3.27s 1.90s
% Output   : CNFRefutation 3.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% 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 :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number arithmetic     :   58 (   0 atm;  45 fun;   0 num;  13 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   3 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (  13   !;   0   ?;  13   :)

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp

%Foreground sorts:

%Background operators:
tff(c,type,
    c: $int ).

tff(b,type,
    b: $int ).

tff(a,type,
    a: $int ).

%Foreground operators:

tff(f_62,axiom,
    ! [A: $int,B: $int,C: $int] : ( $product(A,$sum(B,C)) = $sum($product(A,B),$product(A,C)) ),
    file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas.p',mult_dist) ).

tff(f_60,axiom,
    ! [A: $int,B: $int] : ( $product(A,B) = $product(B,A) ),
    file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas.p',mult_comm) ).

tff(f_31,negated_conjecture,
    $product($product(a,$sum(a,b)),c) != $sum($product($product(a,a),c),$product($product(a,b),c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

tff(c_10,plain,
    ! [A_9: $int,C_11: $int,B_10: $int] : ( $product(A_9,$sum(C_11,B_10)) = $sum($product(A_9,B_10),$product(A_9,C_11)) ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_45,plain,
    ! [A_12: $int,B_13: $int,C_14: $int] : ( $product(A_12,$sum(B_13,C_14)) = $sum($product(A_12,B_13),$product(A_12,C_14)) ),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_10]) ).

tff(c_39,plain,
    ! [B_7: $int,A_8: $int] : ( $product(B_7,A_8) = $product(A_8,B_7) ),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_29,plain,
    $product($product(a,$sum(b,a)),c) != $sum($product($product(a,a),c),$product($product(a,b),c)),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_49,plain,
    $sum($product(c,$product(a,b)),$product(c,$product(a,a))) != $sum($product(c,$product(a,a)),$product(c,$product(a,b))),
    inference(demodulation,[status(thm),theory(equality)],[c_45,c_45,c_39,c_39,c_39,c_29]) ).

tff(c_51,plain,
    $false,
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_49]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ARI684_1 : TPTP v9.0.0. Released v6.3.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.14/0.34  % Computer : n018.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Mon Apr  7 15:16:32 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 3.27/1.90  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.27/1.91  
% 3.27/1.91  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------