TSTP Solution File: SEU303+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU303+1 : TPTP v8.1.2. Released v3.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 : n029.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 : Tue Aug 22 10:58:20 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ relation > function > finite > relation_image > #nlpp > relation_rng > relation_dom > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_60,negated_conjecture,
    ~ ! [A] :
        ( ( relation(A)
          & function(A) )
       => ( finite(relation_dom(A))
         => finite(relation_rng(A)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_finset_1) ).

tff(f_43,axiom,
    ! [A] :
      ( relation(A)
     => ( relation_image(A,relation_dom(A)) = relation_rng(A) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t146_relat_1) ).

tff(f_51,axiom,
    ! [A,B] :
      ( ( relation(B)
        & function(B) )
     => ( finite(A)
       => finite(relation_image(B,A)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_finset_1) ).

tff(c_24,plain,
    relation('#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_22,plain,
    function('#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_20,plain,
    finite(relation_dom('#skF_2')),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_14,plain,
    ! [A_3] :
      ( ( relation_image(A_3,relation_dom(A_3)) = relation_rng(A_3) )
      | ~ relation(A_3) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_34,plain,
    ! [B_7,A_8] :
      ( finite(relation_image(B_7,A_8))
      | ~ finite(A_8)
      | ~ function(B_7)
      | ~ relation(B_7) ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_38,plain,
    ! [A_9] :
      ( finite(relation_rng(A_9))
      | ~ finite(relation_dom(A_9))
      | ~ function(A_9)
      | ~ relation(A_9)
      | ~ relation(A_9) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_34]) ).

tff(c_18,plain,
    ~ finite(relation_rng('#skF_2')),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_41,plain,
    ( ~ finite(relation_dom('#skF_2'))
    | ~ function('#skF_2')
    | ~ relation('#skF_2') ),
    inference(resolution,[status(thm)],[c_38,c_18]) ).

tff(c_45,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_22,c_20,c_41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU303+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/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.17/0.35  % Computer : n029.cluster.edu
% 0.17/0.35  % Model    : x86_64 x86_64
% 0.17/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35  % Memory   : 8042.1875MB
% 0.17/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit : 300
% 0.17/0.35  % WCLimit  : 300
% 0.17/0.35  % DateTime : Thu Aug  3 11:50:52 EDT 2023
% 0.17/0.35  % CPUTime  : 
% 2.86/1.71  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.86/1.71  
% 2.86/1.71  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.86/1.73  
% 2.86/1.73  Inference rules
% 2.86/1.73  ----------------------
% 2.86/1.73  #Ref     : 0
% 2.86/1.73  #Sup     : 4
% 2.86/1.73  #Fact    : 0
% 2.86/1.73  #Define  : 0
% 2.86/1.73  #Split   : 0
% 2.86/1.73  #Chain   : 0
% 2.86/1.73  #Close   : 0
% 2.86/1.73  
% 2.86/1.73  Ordering : KBO
% 2.86/1.73  
% 2.86/1.73  Simplification rules
% 2.86/1.73  ----------------------
% 2.86/1.73  #Subsume      : 1
% 2.86/1.73  #Demod        : 3
% 2.86/1.73  #Tautology    : 5
% 2.86/1.73  #SimpNegUnit  : 0
% 2.86/1.73  #BackRed      : 0
% 2.86/1.73  
% 2.86/1.73  #Partial instantiations: 0
% 2.86/1.73  #Strategies tried      : 1
% 2.86/1.73  
% 2.86/1.73  Timing (in seconds)
% 2.86/1.73  ----------------------
% 2.86/1.74  Preprocessing        : 0.44
% 2.86/1.74  Parsing              : 0.24
% 2.86/1.74  CNF conversion       : 0.02
% 2.86/1.74  Main loop            : 0.17
% 2.86/1.74  Inferencing          : 0.08
% 2.86/1.74  Reduction            : 0.03
% 2.86/1.74  Demodulation         : 0.03
% 2.86/1.74  BG Simplification    : 0.01
% 2.86/1.74  Subsumption          : 0.03
% 2.86/1.74  Abstraction          : 0.01
% 2.86/1.74  MUC search           : 0.00
% 2.86/1.74  Cooper               : 0.00
% 2.86/1.74  Total                : 0.65
% 2.86/1.74  Index Insertion      : 0.00
% 2.86/1.74  Index Deletion       : 0.00
% 2.86/1.74  Index Matching       : 0.00
% 2.86/1.74  BG Taut test         : 0.00
%------------------------------------------------------------------------------