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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN668-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 : n012.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:34 EDT 2023

% Result   : Unsatisfiable 12.59s 4.71s
% Output   : CNFRefutation 12.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   43
% Syntax   : Number of formulae    :   57 (  12 unt;  36 typ;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   34 (  19   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   47 (  26   >;  21   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  15 usr;   1 prp; 0-3 aty)
%            Number of functors    :   21 (  21 usr;  10 con; 0-2 aty)
%            Number of variables   :   19 (;  19   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p23 > p7 > p6 > p3 > p27 > p26 > p25 > p24 > p20 > p2 > p19 > p14 > p12 > p10 > p22 > f21 > f18 > f16 > f15 > f13 > f11 > #nlpp > f9 > f8 > f5 > f4 > f17 > c37 > c36 > c35 > c34 > c33 > c32 > c31 > c30 > c29 > c28

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_42,axiom,
    p25(c33,c36),
    file(unknown,unknown) ).

tff(f_44,axiom,
    p25(c32,c33),
    file(unknown,unknown) ).

tff(f_270,axiom,
    ! [X36] :
      ( p2(f11(f4(X36),c34),f11(f4(c32),c34))
      | ~ p25(X36,c36)
      | ~ p25(c32,X36) ),
    file(unknown,unknown) ).

tff(f_34,axiom,
    ! [X28] : p2(X28,X28),
    file(unknown,unknown) ).

tff(f_132,axiom,
    ! [X29,X30,X28] :
      ( p2(X29,X30)
      | ~ p2(X28,X29)
      | ~ p2(X28,X30) ),
    file(unknown,unknown) ).

tff(f_201,axiom,
    p2(f11(f4(c32),c34),f18(f11(f4(c33),c34),f9(f17(c31)))),
    file(unknown,unknown) ).

tff(f_51,axiom,
    ! [X96] : ~ p2(X96,f18(X96,f9(f17(c31)))),
    file(unknown,unknown) ).

tff(c_24,plain,
    p25(c33,c36),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_28,plain,
    p25(c32,c33),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_1540,plain,
    ! [X36_355] :
      ( ~ p25(c32,X36_355)
      | ~ p25(X36_355,c36)
      | p2(f11(f4(X36_355),c34),f11(f4(c32),c34)) ),
    inference(cnfTransformation,[status(thm)],[f_270]) ).

tff(c_14,plain,
    ! [X28_6] : p2(X28_6,X28_6),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_225,plain,
    ! [X28_166,X30_167,X29_168] :
      ( ~ p2(X28_166,X30_167)
      | ~ p2(X28_166,X29_168)
      | p2(X29_168,X30_167) ),
    inference(cnfTransformation,[status(thm)],[f_132]) ).

tff(c_237,plain,
    ! [X28_6,X29_168] :
      ( ~ p2(X28_6,X29_168)
      | p2(X29_168,X28_6) ),
    inference(resolution,[status(thm)],[c_14,c_225]) ).

tff(c_13416,plain,
    ! [X36_1147] :
      ( p2(f11(f4(c32),c34),f11(f4(X36_1147),c34))
      | ~ p25(c32,X36_1147)
      | ~ p25(X36_1147,c36) ),
    inference(resolution,[status(thm)],[c_1540,c_237]) ).

tff(c_76,plain,
    p2(f11(f4(c32),c34),f18(f11(f4(c33),c34),f9(f17(c31)))),
    inference(cnfTransformation,[status(thm)],[f_201]) ).

tff(c_60,plain,
    ! [X28_41,X30_40,X29_39] :
      ( ~ p2(X28_41,X30_40)
      | ~ p2(X28_41,X29_39)
      | p2(X29_39,X30_40) ),
    inference(cnfTransformation,[status(thm)],[f_132]) ).

tff(c_4691,plain,
    ! [X29_636] :
      ( ~ p2(f11(f4(c32),c34),X29_636)
      | p2(X29_636,f18(f11(f4(c33),c34),f9(f17(c31)))) ),
    inference(resolution,[status(thm)],[c_76,c_60]) ).

tff(c_36,plain,
    ! [X96_11] : ~ p2(X96_11,f18(X96_11,f9(f17(c31)))),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_4922,plain,
    ~ p2(f11(f4(c32),c34),f11(f4(c33),c34)),
    inference(resolution,[status(thm)],[c_4691,c_36]) ).

tff(c_13524,plain,
    ( ~ p25(c32,c33)
    | ~ p25(c33,c36) ),
    inference(resolution,[status(thm)],[c_13416,c_4922]) ).

tff(c_13632,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_28,c_13524]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.16  % Problem  : SYN668-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.17  % 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.15/0.39  % Computer : n012.cluster.edu
% 0.15/0.39  % Model    : x86_64 x86_64
% 0.15/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39  % Memory   : 8042.1875MB
% 0.15/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39  % CPULimit : 300
% 0.15/0.39  % WCLimit  : 300
% 0.15/0.39  % DateTime : Thu Aug  3 17:20:07 EDT 2023
% 0.15/0.39  % CPUTime  : 
% 12.59/4.71  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.59/4.72  
% 12.59/4.72  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.59/4.74  
% 12.59/4.74  Inference rules
% 12.59/4.74  ----------------------
% 12.59/4.74  #Ref     : 0
% 12.59/4.74  #Sup     : 4171
% 12.59/4.74  #Fact    : 0
% 12.59/4.74  #Define  : 0
% 12.59/4.74  #Split   : 2
% 12.59/4.74  #Chain   : 0
% 12.59/4.74  #Close   : 0
% 12.59/4.74  
% 12.59/4.74  Ordering : KBO
% 12.59/4.74  
% 12.59/4.74  Simplification rules
% 12.59/4.74  ----------------------
% 12.59/4.74  #Subsume      : 440
% 12.59/4.74  #Demod        : 109
% 12.59/4.74  #Tautology    : 52
% 12.59/4.74  #SimpNegUnit  : 0
% 12.59/4.74  #BackRed      : 0
% 12.59/4.74  
% 12.59/4.74  #Partial instantiations: 0
% 12.59/4.74  #Strategies tried      : 1
% 12.59/4.74  
% 12.59/4.74  Timing (in seconds)
% 12.59/4.74  ----------------------
% 12.59/4.75  Preprocessing        : 0.55
% 12.59/4.75  Parsing              : 0.31
% 12.59/4.75  CNF conversion       : 0.04
% 12.59/4.75  Main loop            : 3.10
% 12.59/4.75  Inferencing          : 0.69
% 12.59/4.75  Reduction            : 0.73
% 12.59/4.75  Demodulation         : 0.49
% 12.59/4.75  BG Simplification    : 0.06
% 12.59/4.75  Subsumption          : 1.37
% 12.59/4.75  Abstraction          : 0.07
% 12.59/4.75  MUC search           : 0.00
% 12.59/4.75  Cooper               : 0.00
% 12.59/4.75  Total                : 3.70
% 12.59/4.75  Index Insertion      : 0.00
% 12.59/4.75  Index Deletion       : 0.00
% 12.59/4.75  Index Matching       : 0.00
% 12.59/4.75  BG Taut test         : 0.00
%------------------------------------------------------------------------------