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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL204-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 : n012.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:39 EDT 2023

% Result   : Unsatisfiable 126.58s 113.42s
% Output   : CNFRefutation 126.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   52 (  18 unt;   6 typ;   0 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   76 (  39   ~;  37   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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_57,axiom,
    ! [A,B] : axiom(or(not(or(A,B)),or(B,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_59,axiom,
    ! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
    file(unknown,unknown) ).

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

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

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

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_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_106,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_565,plain,
    ! [X_102,Y_103,Z_104] :
      ( ~ axiom(or(not(X_102),Y_103))
      | theorem(or(not(X_102),Z_104))
      | ~ axiom(or(not(Y_103),Z_104)) ),
    inference(resolution,[status(thm)],[c_12,c_106]) ).

tff(c_601,plain,
    ! [A_107,Z_108,B_109] :
      ( theorem(or(not(A_107),Z_108))
      | ~ axiom(or(not(or(B_109,A_107)),Z_108)) ),
    inference(resolution,[status(thm)],[c_4,c_565]) ).

tff(c_624,plain,
    ! [B_110,A_111] : theorem(or(not(B_110),or(B_110,A_111))),
    inference(resolution,[status(thm)],[c_6,c_601]) ).

tff(c_97,plain,
    ! [A_34,B_35,C_36] : axiom(or(not(or(A_34,or(B_35,C_36))),or(B_35,or(A_34,C_36)))),
    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_101,plain,
    ! [A_34,B_35,C_36] :
      ( ~ theorem(or(A_34,or(B_35,C_36)))
      | theorem(or(B_35,or(A_34,C_36))) ),
    inference(resolution,[status(thm)],[c_97,c_14]) ).

tff(c_631,plain,
    ! [B_110,A_111] : theorem(or(B_110,or(not(B_110),A_111))),
    inference(resolution,[status(thm)],[c_624,c_101]) ).

tff(c_22,plain,
    ! [Y_22,X_23] :
      ( ~ theorem(Y_22)
      | ~ axiom(or(not(Y_22),X_23))
      | theorem(X_23) ),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

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

tff(c_140,plain,
    ! [A_42,B_43,C_44] :
      ( ~ theorem(or(A_42,or(B_43,C_44)))
      | theorem(or(B_43,or(A_42,C_44))) ),
    inference(resolution,[status(thm)],[c_97,c_14]) ).

tff(c_195,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_30,c_140]) ).

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_4687,plain,
    ! [X_611,Y_612,B_613,C_614] :
      ( ~ axiom(or(not(X_611),Y_612))
      | theorem(or(not(X_611),or(B_613,C_614)))
      | ~ theorem(or(not(Y_612),C_614)) ),
    inference(resolution,[status(thm)],[c_195,c_16]) ).

tff(c_13615,plain,
    ! [A_1500,B_1501,B_1502,C_1503] :
      ( theorem(or(not(or(A_1500,B_1501)),or(B_1502,C_1503)))
      | ~ theorem(or(not(or(B_1501,A_1500)),C_1503)) ),
    inference(resolution,[status(thm)],[c_6,c_4687]) ).

tff(c_148012,plain,
    ! [C_7709,A_7711,X_7712,B_7713,B_7710] :
      ( ~ axiom(or(not(X_7712),or(A_7711,B_7710)))
      | theorem(or(not(X_7712),or(B_7713,C_7709)))
      | ~ theorem(or(not(or(B_7710,A_7711)),C_7709)) ),
    inference(resolution,[status(thm)],[c_13615,c_16]) ).

tff(c_148226,plain,
    ! [A_7722,B_7723,C_7724,B_7725] :
      ( theorem(or(not(A_7722),or(B_7723,C_7724)))
      | ~ theorem(or(not(or(A_7722,B_7725)),C_7724)) ),
    inference(resolution,[status(thm)],[c_4,c_148012]) ).

tff(c_152164,plain,
    ! [A_7726,B_7727,B_7728,A_7729] : theorem(or(not(A_7726),or(B_7727,or(not(not(or(A_7726,B_7728))),A_7729)))),
    inference(resolution,[status(thm)],[c_631,c_148226]) ).

tff(c_152317,plain,
    ! [B_7740,A_7741,B_7742,A_7743] : theorem(or(B_7740,or(not(A_7741),or(not(not(or(A_7741,B_7742))),A_7743)))),
    inference(resolution,[status(thm)],[c_152164,c_101]) ).

tff(c_36,plain,
    ! [A_25,B_26] : axiom(or(not(or(A_25,B_26)),or(B_26,A_25))),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_40,plain,
    ! [A_25,B_26] :
      ( ~ theorem(or(A_25,B_26))
      | theorem(or(B_26,A_25)) ),
    inference(resolution,[status(thm)],[c_36,c_14]) ).

tff(c_213,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_195,c_40]) ).

tff(c_231,plain,
    ! [B_57,C_58,B_59] :
      ( theorem(or(or(B_57,C_58),B_59))
      | ~ theorem(or(B_59,C_58)) ),
    inference(resolution,[status(thm)],[c_195,c_40]) ).

tff(c_9002,plain,
    ! [B_1035,B_1036,C_1037,C_1038] :
      ( theorem(or(B_1035,or(or(B_1036,C_1037),C_1038)))
      | ~ theorem(or(or(B_1035,C_1038),C_1037)) ),
    inference(resolution,[status(thm)],[c_231,c_101]) ).

tff(c_34886,plain,
    ! [B_3537,C_3538,C_3539,B_3540] :
      ( theorem(or(or(or(B_3537,C_3538),C_3539),B_3540))
      | ~ theorem(or(or(B_3540,C_3539),C_3538)) ),
    inference(resolution,[status(thm)],[c_9002,c_40]) ).

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

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

tff(c_214,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_195,c_29]) ).

tff(c_34925,plain,
    ! [B_3541,C_3542,B_3543] :
      ( theorem(or(or(B_3541,C_3542),B_3543))
      | ~ theorem(or(or(B_3543,B_3543),C_3542)) ),
    inference(resolution,[status(thm)],[c_34886,c_214]) ).

tff(c_37474,plain,
    ! [B_3544,B_3545,C_3546] :
      ( theorem(or(or(B_3544,B_3545),C_3546))
      | ~ theorem(or(B_3545,C_3546)) ),
    inference(resolution,[status(thm)],[c_213,c_34925]) ).

tff(c_37516,plain,
    ! [B_3544,B_3545] :
      ( theorem(or(B_3544,B_3545))
      | ~ theorem(or(B_3545,or(B_3544,B_3545))) ),
    inference(resolution,[status(thm)],[c_37474,c_29]) ).

tff(c_152450,plain,
    ! [A_7744,B_7745,A_7746] : theorem(or(not(A_7744),or(not(not(or(A_7744,B_7745))),A_7746))),
    inference(resolution,[status(thm)],[c_152317,c_37516]) ).

tff(c_152517,plain,
    ! [A_7744,B_7745,A_7746] : theorem(or(not(not(or(A_7744,B_7745))),or(not(A_7744),A_7746))),
    inference(resolution,[status(thm)],[c_152450,c_101]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL204-1 : TPTP v8.1.2. Released v1.1.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.14/0.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 13:31:22 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 126.58/113.42  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 126.58/113.43  
% 126.58/113.43  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 126.58/113.46  
% 126.58/113.46  Inference rules
% 126.58/113.46  ----------------------
% 126.58/113.46  #Ref     : 0
% 126.58/113.46  #Sup     : 34287
% 126.58/113.46  #Fact    : 0
% 126.58/113.46  #Define  : 0
% 126.58/113.46  #Split   : 0
% 126.58/113.46  #Chain   : 0
% 126.58/113.46  #Close   : 0
% 126.58/113.46  
% 126.58/113.46  Ordering : KBO
% 126.58/113.46  
% 126.58/113.46  Simplification rules
% 126.58/113.46  ----------------------
% 126.58/113.46  #Subsume      : 1656
% 126.58/113.46  #Demod        : 11320
% 126.58/113.46  #Tautology    : 11330
% 126.58/113.46  #SimpNegUnit  : 0
% 126.58/113.46  #BackRed      : 1
% 126.58/113.46  
% 126.58/113.46  #Partial instantiations: 0
% 126.58/113.46  #Strategies tried      : 1
% 126.58/113.46  
% 126.58/113.46  Timing (in seconds)
% 126.58/113.46  ----------------------
% 126.58/113.47  Preprocessing        : 0.43
% 126.58/113.47  Parsing              : 0.23
% 126.58/113.47  CNF conversion       : 0.02
% 126.58/113.47  Main loop            : 111.96
% 126.58/113.47  Inferencing          : 9.06
% 126.58/113.47  Reduction            : 44.26
% 126.58/113.47  Demodulation         : 39.26
% 126.58/113.47  BG Simplification    : 0.16
% 126.58/113.47  Subsumption          : 54.08
% 126.58/113.47  Abstraction          : 0.31
% 126.58/113.47  MUC search           : 0.00
% 126.58/113.47  Cooper               : 0.00
% 126.58/113.47  Total                : 112.45
% 126.58/113.47  Index Insertion      : 0.00
% 126.58/113.47  Index Deletion       : 0.00
% 126.58/113.47  Index Matching       : 0.00
% 126.58/113.47  BG Taut test         : 0.00
%------------------------------------------------------------------------------