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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL216-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 : n027.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:41 EDT 2023

% Result   : Unsatisfiable 30.15s 20.59s
% Output   : CNFRefutation 30.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   53 (  22 unt;   6 typ;   0 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   69 (  36   ~;  33   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    6 (   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   :  110 (; 110   !;   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_59,axiom,
    ! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
    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_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_61,axiom,
    ! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
    file(unknown,unknown) ).

tff(f_86,axiom,
    ~ theorem(or(not(or(p,q)),or(not(or(p,not(q))),p))),
    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_8,plain,
    ! [A_6,B_7,C_8] : axiom(or(not(or(A_6,or(B_7,C_8))),or(B_7,or(A_6,C_8)))),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

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

tff(c_161,plain,
    ! [Y_48,Z_49,X_50] :
      ( ~ theorem(or(not(Y_48),Z_49))
      | ~ axiom(or(not(X_50),Y_48))
      | theorem(or(not(X_50),Z_49)) ),
    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_161]) ).

tff(c_1134,plain,
    ! [A_196,B_197,C_198,Z_199] :
      ( theorem(or(not(or(A_196,or(B_197,C_198))),Z_199))
      | ~ axiom(or(not(or(B_197,or(A_196,C_198))),Z_199)) ),
    inference(resolution,[status(thm)],[c_8,c_565]) ).

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_7127,plain,
    ! [X_878,Z_879,C_877,B_876,A_875] :
      ( ~ axiom(or(not(X_878),or(A_875,or(B_876,C_877))))
      | theorem(or(not(X_878),Z_879))
      | ~ axiom(or(not(or(B_876,or(A_875,C_877))),Z_879)) ),
    inference(resolution,[status(thm)],[c_1134,c_16]) ).

tff(c_12925,plain,
    ! [B_1395,C_1396,Z_1397,B_1398] :
      ( theorem(or(not(or(B_1395,C_1396)),Z_1397))
      | ~ axiom(or(not(or(B_1395,or(B_1398,C_1396))),Z_1397)) ),
    inference(resolution,[status(thm)],[c_4,c_7127]) ).

tff(c_12953,plain,
    ! [A_1399,C_1400,B_1401] : theorem(or(not(or(A_1399,C_1400)),or(or(B_1401,C_1400),A_1399))),
    inference(resolution,[status(thm)],[c_6,c_12925]) ).

tff(c_110,plain,
    ! [A_36,B_37,C_38] : axiom(or(not(or(A_36,or(B_37,C_38))),or(B_37,or(A_36,C_38)))),
    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_114,plain,
    ! [A_36,B_37,C_38] :
      ( ~ theorem(or(A_36,or(B_37,C_38)))
      | theorem(or(B_37,or(A_36,C_38))) ),
    inference(resolution,[status(thm)],[c_110,c_14]) ).

tff(c_12967,plain,
    ! [B_1402,C_1403,A_1404] : theorem(or(or(B_1402,C_1403),or(not(or(A_1404,C_1403)),A_1404))),
    inference(resolution,[status(thm)],[c_12953,c_114]) ).

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_13015,plain,
    ! [A_1411,C_1412,B_1413] : theorem(or(or(not(or(A_1411,C_1412)),A_1411),or(B_1413,C_1412))),
    inference(resolution,[status(thm)],[c_12967,c_40]) ).

tff(c_13055,plain,
    ! [B_1414,A_1415,C_1416] : theorem(or(B_1414,or(or(not(or(A_1415,C_1416)),A_1415),C_1416))),
    inference(resolution,[status(thm)],[c_13015,c_114]) ).

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

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_29,plain,
    ! [A_1] :
      ( ~ theorem(or(A_1,A_1))
      | theorem(A_1) ),
    inference(resolution,[status(thm)],[c_2,c_22]) ).

tff(c_13106,plain,
    ! [A_1417,C_1418] : theorem(or(or(not(or(A_1417,C_1418)),A_1417),C_1418)),
    inference(resolution,[status(thm)],[c_13055,c_29]) ).

tff(c_13130,plain,
    ! [C_1418,A_1417] : theorem(or(C_1418,or(not(or(A_1417,C_1418)),A_1417))),
    inference(resolution,[status(thm)],[c_13106,c_40]) ).

tff(c_123,plain,
    ! [A_39,B_40,C_41] : axiom(or(not(or(not(A_39),B_40)),or(not(or(C_41,A_39)),or(C_41,B_40)))),
    inference(cnfTransformation,[status(thm)],[f_61]) ).

tff(c_447,plain,
    ! [A_87,B_88,C_89] :
      ( ~ theorem(or(not(A_87),B_88))
      | theorem(or(not(or(C_89,A_87)),or(C_89,B_88))) ),
    inference(resolution,[status(thm)],[c_123,c_14]) ).

tff(c_1018,plain,
    ! [C_174,A_175,B_176] :
      ( theorem(or(C_174,or(not(or(C_174,A_175)),B_176)))
      | ~ theorem(or(not(A_175),B_176)) ),
    inference(resolution,[status(thm)],[c_447,c_114]) ).

tff(c_1028,plain,
    ! [C_174,A_175,B_176] :
      ( theorem(or(or(not(or(C_174,A_175)),B_176),C_174))
      | ~ theorem(or(not(A_175),B_176)) ),
    inference(resolution,[status(thm)],[c_1018,c_40]) ).

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_128,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_110,c_14]) ).

tff(c_143,plain,
    ! [B_43,B_3,C_44] :
      ( theorem(or(B_43,or(B_3,C_44)))
      | ~ theorem(or(B_43,C_44)) ),
    inference(resolution,[status(thm)],[c_30,c_128]) ).

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_128]) ).

tff(c_244,plain,
    ! [B_60,C_61] :
      ( theorem(or(B_60,C_61))
      | ~ theorem(or(or(B_60,C_61),C_61)) ),
    inference(resolution,[status(thm)],[c_195,c_29]) ).

tff(c_7967,plain,
    ! [B_1012,B_1013,C_1014] :
      ( theorem(or(B_1012,or(B_1013,C_1014)))
      | ~ theorem(or(or(B_1012,or(B_1013,C_1014)),C_1014)) ),
    inference(resolution,[status(thm)],[c_143,c_244]) ).

tff(c_44195,plain,
    ! [C_3812,A_3813,B_3814] :
      ( theorem(or(not(or(C_3812,A_3813)),or(B_3814,C_3812)))
      | ~ theorem(or(not(A_3813),or(B_3814,C_3812))) ),
    inference(resolution,[status(thm)],[c_1028,c_7967]) ).

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

tff(c_44209,plain,
    ~ theorem(or(not(q),or(not(or(p,not(q))),p))),
    inference(resolution,[status(thm)],[c_44195,c_18]) ).

tff(c_44220,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_13130,c_44209]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : LCL216-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/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.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 14:44:08 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 30.15/20.59  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.15/20.60  
% 30.15/20.60  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 30.15/20.63  
% 30.15/20.63  Inference rules
% 30.15/20.63  ----------------------
% 30.15/20.63  #Ref     : 0
% 30.15/20.63  #Sup     : 9699
% 30.15/20.63  #Fact    : 0
% 30.15/20.63  #Define  : 0
% 30.15/20.63  #Split   : 0
% 30.15/20.63  #Chain   : 0
% 30.15/20.63  #Close   : 0
% 30.15/20.63  
% 30.15/20.63  Ordering : KBO
% 30.15/20.63  
% 30.15/20.63  Simplification rules
% 30.15/20.63  ----------------------
% 30.15/20.63  #Subsume      : 777
% 30.15/20.63  #Demod        : 4044
% 30.15/20.63  #Tautology    : 4049
% 30.15/20.63  #SimpNegUnit  : 0
% 30.15/20.63  #BackRed      : 0
% 30.15/20.63  
% 30.15/20.63  #Partial instantiations: 0
% 30.15/20.63  #Strategies tried      : 1
% 30.15/20.63  
% 30.15/20.63  Timing (in seconds)
% 30.15/20.63  ----------------------
% 30.15/20.64  Preprocessing        : 0.47
% 30.15/20.64  Parsing              : 0.26
% 30.15/20.64  CNF conversion       : 0.02
% 30.15/20.64  Main loop            : 19.02
% 30.15/20.64  Inferencing          : 3.23
% 30.15/20.64  Reduction            : 7.82
% 30.15/20.64  Demodulation         : 6.54
% 30.15/20.64  BG Simplification    : 0.07
% 30.15/20.64  Subsumption          : 7.12
% 30.15/20.64  Abstraction          : 0.11
% 30.15/20.64  MUC search           : 0.00
% 30.15/20.64  Cooper               : 0.00
% 30.15/20.64  Total                : 19.55
% 30.15/20.64  Index Insertion      : 0.00
% 30.15/20.64  Index Deletion       : 0.00
% 30.15/20.64  Index Matching       : 0.00
% 30.15/20.64  BG Taut test         : 0.00
%------------------------------------------------------------------------------