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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN630-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 : n005.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:28 EDT 2023

% Result   : Unsatisfiable 11.76s 3.89s
% Output   : CNFRefutation 12.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   35
% Syntax   : Number of formulae    :   46 (  12 unt;  29 typ;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   30 (  16   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    9 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   37 (  21   >;  16   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   23 (  23 usr;   8 con; 0-2 aty)
%            Number of variables   :   20 (;  20   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p6 > p4 > p3 > p22 > p21 > p2 > f8 > f7 > f5 > f20 > f19 > f18 > f15 > f14 > f13 > f12 > #nlpp > f9 > f17 > f16 > f11 > f10 > c30 > c29 > c28 > c27 > c26 > c25 > c24 > c23

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_31,axiom,
    p21(c27,f12(f9(f10(f11(c29))),c24)),
    file(unknown,unknown) ).

tff(f_91,axiom,
    p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),c27),
    file(unknown,unknown) ).

tff(f_30,axiom,
    p21(c28,f9(f10(f11(c29)))),
    file(unknown,unknown) ).

tff(f_194,axiom,
    p3(c26,f13(f15(f17(f16(f9(f11(c29)))),c28),f13(f15(f16(f9(f10(f11(c29)))),c30),f14(f16(c27),f15(f16(f9(f10(f11(c29)))),c25))))),
    file(unknown,unknown) ).

tff(f_252,axiom,
    ! [X22,X23,X24,X21,X20,X19,X18] :
      ( p4(f5(f7(X19,f8(X20,X21)),X18),X23)
      | ~ p21(X22,f9(f10(f11(c29))))
      | ~ p21(X23,f12(f9(f10(f11(c29))),X20))
      | ~ p22(f12(f9(f10(f11(c29))),f18(X20,f9(f11(c29)))),X23)
      | ~ p3(X18,f13(f15(f17(f16(f9(f11(c29)))),X22),f13(f15(f16(f9(f10(f11(c29)))),X24),f14(f16(X23),f15(f16(f9(f10(f11(c29)))),X21))))) ),
    file(unknown,unknown) ).

tff(f_58,axiom,
    ~ p4(f5(f7(c23,f8(c24,c25)),c26),c27),
    file(unknown,unknown) ).

tff(c_12,plain,
    p21(c27,f12(f9(f10(f11(c29))),c24)),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_34,plain,
    p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),c27),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_10,plain,
    p21(c28,f9(f10(f11(c29)))),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_60,plain,
    p3(c26,f13(f15(f17(f16(f9(f11(c29)))),c28),f13(f15(f16(f9(f10(f11(c29)))),c30),f14(f16(c27),f15(f16(f9(f10(f11(c29)))),c25))))),
    inference(cnfTransformation,[status(thm)],[f_194]) ).

tff(c_1927,plain,
    ! [X23_410,X20_411,X18_412,X21_407,X22_408,X24_409,X19_406] :
      ( ~ p3(X18_412,f13(f15(f17(f16(f9(f11(c29)))),X22_408),f13(f15(f16(f9(f10(f11(c29)))),X24_409),f14(f16(X23_410),f15(f16(f9(f10(f11(c29)))),X21_407)))))
      | ~ p22(f12(f9(f10(f11(c29))),f18(X20_411,f9(f11(c29)))),X23_410)
      | ~ p21(X23_410,f12(f9(f10(f11(c29))),X20_411))
      | ~ p21(X22_408,f9(f10(f11(c29))))
      | p4(f5(f7(X19_406,f8(X20_411,X21_407)),X18_412),X23_410) ),
    inference(cnfTransformation,[status(thm)],[f_252]) ).

tff(c_1929,plain,
    ! [X20_411,X19_406] :
      ( ~ p22(f12(f9(f10(f11(c29))),f18(X20_411,f9(f11(c29)))),c27)
      | ~ p21(c27,f12(f9(f10(f11(c29))),X20_411))
      | ~ p21(c28,f9(f10(f11(c29))))
      | p4(f5(f7(X19_406,f8(X20_411,c25)),c26),c27) ),
    inference(resolution,[status(thm)],[c_60,c_1927]) ).

tff(c_10540,plain,
    ! [X20_849,X19_850] :
      ( ~ p22(f12(f9(f10(f11(c29))),f18(X20_849,f9(f11(c29)))),c27)
      | ~ p21(c27,f12(f9(f10(f11(c29))),X20_849))
      | p4(f5(f7(X19_850,f8(X20_849,c25)),c26),c27) ),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_1929]) ).

tff(c_10542,plain,
    ! [X19_850] :
      ( ~ p21(c27,f12(f9(f10(f11(c29))),c24))
      | p4(f5(f7(X19_850,f8(c24,c25)),c26),c27) ),
    inference(resolution,[status(thm)],[c_34,c_10540]) ).

tff(c_10545,plain,
    ! [X19_850] : p4(f5(f7(X19_850,f8(c24,c25)),c26),c27),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_10542]) ).

tff(c_24,plain,
    ~ p4(f5(f7(c23,f8(c24,c25)),c26),c27),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_10548,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_10545,c_24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN630-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/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.13/0.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 17:27:56 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 11.76/3.89  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.76/3.89  
% 11.76/3.89  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.09/3.92  
% 12.09/3.92  Inference rules
% 12.09/3.92  ----------------------
% 12.09/3.92  #Ref     : 0
% 12.09/3.92  #Sup     : 3365
% 12.09/3.92  #Fact    : 0
% 12.09/3.92  #Define  : 0
% 12.09/3.92  #Split   : 1
% 12.09/3.92  #Chain   : 0
% 12.09/3.92  #Close   : 0
% 12.09/3.92  
% 12.09/3.92  Ordering : KBO
% 12.09/3.92  
% 12.09/3.92  Simplification rules
% 12.09/3.92  ----------------------
% 12.09/3.92  #Subsume      : 241
% 12.09/3.92  #Demod        : 12
% 12.09/3.92  #Tautology    : 4
% 12.09/3.92  #SimpNegUnit  : 0
% 12.09/3.92  #BackRed      : 1
% 12.09/3.92  
% 12.09/3.92  #Partial instantiations: 0
% 12.09/3.92  #Strategies tried      : 1
% 12.09/3.92  
% 12.09/3.92  Timing (in seconds)
% 12.09/3.92  ----------------------
% 12.09/3.92  Preprocessing        : 0.58
% 12.09/3.92  Parsing              : 0.33
% 12.09/3.92  CNF conversion       : 0.03
% 12.09/3.92  Main loop            : 2.21
% 12.09/3.92  Inferencing          : 0.57
% 12.09/3.92  Reduction            : 0.49
% 12.09/3.92  Demodulation         : 0.33
% 12.09/3.92  BG Simplification    : 0.07
% 12.09/3.92  Subsumption          : 0.92
% 12.09/3.92  Abstraction          : 0.06
% 12.09/3.92  MUC search           : 0.00
% 12.09/3.92  Cooper               : 0.00
% 12.09/3.92  Total                : 2.84
% 12.09/3.92  Index Insertion      : 0.00
% 12.09/3.93  Index Deletion       : 0.00
% 12.09/3.93  Index Matching       : 0.00
% 12.09/3.93  BG Taut test         : 0.00
%------------------------------------------------------------------------------