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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN618-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/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 : n019.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:26 EDT 2023

% Result   : Unsatisfiable 7.55s 2.93s
% Output   : CNFRefutation 7.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   34
% Syntax   : Number of formulae    :   56 (  18 unt;  23 typ;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   68 (  36   ~;  32   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   25 (  14   >;  11   *;   0   +;   0  <<)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-2 aty)
%            Number of variables   :   33 (;  33   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p11 > p5 > p4 > p2 > p15 > p14 > p13 > p12 > p10 > p9 > f8 > #nlpp > f7 > f6 > f3 > c24 > c23 > c22 > c21 > c20 > c19 > c18 > c17 > c16

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_30,axiom,
    ! [X24] : p2(X24,X24),
    file(unknown,unknown) ).

tff(f_158,axiom,
    ! [X40,X41,X42,X43] :
      ( p5(f8(X40,X41),f8(X42,X43))
      | ~ p2(X40,X42)
      | ~ p5(X41,X43) ),
    file(unknown,unknown) ).

tff(f_49,axiom,
    p5(f8(f3(c16),c23),f6(f7(c22))),
    file(unknown,unknown) ).

tff(f_82,axiom,
    ! [X35,X36,X34] :
      ( p5(X35,X36)
      | ~ p5(X34,X35)
      | ~ p5(X34,X36) ),
    file(unknown,unknown) ).

tff(f_51,axiom,
    ~ p5(f8(f3(c16),c20),f6(f7(c22))),
    file(unknown,unknown) ).

tff(f_34,axiom,
    p13(c23,c21),
    file(unknown,unknown) ).

tff(f_35,axiom,
    p13(c19,c23),
    file(unknown,unknown) ).

tff(f_26,axiom,
    ! [X34] : p5(X34,X34),
    file(unknown,unknown) ).

tff(f_38,axiom,
    p2(c17,f3(c16)),
    file(unknown,unknown) ).

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

tff(f_169,axiom,
    ! [X37] :
      ( p5(X37,c20)
      | ~ p13(X37,c21)
      | ~ p13(c19,X37)
      | ~ p5(f8(c17,X37),f6(f7(c22))) ),
    file(unknown,unknown) ).

tff(c_10,plain,
    ! [X24_4] : p2(X24_4,X24_4),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_60,plain,
    ! [X41_43,X43_45,X40_42,X42_44] :
      ( ~ p5(X41_43,X43_45)
      | ~ p2(X40_42,X42_44)
      | p5(f8(X40_42,X41_43),f8(X42_44,X43_45)) ),
    inference(cnfTransformation,[status(thm)],[f_158]) ).

tff(c_32,plain,
    p5(f8(f3(c16),c23),f6(f7(c22))),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_261,plain,
    ! [X34_94,X36_95,X35_96] :
      ( ~ p5(X34_94,X36_95)
      | ~ p5(X34_94,X35_96)
      | p5(X35_96,X36_95) ),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_1225,plain,
    ! [X35_194] :
      ( ~ p5(f8(f3(c16),c23),X35_194)
      | p5(X35_194,f6(f7(c22))) ),
    inference(resolution,[status(thm)],[c_32,c_261]) ).

tff(c_4542,plain,
    ! [X42_316,X43_317] :
      ( p5(f8(X42_316,X43_317),f6(f7(c22)))
      | ~ p5(c23,X43_317)
      | ~ p2(f3(c16),X42_316) ),
    inference(resolution,[status(thm)],[c_60,c_1225]) ).

tff(c_34,plain,
    ~ p5(f8(f3(c16),c20),f6(f7(c22))),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_4568,plain,
    ( ~ p5(c23,c20)
    | ~ p2(f3(c16),f3(c16)) ),
    inference(resolution,[status(thm)],[c_4542,c_34]) ).

tff(c_4586,plain,
    ~ p5(c23,c20),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_4568]) ).

tff(c_16,plain,
    p13(c23,c21),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_18,plain,
    p13(c19,c23),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_6,plain,
    ! [X34_2] : p5(X34_2,X34_2),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_24,plain,
    p2(c17,f3(c16)),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_89,plain,
    ! [X24_67,X26_68,X25_69] :
      ( ~ p2(X24_67,X26_68)
      | ~ p2(X24_67,X25_69)
      | p2(X25_69,X26_68) ),
    inference(cnfTransformation,[status(thm)],[f_98]) ).

tff(c_99,plain,
    ! [X24_70,X25_71] :
      ( ~ p2(X24_70,X25_71)
      | p2(X25_71,X24_70) ),
    inference(resolution,[status(thm)],[c_10,c_89]) ).

tff(c_107,plain,
    p2(f3(c16),c17),
    inference(resolution,[status(thm)],[c_24,c_99]) ).

tff(c_62,plain,
    ! [X37_46] :
      ( ~ p5(f8(c17,X37_46),f6(f7(c22)))
      | ~ p13(c19,X37_46)
      | ~ p13(X37_46,c21)
      | p5(X37_46,c20) ),
    inference(cnfTransformation,[status(thm)],[f_169]) ).

tff(c_4561,plain,
    ! [X43_317] :
      ( ~ p13(c19,X43_317)
      | ~ p13(X43_317,c21)
      | p5(X43_317,c20)
      | ~ p5(c23,X43_317)
      | ~ p2(f3(c16),c17) ),
    inference(resolution,[status(thm)],[c_4542,c_62]) ).

tff(c_6882,plain,
    ! [X43_358] :
      ( ~ p13(c19,X43_358)
      | ~ p13(X43_358,c21)
      | p5(X43_358,c20)
      | ~ p5(c23,X43_358) ),
    inference(demodulation,[status(thm),theory(equality)],[c_107,c_4561]) ).

tff(c_6891,plain,
    ( ~ p13(c19,c23)
    | ~ p13(c23,c21)
    | p5(c23,c20) ),
    inference(resolution,[status(thm)],[c_6,c_6882]) ).

tff(c_6896,plain,
    p5(c23,c20),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_18,c_6891]) ).

tff(c_6898,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_4586,c_6896]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SYN618-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/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.36  % Computer : n019.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 17:22:01 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 7.55/2.93  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.55/2.94  
% 7.55/2.94  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.55/2.98  
% 7.55/2.98  Inference rules
% 7.55/2.98  ----------------------
% 7.55/2.98  #Ref     : 0
% 7.55/2.98  #Sup     : 1687
% 7.55/2.98  #Fact    : 0
% 7.55/2.98  #Define  : 0
% 7.55/2.98  #Split   : 24
% 7.55/2.98  #Chain   : 0
% 7.55/2.98  #Close   : 0
% 7.55/2.99  
% 7.55/2.99  Ordering : KBO
% 7.55/2.99  
% 7.55/2.99  Simplification rules
% 7.55/2.99  ----------------------
% 7.55/2.99  #Subsume      : 735
% 7.55/2.99  #Demod        : 375
% 7.55/2.99  #Tautology    : 139
% 7.55/2.99  #SimpNegUnit  : 50
% 7.55/2.99  #BackRed      : 0
% 7.55/2.99  
% 7.55/2.99  #Partial instantiations: 0
% 7.55/2.99  #Strategies tried      : 1
% 7.55/2.99  
% 7.55/2.99  Timing (in seconds)
% 7.55/2.99  ----------------------
% 7.55/2.99  Preprocessing        : 0.48
% 7.55/2.99  Parsing              : 0.26
% 7.55/2.99  CNF conversion       : 0.03
% 7.55/2.99  Main loop            : 1.41
% 7.55/2.99  Inferencing          : 0.42
% 7.55/2.99  Reduction            : 0.40
% 7.55/2.99  Demodulation         : 0.27
% 7.55/2.99  BG Simplification    : 0.04
% 7.55/2.99  Subsumption          : 0.47
% 7.55/2.99  Abstraction          : 0.04
% 7.55/2.99  MUC search           : 0.00
% 7.55/2.99  Cooper               : 0.00
% 7.55/2.99  Total                : 1.96
% 7.55/2.99  Index Insertion      : 0.00
% 7.55/2.99  Index Deletion       : 0.00
% 7.55/2.99  Index Matching       : 0.00
% 7.55/2.99  BG Taut test         : 0.00
%------------------------------------------------------------------------------