↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL374-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:12:33 PM UTC 2026

% Result   : Unsatisfiable 183.17s 27.53s
% Output   : CNFRefutation 183.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   36
%            Number of leaves      :    5
% Syntax   : Number of clauses     :  107 (  42 unt;   0 nHn;  37 RR)
%            Number of literals    :  193 (   0 equ;  92 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :  274 (  74 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( ~ is_a_theorem(X1)
    | ~ is_a_theorem(implies(X1,X2))
    | is_a_theorem(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(cn_1,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).

cnf(cn_2,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).

cnf(cn_3,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).

cnf(prove_cn_31,negated_conjecture,
    ~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,u),u)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_31) ).

cnf(c_0_5,plain,
    ( ~ is_a_theorem(X1)
    | ~ is_a_theorem(implies(X1,X2))
    | is_a_theorem(X2) ),
    inference(fof_simplification,[status(thm)],[condensed_detachment]) ).

cnf(c_0_6,plain,
    ( ~ is_a_theorem(X1)
    | ~ is_a_theorem(implies(X1,X2))
    | is_a_theorem(X2) ),
    c_0_5 ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c_0_21,plain,
    ( ~ is_a_theorem(implies(not(X1),X1))
    | is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_10]) ).

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

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

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

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

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

cnf(c_0_27,plain,
    is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
    inference(spm,[status(thm)],[c_0_13,c_0_10]) ).

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

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

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

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

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

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

cnf(c_0_34,plain,
    is_a_theorem(implies(X1,implies(X2,X2))),
    inference(spm,[status(thm)],[c_0_26,c_0_10]) ).

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c_0_47,plain,
    is_a_theorem(implies(implies(X1,X2),implies(not(implies(X3,implies(X1,X2))),X4))),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

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

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

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

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

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

cnf(c_0_53,plain,
    is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X2)))),
    inference(spm,[status(thm)],[c_0_13,c_0_47]) ).

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

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

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

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

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

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

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

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

cnf(c_0_62,plain,
    ( ~ is_a_theorem(X5)
    | ~ is_a_theorem(implies(X1,implies(X5,X3)))
    | is_a_theorem(implies(not(implies(X1,implies(X2,X3))),X4)) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_63,plain,
    is_a_theorem(implies(X1,implies(X2,X1))),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

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

cnf(c_0_65,plain,
    is_a_theorem(implies(not(implies(X1,implies(X2,X1))),X3)),
    inference(spm,[status(thm)],[c_0_64,c_0_61]) ).

cnf(c_0_66,plain,
    is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
    inference(spm,[status(thm)],[c_0_15,c_0_65]) ).

cnf(c_0_67,plain,
    ( ~ is_a_theorem(X1)
    | is_a_theorem(implies(implies(X1,X2),X2)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_59]) ).

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

cnf(c_0_69,plain,
    is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
    inference(spm,[status(thm)],[c_0_28,c_0_66]) ).

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c_0_82,plain,
    is_a_theorem(implies(X1,not(not(X1)))),
    inference(spm,[status(thm)],[c_0_15,c_0_80]) ).

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

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

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

cnf(c_0_86,plain,
    is_a_theorem(implies(not(implies(X1,X2)),X1)),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

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

cnf(c_0_88,negated_conjecture,
    ~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,u),u)))),
    inference(fof_simplification,[status(thm)],[prove_cn_31]) ).

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

cnf(c_0_90,plain,
    is_a_theorem(implies(X1,implies(X2,not(not(X2))))),
    inference(spm,[status(thm)],[c_0_87,c_0_80]) ).

cnf(c_0_91,negated_conjecture,
    ~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,u),u)))),
    c_0_88 ).

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

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

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

cnf(c_0_95,plain,
    is_a_theorem(implies(implies(not(not(X1)),X2),implies(X1,X2))),
    inference(spm,[status(thm)],[c_0_28,c_0_90]) ).

cnf(c_0_96,negated_conjecture,
    ( ~ is_a_theorem(implies(not(implies(implies(implies(x,z),u),implies(implies(y,u),u))),x))
    | ~ is_a_theorem(implies(x,implies(y,implies(implies(implies(x,z),u),implies(implies(y,u),u))))) ),
    inference(spm,[status(thm)],[c_0_91,c_0_92]) ).

cnf(c_0_97,plain,
    ( ~ is_a_theorem(implies(X2,X4))
    | is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_93]) ).

cnf(c_0_98,plain,
    is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
    inference(spm,[status(thm)],[c_0_73,c_0_51]) ).

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

cnf(c_0_100,plain,
    is_a_theorem(implies(X1,implies(not(X2),implies(X2,X3)))),
    inference(spm,[status(thm)],[c_0_26,c_0_95]) ).

cnf(c_0_101,negated_conjecture,
    ~ is_a_theorem(implies(not(implies(implies(implies(x,z),u),implies(implies(y,u),u))),x)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98])]) ).

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

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

cnf(c_0_104,negated_conjecture,
    ~ is_a_theorem(implies(not(x),implies(implies(implies(x,z),u),implies(implies(y,u),u)))),
    inference(spm,[status(thm)],[c_0_101,c_0_102]) ).

cnf(c_0_105,plain,
    is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))),
    inference(spm,[status(thm)],[c_0_73,c_0_103]) ).

cnf(c_0_106,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_22]),c_0_105])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL374-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.46  % Computer : n011.cluster.edu
% 0.18/0.46  % Model    : x86_64 x86_64
% 0.18/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46  % Memory   : 8046.5625MB
% 0.18/0.46  % OS       : Linux 6.8.0-71-generic
% 0.18/0.46  % CPULimit : 300
% 0.18/0.46  % WCLimit  : 300
% 0.18/0.46  % DateTime : Mon Sep 21 00:25:11 UTC 2026
% 0.18/0.47  % CPUTime  : 
% 0.18/0.47  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55  Running first-order theorem proving
% 0.24/0.55  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 183.17/27.53  % Version: 3.5.1
% 183.17/27.53  % Preprocessing class: FSSSSMSSSSSNFFN.
% 183.17/27.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.17/27.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 183.17/27.53  % Starting new_bool_3 with 300s (1) cores
% 183.17/27.53  % Starting new_bool_1 with 300s (1) cores
% 183.17/27.53  % Starting sh5l with 300s (1) cores
% 183.17/27.53  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 567915 completed with status 0
% 183.17/27.53  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 183.17/27.53  % Preprocessing class: FSSSSMSSSSSNFFN.
% 183.17/27.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.17/27.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 183.17/27.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 183.17/27.53  % No SInE strategy applied
% 183.17/27.53  % Search class: FHUNS-FFSF21-MFFFFFNN
% 183.17/27.53  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 183.17/27.53  % Starting SubtermCWHack with 136s (1) cores
% 183.17/27.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 183.17/27.53  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 183.17/27.53  % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 183.17/27.53  % Starting new_bool_3 with 136s (1) cores
% 183.17/27.53  % H----_011_C07_F1_PI_SE_SP_S0V with pid 567925 completed with status 0
% 183.17/27.53  % Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 183.17/27.53  % Preprocessing class: FSSSSMSSSSSNFFN.
% 183.17/27.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 183.17/27.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 183.17/27.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 183.17/27.53  % No SInE strategy applied
% 183.17/27.53  % Search class: FHUNS-FFSF21-MFFFFFNN
% 183.17/27.53  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 183.17/27.53  % Starting SubtermCWHack with 136s (1) cores
% 183.17/27.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 183.17/27.53  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 183.17/27.53  % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 183.17/27.53  % Preprocessing time       : 0.002 s
% 183.17/27.53  
% 183.17/27.53  % Proof found!
% 183.17/27.53  % SZS status Unsatisfiable
% 183.17/27.53  % SZS output start CNFRefutation
% See solution above
% 183.17/27.53  % Parsed axioms                        : 5
% 183.17/27.53  % Removed by relevancy pruning/SinE    : 0
% 183.17/27.53  % Initial clauses                      : 5
% 183.17/27.53  % Removed in clause preprocessing      : 0
% 183.17/27.53  % Initial clauses in saturation        : 5
% 183.17/27.53  % Processed clauses                    : 142092
% 183.17/27.53  % ...of these trivial                  : 1573
% 183.17/27.53  % ...subsumed                          : 134695
% 183.17/27.53  % ...remaining for further processing  : 5824
% 183.17/27.53  % Other redundant clauses eliminated   : 0
% 183.17/27.53  % Clauses deleted for lack of memory   : 0
% 183.17/27.53  % Backward-subsumed                    : 550
% 183.17/27.53  % Backward-rewritten                   : 58
% 183.17/27.53  % Generated clauses                    : 843544
% 183.17/27.53  % ...of the previous two non-redundant : 803024
% 183.17/27.53  % ...aggressively subsumed             : 0
% 183.17/27.53  % Contextual simplify-reflections      : 0
% 183.17/27.53  % Paramodulations                      : 843544
% 183.17/27.53  % Factorizations                       : 0
% 183.17/27.53  % NegExts                              : 0
% 183.17/27.53  % Equation resolutions                 : 0
% 183.17/27.53  % Disequality decompositions           : 0
% 183.17/27.53  % Total rewrite steps                  : 47350
% 183.17/27.53  % ...of those cached                   : 42540
% 183.17/27.53  % Propositional unsat checks           : 0
% 183.17/27.53  %    Propositional check models        : 0
% 183.17/27.53  %    Propositional check unsatisfiable : 0
% 183.17/27.53  %    Propositional clauses             : 0
% 183.17/27.53  %    Propositional clauses after purity: 0
% 183.17/27.53  %    Propositional unsat core size     : 0
% 183.17/27.53  %    Propositional preprocessing time  : 0.000
% 183.17/27.53  %    Propositional encoding time       : 0.000
% 183.17/27.53  %    Propositional solver time         : 0.000
% 183.17/27.53  %    Success case prop preproc time    : 0.000
% 183.17/27.53  %    Success case prop encoding time   : 0.000
% 183.17/27.53  %    Success case prop solver time     : 0.000
% 183.17/27.53  % Current number of processed clauses  : 5216
% 183.17/27.53  %    Positive orientable unit clauses  : 812
% 183.17/27.53  %    Positive unorientable unit clauses: 0
% 183.17/27.53  %    Negative unit clauses             : 1649
% 183.17/27.53  %    Non-unit-clauses                  : 2755
% 183.17/27.53  % Current number of unprocessed clauses: 659450
% 183.17/27.53  % ...number of literals in the above   : 2078183
% 183.17/27.53  % Current number of archived formulas  : 0
% 183.17/27.53  % Current number of archived clauses   : 608
% 183.17/27.53  % Clause-clause subsumption calls (NU) : 7382955
% 183.17/27.53  % Rec. Clause-clause subsumption calls : 4106966
% 183.17/27.53  % Non-unit clause-clause subsumptions  : 74026
% 183.17/27.53  % Unit Clause-clause subsumption calls : 254575
% 183.17/27.53  % Rewrite failures with RHS unbound    : 0
% 183.17/27.53  % BW rewrite match attempts            : 350364
% 183.17/27.53  % BW rewrite match successes           : 39
% 183.17/27.53  % Condensation attempts                : 0
% 183.17/27.53  % Condensation successes               : 0
% 183.17/27.53  % Termbank termtop insertions          : 12452144
% 183.17/27.53  % Search garbage collected termcells   : 8
% 183.17/27.53  
% 183.17/27.53  % -------------------------------------------------
% 183.17/27.53  % User time                : 23.346 s
% 183.17/27.53  % System time              : 0.746 s
% 183.17/27.53  % Total time               : 24.092 s
% 183.17/27.53  % Maximum resident set size: 3380 pages
% 183.17/27.53  
% 183.17/27.53  % -------------------------------------------------
% 183.17/27.53  % User time                : 125.483 s
% 183.17/27.53  % System time              : 4.049 s
% 183.17/27.53  % Total time               : 129.532 s
% 183.17/27.53  % Maximum resident set size: 4864 pages
% 183.17/27.53  % E exiting
%------------------------------------------------------------------------------