TSTP Solution File: SEU149+3 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU149+3 : 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/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 : n026.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:46 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ in > empty > unordered_pair > #nlpp > singleton > #skF_4 > #skF_7 > #skF_5 > #skF_6 > #skF_9 > #skF_8 > #skF_3 > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_59,negated_conjecture,
    ~ ! [A,B,C] :
        ( ( singleton(A) = unordered_pair(B,C) )
       => ( A = B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).

tff(f_49,axiom,
    ! [A,B,C] :
      ( ( C = unordered_pair(A,B) )
    <=> ! [D] :
          ( in(D,C)
        <=> ( ( D = A )
            | ( D = B ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).

tff(f_40,axiom,
    ! [A,B] :
      ( ( B = singleton(A) )
    <=> ! [C] :
          ( in(C,B)
        <=> ( C = A ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).

tff(c_40,plain,
    '#skF_7' != '#skF_8',
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_42,plain,
    unordered_pair('#skF_8','#skF_9') = singleton('#skF_7'),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_48,plain,
    ! [D_17,B_18] : in(D_17,unordered_pair(D_17,B_18)),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_51,plain,
    in('#skF_8',singleton('#skF_7')),
    inference(superposition,[status(thm),theory(equality)],[c_42,c_48]) ).

tff(c_56,plain,
    ! [C_21,A_22] :
      ( ( C_21 = A_22 )
      | ~ in(C_21,singleton(A_22)) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_62,plain,
    '#skF_7' = '#skF_8',
    inference(resolution,[status(thm)],[c_51,c_56]) ).

tff(c_70,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_40,c_62]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SEU149+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/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 : n026.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 : Thu Aug  3 12:23:16 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.85/1.80  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.80  
% 2.85/1.80  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.85/1.83  
% 2.85/1.83  Inference rules
% 2.85/1.83  ----------------------
% 2.85/1.83  #Ref     : 0
% 2.85/1.83  #Sup     : 7
% 2.85/1.83  #Fact    : 0
% 2.85/1.83  #Define  : 0
% 2.85/1.83  #Split   : 0
% 2.85/1.83  #Chain   : 0
% 2.85/1.83  #Close   : 0
% 2.85/1.83  
% 2.85/1.83  Ordering : KBO
% 2.85/1.83  
% 2.85/1.83  Simplification rules
% 2.85/1.83  ----------------------
% 2.85/1.83  #Subsume      : 0
% 2.85/1.83  #Demod        : 0
% 2.85/1.83  #Tautology    : 2
% 2.85/1.83  #SimpNegUnit  : 1
% 2.85/1.83  #BackRed      : 0
% 2.85/1.83  
% 2.85/1.83  #Partial instantiations: 0
% 2.85/1.83  #Strategies tried      : 1
% 2.85/1.83  
% 2.85/1.83  Timing (in seconds)
% 2.85/1.83  ----------------------
% 2.85/1.83  Preprocessing        : 0.52
% 2.85/1.83  Parsing              : 0.25
% 2.85/1.83  CNF conversion       : 0.04
% 2.85/1.83  Main loop            : 0.17
% 2.85/1.83  Inferencing          : 0.04
% 2.85/1.83  Reduction            : 0.05
% 2.85/1.83  Demodulation         : 0.04
% 2.85/1.83  BG Simplification    : 0.02
% 2.85/1.83  Subsumption          : 0.05
% 2.85/1.83  Abstraction          : 0.01
% 2.85/1.83  MUC search           : 0.00
% 2.85/1.83  Cooper               : 0.00
% 2.85/1.83  Total                : 0.73
% 2.85/1.83  Index Insertion      : 0.00
% 2.85/1.83  Index Deletion       : 0.00
% 2.85/1.83  Index Matching       : 0.00
% 2.85/1.83  BG Taut test         : 0.00
%------------------------------------------------------------------------------