TSTP Solution File: SYN593-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN593-1 : TPTP v8.1.2. Released v2.5.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 : n008.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 11:11:23 EDT 2023

% Result   : Unsatisfiable 6.84s 2.68s
% Output   : CNFRefutation 7.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   29
% Syntax   : Number of formulae    :   46 (  17 unt;  20 typ;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   47 (  22   ~;  25   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    7 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   22 (  14   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-2 aty)
%            Number of variables   :   21 (;  21   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p5 > p3 > p2 > p15 > p12 > f6 > f4 > f14 > #nlpp > f9 > f8 > f7 > f13 > f11 > f10 > c21 > c20 > c19 > c18 > c17 > c16

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_31,axiom,
    ~ p3(c21,c19),
    file(unknown,unknown) ).

tff(f_108,axiom,
    p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20),
    file(unknown,unknown) ).

tff(f_33,axiom,
    ~ p12(f13(c20),f13(c18)),
    file(unknown,unknown) ).

tff(f_107,axiom,
    p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20),
    file(unknown,unknown) ).

tff(f_159,axiom,
    ! [X7,X8,X5,X6] :
      ( p3(X7,X8)
      | p12(f13(X5),f13(c18))
      | p15(f4(f6(f10(X6),f6(f7(f8(f9(c17))),c18)),f11(X8)),X5)
      | p15(f4(f6(f10(X6),f6(f7(f8(f9(c17))),c18)),f11(X7)),X5)
      | ~ p15(f4(f6(f10(X6),f6(f7(f8(f9(c17))),c18)),X7),X5)
      | ~ p15(f4(f6(f10(X6),f6(f7(f8(f9(c17))),c18)),X8),X5) ),
    file(unknown,unknown) ).

tff(f_136,axiom,
    ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20),
    file(unknown,unknown) ).

tff(f_134,axiom,
    ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ! [X24] : p3(X24,X24),
    file(unknown,unknown) ).

tff(f_87,axiom,
    ! [X25,X26,X24] :
      ( p3(X25,X26)
      | ~ p3(X24,X25)
      | ~ p3(X24,X26) ),
    file(unknown,unknown) ).

tff(c_10,plain,
    ~ p3(c21,c19),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_38,plain,
    p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20),
    inference(cnfTransformation,[status(thm)],[f_108]) ).

tff(c_12,plain,
    ~ p12(f13(c20),f13(c18)),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_36,plain,
    p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20),
    inference(cnfTransformation,[status(thm)],[f_107]) ).

tff(c_927,plain,
    ! [X6_233,X8_234,X5_235,X7_236] :
      ( ~ p15(f4(f6(f10(X6_233),f6(f7(f8(f9(c17))),c18)),X8_234),X5_235)
      | ~ p15(f4(f6(f10(X6_233),f6(f7(f8(f9(c17))),c18)),X7_236),X5_235)
      | p15(f4(f6(f10(X6_233),f6(f7(f8(f9(c17))),c18)),f11(X7_236)),X5_235)
      | p15(f4(f6(f10(X6_233),f6(f7(f8(f9(c17))),c18)),f11(X8_234)),X5_235)
      | p12(f13(X5_235),f13(c18))
      | p3(X7_236,X8_234) ),
    inference(cnfTransformation,[status(thm)],[f_159]) ).

tff(c_48,plain,
    ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20),
    inference(cnfTransformation,[status(thm)],[f_136]) ).

tff(c_937,plain,
    ! [X8_234] :
      ( ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),X8_234),c20)
      | ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20)
      | p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(X8_234)),c20)
      | p12(f13(c20),f13(c18))
      | p3(c19,X8_234) ),
    inference(resolution,[status(thm)],[c_927,c_48]) ).

tff(c_1014,plain,
    ! [X8_234] :
      ( ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),X8_234),c20)
      | p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(X8_234)),c20)
      | p12(f13(c20),f13(c18))
      | p3(c19,X8_234) ),
    inference(demodulation,[status(thm),theory(equality)],[c_36,c_937]) ).

tff(c_3821,plain,
    ! [X8_423] :
      ( ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),X8_423),c20)
      | p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(X8_423)),c20)
      | p3(c19,X8_423) ),
    inference(negUnitSimplification,[status(thm)],[c_12,c_1014]) ).

tff(c_46,plain,
    ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20),
    inference(cnfTransformation,[status(thm)],[f_134]) ).

tff(c_3828,plain,
    ( ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20)
    | p3(c19,c21) ),
    inference(resolution,[status(thm)],[c_3821,c_46]) ).

tff(c_3839,plain,
    p3(c19,c21),
    inference(demodulation,[status(thm),theory(equality)],[c_38,c_3828]) ).

tff(c_6,plain,
    ! [X24_3] : p3(X24_3,X24_3),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_139,plain,
    ! [X24_90,X26_91,X25_92] :
      ( ~ p3(X24_90,X26_91)
      | ~ p3(X24_90,X25_92)
      | p3(X25_92,X26_91) ),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_151,plain,
    ! [X24_3,X25_92] :
      ( ~ p3(X24_3,X25_92)
      | p3(X25_92,X24_3) ),
    inference(resolution,[status(thm)],[c_6,c_139]) ).

tff(c_3887,plain,
    p3(c21,c19),
    inference(resolution,[status(thm)],[c_3839,c_151]) ).

tff(c_3914,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_10,c_3887]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN593-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.12  % 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.16/0.34  % Computer : n008.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Thu Aug  3 17:25:33 EDT 2023
% 0.16/0.34  % CPUTime  : 
% 6.84/2.68  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.84/2.68  
% 6.84/2.68  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.19/2.71  
% 7.19/2.71  Inference rules
% 7.19/2.71  ----------------------
% 7.19/2.71  #Ref     : 0
% 7.19/2.71  #Sup     : 1197
% 7.19/2.71  #Fact    : 2
% 7.19/2.71  #Define  : 0
% 7.19/2.71  #Split   : 0
% 7.19/2.71  #Chain   : 0
% 7.19/2.71  #Close   : 0
% 7.19/2.71  
% 7.19/2.71  Ordering : KBO
% 7.19/2.71  
% 7.19/2.71  Simplification rules
% 7.19/2.71  ----------------------
% 7.19/2.71  #Subsume      : 81
% 7.19/2.71  #Demod        : 13
% 7.19/2.71  #Tautology    : 7
% 7.19/2.71  #SimpNegUnit  : 6
% 7.19/2.71  #BackRed      : 0
% 7.19/2.71  
% 7.19/2.71  #Partial instantiations: 0
% 7.19/2.71  #Strategies tried      : 1
% 7.19/2.71  
% 7.19/2.71  Timing (in seconds)
% 7.19/2.71  ----------------------
% 7.19/2.71  Preprocessing        : 0.48
% 7.19/2.71  Parsing              : 0.26
% 7.19/2.71  CNF conversion       : 0.03
% 7.19/2.71  Main loop            : 1.19
% 7.19/2.71  Inferencing          : 0.37
% 7.19/2.71  Reduction            : 0.28
% 7.19/2.71  Demodulation         : 0.19
% 7.19/2.71  BG Simplification    : 0.04
% 7.19/2.71  Subsumption          : 0.41
% 7.19/2.72  Abstraction          : 0.04
% 7.19/2.72  MUC search           : 0.00
% 7.19/2.72  Cooper               : 0.00
% 7.19/2.72  Total                : 1.72
% 7.19/2.72  Index Insertion      : 0.00
% 7.19/2.72  Index Deletion       : 0.00
% 7.19/2.72  Index Matching       : 0.00
% 7.19/2.72  BG Taut test         : 0.00
%------------------------------------------------------------------------------