%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL374-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:19:15 PM UTC 2026
% Result : Unsatisfiable 121.10s 18.38s
% Output : CNFRefutation 121.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 5
% Syntax : Number of clauses : 111 ( 46 unt; 0 nHn; 37 RR)
% Number of literals : 197 ( 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 : 288 ( 82 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/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/sandbox/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(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_26,c_0_35]) ).
cnf(c_0_73,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_74,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_75,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_76,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_28,c_0_72]) ).
cnf(c_0_77,plain,
( ~ is_a_theorem(implies(not(not(X1)),not(not(X2))))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_73,c_0_20]) ).
cnf(c_0_78,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(not(not(implies(X1,X2))),X2)) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,plain,
is_a_theorem(implies(X1,implies(implies(X2,not(X3)),implies(X3,implies(X2,X4))))),
inference(spm,[status(thm)],[c_0_38,c_0_76]) ).
cnf(c_0_80,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,not(not(X2))),X2)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_21,c_0_79]) ).
cnf(c_0_82,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(not(not(X1)),X1)) ),
inference(spm,[status(thm)],[c_0_74,c_0_80]) ).
cnf(c_0_83,plain,
is_a_theorem(implies(not(X1),implies(X1,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_74,c_0_81]) ).
cnf(c_0_84,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_85,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_86,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_15,c_0_84]) ).
cnf(c_0_87,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_85,c_0_14]) ).
cnf(c_0_88,plain,
is_a_theorem(implies(X1,not(not(implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_74,c_0_86]) ).
cnf(c_0_89,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_90,plain,
is_a_theorem(implies(not(implies(X1,X2)),X1)),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_91,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_92,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_93,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_89,c_0_90]) ).
cnf(c_0_94,plain,
is_a_theorem(implies(X1,implies(X2,not(not(X2))))),
inference(spm,[status(thm)],[c_0_91,c_0_84]) ).
cnf(c_0_95,negated_conjecture,
~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,u),u)))),
c_0_92 ).
cnf(c_0_96,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_93]) ).
cnf(c_0_97,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_98,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_99,plain,
is_a_theorem(implies(implies(not(not(X1)),X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_28,c_0_94]) ).
cnf(c_0_100,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_95,c_0_96]) ).
cnf(c_0_101,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_97]) ).
cnf(c_0_102,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_74,c_0_51]) ).
cnf(c_0_103,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_98,c_0_84]) ).
cnf(c_0_104,plain,
is_a_theorem(implies(X1,implies(not(X2),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_26,c_0_99]) ).
cnf(c_0_105,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_100,c_0_101]),c_0_102])]) ).
cnf(c_0_106,plain,
( ~ is_a_theorem(implies(not(X2),X1))
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_103]) ).
cnf(c_0_107,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X1,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_31,c_0_104]) ).
cnf(c_0_108,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_105,c_0_106]) ).
cnf(c_0_109,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_74,c_0_107]) ).
cnf(c_0_110,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_22]),c_0_109])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL374-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.46 % Computer : n009.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:13 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 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/benchmark/theBenchmark.p
% 121.10/18.38 % Version: 3.5.1
% 121.10/18.38 % Preprocessing class: FSSSSMSSSSSNFFN.
% 121.10/18.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 121.10/18.38 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 121.10/18.38 % Starting new_bool_3 with 300s (1) cores
% 121.10/18.38 % Starting new_bool_1 with 300s (1) cores
% 121.10/18.38 % Starting sh5l with 300s (1) cores
% 121.10/18.38 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 450070 completed with status 0
% 121.10/18.38 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 121.10/18.38 % Preprocessing class: FSSSSMSSSSSNFFN.
% 121.10/18.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 121.10/18.38 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 121.10/18.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 121.10/18.38 % No SInE strategy applied
% 121.10/18.38 % Search class: FHUNS-FFSF21-MFFFFFNN
% 121.10/18.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 121.10/18.38 % Starting SubtermCWHack with 136s (1) cores
% 121.10/18.38 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 121.10/18.38 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 121.10/18.38 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 121.10/18.38 % Starting new_bool_3 with 136s (1) cores
% 121.10/18.38 % H----_011_C07_F1_PI_SE_SP_S0V with pid 450078 completed with status 0
% 121.10/18.38 % Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 121.10/18.38 % Preprocessing class: FSSSSMSSSSSNFFN.
% 121.10/18.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 121.10/18.38 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 121.10/18.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 121.10/18.38 % No SInE strategy applied
% 121.10/18.38 % Search class: FHUNS-FFSF21-MFFFFFNN
% 121.10/18.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 121.10/18.38 % Starting SubtermCWHack with 136s (1) cores
% 121.10/18.38 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 121.10/18.38 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 121.10/18.38 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 121.10/18.38 % Preprocessing time : 0.001 s
% 121.10/18.38
% 121.10/18.38 % Proof found!
% 121.10/18.38 % SZS status Unsatisfiable
% 121.10/18.38 % SZS output start CNFRefutation
% See solution above
% 121.10/18.38 % Parsed axioms : 5
% 121.10/18.38 % Removed by relevancy pruning/SinE : 0
% 121.10/18.38 % Initial clauses : 5
% 121.10/18.38 % Removed in clause preprocessing : 0
% 121.10/18.38 % Initial clauses in saturation : 5
% 121.10/18.38 % Processed clauses : 142056
% 121.10/18.38 % ...of these trivial : 1585
% 121.10/18.38 % ...subsumed : 134648
% 121.10/18.38 % ...remaining for further processing : 5823
% 121.10/18.38 % Other redundant clauses eliminated : 0
% 121.10/18.38 % Clauses deleted for lack of memory : 0
% 121.10/18.38 % Backward-subsumed : 550
% 121.10/18.38 % Backward-rewritten : 57
% 121.10/18.38 % Generated clauses : 844611
% 121.10/18.38 % ...of the previous two non-redundant : 804146
% 121.10/18.38 % ...aggressively subsumed : 0
% 121.10/18.38 % Contextual simplify-reflections : 0
% 121.10/18.38 % Paramodulations : 844611
% 121.10/18.38 % Factorizations : 0
% 121.10/18.38 % NegExts : 0
% 121.10/18.38 % Equation resolutions : 0
% 121.10/18.38 % Disequality decompositions : 0
% 121.10/18.38 % Total rewrite steps : 47283
% 121.10/18.38 % ...of those cached : 42466
% 121.10/18.38 % Propositional unsat checks : 0
% 121.10/18.38 % Propositional check models : 0
% 121.10/18.38 % Propositional check unsatisfiable : 0
% 121.10/18.38 % Propositional clauses : 0
% 121.10/18.38 % Propositional clauses after purity: 0
% 121.10/18.38 % Propositional unsat core size : 0
% 121.10/18.38 % Propositional preprocessing time : 0.000
% 121.10/18.38 % Propositional encoding time : 0.000
% 121.10/18.38 % Propositional solver time : 0.000
% 121.10/18.38 % Success case prop preproc time : 0.000
% 121.10/18.38 % Success case prop encoding time : 0.000
% 121.10/18.38 % Success case prop solver time : 0.000
% 121.10/18.38 % Current number of processed clauses : 5216
% 121.10/18.38 % Positive orientable unit clauses : 811
% 121.10/18.38 % Positive unorientable unit clauses: 0
% 121.10/18.38 % Negative unit clauses : 1649
% 121.10/18.38 % Non-unit-clauses : 2756
% 121.10/18.38 % Current number of unprocessed clauses: 660644
% 121.10/18.38 % ...number of literals in the above : 2083666
% 121.10/18.38 % Current number of archived formulas : 0
% 121.10/18.38 % Current number of archived clauses : 607
% 121.10/18.38 % Clause-clause subsumption calls (NU) : 7402706
% 121.10/18.38 % Rec. Clause-clause subsumption calls : 4113025
% 121.10/18.38 % Non-unit clause-clause subsumptions : 74008
% 121.10/18.38 % Unit Clause-clause subsumption calls : 253978
% 121.10/18.38 % Rewrite failures with RHS unbound : 0
% 121.10/18.38 % BW rewrite match attempts : 349835
% 121.10/18.38 % BW rewrite match successes : 38
% 121.10/18.38 % Condensation attempts : 0
% 121.10/18.38 % Condensation successes : 0
% 121.10/18.38 % Termbank termtop insertions : 12468533
% 121.10/18.38 % Search garbage collected termcells : 8
% 121.10/18.38
% 121.10/18.38 % -------------------------------------------------
% 121.10/18.38 % User time : 16.515 s
% 121.10/18.38 % System time : 0.596 s
% 121.10/18.38 % Total time : 17.111 s
% 121.10/18.38 % Maximum resident set size: 3636 pages
% 121.10/18.38
% 121.10/18.38 % -------------------------------------------------
% 121.10/18.38 % User time : 83.126 s
% 121.10/18.38 % System time : 2.933 s
% 121.10/18.38 % Total time : 86.059 s
% 121.10/18.38 % Maximum resident set size: 4864 pages
% 121.10/18.38 % E exiting
%------------------------------------------------------------------------------