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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL087-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/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 : n025.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:20 EDT 2023

% Result   : Unsatisfiable 3.06s 1.77s
% Output   : CNFRefutation 3.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   41 (  27 unt;   4 typ;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  18   ~;  12   |;   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  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :  111 (; 111   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > 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(implies,type,
    implies: ( $i * $i ) > $i ).

tff(f_35,axiom,
    ! [P,R,S,Q,T] : is_a_theorem(implies(implies(implies(P,Q),implies(R,S)),implies(T,implies(implies(S,P),implies(R,P))))),
    file(unknown,unknown) ).

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

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

tff(c_4,plain,
    ! [S_5,T_7,P_3,R_4,Q_6] : is_a_theorem(implies(implies(implies(P_3,Q_6),implies(R_4,S_5)),implies(T_7,implies(implies(S_5,P_3),implies(R_4,P_3))))),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_8,plain,
    ! [P_14,Q_13,S_11,T_10,R_12] : is_a_theorem(implies(implies(implies(P_14,Q_13),implies(R_12,S_11)),implies(T_10,implies(implies(S_11,P_14),implies(R_12,P_14))))),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

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

tff(c_13,plain,
    ! [R_18,T_16,P_19,Q_15,S_17] :
      ( is_a_theorem(implies(T_16,implies(implies(S_17,P_19),implies(R_18,P_19))))
      | ~ is_a_theorem(implies(implies(P_19,Q_15),implies(R_18,S_17))) ),
    inference(resolution,[status(thm)],[c_8,c_2]) ).

tff(c_17,plain,
    ! [T_20,P_25,Q_24,S_21,T_22,R_23] : is_a_theorem(implies(T_22,implies(implies(implies(implies(S_21,P_25),implies(R_23,P_25)),implies(P_25,Q_24)),implies(T_20,implies(P_25,Q_24))))),
    inference(resolution,[status(thm)],[c_4,c_13]) ).

tff(c_25,plain,
    ! [T_20,P_25,Q_24,S_21,T_22,R_23] :
      ( is_a_theorem(implies(implies(implies(implies(S_21,P_25),implies(R_23,P_25)),implies(P_25,Q_24)),implies(T_20,implies(P_25,Q_24))))
      | ~ is_a_theorem(T_22) ),
    inference(resolution,[status(thm)],[c_17,c_2]) ).

tff(c_26,plain,
    ! [T_22] : ~ is_a_theorem(T_22),
    inference(splitLeft,[status(thm)],[c_25]) ).

tff(c_16,plain,
    ! [S_5,T_7,T_16,P_3,R_4,Q_6] : is_a_theorem(implies(T_16,implies(implies(implies(implies(S_5,P_3),implies(R_4,P_3)),implies(P_3,Q_6)),implies(T_7,implies(P_3,Q_6))))),
    inference(resolution,[status(thm)],[c_4,c_13]) ).

tff(c_31,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_26,c_16]) ).

tff(c_32,plain,
    ! [T_20,P_25,Q_24,S_21,R_23] : is_a_theorem(implies(implies(implies(implies(S_21,P_25),implies(R_23,P_25)),implies(P_25,Q_24)),implies(T_20,implies(P_25,Q_24)))),
    inference(splitRight,[status(thm)],[c_25]) ).

tff(c_33,plain,
    ! [R_26,T_28,P_29,S_27,Q_30] : is_a_theorem(implies(implies(implies(implies(S_27,P_29),implies(R_26,P_29)),implies(P_29,Q_30)),implies(T_28,implies(P_29,Q_30)))),
    inference(splitRight,[status(thm)],[c_25]) ).

tff(c_41,plain,
    ! [P_34,T_31,S_33,R_32,Q_35] :
      ( is_a_theorem(implies(T_31,implies(P_34,Q_35)))
      | ~ is_a_theorem(implies(implies(implies(S_33,P_34),implies(R_32,P_34)),implies(P_34,Q_35))) ),
    inference(resolution,[status(thm)],[c_33,c_2]) ).

tff(c_69,plain,
    ! [T_40,R_41,P_42] : is_a_theorem(implies(T_40,implies(implies(R_41,P_42),implies(P_42,implies(R_41,P_42))))),
    inference(resolution,[status(thm)],[c_32,c_41]) ).

tff(c_82,plain,
    ! [R_41,P_42,T_40] :
      ( is_a_theorem(implies(implies(R_41,P_42),implies(P_42,implies(R_41,P_42))))
      | ~ is_a_theorem(T_40) ),
    inference(resolution,[status(thm)],[c_69,c_2]) ).

tff(c_158,plain,
    ! [T_40] : ~ is_a_theorem(T_40),
    inference(splitLeft,[status(thm)],[c_82]) ).

tff(c_12,plain,
    ! [P_14,Q_13,S_11,T_10,R_12] :
      ( is_a_theorem(implies(T_10,implies(implies(S_11,P_14),implies(R_12,P_14))))
      | ~ is_a_theorem(implies(implies(P_14,Q_13),implies(R_12,S_11))) ),
    inference(resolution,[status(thm)],[c_8,c_2]) ).

tff(c_24,plain,
    ! [T_20,P_14,P_25,Q_24,S_21,T_10,R_23] : is_a_theorem(implies(T_10,implies(implies(implies(T_20,implies(P_25,Q_24)),P_14),implies(implies(implies(implies(S_21,P_25),implies(R_23,P_25)),implies(P_25,Q_24)),P_14)))),
    inference(resolution,[status(thm)],[c_17,c_12]) ).

tff(c_171,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_158,c_24]) ).

tff(c_203,plain,
    ! [R_65,P_66] : is_a_theorem(implies(implies(R_65,P_66),implies(P_66,implies(R_65,P_66)))),
    inference(splitRight,[status(thm)],[c_82]) ).

tff(c_241,plain,
    ! [T_69,R_70,P_71] : is_a_theorem(implies(T_69,implies(implies(implies(R_70,P_71),R_70),implies(P_71,R_70)))),
    inference(resolution,[status(thm)],[c_203,c_12]) ).

tff(c_262,plain,
    ! [R_70,P_71,T_69] :
      ( is_a_theorem(implies(implies(implies(R_70,P_71),R_70),implies(P_71,R_70)))
      | ~ is_a_theorem(T_69) ),
    inference(resolution,[status(thm)],[c_241,c_2]) ).

tff(c_345,plain,
    ! [T_69] : ~ is_a_theorem(T_69),
    inference(splitLeft,[status(thm)],[c_262]) ).

tff(c_39,plain,
    ! [R_26,T_28,P_29,S_27,Q_30,T_10] : is_a_theorem(implies(T_10,implies(implies(implies(P_29,Q_30),implies(implies(S_27,P_29),implies(R_26,P_29))),implies(T_28,implies(implies(S_27,P_29),implies(R_26,P_29)))))),
    inference(resolution,[status(thm)],[c_33,c_12]) ).

tff(c_365,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_345,c_39]) ).

tff(c_389,plain,
    ! [R_86,P_87] : is_a_theorem(implies(implies(implies(R_86,P_87),R_86),implies(P_87,R_86))),
    inference(splitRight,[status(thm)],[c_262]) ).

tff(c_40,plain,
    ! [R_26,T_28,P_29,S_27,Q_30] :
      ( is_a_theorem(implies(T_28,implies(P_29,Q_30)))
      | ~ is_a_theorem(implies(implies(implies(S_27,P_29),implies(R_26,P_29)),implies(P_29,Q_30))) ),
    inference(resolution,[status(thm)],[c_33,c_2]) ).

tff(c_413,plain,
    ! [T_88,P_89,R_90] : is_a_theorem(implies(T_88,implies(P_89,implies(R_90,P_89)))),
    inference(resolution,[status(thm)],[c_389,c_40]) ).

tff(c_434,plain,
    ! [P_89,R_90,T_88] :
      ( is_a_theorem(implies(P_89,implies(R_90,P_89)))
      | ~ is_a_theorem(T_88) ),
    inference(resolution,[status(thm)],[c_413,c_2]) ).

tff(c_435,plain,
    ! [T_88] : ~ is_a_theorem(T_88),
    inference(splitLeft,[status(thm)],[c_434]) ).

tff(c_407,plain,
    ! [T_28,P_87,R_26] : is_a_theorem(implies(T_28,implies(P_87,implies(R_26,P_87)))),
    inference(resolution,[status(thm)],[c_389,c_40]) ).

tff(c_454,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_435,c_407]) ).

tff(c_455,plain,
    ! [P_89,R_90] : is_a_theorem(implies(P_89,implies(R_90,P_89))),
    inference(splitRight,[status(thm)],[c_434]) ).

tff(c_6,plain,
    ~ is_a_theorem(implies(a,implies(b,a))),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_480,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_455,c_6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL087-1 : TPTP v8.1.2. Released v1.0.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.35  % Computer : n025.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 14:03:04 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 3.06/1.77  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.06/1.77  
% 3.06/1.77  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.06/1.81  
% 3.06/1.81  Inference rules
% 3.06/1.81  ----------------------
% 3.06/1.81  #Ref     : 0
% 3.06/1.81  #Sup     : 88
% 3.06/1.81  #Fact    : 0
% 3.06/1.81  #Define  : 0
% 3.06/1.81  #Split   : 7
% 3.06/1.81  #Chain   : 0
% 3.06/1.81  #Close   : 0
% 3.06/1.81  
% 3.06/1.81  Ordering : KBO
% 3.06/1.81  
% 3.06/1.81  Simplification rules
% 3.06/1.81  ----------------------
% 3.06/1.81  #Subsume      : 57
% 3.06/1.81  #Demod        : 19
% 3.06/1.81  #Tautology    : 19
% 3.06/1.81  #SimpNegUnit  : 98
% 3.06/1.81  #BackRed      : 55
% 3.06/1.81  
% 3.06/1.81  #Partial instantiations: 0
% 3.06/1.81  #Strategies tried      : 1
% 3.06/1.81  
% 3.06/1.81  Timing (in seconds)
% 3.06/1.81  ----------------------
% 3.06/1.82  Preprocessing        : 0.38
% 3.06/1.82  Parsing              : 0.21
% 3.06/1.82  CNF conversion       : 0.02
% 3.06/1.82  Main loop            : 0.37
% 3.06/1.82  Inferencing          : 0.14
% 3.06/1.82  Reduction            : 0.10
% 3.06/1.82  Demodulation         : 0.07
% 3.06/1.82  BG Simplification    : 0.01
% 3.06/1.82  Subsumption          : 0.09
% 3.06/1.82  Abstraction          : 0.02
% 3.06/1.82  MUC search           : 0.00
% 3.06/1.82  Cooper               : 0.00
% 3.06/1.82  Total                : 0.81
% 3.06/1.82  Index Insertion      : 0.00
% 3.06/1.82  Index Deletion       : 0.00
% 3.06/1.82  Index Matching       : 0.00
% 3.06/1.82  BG Taut test         : 0.00
%------------------------------------------------------------------------------