TSTP Solution File: LCL239-3 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL239-3 : TPTP v8.1.2. Released v2.3.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 : n004.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:47 EDT 2023

% Result   : Unsatisfiable 8.23s 3.01s
% Output   : CNFRefutation 8.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   74 (  36 unt;   7 typ;   0 def)
%            Number of atoms       :  107 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   82 (  42   ~;  40   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   6   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :  141 (; 141   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > and > #nlpp > not > p

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

tff(f_56,axiom,
    ! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
    file(unknown,unknown) ).

tff(f_96,axiom,
    ! [P,Q] : ( and(P,Q) = not(or(not(P),not(Q))) ),
    file(unknown,unknown) ).

tff(f_48,axiom,
    ! [A,B] : axiom(implies(A,or(B,A))),
    file(unknown,unknown) ).

tff(f_61,axiom,
    ! [X] :
      ( theorem(X)
      | ~ axiom(X) ),
    file(unknown,unknown) ).

tff(f_52,axiom,
    ! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
    file(unknown,unknown) ).

tff(f_69,axiom,
    ! [X,Y] :
      ( theorem(X)
      | ~ theorem(implies(Y,X))
      | ~ theorem(Y) ),
    file(unknown,unknown) ).

tff(f_50,axiom,
    ! [A,B] : axiom(implies(or(A,B),or(B,A))),
    file(unknown,unknown) ).

tff(f_46,axiom,
    ! [A] : axiom(implies(or(A,A),A)),
    file(unknown,unknown) ).

tff(f_54,axiom,
    ! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
    file(unknown,unknown) ).

tff(f_100,axiom,
    ~ theorem(not(and(p,not(p)))),
    file(unknown,unknown) ).

tff(c_12,plain,
    ! [X_12,Y_13] : ( or(not(X_12),Y_13) = implies(X_12,Y_13) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_18,plain,
    ! [P_17,Q_18] : ( not(or(not(P_17),not(Q_18))) = and(P_17,Q_18) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_77,plain,
    ! [P_34,Q_35] : ( not(implies(P_34,not(Q_35))) = and(P_34,Q_35) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_18]) ).

tff(c_86,plain,
    ! [P_34,Q_35,Y_13] : ( implies(implies(P_34,not(Q_35)),Y_13) = or(and(P_34,Q_35),Y_13) ),
    inference(superposition,[status(thm),theory(equality)],[c_77,c_12]) ).

tff(c_21,plain,
    ! [P_17,Q_18] : ( not(implies(P_17,not(Q_18))) = and(P_17,Q_18) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_18]) ).

tff(c_4,plain,
    ! [A_2,B_3] : axiom(implies(A_2,or(B_3,A_2))),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_14,plain,
    ! [X_14] :
      ( ~ axiom(X_14)
      | theorem(X_14) ),
    inference(cnfTransformation,[status(thm)],[f_61]) ).

tff(c_58,plain,
    ! [A_31,B_32,C_33] : axiom(implies(or(A_31,or(B_32,C_33)),or(B_32,or(A_31,C_33)))),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_65,plain,
    ! [X_12,B_32,C_33] : axiom(implies(implies(X_12,or(B_32,C_33)),or(B_32,or(not(X_12),C_33)))),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_58]) ).

tff(c_595,plain,
    ! [X_104,B_105,C_106] : axiom(implies(implies(X_104,or(B_105,C_106)),or(B_105,implies(X_104,C_106)))),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_65]) ).

tff(c_46,plain,
    ! [Y_27,X_28] :
      ( ~ theorem(Y_27)
      | ~ theorem(implies(Y_27,X_28))
      | theorem(X_28) ),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_50,plain,
    ! [Y_27,X_28] :
      ( ~ theorem(Y_27)
      | theorem(X_28)
      | ~ axiom(implies(Y_27,X_28)) ),
    inference(resolution,[status(thm)],[c_14,c_46]) ).

tff(c_613,plain,
    ! [X_104,B_105,C_106] :
      ( ~ theorem(implies(X_104,or(B_105,C_106)))
      | theorem(or(B_105,implies(X_104,C_106))) ),
    inference(resolution,[status(thm)],[c_595,c_50]) ).

tff(c_6,plain,
    ! [A_4,B_5] : axiom(implies(or(A_4,B_5),or(B_5,A_4))),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_95,plain,
    ! [Y_36,X_37] :
      ( ~ theorem(Y_36)
      | theorem(X_37)
      | ~ axiom(implies(Y_36,X_37)) ),
    inference(resolution,[status(thm)],[c_14,c_46]) ).

tff(c_115,plain,
    ! [A_2,B_3] :
      ( ~ theorem(A_2)
      | theorem(or(B_3,A_2)) ),
    inference(resolution,[status(thm)],[c_4,c_95]) ).

tff(c_61,plain,
    ! [A_31,X_12,Y_13] : axiom(implies(or(A_31,implies(X_12,Y_13)),or(not(X_12),or(A_31,Y_13)))),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_58]) ).

tff(c_722,plain,
    ! [A_117,X_118,Y_119] : axiom(implies(or(A_117,implies(X_118,Y_119)),implies(X_118,or(A_117,Y_119)))),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_61]) ).

tff(c_1022,plain,
    ! [A_166,X_167,Y_168] :
      ( ~ theorem(or(A_166,implies(X_167,Y_168)))
      | theorem(implies(X_167,or(A_166,Y_168))) ),
    inference(resolution,[status(thm)],[c_722,c_50]) ).

tff(c_1076,plain,
    ! [X_175,B_176,Y_177] :
      ( theorem(implies(X_175,or(B_176,Y_177)))
      | ~ theorem(implies(X_175,Y_177)) ),
    inference(resolution,[status(thm)],[c_115,c_1022]) ).

tff(c_16,plain,
    ! [Y_16,X_15] :
      ( ~ theorem(Y_16)
      | ~ theorem(implies(Y_16,X_15))
      | theorem(X_15) ),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_1089,plain,
    ! [X_178,B_179,Y_180] :
      ( ~ theorem(X_178)
      | theorem(or(B_179,Y_180))
      | ~ theorem(implies(X_178,Y_180)) ),
    inference(resolution,[status(thm)],[c_1076,c_16]) ).

tff(c_1420,plain,
    ! [X_213,B_214,Y_215] :
      ( ~ theorem(X_213)
      | theorem(or(B_214,Y_215))
      | ~ axiom(implies(X_213,Y_215)) ),
    inference(resolution,[status(thm)],[c_14,c_1089]) ).

tff(c_2093,plain,
    ! [A_271,B_272,B_273] :
      ( ~ theorem(or(A_271,B_272))
      | theorem(or(B_273,or(B_272,A_271))) ),
    inference(resolution,[status(thm)],[c_6,c_1420]) ).

tff(c_8,plain,
    ! [A_6,B_7,C_8] : axiom(implies(or(A_6,or(B_7,C_8)),or(B_7,or(A_6,C_8)))),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_111,plain,
    ! [A_6,B_7,C_8] :
      ( ~ theorem(or(A_6,or(B_7,C_8)))
      | theorem(or(B_7,or(A_6,C_8))) ),
    inference(resolution,[status(thm)],[c_8,c_95]) ).

tff(c_2328,plain,
    ! [B_289,B_290,A_291] :
      ( theorem(or(B_289,or(B_290,A_291)))
      | ~ theorem(or(A_291,B_289)) ),
    inference(resolution,[status(thm)],[c_2093,c_111]) ).

tff(c_2,plain,
    ! [A_1] : axiom(implies(or(A_1,A_1),A_1)),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_114,plain,
    ! [A_1] :
      ( ~ theorem(or(A_1,A_1))
      | theorem(A_1) ),
    inference(resolution,[status(thm)],[c_2,c_95]) ).

tff(c_2770,plain,
    ! [B_335,A_336] :
      ( theorem(or(B_335,A_336))
      | ~ theorem(or(A_336,or(B_335,A_336))) ),
    inference(resolution,[status(thm)],[c_2328,c_114]) ).

tff(c_2861,plain,
    ! [X_12,Y_13] :
      ( theorem(or(not(X_12),Y_13))
      | ~ theorem(or(Y_13,implies(X_12,Y_13))) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_2770]) ).

tff(c_2937,plain,
    ! [X_340,Y_341] :
      ( theorem(implies(X_340,Y_341))
      | ~ theorem(or(Y_341,implies(X_340,Y_341))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_2861]) ).

tff(c_3193,plain,
    ! [X_353,C_354] :
      ( theorem(implies(X_353,C_354))
      | ~ theorem(implies(X_353,or(C_354,C_354))) ),
    inference(resolution,[status(thm)],[c_613,c_2937]) ).

tff(c_3433,plain,
    ! [X_360,C_361] :
      ( theorem(implies(X_360,C_361))
      | ~ axiom(implies(X_360,or(C_361,C_361))) ),
    inference(resolution,[status(thm)],[c_14,c_3193]) ).

tff(c_3474,plain,
    ! [A_362] : theorem(implies(A_362,A_362)),
    inference(resolution,[status(thm)],[c_4,c_3433]) ).

tff(c_51,plain,
    ! [A_29,B_30] : axiom(implies(or(A_29,B_30),or(B_30,A_29))),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_258,plain,
    ! [Y_62,X_63] : axiom(implies(or(Y_62,not(X_63)),implies(X_63,Y_62))),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_51]) ).

tff(c_287,plain,
    ! [Y_66,X_67] :
      ( ~ theorem(or(Y_66,not(X_67)))
      | theorem(implies(X_67,Y_66)) ),
    inference(resolution,[status(thm)],[c_258,c_50]) ).

tff(c_309,plain,
    ! [X_12,X_67] :
      ( ~ theorem(implies(X_12,not(X_67)))
      | theorem(implies(X_67,not(X_12))) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_287]) ).

tff(c_3576,plain,
    ! [X_366] : theorem(implies(X_366,not(not(X_366)))),
    inference(resolution,[status(thm)],[c_3474,c_309]) ).

tff(c_3601,plain,
    ! [P_17,Q_18] : theorem(implies(implies(P_17,not(Q_18)),not(and(P_17,Q_18)))),
    inference(superposition,[status(thm),theory(equality)],[c_21,c_3576]) ).

tff(c_3610,plain,
    ! [P_17,Q_18] : theorem(or(and(P_17,Q_18),not(and(P_17,Q_18)))),
    inference(demodulation,[status(thm),theory(equality)],[c_86,c_3601]) ).

tff(c_328,plain,
    ! [P_70,Q_71,Y_72] : ( implies(implies(P_70,not(Q_71)),Y_72) = or(and(P_70,Q_71),Y_72) ),
    inference(superposition,[status(thm),theory(equality)],[c_77,c_12]) ).

tff(c_387,plain,
    ! [P_70,Q_71,B_3] : axiom(or(and(P_70,Q_71),or(B_3,implies(P_70,not(Q_71))))),
    inference(superposition,[status(thm),theory(equality)],[c_328,c_4]) ).

tff(c_3504,plain,
    ! [X_67] : theorem(implies(X_67,not(not(X_67)))),
    inference(resolution,[status(thm)],[c_3474,c_309]) ).

tff(c_3968,plain,
    ! [P_392,Q_393,Y_394] :
      ( ~ theorem(implies(P_392,not(Q_393)))
      | theorem(Y_394)
      | ~ axiom(or(and(P_392,Q_393),Y_394)) ),
    inference(superposition,[status(thm),theory(equality)],[c_328,c_50]) ).

tff(c_4668,plain,
    ! [Y_417,X_418] :
      ( theorem(Y_417)
      | ~ axiom(or(and(X_418,not(X_418)),Y_417)) ),
    inference(resolution,[status(thm)],[c_3504,c_3968]) ).

tff(c_4701,plain,
    ! [B_419,P_420] : theorem(or(B_419,implies(P_420,not(not(P_420))))),
    inference(resolution,[status(thm)],[c_387,c_4668]) ).

tff(c_139,plain,
    ! [A_43,B_44,C_45] : axiom(implies(implies(A_43,B_44),implies(or(C_45,A_43),or(C_45,B_44)))),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_149,plain,
    ! [A_43,B_44,C_45] :
      ( ~ theorem(implies(A_43,B_44))
      | theorem(implies(or(C_45,A_43),or(C_45,B_44))) ),
    inference(resolution,[status(thm)],[c_139,c_50]) ).

tff(c_3397,plain,
    ! [B_358,A_359] :
      ( theorem(implies(or(B_358,A_359),B_358))
      | ~ theorem(implies(A_359,B_358)) ),
    inference(resolution,[status(thm)],[c_149,c_3193]) ).

tff(c_3432,plain,
    ! [B_358,A_359] :
      ( ~ theorem(or(B_358,A_359))
      | theorem(B_358)
      | ~ theorem(implies(A_359,B_358)) ),
    inference(resolution,[status(thm)],[c_3397,c_16]) ).

tff(c_4704,plain,
    ! [B_419,P_420] :
      ( theorem(B_419)
      | ~ theorem(implies(implies(P_420,not(not(P_420))),B_419)) ),
    inference(resolution,[status(thm)],[c_4701,c_3432]) ).

tff(c_6707,plain,
    ! [B_487,P_488] :
      ( theorem(B_487)
      | ~ theorem(or(and(P_488,not(P_488)),B_487)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_86,c_4704]) ).

tff(c_6825,plain,
    ! [P_17] : theorem(not(and(P_17,not(P_17)))),
    inference(resolution,[status(thm)],[c_3610,c_6707]) ).

tff(c_20,plain,
    ~ theorem(not(and(p,not(p)))),
    inference(cnfTransformation,[status(thm)],[f_100]) ).

tff(c_6854,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_6825,c_20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL239-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13  % 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.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu Aug  3 14:13:11 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 8.23/3.01  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.23/3.02  
% 8.23/3.02  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.36/3.06  
% 8.36/3.06  Inference rules
% 8.36/3.06  ----------------------
% 8.36/3.06  #Ref     : 0
% 8.36/3.06  #Sup     : 1592
% 8.36/3.06  #Fact    : 0
% 8.36/3.06  #Define  : 0
% 8.36/3.06  #Split   : 2
% 8.36/3.06  #Chain   : 0
% 8.36/3.06  #Close   : 0
% 8.36/3.06  
% 8.36/3.06  Ordering : KBO
% 8.36/3.06  
% 8.36/3.06  Simplification rules
% 8.36/3.06  ----------------------
% 8.36/3.06  #Subsume      : 605
% 8.36/3.06  #Demod        : 580
% 8.36/3.06  #Tautology    : 209
% 8.36/3.06  #SimpNegUnit  : 0
% 8.36/3.06  #BackRed      : 5
% 8.36/3.06  
% 8.36/3.06  #Partial instantiations: 0
% 8.36/3.06  #Strategies tried      : 1
% 8.36/3.06  
% 8.36/3.06  Timing (in seconds)
% 8.36/3.06  ----------------------
% 8.36/3.06  Preprocessing        : 0.44
% 8.36/3.06  Parsing              : 0.24
% 8.36/3.06  CNF conversion       : 0.02
% 8.36/3.06  Main loop            : 1.56
% 8.36/3.06  Inferencing          : 0.57
% 8.36/3.06  Reduction            : 0.44
% 8.36/3.06  Demodulation         : 0.32
% 8.36/3.06  BG Simplification    : 0.04
% 8.36/3.06  Subsumption          : 0.41
% 8.36/3.06  Abstraction          : 0.05
% 8.36/3.06  MUC search           : 0.00
% 8.36/3.06  Cooper               : 0.00
% 8.36/3.06  Total                : 2.05
% 8.36/3.06  Index Insertion      : 0.00
% 8.36/3.06  Index Deletion       : 0.00
% 8.36/3.06  Index Matching       : 0.00
% 8.36/3.06  BG Taut test         : 0.00
%------------------------------------------------------------------------------