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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL201-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/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 : n015.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 118.63s 105.71s
% Output   : CNFRefutation 118.63s
% 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(p,q))),or(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_128,plain,
    ! [Y_42,Z_43,X_44] :
      ( ~ theorem(or(not(Y_42),Z_43))
      | ~ axiom(or(not(X_44),Y_42))
      | theorem(or(not(X_44),Z_43)) ),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_406,plain,
    ! [X_84,Y_85,Z_86] :
      ( ~ axiom(or(not(X_84),Y_85))
      | theorem(or(not(X_84),Z_86))
      | ~ axiom(or(not(Y_85),Z_86)) ),
    inference(resolution,[status(thm)],[c_12,c_128]) ).

tff(c_442,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_406]) ).

tff(c_475,plain,
    ! [B_93,A_94] : theorem(or(not(B_93),or(B_93,A_94))),
    inference(resolution,[status(thm)],[c_6,c_442]) ).

tff(c_93,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_97,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_93,c_14]) ).

tff(c_482,plain,
    ! [B_93,A_94] : theorem(or(B_93,or(not(B_93),A_94))),
    inference(resolution,[status(thm)],[c_475,c_97]) ).

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_145,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_93,c_14]) ).

tff(c_215,plain,
    ! [B_57,B_58,C_59] :
      ( theorem(or(B_57,or(B_58,C_59)))
      | ~ theorem(or(B_57,C_59)) ),
    inference(resolution,[status(thm)],[c_30,c_145]) ).

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_4078,plain,
    ! [X_539,Y_540,B_541,C_542] :
      ( ~ axiom(or(not(X_539),Y_540))
      | theorem(or(not(X_539),or(B_541,C_542)))
      | ~ theorem(or(not(Y_540),C_542)) ),
    inference(resolution,[status(thm)],[c_215,c_16]) ).

tff(c_12086,plain,
    ! [A_1306,B_1307,B_1308,C_1309] :
      ( theorem(or(not(or(A_1306,B_1307)),or(B_1308,C_1309)))
      | ~ theorem(or(not(or(B_1307,A_1306)),C_1309)) ),
    inference(resolution,[status(thm)],[c_6,c_4078]) ).

tff(c_140492,plain,
    ! [C_7559,X_7562,B_7561,A_7560,B_7558] :
      ( ~ axiom(or(not(X_7562),or(A_7560,B_7558)))
      | theorem(or(not(X_7562),or(B_7561,C_7559)))
      | ~ theorem(or(not(or(B_7558,A_7560)),C_7559)) ),
    inference(resolution,[status(thm)],[c_12086,c_16]) ).

tff(c_140721,plain,
    ! [A_7576,B_7577,C_7578,B_7579] :
      ( theorem(or(not(A_7576),or(B_7577,C_7578)))
      | ~ theorem(or(not(or(A_7576,B_7579)),C_7578)) ),
    inference(resolution,[status(thm)],[c_4,c_140492]) ).

tff(c_144628,plain,
    ! [A_7580,B_7581,B_7582,A_7583] : theorem(or(not(A_7580),or(B_7581,or(not(not(or(A_7580,B_7582))),A_7583)))),
    inference(resolution,[status(thm)],[c_482,c_140721]) ).

tff(c_144832,plain,
    ! [B_7598,A_7599,B_7600,A_7601] : theorem(or(B_7598,or(not(A_7599),or(not(not(or(A_7599,B_7600))),A_7601)))),
    inference(resolution,[status(thm)],[c_144628,c_97]) ).

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_233,plain,
    ! [B_58,C_59,B_57] :
      ( theorem(or(or(B_58,C_59),B_57))
      | ~ theorem(or(B_57,C_59)) ),
    inference(resolution,[status(thm)],[c_215,c_40]) ).

tff(c_301,plain,
    ! [B_65,C_66,B_67] :
      ( theorem(or(or(B_65,C_66),B_67))
      | ~ theorem(or(B_67,C_66)) ),
    inference(resolution,[status(thm)],[c_215,c_40]) ).

tff(c_7624,plain,
    ! [B_964,B_965,C_966,C_967] :
      ( theorem(or(B_964,or(or(B_965,C_966),C_967)))
      | ~ theorem(or(or(B_964,C_967),C_966)) ),
    inference(resolution,[status(thm)],[c_301,c_97]) ).

tff(c_33435,plain,
    ! [B_3402,C_3403,C_3404,B_3405] :
      ( theorem(or(or(or(B_3402,C_3403),C_3404),B_3405))
      | ~ theorem(or(or(B_3405,C_3404),C_3403)) ),
    inference(resolution,[status(thm)],[c_7624,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_234,plain,
    ! [B_58,C_59] :
      ( theorem(or(B_58,C_59))
      | ~ theorem(or(or(B_58,C_59),C_59)) ),
    inference(resolution,[status(thm)],[c_215,c_29]) ).

tff(c_33474,plain,
    ! [B_3406,C_3407,B_3408] :
      ( theorem(or(or(B_3406,C_3407),B_3408))
      | ~ theorem(or(or(B_3408,B_3408),C_3407)) ),
    inference(resolution,[status(thm)],[c_33435,c_234]) ).

tff(c_36529,plain,
    ! [B_3463,B_3464,C_3465] :
      ( theorem(or(or(B_3463,B_3464),C_3465))
      | ~ theorem(or(B_3464,C_3465)) ),
    inference(resolution,[status(thm)],[c_233,c_33474]) ).

tff(c_36571,plain,
    ! [B_3463,B_3464] :
      ( theorem(or(B_3463,B_3464))
      | ~ theorem(or(B_3464,or(B_3463,B_3464))) ),
    inference(resolution,[status(thm)],[c_36529,c_29]) ).

tff(c_145022,plain,
    ! [A_7606,B_7607,A_7608] : theorem(or(not(A_7606),or(not(not(or(A_7606,B_7607))),A_7608))),
    inference(resolution,[status(thm)],[c_144832,c_36571]) ).

tff(c_145089,plain,
    ! [A_7606,B_7607,A_7608] : theorem(or(not(not(or(A_7606,B_7607))),or(not(A_7606),A_7608))),
    inference(resolution,[status(thm)],[c_145022,c_97]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL201-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/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.14/0.36  % Computer : n015.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 14:06:44 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 118.63/105.71  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 118.63/105.71  
% 118.63/105.71  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 118.63/105.75  
% 118.63/105.75  Inference rules
% 118.63/105.75  ----------------------
% 118.63/105.75  #Ref     : 0
% 118.63/105.75  #Sup     : 32558
% 118.63/105.75  #Fact    : 0
% 118.63/105.75  #Define  : 0
% 118.63/105.75  #Split   : 0
% 118.63/105.75  #Chain   : 0
% 118.63/105.75  #Close   : 0
% 118.63/105.75  
% 118.63/105.75  Ordering : KBO
% 118.63/105.75  
% 118.63/105.75  Simplification rules
% 118.63/105.75  ----------------------
% 118.63/105.75  #Subsume      : 1620
% 118.63/105.75  #Demod        : 10787
% 118.63/105.75  #Tautology    : 10797
% 118.63/105.75  #SimpNegUnit  : 0
% 118.63/105.75  #BackRed      : 1
% 118.63/105.75  
% 118.63/105.75  #Partial instantiations: 0
% 118.63/105.75  #Strategies tried      : 1
% 118.63/105.75  
% 118.63/105.75  Timing (in seconds)
% 118.63/105.75  ----------------------
% 118.63/105.75  Preprocessing        : 0.42
% 118.63/105.75  Parsing              : 0.23
% 118.63/105.75  CNF conversion       : 0.02
% 118.63/105.75  Main loop            : 104.26
% 118.63/105.75  Inferencing          : 8.55
% 118.63/105.75  Reduction            : 41.38
% 118.63/105.75  Demodulation         : 36.48
% 118.63/105.75  BG Simplification    : 0.15
% 118.63/105.75  Subsumption          : 50.10
% 118.63/105.75  Abstraction          : 0.28
% 118.63/105.75  MUC search           : 0.00
% 118.63/105.75  Cooper               : 0.00
% 118.63/105.75  Total                : 104.74
% 118.63/105.75  Index Insertion      : 0.00
% 118.63/105.75  Index Deletion       : 0.00
% 118.63/105.75  Index Matching       : 0.00
% 118.63/105.75  BG Taut test         : 0.00
%------------------------------------------------------------------------------