↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : ITP209_1 : TPTP v9.0.0. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n015.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 06:52:46 PM UTC 2025

% Result   : Theorem 3.31s 1.65s
% Output   : CNFRefutation 3.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    8 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :    8 (   7 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    :    5 (   2 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;   6 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   0   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
%$ syntax_ac_operator_a > pp > aa_a_fun_a_a > aa_a_a > #nlpp > fTrue > fFalse > f > c > b > a2 > #skF_7 > #skF_3 > #skF_2 > #skF_8 > #skF_9 > #skF_10 > #skF_1 > #skF_4 > #skF_6 > #skF_5

%Foreground sorts:
tff(fun_a_a,type,
    fun_a_a: $tType ).

tff(fun_a_fun_a_a,type,
    fun_a_fun_a_a: $tType ).

tff(bool,type,
    bool: $tType ).

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

%Background operators:

%Foreground operators:
tff('#skF_7',type,
    '#skF_7': fun_a_fun_a_a > a ).

tff(fTrue,type,
    fTrue: bool ).

tff(a2,type,
    a2: a ).

tff(c,type,
    c: a ).

tff('#skF_3',type,
    '#skF_3': fun_a_fun_a_a > a ).

tff('#skF_2',type,
    '#skF_2': fun_a_fun_a_a > a ).

tff(aa_a_a,type,
    aa_a_a: ( fun_a_a * a ) > a ).

tff('#skF_8',type,
    '#skF_8': fun_a_fun_a_a > a ).

tff('#skF_9',type,
    '#skF_9': fun_a_fun_a_a > a ).

tff(syntax_ac_operator_a,type,
    syntax_ac_operator_a: fun_a_fun_a_a > $o ).

tff('#skF_10',type,
    '#skF_10': fun_a_fun_a_a > a ).

tff('#skF_1',type,
    '#skF_1': fun_a_fun_a_a > a ).

tff(aa_a_fun_a_a,type,
    aa_a_fun_a_a: ( fun_a_fun_a_a * a ) > fun_a_a ).

tff('#skF_4',type,
    '#skF_4': fun_a_fun_a_a > a ).

tff(f,type,
    f: fun_a_fun_a_a ).

tff(pp,type,
    pp: bool > $o ).

tff('#skF_6',type,
    '#skF_6': fun_a_fun_a_a > a ).

tff(fFalse,type,
    fFalse: bool ).

tff('#skF_5',type,
    '#skF_5': fun_a_fun_a_a > a ).

tff(b,type,
    b: a ).

tff(f_38,axiom,
    ! [A: a,B: a] : ( aa_a_a(aa_a_fun_a_a(f,A),B) = aa_a_a(aa_a_fun_a_a(f,B),A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_commute) ).

tff(f_44,axiom,
    ! [A: a,B: a,C: a] : ( aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,A),B)),C) = aa_a_a(aa_a_fun_a_a(f,A),aa_a_a(aa_a_fun_a_a(f,B),C)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_right__assoc) ).

tff(f_90,negated_conjecture,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) != aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(c_4,plain,
    ! [B_2: a,A_1: a] : ( aa_a_a(aa_a_fun_a_a(f,B_2),A_1) = aa_a_a(aa_a_fun_a_a(f,A_1),B_2) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_8,plain,
    ! [A_6: a,B_7: a,C_8: a] : ( aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,A_6),B_7)),C_8) = aa_a_a(aa_a_fun_a_a(f,A_6),aa_a_a(aa_a_fun_a_a(f,B_7),C_8)) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_30,plain,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b) != aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c),
    inference(cnfTransformation,[status(thm)],[f_90]) ).

tff(c_31,plain,
    aa_a_a(aa_a_fun_a_a(f,a2),aa_a_a(aa_a_fun_a_a(f,c),b)) != aa_a_a(aa_a_fun_a_a(f,a2),aa_a_a(aa_a_fun_a_a(f,b),c)),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_8,c_30]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : ITP209_1 : TPTP v9.0.0. Released v8.0.0.
% 0.03/0.13  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.34  % Computer : n015.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Apr  8 01:36:20 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 3.31/1.65  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.31/1.66  
% 3.31/1.66  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------