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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL115-1 : TPTP v8.1.2. Released v1.0.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 : n017.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:25 EDT 2023

% Result   : Unsatisfiable 6.52s 2.60s
% Output   : CNFRefutation 6.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   46 (  22 unt;   5 typ;   0 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   54 (  29   ~;  25   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   3   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   78 (;  78   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(a,type,
    a: $i ).

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

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

tff(not,type,
    not: $i > $i ).

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

tff(f_34,axiom,
    ! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ! [X,Y] : is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
    file(unknown,unknown) ).

tff(f_36,axiom,
    ! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
    file(unknown,unknown) ).

tff(f_32,axiom,
    ! [X,Y] :
      ( ~ is_a_theorem(implies(X,Y))
      | ~ is_a_theorem(X)
      | is_a_theorem(Y) ),
    file(unknown,unknown) ).

tff(f_38,axiom,
    ! [X,Y] : is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))),
    file(unknown,unknown) ).

tff(f_42,axiom,
    ~ is_a_theorem(implies(not(implies(a,b)),not(b))),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [X_3,Y_4] : is_a_theorem(implies(X_3,implies(Y_4,X_3))),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_10,plain,
    ! [X_10,Y_11] : is_a_theorem(implies(implies(not(X_10),not(Y_11)),implies(Y_11,X_10))),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_51,plain,
    ! [X_24,Y_25,Z_26] : is_a_theorem(implies(implies(X_24,Y_25),implies(implies(Y_25,Z_26),implies(X_24,Z_26)))),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_2,plain,
    ! [Y_2,X_1] :
      ( is_a_theorem(Y_2)
      | ~ is_a_theorem(X_1)
      | ~ is_a_theorem(implies(X_1,Y_2)) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_64,plain,
    ! [Y_32,Z_33,X_34] :
      ( is_a_theorem(implies(implies(Y_32,Z_33),implies(X_34,Z_33)))
      | ~ is_a_theorem(implies(X_34,Y_32)) ),
    inference(resolution,[status(thm)],[c_51,c_2]) ).

tff(c_127,plain,
    ! [X_43,Z_44,Y_45] :
      ( is_a_theorem(implies(X_43,Z_44))
      | ~ is_a_theorem(implies(Y_45,Z_44))
      | ~ is_a_theorem(implies(X_43,Y_45)) ),
    inference(resolution,[status(thm)],[c_64,c_2]) ).

tff(c_715,plain,
    ! [X_95,Y_96,X_97] :
      ( is_a_theorem(implies(X_95,implies(Y_96,X_97)))
      | ~ is_a_theorem(implies(X_95,implies(not(X_97),not(Y_96)))) ),
    inference(resolution,[status(thm)],[c_10,c_127]) ).

tff(c_799,plain,
    ! [Y_99,X_100] : is_a_theorem(implies(not(Y_99),implies(Y_99,X_100))),
    inference(resolution,[status(thm)],[c_4,c_715]) ).

tff(c_152,plain,
    ! [X_43,Y_11,X_10] :
      ( is_a_theorem(implies(X_43,implies(Y_11,X_10)))
      | ~ is_a_theorem(implies(X_43,implies(not(X_10),not(Y_11)))) ),
    inference(resolution,[status(thm)],[c_10,c_127]) ).

tff(c_867,plain,
    ! [X_103,Y_104] : is_a_theorem(implies(not(not(X_103)),implies(Y_104,X_103))),
    inference(resolution,[status(thm)],[c_799,c_152]) ).

tff(c_14,plain,
    ! [Y_14,X_15] :
      ( is_a_theorem(Y_14)
      | ~ is_a_theorem(X_15)
      | ~ is_a_theorem(implies(X_15,Y_14)) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_18,plain,
    ! [Y_4,X_3] :
      ( is_a_theorem(implies(Y_4,X_3))
      | ~ is_a_theorem(X_3) ),
    inference(resolution,[status(thm)],[c_4,c_14]) ).

tff(c_59,plain,
    ! [X_30,Y_31] : is_a_theorem(implies(implies(implies(X_30,Y_31),Y_31),implies(implies(Y_31,X_30),X_30))),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_69,plain,
    ! [Y_35,X_36] :
      ( is_a_theorem(implies(implies(Y_35,X_36),X_36))
      | ~ is_a_theorem(implies(implies(X_36,Y_35),Y_35)) ),
    inference(resolution,[status(thm)],[c_59,c_2]) ).

tff(c_77,plain,
    ! [X_3,X_36] :
      ( is_a_theorem(implies(implies(X_3,X_36),X_36))
      | ~ is_a_theorem(X_3) ),
    inference(resolution,[status(thm)],[c_18,c_69]) ).

tff(c_147,plain,
    ! [X_43,X_36,X_3] :
      ( is_a_theorem(implies(X_43,X_36))
      | ~ is_a_theorem(implies(X_43,implies(X_3,X_36)))
      | ~ is_a_theorem(X_3) ),
    inference(resolution,[status(thm)],[c_77,c_127]) ).

tff(c_885,plain,
    ! [X_103,Y_104] :
      ( is_a_theorem(implies(not(not(X_103)),X_103))
      | ~ is_a_theorem(Y_104) ),
    inference(resolution,[status(thm)],[c_867,c_147]) ).

tff(c_890,plain,
    ! [Y_104] : ~ is_a_theorem(Y_104),
    inference(splitLeft,[status(thm)],[c_885]) ).

tff(c_816,plain,
    ! [X_10,Y_11] : is_a_theorem(implies(not(not(X_10)),implies(Y_11,X_10))),
    inference(resolution,[status(thm)],[c_799,c_152]) ).

tff(c_925,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_890,c_816]) ).

tff(c_1005,plain,
    ! [X_108] : is_a_theorem(implies(not(not(X_108)),X_108)),
    inference(splitRight,[status(thm)],[c_885]) ).

tff(c_28,plain,
    ! [X_18,Y_19] : is_a_theorem(implies(implies(not(X_18),not(Y_19)),implies(Y_19,X_18))),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_32,plain,
    ! [Y_19,X_18] :
      ( is_a_theorem(implies(Y_19,X_18))
      | ~ is_a_theorem(implies(not(X_18),not(Y_19))) ),
    inference(resolution,[status(thm)],[c_28,c_2]) ).

tff(c_1043,plain,
    ! [Y_110] : is_a_theorem(implies(Y_110,not(not(Y_110)))),
    inference(resolution,[status(thm)],[c_1005,c_32]) ).

tff(c_68,plain,
    ! [X_34,Z_33,Y_32] :
      ( is_a_theorem(implies(X_34,Z_33))
      | ~ is_a_theorem(implies(Y_32,Z_33))
      | ~ is_a_theorem(implies(X_34,Y_32)) ),
    inference(resolution,[status(thm)],[c_64,c_2]) ).

tff(c_1073,plain,
    ! [X_34,Y_110] :
      ( is_a_theorem(implies(X_34,not(not(Y_110))))
      | ~ is_a_theorem(implies(X_34,Y_110)) ),
    inference(resolution,[status(thm)],[c_1043,c_68]) ).

tff(c_8,plain,
    ! [X_8,Y_9] : is_a_theorem(implies(implies(implies(X_8,Y_9),Y_9),implies(implies(Y_9,X_8),X_8))),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_927,plain,
    ! [X_105,Y_106,X_107] :
      ( is_a_theorem(implies(X_105,implies(implies(Y_106,X_107),X_107)))
      | ~ is_a_theorem(implies(X_105,implies(implies(X_107,Y_106),Y_106))) ),
    inference(resolution,[status(thm)],[c_8,c_127]) ).

tff(c_1727,plain,
    ! [X_159,X_160] : is_a_theorem(implies(not(not(X_159)),implies(implies(X_159,X_160),X_160))),
    inference(resolution,[status(thm)],[c_816,c_927]) ).

tff(c_1916,plain,
    ! [X_170,X_171] :
      ( is_a_theorem(implies(not(not(X_170)),X_171))
      | ~ is_a_theorem(implies(X_170,X_171)) ),
    inference(resolution,[status(thm)],[c_1727,c_147]) ).

tff(c_4626,plain,
    ! [Y_279,X_280] :
      ( is_a_theorem(implies(Y_279,not(X_280)))
      | ~ is_a_theorem(implies(X_280,not(Y_279))) ),
    inference(resolution,[status(thm)],[c_1916,c_32]) ).

tff(c_5765,plain,
    ! [Y_305,X_306] :
      ( is_a_theorem(implies(not(Y_305),not(X_306)))
      | ~ is_a_theorem(implies(X_306,Y_305)) ),
    inference(resolution,[status(thm)],[c_1073,c_4626]) ).

tff(c_12,plain,
    ~ is_a_theorem(implies(not(implies(a,b)),not(b))),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_5813,plain,
    ~ is_a_theorem(implies(b,implies(a,b))),
    inference(resolution,[status(thm)],[c_5765,c_12]) ).

tff(c_5834,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_5813]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL115-1 : TPTP v8.1.2. Released v1.0.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 : n017.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 12:53:51 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 6.52/2.60  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.52/2.60  
% 6.52/2.60  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.79/2.64  
% 6.79/2.64  Inference rules
% 6.79/2.64  ----------------------
% 6.79/2.64  #Ref     : 0
% 6.79/2.64  #Sup     : 1371
% 6.79/2.64  #Fact    : 0
% 6.79/2.64  #Define  : 0
% 6.79/2.64  #Split   : 7
% 6.79/2.64  #Chain   : 0
% 6.79/2.64  #Close   : 0
% 6.79/2.64  
% 6.79/2.64  Ordering : KBO
% 6.79/2.64  
% 6.79/2.64  Simplification rules
% 6.79/2.64  ----------------------
% 6.79/2.64  #Subsume      : 545
% 6.79/2.64  #Demod        : 144
% 6.79/2.64  #Tautology    : 179
% 6.79/2.64  #SimpNegUnit  : 59
% 6.79/2.64  #BackRed      : 13
% 6.79/2.64  
% 6.79/2.64  #Partial instantiations: 0
% 6.79/2.64  #Strategies tried      : 1
% 6.79/2.64  
% 6.79/2.64  Timing (in seconds)
% 6.79/2.64  ----------------------
% 6.79/2.64  Preprocessing        : 0.40
% 6.79/2.64  Parsing              : 0.22
% 6.79/2.64  CNF conversion       : 0.02
% 6.79/2.64  Main loop            : 1.18
% 6.79/2.64  Inferencing          : 0.43
% 6.79/2.64  Reduction            : 0.30
% 6.79/2.64  Demodulation         : 0.20
% 6.79/2.64  BG Simplification    : 0.03
% 6.79/2.64  Subsumption          : 0.33
% 6.79/2.64  Abstraction          : 0.03
% 6.79/2.64  MUC search           : 0.00
% 6.79/2.64  Cooper               : 0.00
% 6.79/2.64  Total                : 1.63
% 6.79/2.64  Index Insertion      : 0.00
% 6.79/2.64  Index Deletion       : 0.00
% 6.79/2.64  Index Matching       : 0.00
% 6.79/2.64  BG Taut test         : 0.00
%------------------------------------------------------------------------------