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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN585-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 : n021.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:22 EDT 2023

% Result   : Unsatisfiable 6.09s 2.60s
% Output   : CNFRefutation 6.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   37 (  11 unt;  17 typ;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   34 (  18   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   18 (  10   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   7 con; 0-2 aty)
%            Number of variables   :   26 (;  26   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p2 > p11 > p10 > f9 > f8 > f7 > f6 > f5 > #nlpp > f4 > f3 > c18 > c17 > c16 > c15 > c14 > c13 > c12

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_25,axiom,
    ! [X8] : p11(X8,X8),
    file(unknown,unknown) ).

tff(f_44,axiom,
    ! [X9,X10,X11] :
      ( p11(X9,f8(X10,X11))
      | ~ p11(X9,X11) ),
    file(unknown,unknown) ).

tff(f_31,axiom,
    ~ p2(c12,f3(c13)),
    file(unknown,unknown) ).

tff(f_32,axiom,
    p11(c18,f9(c12,c14)),
    file(unknown,unknown) ).

tff(f_146,axiom,
    ! [X17,X15,X16] :
      ( p2(X17,f3(c13))
      | p11(f9(X17,X15),f9(X17,X16))
      | ~ p11(X15,X16) ),
    file(unknown,unknown) ).

tff(f_62,axiom,
    ! [X12,X13,X14] :
      ( p11(X12,X13)
      | ~ p11(X12,X14)
      | ~ p11(X14,X13) ),
    file(unknown,unknown) ).

tff(f_39,axiom,
    ~ p11(c18,f9(c12,f8(c16,c14))),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [X8_2] : p11(X8_2,X8_2),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_26,plain,
    ! [X9_3,X11_5,X10_4] :
      ( ~ p11(X9_3,X11_5)
      | p11(X9_3,f8(X10_4,X11_5)) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_12,plain,
    ~ p2(c12,f3(c13)),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_14,plain,
    p11(c18,f9(c12,c14)),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_538,plain,
    ! [X15_117,X16_118,X17_119] :
      ( ~ p11(X15_117,X16_118)
      | p11(f9(X17_119,X15_117),f9(X17_119,X16_118))
      | p2(X17_119,f3(c13)) ),
    inference(cnfTransformation,[status(thm)],[f_146]) ).

tff(c_32,plain,
    ! [X14_12,X13_11,X12_10] :
      ( ~ p11(X14_12,X13_11)
      | ~ p11(X12_10,X14_12)
      | p11(X12_10,X13_11) ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_2465,plain,
    ! [X12_283,X17_284,X15_285,X16_286] :
      ( ~ p11(X12_283,f9(X17_284,X15_285))
      | p11(X12_283,f9(X17_284,X16_286))
      | ~ p11(X15_285,X16_286)
      | p2(X17_284,f3(c13)) ),
    inference(resolution,[status(thm)],[c_538,c_32]) ).

tff(c_2482,plain,
    ! [X16_286] :
      ( p11(c18,f9(c12,X16_286))
      | ~ p11(c14,X16_286)
      | p2(c12,f3(c13)) ),
    inference(resolution,[status(thm)],[c_14,c_2465]) ).

tff(c_2501,plain,
    ! [X16_288] :
      ( p11(c18,f9(c12,X16_288))
      | ~ p11(c14,X16_288) ),
    inference(negUnitSimplification,[status(thm)],[c_12,c_2482]) ).

tff(c_24,plain,
    ~ p11(c18,f9(c12,f8(c16,c14))),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_2523,plain,
    ~ p11(c14,f8(c16,c14)),
    inference(resolution,[status(thm)],[c_2501,c_24]) ).

tff(c_2526,plain,
    ~ p11(c14,c14),
    inference(resolution,[status(thm)],[c_26,c_2523]) ).

tff(c_2530,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_2526]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN585-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/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 : n021.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:14:21 EDT 2023
% 0.21/0.35  % CPUTime  : 
% 6.09/2.60  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.09/2.61  
% 6.09/2.61  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.09/2.64  
% 6.09/2.64  Inference rules
% 6.09/2.64  ----------------------
% 6.09/2.64  #Ref     : 0
% 6.09/2.64  #Sup     : 650
% 6.09/2.64  #Fact    : 0
% 6.09/2.64  #Define  : 0
% 6.09/2.64  #Split   : 12
% 6.09/2.64  #Chain   : 0
% 6.09/2.64  #Close   : 0
% 6.09/2.64  
% 6.09/2.64  Ordering : KBO
% 6.09/2.64  
% 6.09/2.64  Simplification rules
% 6.09/2.64  ----------------------
% 6.09/2.64  #Subsume      : 47
% 6.09/2.64  #Demod        : 71
% 6.09/2.64  #Tautology    : 56
% 6.09/2.64  #SimpNegUnit  : 7
% 6.09/2.64  #BackRed      : 0
% 6.09/2.64  
% 6.09/2.64  #Partial instantiations: 0
% 6.09/2.64  #Strategies tried      : 1
% 6.09/2.64  
% 6.09/2.64  Timing (in seconds)
% 6.09/2.64  ----------------------
% 6.09/2.64  Preprocessing        : 0.48
% 6.09/2.64  Parsing              : 0.28
% 6.09/2.64  CNF conversion       : 0.03
% 6.09/2.64  Main loop            : 0.97
% 6.09/2.64  Inferencing          : 0.35
% 6.09/2.64  Reduction            : 0.27
% 6.09/2.64  Demodulation         : 0.18
% 6.09/2.64  BG Simplification    : 0.03
% 6.09/2.64  Subsumption          : 0.26
% 6.09/2.64  Abstraction          : 0.03
% 6.09/2.64  MUC search           : 0.00
% 6.09/2.64  Cooper               : 0.00
% 6.09/2.64  Total                : 1.51
% 6.09/2.64  Index Insertion      : 0.00
% 6.09/2.64  Index Deletion       : 0.00
% 6.09/2.64  Index Matching       : 0.00
% 6.09/2.64  BG Taut test         : 0.00
%------------------------------------------------------------------------------