↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SET891+1 : TPTP v9.0.0. Released v3.2.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 : n006.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 08:39:32 PM UTC 2025

% Result   : Theorem 2.50s 1.55s
% Output   : CNFRefutation 2.50s
% 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    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ empty > unordered_pair > set_union2 > #nlpp > union > singleton > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

tff('#skF_2',type,
    '#skF_2': $i ).

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

tff('#skF_1',type,
    '#skF_1': $i ).

tff(empty,type,
    empty: $i > $o ).

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

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

tff(f_56,axiom,
    ! [A,B] : ( unordered_pair(A,B) = set_union2(singleton(A),singleton(B)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t41_enumset1) ).

tff(f_46,axiom,
    ! [A,B] : ( union(unordered_pair(A,B)) = set_union2(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l52_zfmisc_1) ).

tff(f_54,negated_conjecture,
    ~ ! [A,B] : ( union(unordered_pair(singleton(A),singleton(B))) = unordered_pair(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_zfmisc_1) ).

tff(c_20,plain,
    ! [A_13,B_14] : ( set_union2(singleton(A_13),singleton(B_14)) = unordered_pair(A_13,B_14) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_12,plain,
    ! [A_11,B_12] : ( union(unordered_pair(A_11,B_12)) = set_union2(A_11,B_12) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_18,plain,
    union(unordered_pair(singleton('#skF_3'),singleton('#skF_4'))) != unordered_pair('#skF_3','#skF_4'),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_21,plain,
    set_union2(singleton('#skF_3'),singleton('#skF_4')) != unordered_pair('#skF_3','#skF_4'),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_18]) ).

tff(c_23,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_20,c_21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET891+1 : TPTP v9.0.0. Released v3.2.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 : n006.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 : Tue Apr  8 21:49:07 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 2.50/1.55  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.50/1.55  
% 2.50/1.55  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------