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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN589-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 : n018.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 7.16s 2.85s
% Output   : CNFRefutation 7.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   35 (   8 unt;  24 typ;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   13 (   8   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    9 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   23 (  14   >;   9   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  10 con; 0-2 aty)
%            Number of variables   :    7 (;   7   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p7 > p2 > p15 > p14 > f9 > f8 > f6 > f13 > f10 > #nlpp > f5 > f4 > f3 > f12 > f11 > c25 > c24 > c23 > c22 > c21 > c20 > c19 > c18 > c17 > c16

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_138,axiom,
    p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))),
    file(unknown,unknown) ).

tff(f_137,axiom,
    p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22))))),
    file(unknown,unknown) ).

tff(f_65,axiom,
    ! [X26,X27,X25] :
      ( p7(X26,X27)
      | ~ p7(X25,X26)
      | ~ p7(X25,X27) ),
    file(unknown,unknown) ).

tff(f_140,axiom,
    ~ p7(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22))))),
    file(unknown,unknown) ).

tff(c_50,plain,
    p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))),
    inference(cnfTransformation,[status(thm)],[f_138]) ).

tff(c_48,plain,
    p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22))))),
    inference(cnfTransformation,[status(thm)],[f_137]) ).

tff(c_28,plain,
    ! [X25_15,X27_14,X26_13] :
      ( ~ p7(X25_15,X27_14)
      | ~ p7(X25_15,X26_13)
      | p7(X26_13,X27_14) ),
    inference(cnfTransformation,[status(thm)],[f_65]) ).

tff(c_5261,plain,
    ! [X26_326] :
      ( ~ p7(c20,X26_326)
      | p7(X26_326,f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22))))) ),
    inference(resolution,[status(thm)],[c_48,c_28]) ).

tff(c_52,plain,
    ~ p7(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f8(f10(f12(f11(f3(f5(c17)))),c23),f8(f10(f11(f3(f4(f5(c17)))),c25),f9(f11(c24),f10(f11(f3(f4(f5(c17)))),c22))))),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_5290,plain,
    ~ p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))),
    inference(resolution,[status(thm)],[c_5261,c_52]) ).

tff(c_5311,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_50,c_5290]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SYN589-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.16/0.37  % Computer : n018.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu Aug  3 17:18:35 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 7.16/2.85  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.16/2.85  
% 7.16/2.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.16/2.88  
% 7.16/2.88  Inference rules
% 7.16/2.88  ----------------------
% 7.16/2.88  #Ref     : 0
% 7.16/2.88  #Sup     : 1546
% 7.16/2.88  #Fact    : 0
% 7.16/2.88  #Define  : 0
% 7.16/2.88  #Split   : 11
% 7.16/2.88  #Chain   : 0
% 7.16/2.88  #Close   : 0
% 7.16/2.88  
% 7.16/2.88  Ordering : KBO
% 7.16/2.88  
% 7.16/2.88  Simplification rules
% 7.16/2.88  ----------------------
% 7.16/2.88  #Subsume      : 231
% 7.16/2.88  #Demod        : 77
% 7.16/2.88  #Tautology    : 24
% 7.16/2.88  #SimpNegUnit  : 0
% 7.16/2.88  #BackRed      : 0
% 7.16/2.88  
% 7.16/2.88  #Partial instantiations: 0
% 7.16/2.88  #Strategies tried      : 1
% 7.16/2.88  
% 7.16/2.88  Timing (in seconds)
% 7.16/2.88  ----------------------
% 7.16/2.88  Preprocessing        : 0.50
% 7.16/2.88  Parsing              : 0.27
% 7.16/2.88  CNF conversion       : 0.03
% 7.16/2.88  Main loop            : 1.30
% 7.16/2.89  Inferencing          : 0.37
% 7.16/2.89  Reduction            : 0.31
% 7.16/2.89  Demodulation         : 0.21
% 7.16/2.89  BG Simplification    : 0.04
% 7.16/2.89  Subsumption          : 0.49
% 7.16/2.89  Abstraction          : 0.04
% 7.16/2.89  MUC search           : 0.00
% 7.16/2.89  Cooper               : 0.00
% 7.16/2.89  Total                : 1.84
% 7.16/2.89  Index Insertion      : 0.00
% 7.16/2.89  Index Deletion       : 0.00
% 7.16/2.89  Index Matching       : 0.00
% 7.16/2.89  BG Taut test         : 0.00
%------------------------------------------------------------------------------