↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SEU167+1 : TPTP v9.0.0. Released v3.3.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 : n010.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:53:03 PM UTC 2025

% Result   : Theorem 3.30s 1.81s
% Output   : CNFRefutation 3.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   27 (  12   ~;   9   |;   3   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   27 (  27   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ subset > cartesian_product2 > #nlpp > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_42,negated_conjecture,
    ~ ! [A,B,C,D] :
        ( ( subset(A,B)
          & subset(C,D) )
       => subset(cartesian_product2(A,C),cartesian_product2(B,D)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t119_zfmisc_1) ).

tff(f_35,axiom,
    ! [A,B,C] :
      ( subset(A,B)
     => ( subset(cartesian_product2(A,C),cartesian_product2(B,C))
        & subset(cartesian_product2(C,A),cartesian_product2(C,B)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t118_zfmisc_1) ).

tff(f_48,axiom,
    ! [A,B,C] :
      ( ( subset(A,B)
        & subset(B,C) )
     => subset(A,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).

tff(c_12,plain,
    subset('#skF_3','#skF_4'),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_14,plain,
    subset('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_6,plain,
    ! [C_5,A_3,B_4] :
      ( subset(cartesian_product2(C_5,A_3),cartesian_product2(C_5,B_4))
      | ~ subset(A_3,B_4) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_61,plain,
    ! [A_20,C_21,B_22] :
      ( subset(cartesian_product2(A_20,C_21),cartesian_product2(B_22,C_21))
      | ~ subset(A_20,B_22) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_16,plain,
    ! [A_6,C_8,B_7] :
      ( subset(A_6,C_8)
      | ~ subset(B_7,C_8)
      | ~ subset(A_6,B_7) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_79,plain,
    ! [A_27,B_28,C_29,A_30] :
      ( subset(A_27,cartesian_product2(B_28,C_29))
      | ~ subset(A_27,cartesian_product2(A_30,C_29))
      | ~ subset(A_30,B_28) ),
    inference(resolution,[status(thm)],[c_61,c_16]) ).

tff(c_204,plain,
    ! [C_47,A_48,B_49,B_50] :
      ( subset(cartesian_product2(C_47,A_48),cartesian_product2(B_49,B_50))
      | ~ subset(C_47,B_49)
      | ~ subset(A_48,B_50) ),
    inference(resolution,[status(thm)],[c_6,c_79]) ).

tff(c_10,plain,
    ~ subset(cartesian_product2('#skF_1','#skF_3'),cartesian_product2('#skF_2','#skF_4')),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_219,plain,
    ( ~ subset('#skF_1','#skF_2')
    | ~ subset('#skF_3','#skF_4') ),
    inference(resolution,[status(thm)],[c_204,c_10]) ).

tff(c_229,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_14,c_219]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SEU167+1 : TPTP v9.0.0. Released v3.3.0.
% 0.12/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.13/0.35  % Computer : n010.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Tue Apr  8 22:11:33 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 3.30/1.81  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.30/1.82  
% 3.30/1.82  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------