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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN662-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 : n025.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:33 EDT 2023

% Result   : Unsatisfiable 14.17s 5.84s
% Output   : CNFRefutation 14.17s
% 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 > p2 > p19 > p18 > p14 > p12 > p10 > p22 > f21 > f20 > 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(p23,type,
    p23: ( $i * $i * $i ) > $o ).

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

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

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(p18,type,
    p18: ( $i * $i ) > $o ).

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

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

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

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

tff(f_32,axiom,
    ! [X35] : p2(X35,X35),
    file(unknown,unknown) ).

tff(f_125,axiom,
    ! [X36,X37,X35] :
      ( p2(X36,X37)
      | ~ p2(X35,X36)
      | ~ p2(X35,X37) ),
    file(unknown,unknown) ).

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

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

tff(c_22,plain,
    p25(c33,c36),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

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

tff(c_1226,plain,
    ! [X43_290] :
      ( ~ p25(c32,X43_290)
      | ~ p25(X43_290,c36)
      | p2(f11(f4(X43_290),c34),f11(f4(c32),c34)) ),
    inference(cnfTransformation,[status(thm)],[f_269]) ).

tff(c_12,plain,
    ! [X35_5] : p2(X35_5,X35_5),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_201,plain,
    ! [X35_169,X37_170,X36_171] :
      ( ~ p2(X35_169,X37_170)
      | ~ p2(X35_169,X36_171)
      | p2(X36_171,X37_170) ),
    inference(cnfTransformation,[status(thm)],[f_125]) ).

tff(c_216,plain,
    ! [X35_5,X36_171] :
      ( ~ p2(X35_5,X36_171)
      | p2(X36_171,X35_5) ),
    inference(resolution,[status(thm)],[c_12,c_201]) ).

tff(c_21057,plain,
    ! [X43_866] :
      ( p2(f11(f4(c32),c34),f11(f4(X43_866),c34))
      | ~ p25(c32,X43_866)
      | ~ p25(X43_866,c36) ),
    inference(resolution,[status(thm)],[c_1226,c_216]) ).

tff(c_78,plain,
    p2(f11(f4(c32),c34),f16(f11(f4(c33),c34),f9(f17(c31)))),
    inference(cnfTransformation,[status(thm)],[f_202]) ).

tff(c_60,plain,
    ! [X35_38,X37_37,X36_36] :
      ( ~ p2(X35_38,X37_37)
      | ~ p2(X35_38,X36_36)
      | p2(X36_36,X37_37) ),
    inference(cnfTransformation,[status(thm)],[f_125]) ).

tff(c_7207,plain,
    ! [X36_595] :
      ( ~ p2(f11(f4(c32),c34),X36_595)
      | p2(X36_595,f16(f11(f4(c33),c34),f9(f17(c31)))) ),
    inference(resolution,[status(thm)],[c_78,c_60]) ).

tff(c_38,plain,
    ! [X96_11] : ~ p2(X96_11,f16(X96_11,f9(f17(c31)))),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_7390,plain,
    ~ p2(f11(f4(c32),c34),f11(f4(c33),c34)),
    inference(resolution,[status(thm)],[c_7207,c_38]) ).

tff(c_21076,plain,
    ( ~ p25(c32,c33)
    | ~ p25(c33,c36) ),
    inference(resolution,[status(thm)],[c_21057,c_7390]) ).

tff(c_21155,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_24,c_21076]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN662-1 : TPTP v8.1.2. Released v2.5.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.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 17:36:20 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 14.17/5.84  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.17/5.85  
% 14.17/5.85  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 14.17/5.88  
% 14.17/5.88  Inference rules
% 14.17/5.88  ----------------------
% 14.17/5.88  #Ref     : 0
% 14.17/5.88  #Sup     : 6202
% 14.17/5.88  #Fact    : 0
% 14.17/5.88  #Define  : 0
% 14.17/5.88  #Split   : 53
% 14.17/5.88  #Chain   : 0
% 14.17/5.88  #Close   : 0
% 14.17/5.88  
% 14.17/5.88  Ordering : KBO
% 14.17/5.88  
% 14.17/5.88  Simplification rules
% 14.17/5.88  ----------------------
% 14.17/5.88  #Subsume      : 1107
% 14.17/5.88  #Demod        : 433
% 14.17/5.88  #Tautology    : 160
% 14.17/5.88  #SimpNegUnit  : 16
% 14.17/5.88  #BackRed      : 0
% 14.17/5.88  
% 14.17/5.88  #Partial instantiations: 0
% 14.17/5.88  #Strategies tried      : 1
% 14.17/5.88  
% 14.17/5.88  Timing (in seconds)
% 14.17/5.88  ----------------------
% 14.17/5.88  Preprocessing        : 0.60
% 14.17/5.88  Parsing              : 0.31
% 14.17/5.88  CNF conversion       : 0.05
% 14.17/5.88  Main loop            : 4.12
% 14.17/5.88  Inferencing          : 0.76
% 14.17/5.88  Reduction            : 1.02
% 14.17/5.88  Demodulation         : 0.63
% 14.17/5.88  BG Simplification    : 0.08
% 14.17/5.88  Subsumption          : 2.00
% 14.17/5.88  Abstraction          : 0.07
% 14.17/5.88  MUC search           : 0.00
% 14.17/5.88  Cooper               : 0.00
% 14.17/5.88  Total                : 4.77
% 14.17/5.88  Index Insertion      : 0.00
% 14.17/5.88  Index Deletion       : 0.00
% 14.17/5.88  Index Matching       : 0.00
% 14.17/5.88  BG Taut test         : 0.00
%------------------------------------------------------------------------------