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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL199-1 : TPTP v8.1.2. Released v1.1.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 : n007.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 33.66s 23.83s
% Output   : CNFRefutation 33.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   53 (  19 unt;   6 typ;   0 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   74 (  38   ~;  36   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   4   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :  114 (; 114   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #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(f_53,axiom,
    ! [A] : axiom(or(not(or(A,A)),A)),
    file(unknown,unknown) ).

tff(f_55,axiom,
    ! [A,B] : axiom(or(not(A),or(B,A))),
    file(unknown,unknown) ).

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

tff(f_82,axiom,
    ! [X,Z,Y] :
      ( theorem(or(not(X),Z))
      | ~ axiom(or(not(X),Y))
      | ~ theorem(or(not(Y),Z)) ),
    file(unknown,unknown) ).

tff(f_57,axiom,
    ! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
    file(unknown,unknown) ).

tff(f_74,axiom,
    ! [X,Y] :
      ( theorem(X)
      | ~ axiom(or(not(Y),X))
      | ~ theorem(Y) ),
    file(unknown,unknown) ).

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

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

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

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

tff(c_12,plain,
    ! [X_12] :
      ( ~ axiom(X_12)
      | theorem(X_12) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_90,plain,
    ! [Y_37,Z_38,X_39] :
      ( ~ theorem(or(not(Y_37),Z_38))
      | ~ axiom(or(not(X_39),Y_37))
      | theorem(or(not(X_39),Z_38)) ),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_333,plain,
    ! [X_81,Y_82,Z_83] :
      ( ~ axiom(or(not(X_81),Y_82))
      | theorem(or(not(X_81),Z_83))
      | ~ axiom(or(not(Y_82),Z_83)) ),
    inference(resolution,[status(thm)],[c_12,c_90]) ).

tff(c_394,plain,
    ! [A_89,Z_90,B_91] :
      ( theorem(or(not(A_89),Z_90))
      | ~ axiom(or(not(or(B_91,A_89)),Z_90)) ),
    inference(resolution,[status(thm)],[c_4,c_333]) ).

tff(c_416,plain,
    ! [A_92] : theorem(or(not(A_92),A_92)),
    inference(resolution,[status(thm)],[c_2,c_394]) ).

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

tff(c_27,plain,
    ! [Y_24,X_25] :
      ( ~ theorem(Y_24)
      | ~ axiom(or(not(Y_24),X_25))
      | theorem(X_25) ),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_37,plain,
    ! [A_4,B_5] :
      ( ~ theorem(or(A_4,B_5))
      | theorem(or(B_5,A_4)) ),
    inference(resolution,[status(thm)],[c_6,c_27]) ).

tff(c_426,plain,
    ! [A_92] : theorem(or(A_92,not(A_92))),
    inference(resolution,[status(thm)],[c_416,c_37]) ).

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

tff(c_59,plain,
    ! [A_29,B_30,C_31] : axiom(or(not(or(A_29,or(B_30,C_31))),or(B_30,or(A_29,C_31)))),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_14,plain,
    ! [Y_14,X_13] :
      ( ~ theorem(Y_14)
      | ~ axiom(or(not(Y_14),X_13))
      | theorem(X_13) ),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_125,plain,
    ! [A_45,B_46,C_47] :
      ( ~ theorem(or(A_45,or(B_46,C_47)))
      | theorem(or(B_46,or(A_45,C_47))) ),
    inference(resolution,[status(thm)],[c_59,c_14]) ).

tff(c_171,plain,
    ! [B_54,B_55,C_56] :
      ( theorem(or(B_54,or(B_55,C_56)))
      | ~ theorem(or(B_54,C_56)) ),
    inference(resolution,[status(thm)],[c_39,c_125]) ).

tff(c_16,plain,
    ! [Y_17,Z_16,X_15] :
      ( ~ theorem(or(not(Y_17),Z_16))
      | ~ axiom(or(not(X_15),Y_17))
      | theorem(or(not(X_15),Z_16)) ),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_3697,plain,
    ! [X_491,Y_492,B_493,C_494] :
      ( ~ axiom(or(not(X_491),Y_492))
      | theorem(or(not(X_491),or(B_493,C_494)))
      | ~ theorem(or(not(Y_492),C_494)) ),
    inference(resolution,[status(thm)],[c_171,c_16]) ).

tff(c_11159,plain,
    ! [A_1216,B_1217,B_1218,C_1219] :
      ( theorem(or(not(or(A_1216,B_1217)),or(B_1218,C_1219)))
      | ~ theorem(or(not(or(B_1217,A_1216)),C_1219)) ),
    inference(resolution,[status(thm)],[c_6,c_3697]) ).

tff(c_3712,plain,
    ! [A_2,B_493,C_494,B_3] :
      ( theorem(or(not(A_2),or(B_493,C_494)))
      | ~ theorem(or(not(or(B_3,A_2)),C_494)) ),
    inference(resolution,[status(thm)],[c_4,c_3697]) ).

tff(c_46804,plain,
    ! [B_4115,C_4116,B_4113,A_4114,B_4112] :
      ( theorem(or(not(B_4115),or(B_4112,or(B_4113,C_4116))))
      | ~ theorem(or(not(or(B_4115,A_4114)),C_4116)) ),
    inference(resolution,[status(thm)],[c_11159,c_3712]) ).

tff(c_49111,plain,
    ! [B_4122,B_4123,B_4124,A_4125] : theorem(or(not(B_4122),or(B_4123,or(B_4124,not(not(or(B_4122,A_4125))))))),
    inference(resolution,[status(thm)],[c_426,c_46804]) ).

tff(c_63,plain,
    ! [A_29,B_30,C_31] :
      ( ~ theorem(or(A_29,or(B_30,C_31)))
      | theorem(or(B_30,or(A_29,C_31))) ),
    inference(resolution,[status(thm)],[c_59,c_14]) ).

tff(c_49241,plain,
    ! [B_4140,B_4141,B_4142,A_4143] : theorem(or(B_4140,or(not(B_4141),or(B_4142,not(not(or(B_4141,A_4143))))))),
    inference(resolution,[status(thm)],[c_49111,c_63]) ).

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

tff(c_49313,plain,
    ! [B_4144,B_4145,A_4146] : theorem(or(not(B_4144),or(B_4145,not(not(or(B_4144,A_4146)))))),
    inference(resolution,[status(thm)],[c_49241,c_38]) ).

tff(c_49340,plain,
    ! [B_4147,B_4148,A_4149] : theorem(or(B_4147,or(not(B_4148),not(not(or(B_4148,A_4149)))))),
    inference(resolution,[status(thm)],[c_49313,c_63]) ).

tff(c_185,plain,
    ! [B_55,C_56,B_54] :
      ( theorem(or(or(B_55,C_56),B_54))
      | ~ theorem(or(B_54,C_56)) ),
    inference(resolution,[status(thm)],[c_171,c_37]) ).

tff(c_232,plain,
    ! [B_62,C_63,B_64] :
      ( theorem(or(or(B_62,C_63),B_64))
      | ~ theorem(or(B_64,C_63)) ),
    inference(resolution,[status(thm)],[c_171,c_37]) ).

tff(c_8373,plain,
    ! [B_962,B_963,C_964,C_965] :
      ( theorem(or(B_962,or(or(B_963,C_964),C_965)))
      | ~ theorem(or(or(B_962,C_965),C_964)) ),
    inference(resolution,[status(thm)],[c_232,c_63]) ).

tff(c_30645,plain,
    ! [B_3138,C_3139,C_3140,B_3141] :
      ( theorem(or(or(or(B_3138,C_3139),C_3140),B_3141))
      | ~ theorem(or(or(B_3141,C_3140),C_3139)) ),
    inference(resolution,[status(thm)],[c_8373,c_37]) ).

tff(c_186,plain,
    ! [B_55,C_56] :
      ( theorem(or(B_55,C_56))
      | ~ theorem(or(or(B_55,C_56),C_56)) ),
    inference(resolution,[status(thm)],[c_171,c_38]) ).

tff(c_30684,plain,
    ! [B_3142,C_3143,B_3144] :
      ( theorem(or(or(B_3142,C_3143),B_3144))
      | ~ theorem(or(or(B_3144,B_3144),C_3143)) ),
    inference(resolution,[status(thm)],[c_30645,c_186]) ).

tff(c_33521,plain,
    ! [B_3201,B_3202,C_3203] :
      ( theorem(or(or(B_3201,B_3202),C_3203))
      | ~ theorem(or(B_3202,C_3203)) ),
    inference(resolution,[status(thm)],[c_185,c_30684]) ).

tff(c_33563,plain,
    ! [B_3201,B_3202] :
      ( theorem(or(B_3201,B_3202))
      | ~ theorem(or(B_3202,or(B_3201,B_3202))) ),
    inference(resolution,[status(thm)],[c_33521,c_38]) ).

tff(c_49479,plain,
    ! [B_4153,A_4154] : theorem(or(not(B_4153),not(not(or(B_4153,A_4154))))),
    inference(resolution,[status(thm)],[c_49340,c_33563]) ).

tff(c_49501,plain,
    ! [B_4153,A_4154] : theorem(or(not(not(or(B_4153,A_4154))),not(B_4153))),
    inference(resolution,[status(thm)],[c_49479,c_37]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : LCL199-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.15  % 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.15/0.36  % Computer : n007.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 13:22:53 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 33.66/23.83  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 33.66/23.84  
% 33.66/23.84  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 33.66/23.88  
% 33.66/23.88  Inference rules
% 33.66/23.88  ----------------------
% 33.66/23.88  #Ref     : 0
% 33.66/23.88  #Sup     : 10951
% 33.66/23.88  #Fact    : 0
% 33.66/23.88  #Define  : 0
% 33.66/23.88  #Split   : 0
% 33.66/23.88  #Chain   : 0
% 33.66/23.88  #Close   : 0
% 33.66/23.88  
% 33.66/23.88  Ordering : KBO
% 33.66/23.88  
% 33.66/23.88  Simplification rules
% 33.66/23.88  ----------------------
% 33.66/23.88  #Subsume      : 822
% 33.66/23.88  #Demod        : 4392
% 33.66/23.88  #Tautology    : 4397
% 33.66/23.88  #SimpNegUnit  : 0
% 33.66/23.88  #BackRed      : 1
% 33.66/23.88  
% 33.66/23.88  #Partial instantiations: 0
% 33.66/23.88  #Strategies tried      : 1
% 33.66/23.88  
% 33.66/23.88  Timing (in seconds)
% 33.66/23.88  ----------------------
% 33.66/23.88  Preprocessing        : 0.45
% 33.66/23.88  Parsing              : 0.25
% 33.66/23.88  CNF conversion       : 0.02
% 33.66/23.88  Main loop            : 22.34
% 33.66/23.88  Inferencing          : 3.47
% 33.66/23.88  Reduction            : 8.88
% 33.66/23.88  Demodulation         : 7.64
% 33.66/23.88  BG Simplification    : 0.07
% 33.66/23.88  Subsumption          : 8.98
% 33.66/23.88  Abstraction          : 0.12
% 33.66/23.88  MUC search           : 0.00
% 33.66/23.88  Cooper               : 0.00
% 33.66/23.88  Total                : 22.85
% 33.66/23.88  Index Insertion      : 0.00
% 33.66/23.88  Index Deletion       : 0.00
% 33.66/23.88  Index Matching       : 0.00
% 33.66/23.88  BG Taut test         : 0.00
%------------------------------------------------------------------------------