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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU010+1 : TPTP v8.1.2. 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 : n011.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:57:29 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ subset > in > element > relation_empty_yielding > relation > function > empty > relation_composition > #nlpp > relation_rng > relation_dom > powerset > identity_relation > empty_set > #skF_4 > #skF_1 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_2 > #skF_9 > #skF_8 > #skF_3

%Foreground sorts:

%Background operators:

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

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

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

tff(element,type,
    element: ( $i * $i ) > $o ).

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

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

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

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

tff(in,type,
    in: ( $i * $i ) > $o ).

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

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

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

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

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

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

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

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

tff(empty_set,type,
    empty_set: $i ).

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

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

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

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

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

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

tff(f_140,axiom,
    ! [A,B] : subset(A,A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

tff(f_225,axiom,
    ! [A,B] :
      ( relation(B)
     => ( subset(relation_rng(B),A)
       => ( relation_composition(B,identity_relation(A)) = B ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t79_relat_1) ).

tff(f_219,axiom,
    ! [A,B] :
      ( relation(B)
     => ( subset(relation_dom(B),A)
       => ( relation_composition(identity_relation(A),B) = B ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t77_relat_1) ).

tff(c_108,plain,
    relation('#skF_10'),
    inference(cnfTransformation,[status(thm)],[f_213]) ).

tff(c_58,plain,
    ! [A_31] : subset(A_31,A_31),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_2397,plain,
    ! [B_233,A_234] :
      ( ( relation_composition(B_233,identity_relation(A_234)) = B_233 )
      | ~ subset(relation_rng(B_233),A_234)
      | ~ relation(B_233) ),
    inference(cnfTransformation,[status(thm)],[f_225]) ).

tff(c_3087,plain,
    ! [B_252] :
      ( ( relation_composition(B_252,identity_relation(relation_rng(B_252))) = B_252 )
      | ~ relation(B_252) ),
    inference(resolution,[status(thm)],[c_58,c_2397]) ).

tff(c_1076,plain,
    ! [A_138,B_139] :
      ( ( relation_composition(identity_relation(A_138),B_139) = B_139 )
      | ~ subset(relation_dom(B_139),A_138)
      | ~ relation(B_139) ),
    inference(cnfTransformation,[status(thm)],[f_219]) ).

tff(c_1597,plain,
    ! [B_151] :
      ( ( relation_composition(identity_relation(relation_dom(B_151)),B_151) = B_151 )
      | ~ relation(B_151) ),
    inference(resolution,[status(thm)],[c_58,c_1076]) ).

tff(c_104,plain,
    ( ( relation_composition('#skF_10',identity_relation(relation_rng('#skF_10'))) != '#skF_10' )
    | ( relation_composition(identity_relation(relation_dom('#skF_10')),'#skF_10') != '#skF_10' ) ),
    inference(cnfTransformation,[status(thm)],[f_213]) ).

tff(c_117,plain,
    relation_composition(identity_relation(relation_dom('#skF_10')),'#skF_10') != '#skF_10',
    inference(splitLeft,[status(thm)],[c_104]) ).

tff(c_1628,plain,
    ~ relation('#skF_10'),
    inference(superposition,[status(thm),theory(equality)],[c_1597,c_117]) ).

tff(c_1664,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_108,c_1628]) ).

tff(c_1665,plain,
    relation_composition('#skF_10',identity_relation(relation_rng('#skF_10'))) != '#skF_10',
    inference(splitRight,[status(thm)],[c_104]) ).

tff(c_3116,plain,
    ~ relation('#skF_10'),
    inference(superposition,[status(thm),theory(equality)],[c_3087,c_1665]) ).

tff(c_3152,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_108,c_3116]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : SEU010+1 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.15  % 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.15/0.37  % Computer : n011.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 11:58:50 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 5.06/2.38  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.06/2.38  
% 5.06/2.38  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.55/2.41  
% 5.55/2.41  Inference rules
% 5.55/2.41  ----------------------
% 5.55/2.41  #Ref     : 0
% 5.55/2.41  #Sup     : 691
% 5.55/2.41  #Fact    : 0
% 5.55/2.41  #Define  : 0
% 5.55/2.41  #Split   : 5
% 5.55/2.41  #Chain   : 0
% 5.55/2.41  #Close   : 0
% 5.55/2.41  
% 5.55/2.41  Ordering : KBO
% 5.55/2.41  
% 5.55/2.41  Simplification rules
% 5.55/2.41  ----------------------
% 5.55/2.41  #Subsume      : 39
% 5.55/2.41  #Demod        : 654
% 5.55/2.41  #Tautology    : 453
% 5.55/2.41  #SimpNegUnit  : 0
% 5.55/2.41  #BackRed      : 18
% 5.55/2.41  
% 5.55/2.41  #Partial instantiations: 0
% 5.55/2.41  #Strategies tried      : 1
% 5.55/2.41  
% 5.55/2.41  Timing (in seconds)
% 5.55/2.41  ----------------------
% 5.55/2.41  Preprocessing        : 0.55
% 5.55/2.41  Parsing              : 0.30
% 5.55/2.41  CNF conversion       : 0.05
% 5.55/2.41  Main loop            : 0.79
% 5.55/2.41  Inferencing          : 0.29
% 5.55/2.41  Reduction            : 0.23
% 5.55/2.41  Demodulation         : 0.17
% 5.55/2.41  BG Simplification    : 0.03
% 5.55/2.41  Subsumption          : 0.16
% 5.55/2.41  Abstraction          : 0.03
% 5.55/2.41  MUC search           : 0.00
% 5.55/2.41  Cooper               : 0.00
% 5.55/2.41  Total                : 1.38
% 5.55/2.41  Index Insertion      : 0.00
% 5.55/2.41  Index Deletion       : 0.00
% 5.55/2.41  Index Matching       : 0.00
% 5.55/2.41  BG Taut test         : 0.00
%------------------------------------------------------------------------------