↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SEU219+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 : 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 08:53:15 PM UTC 2025

% Result   : Theorem 3.47s 2.08s
% Output   : CNFRefutation 3.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   47 (  21 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   43 (  19   ~;  15   |;   4   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 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  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-1 aty)
%            Number of variables   :    7 (   7   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ relation > one_to_one > function > #nlpp > relation_rng > relation_inverse > relation_dom > function_inverse > #skF_2 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(f_88,negated_conjecture,
    ~ ! [A] :
        ( ( relation(A)
          & function(A) )
       => ( one_to_one(A)
         => ( ( relation_rng(A) = relation_dom(function_inverse(A)) )
            & ( relation_dom(A) = relation_rng(function_inverse(A)) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_funct_1) ).

tff(f_34,axiom,
    ! [A] :
      ( ( relation(A)
        & function(A) )
     => ( one_to_one(A)
       => ( function_inverse(A) = relation_inverse(A) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_funct_1) ).

tff(f_77,axiom,
    ! [A] :
      ( relation(A)
     => ( ( relation_rng(A) = relation_dom(relation_inverse(A)) )
        & ( relation_dom(A) = relation_rng(relation_inverse(A)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_relat_1) ).

tff(c_34,plain,
    ( ( relation_rng(function_inverse('#skF_3')) != relation_dom('#skF_3') )
    | ( relation_dom(function_inverse('#skF_3')) != relation_rng('#skF_3') ) ),
    inference(cnfTransformation,[status(thm)],[f_88]) ).

tff(c_42,plain,
    relation_dom(function_inverse('#skF_3')) != relation_rng('#skF_3'),
    inference(splitLeft,[status(thm)],[c_34]) ).

tff(c_40,plain,
    relation('#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_88]) ).

tff(c_38,plain,
    function('#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_88]) ).

tff(c_36,plain,
    one_to_one('#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_88]) ).

tff(c_93,plain,
    ! [A_14] :
      ( ( relation_inverse(A_14) = function_inverse(A_14) )
      | ~ one_to_one(A_14)
      | ~ function(A_14)
      | ~ relation(A_14) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_108,plain,
    ( ( relation_inverse('#skF_3') = function_inverse('#skF_3') )
    | ~ one_to_one('#skF_3')
    | ~ function('#skF_3') ),
    inference(resolution,[status(thm)],[c_40,c_93]) ).

tff(c_119,plain,
    relation_inverse('#skF_3') = function_inverse('#skF_3'),
    inference(demodulation,[status(thm),theory(equality)],[c_38,c_36,c_108]) ).

tff(c_32,plain,
    ! [A_6] :
      ( ( relation_dom(relation_inverse(A_6)) = relation_rng(A_6) )
      | ~ relation(A_6) ),
    inference(cnfTransformation,[status(thm)],[f_77]) ).

tff(c_155,plain,
    ( ( relation_dom(function_inverse('#skF_3')) = relation_rng('#skF_3') )
    | ~ relation('#skF_3') ),
    inference(superposition,[status(thm),theory(equality)],[c_119,c_32]) ).

tff(c_170,plain,
    relation_dom(function_inverse('#skF_3')) = relation_rng('#skF_3'),
    inference(demodulation,[status(thm),theory(equality)],[c_40,c_155]) ).

tff(c_172,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_42,c_170]) ).

tff(c_173,plain,
    relation_rng(function_inverse('#skF_3')) != relation_dom('#skF_3'),
    inference(splitRight,[status(thm)],[c_34]) ).

tff(c_229,plain,
    ! [A_21] :
      ( ( relation_inverse(A_21) = function_inverse(A_21) )
      | ~ one_to_one(A_21)
      | ~ function(A_21)
      | ~ relation(A_21) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_244,plain,
    ( ( relation_inverse('#skF_3') = function_inverse('#skF_3') )
    | ~ one_to_one('#skF_3')
    | ~ function('#skF_3') ),
    inference(resolution,[status(thm)],[c_40,c_229]) ).

tff(c_255,plain,
    relation_inverse('#skF_3') = function_inverse('#skF_3'),
    inference(demodulation,[status(thm),theory(equality)],[c_38,c_36,c_244]) ).

tff(c_30,plain,
    ! [A_6] :
      ( ( relation_rng(relation_inverse(A_6)) = relation_dom(A_6) )
      | ~ relation(A_6) ),
    inference(cnfTransformation,[status(thm)],[f_77]) ).

tff(c_265,plain,
    ( ( relation_rng(function_inverse('#skF_3')) = relation_dom('#skF_3') )
    | ~ relation('#skF_3') ),
    inference(superposition,[status(thm),theory(equality)],[c_255,c_30]) ).

tff(c_279,plain,
    relation_rng(function_inverse('#skF_3')) = relation_dom('#skF_3'),
    inference(demodulation,[status(thm),theory(equality)],[c_40,c_265]) ).

tff(c_281,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_173,c_279]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SEU219+1 : TPTP v9.0.0. Released v3.3.0.
% 0.00/0.09  % 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.09/0.29  % Computer : n018.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 300
% 0.09/0.29  % DateTime : Tue Apr  8 22:22:17 EDT 2025
% 0.09/0.29  % CPUTime  : 
% 3.47/2.08  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.52/2.09  
% 3.52/2.09  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------