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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN613-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:26 EDT 2023

% Result   : Unsatisfiable 10.06s 3.56s
% Output   : CNFRefutation 10.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   33
% Syntax   : Number of formulae    :   54 (  19 unt;  24 typ;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   49 (  26   ~;  23   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   29 (  17   >;  12   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;   7 con; 0-2 aty)
%            Number of variables   :   37 (;  37   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p17 > p6 > p5 > p3 > p2 > p18 > p16 > p11 > f8 > f7 > f14 > #nlpp > f9 > f4 > f15 > f13 > f12 > f10 > c25 > c24 > c23 > c22 > c21 > c20 > c19

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_33,axiom,
    ! [X14] : p16(X14,X14),
    file(unknown,unknown) ).

tff(f_34,axiom,
    p11(c23,f12(f9(c21))),
    file(unknown,unknown) ).

tff(f_23,axiom,
    ! [X0] : p11(X0,X0),
    file(unknown,unknown) ).

tff(f_73,axiom,
    ! [X1,X2,X0] :
      ( p11(X1,X2)
      | ~ p11(X0,X1)
      | ~ p11(X0,X2) ),
    file(unknown,unknown) ).

tff(f_35,axiom,
    p11(c24,f12(f9(c21))),
    file(unknown,unknown) ).

tff(f_29,axiom,
    ! [X36] : p3(X36,X36),
    file(unknown,unknown) ).

tff(f_114,axiom,
    p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c24),
    file(unknown,unknown) ).

tff(f_175,axiom,
    ! [X22,X17,X21,X20,X19,X18] :
      ( p17(X17,X18,X19)
      | ~ p3(X22,X18)
      | ~ p16(X21,X17)
      | ~ p11(X20,X19)
      | ~ p17(X21,X22,X20) ),
    file(unknown,unknown) ).

tff(f_116,axiom,
    ~ p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c23),
    file(unknown,unknown) ).

tff(c_12,plain,
    ! [X14_6] : p16(X14_6,X14_6),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_14,plain,
    p11(c23,f12(f9(c21))),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_2,plain,
    ! [X0_1] : p11(X0_1,X0_1),
    inference(cnfTransformation,[status(thm)],[f_23]) ).

tff(c_93,plain,
    ! [X0_91,X2_92,X1_93] :
      ( ~ p11(X0_91,X2_92)
      | ~ p11(X0_91,X1_93)
      | p11(X1_93,X2_92) ),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_119,plain,
    ! [X0_97,X1_98] :
      ( ~ p11(X0_97,X1_98)
      | p11(X1_98,X0_97) ),
    inference(resolution,[status(thm)],[c_2,c_93]) ).

tff(c_136,plain,
    p11(f12(f9(c21)),c23),
    inference(resolution,[status(thm)],[c_14,c_119]) ).

tff(c_16,plain,
    p11(c24,f12(f9(c21))),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_135,plain,
    p11(f12(f9(c21)),c24),
    inference(resolution,[status(thm)],[c_16,c_119]) ).

tff(c_30,plain,
    ! [X0_21,X2_20,X1_19] :
      ( ~ p11(X0_21,X2_20)
      | ~ p11(X0_21,X1_19)
      | p11(X1_19,X2_20) ),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_261,plain,
    ! [X1_127] :
      ( ~ p11(f12(f9(c21)),X1_127)
      | p11(X1_127,c24) ),
    inference(resolution,[status(thm)],[c_135,c_30]) ).

tff(c_303,plain,
    p11(c23,c24),
    inference(resolution,[status(thm)],[c_136,c_261]) ).

tff(c_111,plain,
    ! [X0_1,X1_93] :
      ( ~ p11(X0_1,X1_93)
      | p11(X1_93,X0_1) ),
    inference(resolution,[status(thm)],[c_2,c_93]) ).

tff(c_313,plain,
    p11(c24,c23),
    inference(resolution,[status(thm)],[c_303,c_111]) ).

tff(c_8,plain,
    ! [X36_4] : p3(X36_4,X36_4),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_42,plain,
    p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c24),
    inference(cnfTransformation,[status(thm)],[f_114]) ).

tff(c_787,plain,
    ! [X18_179,X21_178,X22_176,X19_175,X20_174,X17_177] :
      ( ~ p17(X21_178,X22_176,X20_174)
      | ~ p11(X20_174,X19_175)
      | ~ p16(X21_178,X17_177)
      | ~ p3(X22_176,X18_179)
      | p17(X17_177,X18_179,X19_175) ),
    inference(cnfTransformation,[status(thm)],[f_175]) ).

tff(c_3115,plain,
    ! [X19_287,X17_288,X18_289] :
      ( ~ p11(c24,X19_287)
      | ~ p16(c19,X17_288)
      | ~ p3(f4(f7(f10(c20),f8(f9(c21),c22))),X18_289)
      | p17(X17_288,X18_289,X19_287) ),
    inference(resolution,[status(thm)],[c_42,c_787]) ).

tff(c_9492,plain,
    ! [X19_441,X17_442] :
      ( ~ p11(c24,X19_441)
      | ~ p16(c19,X17_442)
      | p17(X17_442,f4(f7(f10(c20),f8(f9(c21),c22))),X19_441) ),
    inference(resolution,[status(thm)],[c_8,c_3115]) ).

tff(c_44,plain,
    ~ p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c23),
    inference(cnfTransformation,[status(thm)],[f_116]) ).

tff(c_9497,plain,
    ( ~ p11(c24,c23)
    | ~ p16(c19,c19) ),
    inference(resolution,[status(thm)],[c_9492,c_44]) ).

tff(c_9502,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_313,c_9497]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN613-1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/0.14  % 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 : n012.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:25:22 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 10.06/3.56  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.06/3.57  
% 10.06/3.57  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 10.45/3.60  
% 10.45/3.60  Inference rules
% 10.45/3.60  ----------------------
% 10.45/3.60  #Ref     : 0
% 10.45/3.60  #Sup     : 2530
% 10.45/3.60  #Fact    : 0
% 10.45/3.60  #Define  : 0
% 10.45/3.60  #Split   : 17
% 10.45/3.60  #Chain   : 0
% 10.45/3.60  #Close   : 0
% 10.45/3.60  
% 10.45/3.60  Ordering : KBO
% 10.45/3.60  
% 10.45/3.60  Simplification rules
% 10.45/3.60  ----------------------
% 10.45/3.60  #Subsume      : 370
% 10.45/3.60  #Demod        : 660
% 10.45/3.60  #Tautology    : 370
% 10.45/3.60  #SimpNegUnit  : 0
% 10.45/3.60  #BackRed      : 0
% 10.45/3.60  
% 10.45/3.60  #Partial instantiations: 0
% 10.45/3.60  #Strategies tried      : 1
% 10.45/3.60  
% 10.45/3.60  Timing (in seconds)
% 10.45/3.60  ----------------------
% 10.45/3.60  Preprocessing        : 0.51
% 10.45/3.60  Parsing              : 0.29
% 10.45/3.60  CNF conversion       : 0.03
% 10.45/3.61  Main loop            : 1.91
% 10.45/3.61  Inferencing          : 0.56
% 10.45/3.61  Reduction            : 0.54
% 10.45/3.61  Demodulation         : 0.35
% 10.45/3.61  BG Simplification    : 0.05
% 10.45/3.61  Subsumption          : 0.64
% 10.45/3.61  Abstraction          : 0.05
% 10.45/3.61  MUC search           : 0.00
% 10.45/3.61  Cooper               : 0.00
% 10.45/3.61  Total                : 2.48
% 10.45/3.61  Index Insertion      : 0.00
% 10.45/3.61  Index Deletion       : 0.00
% 10.45/3.61  Index Matching       : 0.00
% 10.45/3.61  BG Taut test         : 0.00
%------------------------------------------------------------------------------