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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL199-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/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 : 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:38 EDT 2023

% Result   : Unsatisfiable 22.08s 11.46s
% Output   : CNFRefutation 22.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   62 (  28 unt;   7 typ;   0 def)
%            Number of atoms       :   93 (   3 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   78 (  40   ~;  38   |;   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  :    7 (   5   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  117 (; 117   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #nlpp > not > q > 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(q,type,
    q: $i ).

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

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

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

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_56,axiom,
    ! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
    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_54,axiom,
    ! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
    file(unknown,unknown) ).

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

tff(f_77,axiom,
    ~ theorem(implies(not(or(p,q)),not(p))),
    file(unknown,unknown) ).

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_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_107,plain,
    ! [A_37,B_38,C_39] : axiom(implies(or(A_37,or(B_38,C_39)),or(B_38,or(A_37,C_39)))),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_120,plain,
    ! [X_12,B_38,Y_13] : axiom(implies(or(not(X_12),or(B_38,Y_13)),or(B_38,implies(X_12,Y_13)))),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_107]) ).

tff(c_378,plain,
    ! [X_83,B_84,Y_85] : axiom(implies(implies(X_83,or(B_84,Y_85)),or(B_84,implies(X_83,Y_85)))),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_120]) ).

tff(c_50,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_54,plain,
    ! [Y_27,X_28] :
      ( ~ theorem(Y_27)
      | theorem(X_28)
      | ~ axiom(implies(Y_27,X_28)) ),
    inference(resolution,[status(thm)],[c_14,c_50]) ).

tff(c_389,plain,
    ! [X_83,B_84,Y_85] :
      ( ~ theorem(implies(X_83,or(B_84,Y_85)))
      | theorem(or(B_84,implies(X_83,Y_85))) ),
    inference(resolution,[status(thm)],[c_378,c_54]) ).

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_22,plain,
    ! [X_21,Y_22] : ( or(not(X_21),Y_22) = implies(X_21,Y_22) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_32,plain,
    ! [Y_22,X_21] : axiom(implies(Y_22,implies(X_21,Y_22))),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_4]) ).

tff(c_64,plain,
    ! [Y_32,X_33] :
      ( ~ theorem(Y_32)
      | theorem(X_33)
      | ~ axiom(implies(Y_32,X_33)) ),
    inference(resolution,[status(thm)],[c_14,c_50]) ).

tff(c_82,plain,
    ! [Y_22,X_21] :
      ( ~ theorem(Y_22)
      | theorem(implies(X_21,Y_22)) ),
    inference(resolution,[status(thm)],[c_32,c_64]) ).

tff(c_55,plain,
    ! [A_29,B_30,C_31] : axiom(implies(implies(A_29,B_30),implies(or(C_31,A_29),or(C_31,B_30)))),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

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

tff(c_262,plain,
    ! [Y_62,B_63,X_64] : axiom(implies(implies(Y_62,B_63),implies(implies(X_64,Y_62),implies(X_64,B_63)))),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_58]) ).

tff(c_413,plain,
    ! [Y_92,B_93,X_94] :
      ( ~ theorem(implies(Y_92,B_93))
      | theorem(implies(implies(X_94,Y_92),implies(X_94,B_93))) ),
    inference(resolution,[status(thm)],[c_262,c_54]) ).

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_1045,plain,
    ! [X_169,Y_170,B_171] :
      ( ~ theorem(implies(X_169,Y_170))
      | theorem(implies(X_169,B_171))
      | ~ theorem(implies(Y_170,B_171)) ),
    inference(resolution,[status(thm)],[c_413,c_16]) ).

tff(c_1077,plain,
    ! [X_172,B_173,Y_174] :
      ( theorem(implies(X_172,B_173))
      | ~ theorem(implies(Y_174,B_173))
      | ~ theorem(Y_174) ),
    inference(resolution,[status(thm)],[c_82,c_1045]) ).

tff(c_1109,plain,
    ! [X_175,B_176,Y_177] :
      ( theorem(implies(X_175,B_176))
      | ~ theorem(Y_177)
      | ~ axiom(implies(Y_177,B_176)) ),
    inference(resolution,[status(thm)],[c_14,c_1077]) ).

tff(c_1148,plain,
    ! [X_175,B_5,A_4] :
      ( theorem(implies(X_175,or(B_5,A_4)))
      | ~ theorem(or(A_4,B_5)) ),
    inference(resolution,[status(thm)],[c_6,c_1109]) ).

tff(c_418,plain,
    ! [X_95,B_96,Y_97] :
      ( ~ theorem(implies(X_95,or(B_96,Y_97)))
      | theorem(or(B_96,implies(X_95,Y_97))) ),
    inference(resolution,[status(thm)],[c_378,c_54]) ).

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

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

tff(c_1488,plain,
    ! [X_218,Y_219] :
      ( theorem(implies(X_218,Y_219))
      | ~ theorem(implies(X_218,or(implies(X_218,Y_219),Y_219))) ),
    inference(resolution,[status(thm)],[c_418,c_83]) ).

tff(c_1562,plain,
    ! [X_224,A_225] :
      ( theorem(implies(X_224,A_225))
      | ~ theorem(or(A_225,implies(X_224,A_225))) ),
    inference(resolution,[status(thm)],[c_1148,c_1488]) ).

tff(c_1722,plain,
    ! [X_232,Y_233] :
      ( theorem(implies(X_232,Y_233))
      | ~ theorem(implies(X_232,or(Y_233,Y_233))) ),
    inference(resolution,[status(thm)],[c_389,c_1562]) ).

tff(c_1985,plain,
    ! [X_249,Y_250] :
      ( theorem(implies(X_249,Y_250))
      | ~ axiom(implies(X_249,or(Y_250,Y_250))) ),
    inference(resolution,[status(thm)],[c_14,c_1722]) ).

tff(c_2020,plain,
    ! [A_251] : theorem(implies(A_251,A_251)),
    inference(resolution,[status(thm)],[c_4,c_1985]) ).

tff(c_43,plain,
    ! [A_25,B_26] : axiom(implies(or(A_25,B_26),or(B_26,A_25))),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_228,plain,
    ! [X_58,Y_59] : axiom(implies(implies(X_58,Y_59),or(Y_59,not(X_58)))),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_43]) ).

tff(c_267,plain,
    ! [X_65,Y_66] :
      ( ~ theorem(implies(X_65,Y_66))
      | theorem(or(Y_66,not(X_65))) ),
    inference(resolution,[status(thm)],[c_228,c_54]) ).

tff(c_280,plain,
    ! [X_65,X_12] :
      ( ~ theorem(implies(X_65,not(X_12)))
      | theorem(implies(X_12,not(X_65))) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_267]) ).

tff(c_2045,plain,
    ! [X_12] : theorem(implies(X_12,not(not(X_12)))),
    inference(resolution,[status(thm)],[c_2020,c_280]) ).

tff(c_6710,plain,
    ! [X_486,B_487,Y_488] :
      ( theorem(implies(X_486,B_487))
      | ~ theorem(implies(Y_488,B_487))
      | ~ axiom(implies(X_486,Y_488)) ),
    inference(resolution,[status(thm)],[c_14,c_1045]) ).

tff(c_14617,plain,
    ! [X_828,B_829,Y_830] :
      ( theorem(implies(X_828,B_829))
      | ~ axiom(implies(X_828,Y_830))
      | ~ axiom(implies(Y_830,B_829)) ),
    inference(resolution,[status(thm)],[c_14,c_6710]) ).

tff(c_19277,plain,
    ! [A_946,B_947,B_948] :
      ( theorem(implies(A_946,B_947))
      | ~ axiom(implies(or(B_948,A_946),B_947)) ),
    inference(resolution,[status(thm)],[c_4,c_14617]) ).

tff(c_19313,plain,
    ! [B_949,A_950] : theorem(implies(B_949,or(B_949,A_950))),
    inference(resolution,[status(thm)],[c_6,c_19277]) ).

tff(c_417,plain,
    ! [X_94,Y_92,B_93] :
      ( ~ theorem(implies(X_94,Y_92))
      | theorem(implies(X_94,B_93))
      | ~ theorem(implies(Y_92,B_93)) ),
    inference(resolution,[status(thm)],[c_413,c_16]) ).

tff(c_45598,plain,
    ! [B_1701,B_1702,A_1703] :
      ( theorem(implies(B_1701,B_1702))
      | ~ theorem(implies(or(B_1701,A_1703),B_1702)) ),
    inference(resolution,[status(thm)],[c_19313,c_417]) ).

tff(c_48388,plain,
    ! [B_1763,A_1764] : theorem(implies(B_1763,not(not(or(B_1763,A_1764))))),
    inference(resolution,[status(thm)],[c_2045,c_45598]) ).

tff(c_48586,plain,
    ! [B_1763,A_1764] : theorem(implies(not(or(B_1763,A_1764)),not(B_1763))),
    inference(resolution,[status(thm)],[c_48388,c_280]) ).

tff(c_18,plain,
    ~ theorem(implies(not(or(p,q)),not(p))),
    inference(cnfTransformation,[status(thm)],[f_77]) ).

tff(c_49634,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_48586,c_18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL199-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/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.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 13:23:41 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 22.08/11.46  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.08/11.47  
% 22.08/11.47  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 22.18/11.50  
% 22.18/11.50  Inference rules
% 22.18/11.50  ----------------------
% 22.18/11.50  #Ref     : 0
% 22.18/11.50  #Sup     : 11970
% 22.18/11.50  #Fact    : 0
% 22.18/11.50  #Define  : 0
% 22.18/11.50  #Split   : 3
% 22.18/11.50  #Chain   : 0
% 22.18/11.50  #Close   : 0
% 22.18/11.50  
% 22.18/11.50  Ordering : KBO
% 22.18/11.50  
% 22.18/11.50  Simplification rules
% 22.18/11.50  ----------------------
% 22.18/11.50  #Subsume      : 3508
% 22.18/11.50  #Demod        : 2497
% 22.18/11.50  #Tautology    : 2017
% 22.18/11.50  #SimpNegUnit  : 299
% 22.18/11.50  #BackRed      : 101
% 22.18/11.50  
% 22.18/11.50  #Partial instantiations: 0
% 22.18/11.50  #Strategies tried      : 1
% 22.18/11.50  
% 22.18/11.50  Timing (in seconds)
% 22.18/11.50  ----------------------
% 22.18/11.51  Preprocessing        : 0.42
% 22.18/11.51  Parsing              : 0.24
% 22.18/11.51  CNF conversion       : 0.02
% 22.18/11.51  Main loop            : 9.95
% 22.18/11.51  Inferencing          : 1.66
% 22.18/11.51  Reduction            : 3.15
% 22.18/11.51  Demodulation         : 2.29
% 22.18/11.51  BG Simplification    : 0.07
% 22.18/11.51  Subsumption          : 4.48
% 22.18/11.51  Abstraction          : 0.10
% 22.18/11.51  MUC search           : 0.00
% 22.18/11.51  Cooper               : 0.00
% 22.18/11.51  Total                : 10.44
% 22.18/11.51  Index Insertion      : 0.00
% 22.18/11.51  Index Deletion       : 0.00
% 22.18/11.51  Index Matching       : 0.00
% 22.18/11.51  BG Taut test         : 0.00
%------------------------------------------------------------------------------