%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL346-3 : 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 : n008.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:28 PM UTC 2026
% Result : Unsatisfiable 260.73s 34.27s
% Output : CNFRefutation 260.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 11
% Syntax : Number of clauses : 126 ( 46 unt; 0 nHn; 60 RR)
% Number of literals : 234 ( 7 equ; 121 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 248 ( 32 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(implies(and(p,not(q)),r),implies(p,or(q,r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_11,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_18,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_19,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_20,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_22,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_23,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_24,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_26,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_27,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_28,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_29,plain,
( ~ theorem(X1)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_31,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_32,plain,
( ~ theorem(not(X3))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_33,plain,
( ~ axiom(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_34,plain,
( ~ theorem(or(X1,or(X2,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( ~ axiom(or(X1,X3))
| ~ theorem(not(X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_16]) ).
cnf(c_0_36,plain,
( ~ axiom(or(X1,not(X2)))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_37,plain,
( ~ axiom(or(X1,or(X2,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_16]) ).
cnf(c_0_38,plain,
( ~ theorem(not(or(X3,X1)))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_23]) ).
cnf(c_0_39,plain,
( ~ theorem(X1)
| theorem(not(or(not(X1),not(X1)))) ),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_40,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_41,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_37,c_0_23]) ).
cnf(c_0_42,plain,
( ~ axiom(or(X3,X1))
| ~ theorem(not(X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_43,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_44,plain,
( ~ theorem(X1)
| theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_40,c_0_13]) ).
cnf(c_0_46,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_47,plain,
( ~ theorem(not(not(or(X1,X1))))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
cnf(c_0_48,plain,
( ~ theorem(X1)
| theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_45]) ).
cnf(c_0_50,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_27,c_0_46]) ).
cnf(c_0_51,plain,
( ~ theorem(or(X1,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_49,c_0_16]) ).
cnf(c_0_53,plain,
( ~ theorem(X2)
| ~ theorem(or(not(X2),X1))
| theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_15,c_0_50]) ).
cnf(c_0_54,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_37,c_0_22]) ).
cnf(c_0_55,plain,
( ~ axiom(or(X1,or(or(X1,X2),X2)))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( ~ theorem(or(not(X2),X1))
| theorem(or(not(or(X1,X2)),X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_24]) ).
cnf(c_0_57,plain,
( ~ theorem(or(X1,X1))
| theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
theorem(or(or(not(X1),X1),X2)),
inference(spm,[status(thm)],[c_0_55,c_0_23]) ).
cnf(c_0_59,negated_conjecture,
~ theorem(equivalent(implies(and(p,not(q)),r),implies(p,or(q,r)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_60,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_61,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_62,plain,
( ~ theorem(or(X1,X2))
| ~ theorem(or(not(X2),X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_56]) ).
cnf(c_0_63,plain,
( ~ axiom(or(X1,or(not(X3),X2)))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_52]) ).
cnf(c_0_64,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_49,c_0_26]) ).
cnf(c_0_65,plain,
( ~ theorem(not(not(or(X2,X1))))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_66,plain,
theorem(not(not(or(not(X1),X1)))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_67,negated_conjecture,
~ theorem(equivalent(implies(and(p,not(q)),r),implies(p,or(q,r)))),
c_0_59 ).
cnf(c_0_68,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_13]),c_0_13]),c_0_61]) ).
cnf(c_0_69,plain,
( ~ theorem(X2)
| ~ theorem(or(X1,not(X2)))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_44]) ).
cnf(c_0_70,plain,
( ~ theorem(X2)
| theorem(or(not(or(X1,not(X2))),X1)) ),
inference(spm,[status(thm)],[c_0_63,c_0_22]) ).
cnf(c_0_71,plain,
( ~ axiom(or(X2,or(not(X4),X3)))
| ~ theorem(or(X1,X4))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_27,c_0_52]) ).
cnf(c_0_72,plain,
( ~ theorem(X3)
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_64]) ).
cnf(c_0_73,plain,
theorem(or(or(X1,not(X1)),X2)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,negated_conjecture,
~ theorem(not(or(not(or(not(or(not(not(or(not(p),not(not(q))))),r)),or(not(p),or(q,r)))),not(or(not(or(not(p),or(q,r))),or(not(not(or(not(p),not(not(q))))),r)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_13]),c_0_13]),c_0_61]),c_0_68]) ).
cnf(c_0_75,plain,
( ~ theorem(X2)
| ~ theorem(X1)
| theorem(not(or(not(X1),not(X2)))) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,plain,
( ~ theorem(or(X1,or(X4,X2)))
| theorem(or(X1,or(not(or(not(X2),X3)),or(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_71,c_0_21]) ).
cnf(c_0_77,plain,
( ~ theorem(not(X2))
| ~ theorem(or(X1,X2))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_29]) ).
cnf(c_0_78,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_72,c_0_16]) ).
cnf(c_0_79,plain,
( ~ theorem(or(not(not(X1)),X1))
| theorem(not(not(not(not(X1))))) ),
inference(spm,[status(thm)],[c_0_57,c_0_50]) ).
cnf(c_0_80,plain,
theorem(or(X1,or(X2,not(X2)))),
inference(spm,[status(thm)],[c_0_25,c_0_73]) ).
cnf(c_0_81,negated_conjecture,
( ~ theorem(or(not(or(not(p),or(q,r))),or(not(not(or(not(p),not(not(q))))),r)))
| ~ theorem(or(not(or(not(not(or(not(p),not(not(q))))),r)),or(not(p),or(q,r)))) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,plain,
( ~ theorem(or(X3,or(X4,X1)))
| theorem(or(not(or(not(X1),X2)),or(X3,or(X4,X2)))) ),
inference(spm,[status(thm)],[c_0_49,c_0_76]) ).
cnf(c_0_83,plain,
( ~ theorem(or(X2,X1))
| theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_50]) ).
cnf(c_0_84,plain,
( ~ axiom(or(X2,X1))
| ~ theorem(not(X2))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_33]) ).
cnf(c_0_85,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_53,c_0_16]) ).
cnf(c_0_86,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(or(X1,or(X1,X2)))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_56]) ).
cnf(c_0_87,plain,
( ~ theorem(or(X3,X2))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_78,c_0_22]) ).
cnf(c_0_88,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_25,c_0_58]) ).
cnf(c_0_89,plain,
( ~ theorem(not(not(X1)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_46]) ).
cnf(c_0_90,plain,
theorem(not(not(not(not(or(X1,not(X1))))))),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_91,negated_conjecture,
( ~ theorem(or(not(p),or(q,not(or(not(p),not(not(q)))))))
| ~ theorem(or(not(or(not(p),or(q,r))),or(not(not(or(not(p),not(not(q))))),r))) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_92,plain,
( ~ theorem(or(or(X1,X3),X2))
| theorem(or(X1,or(not(not(X2)),X3))) ),
inference(spm,[status(thm)],[c_0_49,c_0_83]) ).
cnf(c_0_93,plain,
( ~ theorem(not(not(or(X2,X1))))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_84,c_0_22]) ).
cnf(c_0_94,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(not(not(or(X1,or(X2,X3))))) ),
inference(spm,[status(thm)],[c_0_85,c_0_45]) ).
cnf(c_0_95,plain,
( ~ theorem(or(X2,X1))
| ~ theorem(or(not(X2),X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_96,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_49,c_0_88]) ).
cnf(c_0_97,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(X1,or(not(or(X1,X2)),X3))) ),
inference(spm,[status(thm)],[c_0_49,c_0_24]) ).
cnf(c_0_98,plain,
theorem(or(not(not(or(X1,not(X1)))),X2)),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_99,negated_conjecture,
( ~ theorem(or(not(p),or(q,not(or(not(p),not(not(q)))))))
| ~ theorem(or(or(not(or(not(p),or(q,r))),r),or(not(p),not(not(q))))) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_100,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_101,plain,
( ~ theorem(or(X2,or(X1,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_102,plain,
( ~ theorem(or(X1,X2))
| ~ theorem(or(not(X3),X4))
| theorem(or(X1,or(not(or(not(X2),X3)),X4))) ),
inference(spm,[status(thm)],[c_0_27,c_0_97]) ).
cnf(c_0_103,plain,
( ~ theorem(or(X1,not(or(X2,not(X2)))))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_98]) ).
cnf(c_0_104,plain,
( ~ theorem(or(not(X3),X2))
| theorem(or(or(X1,X2),not(or(X1,X3)))) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_105,negated_conjecture,
( ~ theorem(or(not(p),or(q,not(or(not(p),not(not(q)))))))
| ~ theorem(or(not(or(not(p),or(q,r))),or(or(not(p),not(not(q))),r))) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_106,plain,
( ~ theorem(or(X3,X1))
| ~ theorem(or(not(X2),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_107,plain,
( ~ theorem(or(X3,X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_25,c_0_64]) ).
cnf(c_0_108,plain,
( ~ theorem(or(not(not(X1)),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_109,negated_conjecture,
( ~ theorem(or(or(or(not(p),not(not(q))),r),p))
| ~ theorem(or(not(p),or(q,not(or(not(p),not(not(q)))))))
| ~ theorem(or(not(or(q,r)),or(or(not(p),not(not(q))),r))) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,plain,
( ~ theorem(or(or(X1,X4),X3))
| theorem(or(X1,or(or(X2,X3),X4))) ),
inference(spm,[status(thm)],[c_0_49,c_0_107]) ).
cnf(c_0_111,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_112,plain,
theorem(or(X1,not(not(not(X1))))),
inference(spm,[status(thm)],[c_0_108,c_0_46]) ).
cnf(c_0_113,negated_conjecture,
( ~ theorem(or(or(not(or(q,r)),r),not(not(q))))
| ~ theorem(or(or(or(not(p),not(not(q))),r),p))
| ~ theorem(or(not(p),or(q,not(or(not(p),not(not(q))))))) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_114,plain,
( ~ theorem(or(not(X3),X2))
| theorem(or(X1,or(X2,not(or(X1,X3))))) ),
inference(spm,[status(thm)],[c_0_111,c_0_97]) ).
cnf(c_0_115,plain,
theorem(or(not(not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_112]) ).
cnf(c_0_116,plain,
theorem(or(X1,or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_49,c_0_80]) ).
cnf(c_0_117,negated_conjecture,
( ~ theorem(or(or(not(or(q,r)),r),not(not(q))))
| ~ theorem(or(or(or(not(p),not(not(q))),r),p)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115])]) ).
cnf(c_0_118,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_111,c_0_116]) ).
cnf(c_0_119,negated_conjecture,
( ~ theorem(or(or(not(p),not(not(q))),or(p,r)))
| ~ theorem(or(or(not(or(q,r)),r),not(not(q)))) ),
inference(spm,[status(thm)],[c_0_117,c_0_100]) ).
cnf(c_0_120,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_111,c_0_64]) ).
cnf(c_0_121,plain,
theorem(or(or(not(X1),X2),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_118]) ).
cnf(c_0_122,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_49,c_0_41]) ).
cnf(c_0_123,negated_conjecture,
~ theorem(or(or(not(or(q,r)),r),not(not(q)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_121])]) ).
cnf(c_0_124,plain,
theorem(or(or(not(or(X1,X2)),X2),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_122]) ).
cnf(c_0_125,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_50]),c_0_124])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL346-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n008.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 00:23:38 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.51 Running first-order theorem proving
% 0.27/0.51 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
% 260.73/34.27 % Version: 3.5.1
% 260.73/34.27 % Preprocessing class: FSMSSMSSSSSNFFN.
% 260.73/34.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 260.73/34.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 260.73/34.27 % Starting new_bool_3 with 300s (1) cores
% 260.73/34.27 % Starting new_bool_1 with 300s (1) cores
% 260.73/34.27 % Starting sh5l with 300s (1) cores
% 260.73/34.27 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3956930 completed with status 0
% 260.73/34.27 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 260.73/34.27 % Preprocessing class: FSMSSMSSSSSNFFN.
% 260.73/34.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 260.73/34.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 260.73/34.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 260.73/34.27 % No SInE strategy applied
% 260.73/34.27 % Search class: FHUNM-FFSF21-DFFFFFNN
% 260.73/34.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 260.73/34.27 % Starting SubtermCWHack with 136s (1) cores
% 260.73/34.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 260.73/34.27 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 300s (1) cores
% 260.73/34.27 % Starting new_bool_3 with 296s (1) cores
% 260.73/34.27 % Starting new_bool_1 with 291s (1) cores
% 260.73/34.27 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3956936 completed with status 0
% 260.73/34.27 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 260.73/34.27 % Preprocessing class: FSMSSMSSSSSNFFN.
% 260.73/34.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 260.73/34.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 260.73/34.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 260.73/34.27 % No SInE strategy applied
% 260.73/34.27 % Search class: FHUNM-FFSF21-DFFFFFNN
% 260.73/34.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 260.73/34.27 % Starting SubtermCWHack with 136s (1) cores
% 260.73/34.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 260.73/34.27 % Preprocessing time : 0.002 s
% 260.73/34.27 % Presaturation interreduction done
% 260.73/34.27
% 260.73/34.27 % Proof found!
% 260.73/34.27 % SZS status Unsatisfiable
% 260.73/34.27 % SZS output start CNFRefutation
% See solution above
% 260.73/34.27 % Parsed axioms : 11
% 260.73/34.27 % Removed by relevancy pruning/SinE : 0
% 260.73/34.27 % Initial clauses : 11
% 260.73/34.27 % Removed in clause preprocessing : 3
% 260.73/34.27 % Initial clauses in saturation : 8
% 260.73/34.27 % Processed clauses : 75871
% 260.73/34.27 % ...of these trivial : 314
% 260.73/34.27 % ...subsumed : 66922
% 260.73/34.27 % ...remaining for further processing : 8635
% 260.73/34.27 % Other redundant clauses eliminated : 0
% 260.73/34.27 % Clauses deleted for lack of memory : 0
% 260.73/34.27 % Backward-subsumed : 2770
% 260.73/34.27 % Backward-rewritten : 24
% 260.73/34.27 % Generated clauses : 1020873
% 260.73/34.27 % ...of the previous two non-redundant : 1002455
% 260.73/34.27 % ...aggressively subsumed : 0
% 260.73/34.27 % Contextual simplify-reflections : 63
% 260.73/34.27 % Paramodulations : 1020873
% 260.73/34.27 % Factorizations : 0
% 260.73/34.27 % NegExts : 0
% 260.73/34.27 % Equation resolutions : 0
% 260.73/34.27 % Disequality decompositions : 0
% 260.73/34.27 % Total rewrite steps : 19879
% 260.73/34.27 % ...of those cached : 17793
% 260.73/34.27 % Propositional unsat checks : 1
% 260.73/34.27 % Propositional check models : 0
% 260.73/34.27 % Propositional check unsatisfiable : 0
% 260.73/34.27 % Propositional clauses : 0
% 260.73/34.27 % Propositional clauses after purity: 0
% 260.73/34.27 % Propositional unsat core size : 0
% 260.73/34.27 % Propositional preprocessing time : 0.000
% 260.73/34.27 % Propositional encoding time : 1.554
% 260.73/34.27 % Propositional solver time : 0.963
% 260.73/34.27 % Success case prop preproc time : 0.000
% 260.73/34.27 % Success case prop encoding time : 0.000
% 260.73/34.27 % Success case prop solver time : 0.000
% 260.73/34.27 % Current number of processed clauses : 5833
% 260.73/34.27 % Positive orientable unit clauses : 194
% 260.73/34.27 % Positive unorientable unit clauses: 0
% 260.73/34.27 % Negative unit clauses : 308
% 260.73/34.27 % Non-unit-clauses : 5331
% 260.73/34.27 % Current number of unprocessed clauses: 919541
% 260.73/34.27 % ...number of literals in the above : 2631257
% 260.73/34.27 % Current number of archived formulas : 0
% 260.73/34.27 % Current number of archived clauses : 2805
% 260.73/34.27 % Clause-clause subsumption calls (NU) : 6927829
% 260.73/34.27 % Rec. Clause-clause subsumption calls : 5894653
% 260.73/34.27 % Non-unit clause-clause subsumptions : 54405
% 260.73/34.27 % Unit Clause-clause subsumption calls : 67805
% 260.73/34.27 % Rewrite failures with RHS unbound : 0
% 260.73/34.27 % BW rewrite match attempts : 23780
% 260.73/34.27 % BW rewrite match successes : 24
% 260.73/34.27 % Condensation attempts : 0
% 260.73/34.27 % Condensation successes : 0
% 260.73/34.27 % Termbank termtop insertions : 25383408
% 260.73/34.27 % Search garbage collected termcells : 11
% 260.73/34.27
% 260.73/34.27 % -------------------------------------------------
% 260.73/34.27 % User time : 30.104 s
% 260.73/34.27 % System time : 0.899 s
% 260.73/34.27 % Total time : 31.004 s
% 260.73/34.27 % Maximum resident set size: 3388 pages
% 260.73/34.27
% 260.73/34.27 % -------------------------------------------------
% 260.73/34.27 % User time : 159.417 s
% 260.73/34.27 % System time : 5.615 s
% 260.73/34.27 % Total time : 165.032 s
% 260.73/34.27 % Maximum resident set size: 4608 pages
% 260.73/34.27 % E exiting
%------------------------------------------------------------------------------