%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL225-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:10 PM UTC 2026
% Result : Unsatisfiable 24.06s 9.03s
% Output : CNFRefutation 24.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 51 ( 20 unt; 0 nHn; 23 RR)
% Number of literals : 88 ( 0 equ; 40 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 122 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(rule_3,axiom,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_9,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_10,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
c_0_9 ).
cnf(c_0_11,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_12,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_13,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_14,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,plain,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
inference(fof_simplification,[status(thm)],[rule_3]) ).
cnf(c_0_17,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_18,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
c_0_16 ).
cnf(c_0_20,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_21,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_22,plain,
( ~ theorem(or(X3,X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_24,plain,
( ~ theorem(or(not(or(X3,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_25,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_20 ).
cnf(c_0_26,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_21]) ).
cnf(c_0_27,plain,
( ~ theorem(or(or(X1,X4),X3))
| theorem(or(X1,or(or(X2,X3),X4))) ),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_28,plain,
( ~ theorem(or(not(or(X2,or(X1,X3))),X4))
| theorem(or(not(or(X1,or(X2,X3))),X4)) ),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_29,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_30,plain,
( ~ axiom(or(not(or(X3,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_32,plain,
( ~ theorem(or(or(X4,X3),X2))
| theorem(or(or(or(X1,X2),X3),X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_33,plain,
( ~ theorem(or(not(or(X1,X3)),X4))
| theorem(or(not(or(X1,or(X2,X3))),or(X2,X4))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( ~ theorem(or(not(or(X2,X1)),X3))
| theorem(or(not(or(X1,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_35,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_36,plain,
( ~ theorem(or(or(X3,X3),X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( ~ theorem(or(not(or(X4,X2)),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_33]) ).
cnf(c_0_38,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( ~ theorem(or(X2,X3))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_36,c_0_22]) ).
cnf(c_0_40,plain,
theorem(or(not(or(X1,X2)),or(X1,or(X2,X3)))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( ~ theorem(or(not(or(not(or(X4,X1)),or(X4,X2))),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_42,plain,
( ~ theorem(or(X2,or(X1,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_39]) ).
cnf(c_0_43,plain,
theorem(or(X1,or(not(or(X1,X2)),or(X2,X3)))),
inference(spm,[status(thm)],[c_0_14,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_45,plain,
( ~ theorem(or(not(or(X3,X2)),X4))
| theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),X4))) ),
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_46,plain,
theorem(or(not(or(or(X1,X2),X1)),or(X1,X2))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))),
c_0_44 ).
cnf(c_0_48,plain,
( ~ theorem(or(not(or(X4,or(X1,X3))),X5))
| theorem(or(not(or(X1,or(not(X2),X3))),or(not(or(X4,X2)),X5))) ),
inference(spm,[status(thm)],[c_0_28,c_0_45]) ).
cnf(c_0_49,plain,
theorem(or(not(or(X1,or(X1,X2))),or(X1,X2))),
inference(spm,[status(thm)],[c_0_34,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL225-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.45 % Computer : n020.cluster.edu
% 0.18/5.45 % Model : x86_64 x86_64
% 0.18/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.45 % Memory : 8046.5625MB
% 0.18/5.45 % OS : Linux 6.8.0-71-generic
% 0.18/5.45 % CPULimit : 300
% 0.18/5.45 % WCLimit : 300
% 0.18/5.45 % DateTime : Mon Sep 21 00:13:52 UTC 2026
% 0.18/5.46 % CPUTime :
% 0.18/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/5.52 Running first-order theorem proving
% 0.22/5.52 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
% 24.06/9.03 % Version: 3.5.1
% 24.06/9.03 % Preprocessing class: FSMSSMSSSSSNFFN.
% 24.06/9.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.06/9.03 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.06/9.03 % Starting new_bool_3 with 300s (1) cores
% 24.06/9.03 % Starting new_bool_1 with 300s (1) cores
% 24.06/9.03 % Starting sh5l with 300s (1) cores
% 24.06/9.03 % sh5l with pid 1577553 completed with status 0
% 24.06/9.03 % Result found by sh5l
% 24.06/9.03 % Preprocessing class: FSMSSMSSSSSNFFN.
% 24.06/9.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.06/9.03 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.06/9.03 % Starting new_bool_3 with 300s (1) cores
% 24.06/9.03 % Starting new_bool_1 with 300s (1) cores
% 24.06/9.03 % Starting sh5l with 300s (1) cores
% 24.06/9.03 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 24.06/9.03 % SinE strategy is gf500_gu_R04_F100_L20000
% 24.06/9.03 % Search class: FHUNM-FFSF21-MFFFFFNN
% 24.06/9.03 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 24.06/9.03 % Starting SubtermCWHack with 28s (1) cores
% 24.06/9.03 % SubtermCWHack with pid 1577560 completed with status 0
% 24.06/9.03 % Result found by SubtermCWHack
% 24.06/9.03 % Preprocessing class: FSMSSMSSSSSNFFN.
% 24.06/9.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.06/9.03 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.06/9.03 % Starting new_bool_3 with 300s (1) cores
% 24.06/9.03 % Starting new_bool_1 with 300s (1) cores
% 24.06/9.03 % Starting sh5l with 300s (1) cores
% 24.06/9.03 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 24.06/9.03 % SinE strategy is gf500_gu_R04_F100_L20000
% 24.06/9.03 % Search class: FHUNM-FFSF21-MFFFFFNN
% 24.06/9.03 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 24.06/9.03 % Starting SubtermCWHack with 28s (1) cores
% 24.06/9.03 % Preprocessing time : 0.002 s
% 24.06/9.03
% 24.06/9.03 % Proof found!
% 24.06/9.03 % SZS status Unsatisfiable
% 24.06/9.03 % SZS output start CNFRefutation
% See solution above
% 24.06/9.03 % Parsed axioms : 9
% 24.06/9.03 % Removed by relevancy pruning/SinE : 0
% 24.06/9.03 % Initial clauses : 9
% 24.06/9.03 % Removed in clause preprocessing : 0
% 24.06/9.03 % Initial clauses in saturation : 9
% 24.06/9.03 % Processed clauses : 11726
% 24.06/9.03 % ...of these trivial : 1217
% 24.06/9.03 % ...subsumed : 5428
% 24.06/9.03 % ...remaining for further processing : 5081
% 24.06/9.03 % Other redundant clauses eliminated : 0
% 24.06/9.03 % Clauses deleted for lack of memory : 0
% 24.06/9.03 % Backward-subsumed : 5
% 24.06/9.03 % Backward-rewritten : 6
% 24.06/9.03 % Generated clauses : 104041
% 24.06/9.03 % ...of the previous two non-redundant : 71443
% 24.06/9.03 % ...aggressively subsumed : 0
% 24.06/9.03 % Contextual simplify-reflections : 0
% 24.06/9.03 % Paramodulations : 104041
% 24.06/9.03 % Factorizations : 0
% 24.06/9.03 % NegExts : 0
% 24.06/9.03 % Equation resolutions : 0
% 24.06/9.03 % Disequality decompositions : 0
% 24.06/9.03 % Total rewrite steps : 33779
% 24.06/9.03 % ...of those cached : 23720
% 24.06/9.03 % Propositional unsat checks : 0
% 24.06/9.03 % Propositional check models : 0
% 24.06/9.03 % Propositional check unsatisfiable : 0
% 24.06/9.03 % Propositional clauses : 0
% 24.06/9.03 % Propositional clauses after purity: 0
% 24.06/9.03 % Propositional unsat core size : 0
% 24.06/9.03 % Propositional preprocessing time : 0.000
% 24.06/9.03 % Propositional encoding time : 0.000
% 24.06/9.03 % Propositional solver time : 0.000
% 24.06/9.03 % Success case prop preproc time : 0.000
% 24.06/9.03 % Success case prop encoding time : 0.000
% 24.06/9.03 % Success case prop solver time : 0.000
% 24.06/9.03 % Current number of processed clauses : 5070
% 24.06/9.03 % Positive orientable unit clauses : 3964
% 24.06/9.03 % Positive unorientable unit clauses: 0
% 24.06/9.03 % Negative unit clauses : 113
% 24.06/9.03 % Non-unit-clauses : 993
% 24.06/9.03 % Current number of unprocessed clauses: 59668
% 24.06/9.03 % ...number of literals in the above : 74300
% 24.06/9.03 % Current number of archived formulas : 0
% 24.06/9.03 % Current number of archived clauses : 11
% 24.06/9.03 % Clause-clause subsumption calls (NU) : 501052
% 24.06/9.03 % Rec. Clause-clause subsumption calls : 501052
% 24.06/9.03 % Non-unit clause-clause subsumptions : 5171
% 24.06/9.03 % Unit Clause-clause subsumption calls : 42280
% 24.06/9.03 % Rewrite failures with RHS unbound : 0
% 24.06/9.03 % BW rewrite match attempts : 2743516
% 24.06/9.03 % BW rewrite match successes : 6
% 24.06/9.03 % Condensation attempts : 0
% 24.06/9.03 % Condensation successes : 0
% 24.06/9.03 % Termbank termtop insertions : 1415276
% 24.06/9.03 % Search garbage collected termcells : 17
% 24.06/9.03
% 24.06/9.03 % -------------------------------------------------
% 24.06/9.03 % User time : 3.273 s
% 24.06/9.03 % System time : 0.135 s
% 24.06/9.03 % Total time : 3.408 s
% 24.06/9.03 % Maximum resident set size: 3644 pages
% 24.06/9.03
% 24.06/9.03 % -------------------------------------------------
% 24.06/9.03 % User time : 3.274 s
% 24.06/9.03 % System time : 0.143 s
% 24.06/9.03 % Total time : 3.417 s
% 24.06/9.03 % Maximum resident set size: 4608 pages
% 24.06/9.03 % E exiting
%------------------------------------------------------------------------------