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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL107-1 : TPTP v8.1.2. Released v1.0.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 : n016.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 10:47:23 EDT 2023

% Result   : Unsatisfiable 7.22s 2.88s
% Output   : CNFRefutation 7.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   35 (  18 unt;   6 typ;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   28 (  15   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   7 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :  147 (; 147   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ is_a_theorem > equivalent > #nlpp > e > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_37,axiom,
    ! [V6,W,U,Z,X,Y,V] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,V),equivalent(equivalent(equivalent(W,V),equivalent(W,U)),V6))),equivalent(Z,equivalent(equivalent(Y,X),V6)))),
    file(unknown,unknown) ).

tff(f_35,axiom,
    ! [X,Y] :
      ( ~ is_a_theorem(equivalent(X,Y))
      | ~ is_a_theorem(X)
      | is_a_theorem(Y) ),
    file(unknown,unknown) ).

tff(f_39,axiom,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [V6_3,Y_8,Z_6,V_9,U_5,X_7,W_4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X_7,Y_8),Z_6),equivalent(equivalent(U_5,V_9),equivalent(equivalent(equivalent(W_4,V_9),equivalent(W_4,U_5)),V6_3))),equivalent(Z_6,equivalent(equivalent(Y_8,X_7),V6_3)))),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_8,plain,
    ! [V_17,V6_12,X_15,Z_14,W_18,Y_13,U_16] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X_15,Y_13),Z_14),equivalent(equivalent(U_16,V_17),equivalent(equivalent(equivalent(W_18,V_17),equivalent(W_18,U_16)),V6_12))),equivalent(Z_14,equivalent(equivalent(Y_13,X_15),V6_12)))),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_2,plain,
    ! [Y_2,X_1] :
      ( is_a_theorem(Y_2)
      | ~ is_a_theorem(X_1)
      | ~ is_a_theorem(equivalent(X_1,Y_2)) ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_13,plain,
    ! [U_24,X_25,Y_22,V_20,Z_23,V6_21,W_19] :
      ( is_a_theorem(equivalent(Z_23,equivalent(equivalent(Y_22,X_25),V6_21)))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(X_25,Y_22),Z_23),equivalent(equivalent(U_24,V_20),equivalent(equivalent(equivalent(W_19,V_20),equivalent(W_19,U_24)),V6_21)))) ),
    inference(resolution,[status(thm)],[c_8,c_2]) ).

tff(c_19,plain,
    ! [V_32,W_27,U_28,W_31,U_29,V6_26,V_30] : is_a_theorem(equivalent(equivalent(equivalent(U_29,V_30),equivalent(equivalent(equivalent(W_31,V_30),equivalent(W_31,U_29)),V6_26)),equivalent(equivalent(equivalent(U_28,V_32),equivalent(equivalent(W_27,U_28),equivalent(W_27,V_32))),V6_26))),
    inference(resolution,[status(thm)],[c_4,c_13]) ).

tff(c_12,plain,
    ! [V_17,V6_12,X_15,Z_14,W_18,Y_13,U_16] :
      ( is_a_theorem(equivalent(Z_14,equivalent(equivalent(Y_13,X_15),V6_12)))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(X_15,Y_13),Z_14),equivalent(equivalent(U_16,V_17),equivalent(equivalent(equivalent(W_18,V_17),equivalent(W_18,U_16)),V6_12)))) ),
    inference(resolution,[status(thm)],[c_8,c_2]) ).

tff(c_30,plain,
    ! [V6_45,U_42,V_46,W_47,W_44,V_43,W_40,U_41] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(W_40,V_43),equivalent(W_40,U_42)),equivalent(equivalent(equivalent(W_44,equivalent(equivalent(W_47,U_41),equivalent(W_47,V_46))),equivalent(W_44,equivalent(U_41,V_46))),V6_45)),equivalent(equivalent(V_43,U_42),V6_45))),
    inference(resolution,[status(thm)],[c_19,c_12]) ).

tff(c_153,plain,
    ! [W_104,W_96,V_101,V6_100,W_103,U_102,U_97,W_99,V_98] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(W_104,equivalent(equivalent(W_96,U_97),equivalent(W_96,V_98))),equivalent(W_104,equivalent(U_97,V_98))),equivalent(equivalent(equivalent(W_99,U_102),equivalent(W_99,V_101)),V6_100)),equivalent(equivalent(equivalent(W_103,U_102),equivalent(W_103,V_101)),V6_100))),
    inference(resolution,[status(thm)],[c_30,c_12]) ).

tff(c_39,plain,
    ! [V6_45,U_42,V_46,W_47,W_44,V_43,W_40,U_41] :
      ( is_a_theorem(equivalent(equivalent(V_43,U_42),V6_45))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(W_40,V_43),equivalent(W_40,U_42)),equivalent(equivalent(equivalent(W_44,equivalent(equivalent(W_47,U_41),equivalent(W_47,V_46))),equivalent(W_44,equivalent(U_41,V_46))),V6_45))) ),
    inference(resolution,[status(thm)],[c_30,c_2]) ).

tff(c_173,plain,
    ! [U_109,V6_107,V_106,W_108,W_105] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(W_108,U_109),equivalent(equivalent(W_105,W_108),equivalent(W_105,V_106))),equivalent(U_109,V_106)),V6_107),V6_107)),
    inference(resolution,[status(thm)],[c_153,c_39]) ).

tff(c_193,plain,
    ! [V_112,V6_110,W_113,U_114,W_111] :
      ( is_a_theorem(V6_110)
      | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(W_111,U_114),equivalent(equivalent(W_113,W_111),equivalent(W_113,V_112))),equivalent(U_114,V_112)),V6_110)) ),
    inference(resolution,[status(thm)],[c_173,c_2]) ).

tff(c_198,plain,
    ! [V6_3,V_9,U_5,W_113,X_7,W_4] : is_a_theorem(equivalent(equivalent(equivalent(W_113,X_7),equivalent(W_113,equivalent(equivalent(equivalent(W_4,V_9),equivalent(W_4,U_5)),V6_3))),equivalent(equivalent(equivalent(U_5,V_9),X_7),V6_3))),
    inference(resolution,[status(thm)],[c_4,c_193]) ).

tff(c_27,plain,
    ! [V_32,W_27,V6_12,U_28,W_31,U_29,V_30,W_18] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(W_31,V_30),equivalent(W_31,U_29)),equivalent(equivalent(equivalent(W_18,equivalent(equivalent(W_27,U_28),equivalent(W_27,V_32))),equivalent(W_18,equivalent(U_28,V_32))),V6_12)),equivalent(equivalent(V_30,U_29),V6_12))),
    inference(resolution,[status(thm)],[c_19,c_12]) ).

tff(c_40,plain,
    ! [W_53,V_51,W_48,W_55,U_49,V_50,V6_54,U_52] :
      ( is_a_theorem(equivalent(equivalent(V_51,U_52),V6_54))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(W_53,V_51),equivalent(W_53,U_52)),equivalent(equivalent(equivalent(W_55,equivalent(equivalent(W_48,U_49),equivalent(W_48,V_50))),equivalent(W_55,equivalent(U_49,V_50))),V6_54))) ),
    inference(resolution,[status(thm)],[c_30,c_2]) ).

tff(c_51,plain,
    ! [W_57,V6_58,W_56,V_61,W_60,U_59] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(W_57,equivalent(equivalent(W_60,equivalent(W_56,U_59)),equivalent(W_60,equivalent(W_56,V_61)))),equivalent(W_57,equivalent(U_59,V_61))),V6_58),V6_58)),
    inference(resolution,[status(thm)],[c_27,c_40]) ).

tff(c_66,plain,
    ! [W_64,U_67,V_66,W_62,W_63,V6_65] :
      ( is_a_theorem(V6_65)
      | ~ is_a_theorem(equivalent(equivalent(equivalent(W_62,equivalent(equivalent(W_64,equivalent(W_63,U_67)),equivalent(W_64,equivalent(W_63,V_66)))),equivalent(W_62,equivalent(U_67,V_66))),V6_65)) ),
    inference(resolution,[status(thm)],[c_51,c_2]) ).

tff(c_138,plain,
    ! [V6_90,W_93,V_94,W_91,U_92,W_95] : is_a_theorem(equivalent(equivalent(equivalent(W_91,equivalent(W_93,equivalent(equivalent(W_95,V_94),equivalent(W_95,U_92)))),equivalent(W_91,equivalent(W_93,V6_90))),equivalent(equivalent(V_94,U_92),V6_90))),
    inference(resolution,[status(thm)],[c_4,c_66]) ).

tff(c_261,plain,
    ! [W_148,W_147,U_144,V_146,W_145,V6_143] :
      ( is_a_theorem(equivalent(equivalent(V_146,U_144),V6_143))
      | ~ is_a_theorem(equivalent(equivalent(W_147,equivalent(W_148,equivalent(equivalent(W_145,V_146),equivalent(W_145,U_144)))),equivalent(W_147,equivalent(W_148,V6_143)))) ),
    inference(resolution,[status(thm)],[c_138,c_2]) ).

tff(c_297,plain,
    ! [W_149,U_150] : is_a_theorem(equivalent(equivalent(equivalent(W_149,W_149),U_150),U_150)),
    inference(resolution,[status(thm)],[c_198,c_261]) ).

tff(c_387,plain,
    ! [U_161,W_162] :
      ( is_a_theorem(U_161)
      | ~ is_a_theorem(equivalent(equivalent(W_162,W_162),U_161)) ),
    inference(resolution,[status(thm)],[c_297,c_2]) ).

tff(c_442,plain,
    ! [W_4,V_9,U_5,V6_3] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(W_4,V_9),equivalent(W_4,U_5)),V6_3),equivalent(equivalent(V_9,U_5),V6_3))),
    inference(resolution,[status(thm)],[c_4,c_387]) ).

tff(c_485,plain,
    ! [W_164,V_165,U_166,V6_167] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(W_164,V_165),equivalent(W_164,U_166)),V6_167),equivalent(equivalent(V_165,U_166),V6_167))),
    inference(resolution,[status(thm)],[c_4,c_387]) ).

tff(c_1275,plain,
    ! [V_226,U_227,V6_228,W_229] :
      ( is_a_theorem(equivalent(equivalent(V_226,U_227),V6_228))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(W_229,V_226),equivalent(W_229,U_227)),V6_228)) ),
    inference(resolution,[status(thm)],[c_485,c_2]) ).

tff(c_1354,plain,
    ! [W_4,U_5,U_227,V_9] : is_a_theorem(equivalent(equivalent(equivalent(W_4,U_5),U_227),equivalent(equivalent(V_9,U_5),equivalent(equivalent(W_4,V_9),U_227)))),
    inference(resolution,[status(thm)],[c_442,c_1275]) ).

tff(c_6,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_6239,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1354,c_6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL107-1 : TPTP v8.1.2. Released v1.0.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.19/0.36  % Computer : n016.cluster.edu
% 0.19/0.36  % Model    : x86_64 x86_64
% 0.19/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.36  % Memory   : 8042.1875MB
% 0.19/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36  % CPULimit : 300
% 0.19/0.36  % WCLimit  : 300
% 0.19/0.36  % DateTime : Thu Aug  3 14:28:07 EDT 2023
% 0.19/0.36  % CPUTime  : 
% 7.22/2.88  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.22/2.88  
% 7.22/2.88  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.22/2.93  
% 7.22/2.93  Inference rules
% 7.22/2.93  ----------------------
% 7.22/2.93  #Ref     : 0
% 7.22/2.93  #Sup     : 1256
% 7.22/2.93  #Fact    : 0
% 7.22/2.93  #Define  : 0
% 7.22/2.93  #Split   : 0
% 7.22/2.93  #Chain   : 0
% 7.22/2.93  #Close   : 0
% 7.22/2.93  
% 7.22/2.93  Ordering : KBO
% 7.22/2.93  
% 7.22/2.93  Simplification rules
% 7.22/2.93  ----------------------
% 7.22/2.93  #Subsume      : 84
% 7.22/2.93  #Demod        : 353
% 7.22/2.93  #Tautology    : 360
% 7.22/2.93  #SimpNegUnit  : 0
% 7.22/2.93  #BackRed      : 1
% 7.22/2.93  
% 7.22/2.93  #Partial instantiations: 0
% 7.22/2.93  #Strategies tried      : 1
% 7.22/2.93  
% 7.22/2.93  Timing (in seconds)
% 7.22/2.93  ----------------------
% 7.22/2.94  Preprocessing        : 0.42
% 7.22/2.94  Parsing              : 0.23
% 7.22/2.94  CNF conversion       : 0.02
% 7.22/2.94  Main loop            : 1.36
% 7.22/2.94  Inferencing          : 0.53
% 7.22/2.94  Reduction            : 0.37
% 7.22/2.94  Demodulation         : 0.30
% 7.22/2.94  BG Simplification    : 0.03
% 7.22/2.94  Subsumption          : 0.34
% 7.22/2.94  Abstraction          : 0.04
% 7.22/2.94  MUC search           : 0.00
% 7.22/2.94  Cooper               : 0.00
% 7.22/2.94  Total                : 1.85
% 7.22/2.94  Index Insertion      : 0.00
% 7.22/2.94  Index Deletion       : 0.00
% 7.22/2.94  Index Matching       : 0.00
% 7.22/2.94  BG Taut test         : 0.00
%------------------------------------------------------------------------------