TSTP Solution File: LCL051-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : LCL051-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n016.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:11:22 EDT 2023

% Result   : Unsatisfiable 19.38s 2.92s
% Output   : CNFRefutation 19.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   31
%            Number of leaves      :    5
% Syntax   : Number of clauses     :  110 (  43 unt;   0 nHn;  37 RR)
%            Number of literals    :  197 (   0 equ;  92 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  272 (  67 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox/tmp/tmp.60pKccAIvF/E---3.1_5198.p',condensed_detachment) ).

cnf(cn_1,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    file('/export/starexec/sandbox/tmp/tmp.60pKccAIvF/E---3.1_5198.p',cn_1) ).

cnf(cn_2,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    file('/export/starexec/sandbox/tmp/tmp.60pKccAIvF/E---3.1_5198.p',cn_2) ).

cnf(cn_3,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    file('/export/starexec/sandbox/tmp/tmp.60pKccAIvF/E---3.1_5198.p',cn_3) ).

cnf(prove_cn_22,negated_conjecture,
    ~ is_a_theorem(implies(implies(b,c),implies(implies(a,b),implies(a,c)))),
    file('/export/starexec/sandbox/tmp/tmp.60pKccAIvF/E---3.1_5198.p',prove_cn_22) ).

cnf(c_0_5,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_6,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    cn_1 ).

cnf(c_0_7,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X3,X2))
    | ~ is_a_theorem(implies(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_7]) ).

cnf(c_0_9,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    cn_2 ).

cnf(c_0_10,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X1,implies(X4,X3)))
    | ~ is_a_theorem(implies(X2,X4)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_7]) ).

cnf(c_0_11,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    cn_3 ).

cnf(c_0_12,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X2,not(X1))) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(not(X2),not(X1))) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,plain,
    ( is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_5,c_0_11]) ).

cnf(c_0_16,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_11]) ).

cnf(c_0_17,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,plain,
    ( is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(implies(X3,X1))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_5,c_0_16]) ).

cnf(c_0_19,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(implies(X1,X4))
    | ~ is_a_theorem(implies(X4,X2)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_16]) ).

cnf(c_0_20,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X2,X4))
    | ~ is_a_theorem(implies(X4,X3)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_17]) ).

cnf(c_0_21,plain,
    ( is_a_theorem(implies(not(implies(X1,X2)),X3))
    | ~ is_a_theorem(implies(X4,X2))
    | ~ is_a_theorem(implies(X1,X4)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_7]) ).

cnf(c_0_22,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(implies(implies(not(X1),X4),X2)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_11]) ).

cnf(c_0_23,plain,
    is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
    inference(spm,[status(thm)],[c_0_12,c_0_9]) ).

cnf(c_0_24,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X4,X3))
    | ~ is_a_theorem(X4) ),
    inference(spm,[status(thm)],[c_0_20,c_0_17]) ).

cnf(c_0_25,plain,
    ( is_a_theorem(implies(not(implies(X1,X2)),X3))
    | ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
    inference(spm,[status(thm)],[c_0_21,c_0_9]) ).

cnf(c_0_26,plain,
    is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(not(X1),X1)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_9]) ).

cnf(c_0_28,plain,
    ( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
    | ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
    inference(spm,[status(thm)],[c_0_8,c_0_6]) ).

cnf(c_0_29,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(not(X3),X3)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_9]) ).

cnf(c_0_30,plain,
    is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_31,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1))) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,plain,
    is_a_theorem(implies(X1,implies(X2,implies(implies(not(X3),X3),X3)))),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),implies(X3,X2))),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))
    | ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_6]) ).

cnf(c_0_35,plain,
    is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2)),
    inference(spm,[status(thm)],[c_0_12,c_0_33]) ).

cnf(c_0_36,plain,
    ( is_a_theorem(implies(implies(not(X1),X1),implies(not(X2),X3)))
    | ~ is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_9]) ).

cnf(c_0_37,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(not(implies(X1,X2)),X3))),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,plain,
    is_a_theorem(implies(X1,X1)),
    inference(spm,[status(thm)],[c_0_12,c_0_11]) ).

cnf(c_0_39,plain,
    ( is_a_theorem(implies(implies(not(X1),X1),X2))
    | ~ is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_36]) ).

cnf(c_0_40,plain,
    is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_12,c_0_37]) ).

cnf(c_0_41,plain,
    is_a_theorem(implies(not(implies(X1,X1)),X2)),
    inference(spm,[status(thm)],[c_0_25,c_0_11]) ).

cnf(c_0_42,plain,
    is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3))),
    inference(spm,[status(thm)],[c_0_22,c_0_38]) ).

cnf(c_0_43,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(not(X3),X3)))
    | ~ is_a_theorem(implies(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_39]) ).

cnf(c_0_44,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
    inference(spm,[status(thm)],[c_0_34,c_0_40]) ).

cnf(c_0_45,plain,
    is_a_theorem(implies(X1,implies(X2,implies(X3,X3)))),
    inference(spm,[status(thm)],[c_0_29,c_0_41]) ).

cnf(c_0_46,plain,
    is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3)),
    inference(spm,[status(thm)],[c_0_25,c_0_42]) ).

cnf(c_0_47,plain,
    ( is_a_theorem(implies(implies(not(X1),X2),X3))
    | ~ is_a_theorem(implies(implies(implies(X2,X1),X1),X3)) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_48,plain,
    is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
    inference(spm,[status(thm)],[c_0_31,c_0_45]) ).

cnf(c_0_49,plain,
    is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
    inference(spm,[status(thm)],[c_0_14,c_0_46]) ).

cnf(c_0_50,plain,
    is_a_theorem(implies(implies(not(X1),X1),implies(X2,X1))),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_51,plain,
    is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
    inference(spm,[status(thm)],[c_0_31,c_0_49]) ).

cnf(c_0_52,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(implies(not(X2),X1)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_7]) ).

cnf(c_0_53,plain,
    ( is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(implies(not(X1),X1)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_9]) ).

cnf(c_0_54,plain,
    is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3))),
    inference(spm,[status(thm)],[c_0_22,c_0_50]) ).

cnf(c_0_55,plain,
    is_a_theorem(implies(implies(implies(not(not(X1)),X2),X1),X1)),
    inference(spm,[status(thm)],[c_0_12,c_0_51]) ).

cnf(c_0_56,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(implies(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_52]) ).

cnf(c_0_57,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,not(X3)))
    | ~ is_a_theorem(implies(not(X3),X3)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_53]) ).

cnf(c_0_58,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
    inference(spm,[status(thm)],[c_0_43,c_0_54]) ).

cnf(c_0_59,plain,
    is_a_theorem(implies(implies(not(X1),not(not(X1))),X1)),
    inference(spm,[status(thm)],[c_0_47,c_0_55]) ).

cnf(c_0_60,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(not(X1)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_17]) ).

cnf(c_0_61,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(implies(not(X2),X3),X1))
    | ~ is_a_theorem(implies(not(X1),X2)) ),
    inference(spm,[status(thm)],[c_0_56,c_0_16]) ).

cnf(c_0_62,plain,
    ( is_a_theorem(implies(implies(not(not(X1)),not(X1)),X2))
    | ~ is_a_theorem(implies(not(X1),X1)) ),
    inference(spm,[status(thm)],[c_0_57,c_0_9]) ).

cnf(c_0_63,plain,
    ( is_a_theorem(implies(not(implies(X1,X2)),X3))
    | ~ is_a_theorem(implies(not(X2),not(X1))) ),
    inference(spm,[status(thm)],[c_0_25,c_0_13]) ).

cnf(c_0_64,plain,
    is_a_theorem(implies(not(not(X1)),X1)),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_65,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_24,c_0_38]) ).

cnf(c_0_66,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(not(not(X2))) ),
    inference(spm,[status(thm)],[c_0_14,c_0_60]) ).

cnf(c_0_67,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(not(X1),not(X2)))
    | ~ is_a_theorem(implies(not(X2),X2)) ),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_68,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(not(X3),not(X2))) ),
    inference(spm,[status(thm)],[c_0_14,c_0_63]) ).

cnf(c_0_69,plain,
    is_a_theorem(implies(X1,not(not(X1)))),
    inference(spm,[status(thm)],[c_0_14,c_0_64]) ).

cnf(c_0_70,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_31,c_0_65]) ).

cnf(c_0_71,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(not(not(implies(X3,X1)))) ),
    inference(spm,[status(thm)],[c_0_31,c_0_66]) ).

cnf(c_0_72,plain,
    ( is_a_theorem(not(not(X1)))
    | ~ is_a_theorem(implies(not(X1),X1)) ),
    inference(spm,[status(thm)],[c_0_67,c_0_64]) ).

cnf(c_0_73,plain,
    is_a_theorem(implies(X1,implies(not(not(X2)),X2))),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_74,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(not(X2),X2)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_53]) ).

cnf(c_0_75,plain,
    ( is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),X4))
    | ~ is_a_theorem(implies(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_6]) ).

cnf(c_0_76,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_70]) ).

cnf(c_0_77,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(not(not(implies(not(X2),X1)))) ),
    inference(spm,[status(thm)],[c_0_12,c_0_71]) ).

cnf(c_0_78,plain,
    is_a_theorem(not(not(implies(not(not(X1)),X1)))),
    inference(spm,[status(thm)],[c_0_72,c_0_73]) ).

cnf(c_0_79,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(not(X2),X2))
    | ~ is_a_theorem(implies(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_56,c_0_74]) ).

cnf(c_0_80,plain,
    ( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
    | ~ is_a_theorem(implies(X4,X2)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_75]) ).

cnf(c_0_81,plain,
    is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
    inference(spm,[status(thm)],[c_0_12,c_0_44]) ).

cnf(c_0_82,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(X3,X2)))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_8,c_0_76]) ).

cnf(c_0_83,plain,
    is_a_theorem(implies(implies(X1,not(X1)),not(X1))),
    inference(spm,[status(thm)],[c_0_77,c_0_78]) ).

cnf(c_0_84,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(implies(X2,implies(not(X2),X3)),X1)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_46]) ).

cnf(c_0_85,plain,
    ( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
    | ~ is_a_theorem(implies(X2,implies(X5,X4)))
    | ~ is_a_theorem(implies(X3,X5)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_80]) ).

cnf(c_0_86,plain,
    is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
    inference(spm,[status(thm)],[c_0_58,c_0_81]) ).

cnf(c_0_87,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(X3,X2)))
    | ~ is_a_theorem(implies(not(X2),X3)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_52]) ).

cnf(c_0_88,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
    | ~ is_a_theorem(implies(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_82,c_0_6]) ).

cnf(c_0_89,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_51]) ).

cnf(c_0_90,plain,
    ( is_a_theorem(implies(X1,not(X2)))
    | ~ is_a_theorem(implies(X1,implies(X2,not(X2)))) ),
    inference(spm,[status(thm)],[c_0_8,c_0_83]) ).

cnf(c_0_91,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(not(not(implies(X1,X2)))) ),
    inference(spm,[status(thm)],[c_0_84,c_0_71]) ).

cnf(c_0_92,plain,
    ( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
    | ~ is_a_theorem(implies(X3,implies(X2,X4))) ),
    inference(spm,[status(thm)],[c_0_85,c_0_86]) ).

cnf(c_0_93,negated_conjecture,
    ~ is_a_theorem(implies(implies(b,c),implies(implies(a,b),implies(a,c)))),
    prove_cn_22 ).

cnf(c_0_94,plain,
    ( is_a_theorem(implies(implies(X1,X2),X3))
    | ~ is_a_theorem(implies(not(X3),X1))
    | ~ is_a_theorem(implies(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_87,c_0_88]) ).

cnf(c_0_95,plain,
    is_a_theorem(implies(X1,implies(X2,X1))),
    inference(spm,[status(thm)],[c_0_89,c_0_50]) ).

cnf(c_0_96,plain,
    ( is_a_theorem(implies(X1,not(not(X2))))
    | ~ is_a_theorem(not(not(implies(X1,X2)))) ),
    inference(spm,[status(thm)],[c_0_90,c_0_91]) ).

cnf(c_0_97,plain,
    ( is_a_theorem(not(not(implies(X1,implies(X2,X3)))))
    | ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
    inference(spm,[status(thm)],[c_0_72,c_0_92]) ).

cnf(c_0_98,negated_conjecture,
    ( ~ is_a_theorem(implies(not(implies(implies(a,b),implies(a,c))),b))
    | ~ is_a_theorem(implies(c,implies(implies(a,b),implies(a,c)))) ),
    inference(spm,[status(thm)],[c_0_93,c_0_94]) ).

cnf(c_0_99,plain,
    is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
    inference(spm,[status(thm)],[c_0_58,c_0_95]) ).

cnf(c_0_100,plain,
    ( is_a_theorem(implies(X1,not(not(implies(X2,X3)))))
    | ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
    inference(spm,[status(thm)],[c_0_96,c_0_97]) ).

cnf(c_0_101,negated_conjecture,
    ~ is_a_theorem(implies(not(implies(implies(a,b),implies(a,c))),b)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99])]) ).

cnf(c_0_102,plain,
    ( is_a_theorem(implies(not(implies(X1,X2)),X3))
    | ~ is_a_theorem(implies(X1,implies(not(X3),X2))) ),
    inference(spm,[status(thm)],[c_0_14,c_0_100]) ).

cnf(c_0_103,plain,
    ( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
    | ~ is_a_theorem(implies(X2,implies(X5,X4)))
    | ~ is_a_theorem(implies(X1,implies(X3,X5))) ),
    inference(spm,[status(thm)],[c_0_10,c_0_28]) ).

cnf(c_0_104,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
    | ~ is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_87,c_0_6]) ).

cnf(c_0_105,plain,
    is_a_theorem(implies(X1,implies(X2,not(not(X2))))),
    inference(spm,[status(thm)],[c_0_68,c_0_64]) ).

cnf(c_0_106,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,b),implies(not(b),implies(a,c)))),
    inference(spm,[status(thm)],[c_0_101,c_0_102]) ).

cnf(c_0_107,plain,
    ( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
    | ~ is_a_theorem(implies(X1,implies(X3,not(X2)))) ),
    inference(spm,[status(thm)],[c_0_103,c_0_11]) ).

cnf(c_0_108,plain,
    is_a_theorem(implies(implies(X1,X2),implies(X1,not(not(X2))))),
    inference(spm,[status(thm)],[c_0_104,c_0_105]) ).

cnf(c_0_109,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : LCL051-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.14  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n016.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   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Oct  2 13:16:51 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.19/0.48  Running first-order theorem proving
% 0.19/0.48  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.60pKccAIvF/E---3.1_5198.p
% 19.38/2.92  # Version: 3.1pre001
% 19.38/2.92  # Preprocessing class: FSSSSMSSSSSNFFN.
% 19.38/2.92  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.38/2.92  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 19.38/2.92  # Starting new_bool_3 with 300s (1) cores
% 19.38/2.92  # Starting new_bool_1 with 300s (1) cores
% 19.38/2.92  # Starting sh5l with 300s (1) cores
% 19.38/2.92  # sh5l with pid 5345 completed with status 0
% 19.38/2.92  # Result found by sh5l
% 19.38/2.92  # Preprocessing class: FSSSSMSSSSSNFFN.
% 19.38/2.92  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.38/2.92  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 19.38/2.92  # Starting new_bool_3 with 300s (1) cores
% 19.38/2.92  # Starting new_bool_1 with 300s (1) cores
% 19.38/2.92  # Starting sh5l with 300s (1) cores
% 19.38/2.92  # SinE strategy is gf500_gu_R04_F100_L20000
% 19.38/2.92  # Search class: FHUNS-FFSF21-MFFFFFNN
% 19.38/2.92  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 19.38/2.92  # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 19.38/2.92  # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 5351 completed with status 0
% 19.38/2.92  # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 19.38/2.92  # Preprocessing class: FSSSSMSSSSSNFFN.
% 19.38/2.92  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.38/2.92  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 19.38/2.92  # Starting new_bool_3 with 300s (1) cores
% 19.38/2.92  # Starting new_bool_1 with 300s (1) cores
% 19.38/2.92  # Starting sh5l with 300s (1) cores
% 19.38/2.92  # SinE strategy is gf500_gu_R04_F100_L20000
% 19.38/2.92  # Search class: FHUNS-FFSF21-MFFFFFNN
% 19.38/2.92  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 19.38/2.92  # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 19.38/2.92  # Preprocessing time       : 0.001 s
% 19.38/2.92  # Presaturation interreduction done
% 19.38/2.92  
% 19.38/2.92  # Proof found!
% 19.38/2.92  # SZS status Unsatisfiable
% 19.38/2.92  # SZS output start CNFRefutation
% See solution above
% 19.38/2.92  # Parsed axioms                        : 5
% 19.38/2.92  # Removed by relevancy pruning/SinE    : 0
% 19.38/2.92  # Initial clauses                      : 5
% 19.38/2.92  # Removed in clause preprocessing      : 0
% 19.38/2.92  # Initial clauses in saturation        : 5
% 19.38/2.92  # Processed clauses                    : 39438
% 19.38/2.92  # ...of these trivial                  : 934
% 19.38/2.92  # ...subsumed                          : 35579
% 19.38/2.92  # ...remaining for further processing  : 2925
% 19.38/2.92  # Other redundant clauses eliminated   : 0
% 19.38/2.92  # Clauses deleted for lack of memory   : 0
% 19.38/2.92  # Backward-subsumed                    : 363
% 19.38/2.92  # Backward-rewritten                   : 45
% 19.38/2.92  # Generated clauses                    : 275025
% 19.38/2.92  # ...of the previous two non-redundant : 253579
% 19.38/2.92  # ...aggressively subsumed             : 0
% 19.38/2.92  # Contextual simplify-reflections      : 4
% 19.38/2.92  # Paramodulations                      : 275025
% 19.38/2.92  # Factorizations                       : 0
% 19.38/2.92  # NegExts                              : 0
% 19.38/2.92  # Equation resolutions                 : 0
% 19.38/2.92  # Total rewrite steps                  : 24426
% 19.38/2.92  # Propositional unsat checks           : 0
% 19.38/2.92  #    Propositional check models        : 0
% 19.38/2.92  #    Propositional check unsatisfiable : 0
% 19.38/2.92  #    Propositional clauses             : 0
% 19.38/2.92  #    Propositional clauses after purity: 0
% 19.38/2.92  #    Propositional unsat core size     : 0
% 19.38/2.92  #    Propositional preprocessing time  : 0.000
% 19.38/2.92  #    Propositional encoding time       : 0.000
% 19.38/2.92  #    Propositional solver time         : 0.000
% 19.38/2.92  #    Success case prop preproc time    : 0.000
% 19.38/2.92  #    Success case prop encoding time   : 0.000
% 19.38/2.92  #    Success case prop solver time     : 0.000
% 19.38/2.92  # Current number of processed clauses  : 2512
% 19.38/2.92  #    Positive orientable unit clauses  : 597
% 19.38/2.92  #    Positive unorientable unit clauses: 0
% 19.38/2.92  #    Negative unit clauses             : 202
% 19.38/2.92  #    Non-unit-clauses                  : 1713
% 19.38/2.92  # Current number of unprocessed clauses: 213915
% 19.38/2.92  # ...number of literals in the above   : 626531
% 19.38/2.92  # Current number of archived formulas  : 0
% 19.38/2.92  # Current number of archived clauses   : 413
% 19.38/2.92  # Clause-clause subsumption calls (NU) : 1984065
% 19.38/2.92  # Rec. Clause-clause subsumption calls : 1310654
% 19.38/2.92  # Non-unit clause-clause subsumptions  : 25518
% 19.38/2.92  # Unit Clause-clause subsumption calls : 33860
% 19.38/2.92  # Rewrite failures with RHS unbound    : 0
% 19.38/2.92  # BW rewrite match attempts            : 116019
% 19.38/2.92  # BW rewrite match successes           : 27
% 19.38/2.92  # Condensation attempts                : 0
% 19.38/2.92  # Condensation successes               : 0
% 19.38/2.92  # Termbank termtop insertions          : 4041120
% 19.38/2.92  
% 19.38/2.92  # -------------------------------------------------
% 19.38/2.92  # User time                : 2.293 s
% 19.38/2.92  # System time              : 0.094 s
% 19.38/2.92  # Total time               : 2.387 s
% 19.38/2.92  # Maximum resident set size: 1644 pages
% 19.38/2.92  
% 19.38/2.92  # -------------------------------------------------
% 19.38/2.92  # User time                : 2.295 s
% 19.38/2.92  # System time              : 0.095 s
% 19.38/2.92  # Total time               : 2.390 s
% 19.38/2.92  # Maximum resident set size: 1676 pages
% 19.38/2.92  % E---3.1 exiting
% 19.38/2.92  % E---3.1 exiting
%------------------------------------------------------------------------------