%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL249-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:16 PM UTC 2026
% Result : Unsatisfiable 18.90s 3.14s
% Output : CNFRefutation 18.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 47 ( 17 unt; 0 nHn; 23 RR)
% Number of literals : 86 ( 0 equ; 42 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 109 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(rule_3,axiom,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r))),
file('/export/starexec/sandbox/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,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_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_16,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_17,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_18,plain,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
c_0_13 ).
cnf(c_0_19,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_21,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ axiom(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_24,plain,
( ~ theorem(or(X3,X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ axiom(or(not(or(X3,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_26,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
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_16,c_0_24]) ).
cnf(c_0_28,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_29,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_30,plain,
( ~ theorem(or(or(or(or(X1,X2),X3),X3),X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_28]) ).
cnf(c_0_32,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_16,c_0_29]) ).
cnf(c_0_33,plain,
( ~ theorem(or(X2,X3))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_34,plain,
( ~ axiom(or(not(X1),or(X2,X4)))
| ~ theorem(or(not(X4),X3))
| theorem(or(not(X1),or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_35,plain,
( ~ axiom(or(not(X1),X2))
| theorem(or(not(X1),or(not(not(X2)),X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_36,plain,
( ~ theorem(or(X2,or(X1,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_37,plain,
( ~ theorem(or(not(X1),X3))
| theorem(or(not(or(X1,X2)),or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_34,c_0_15]) ).
cnf(c_0_38,plain,
( ~ axiom(or(not(X4),X2))
| ~ axiom(or(not(X1),X4))
| theorem(or(not(X1),or(not(not(X2)),X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ theorem(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_40,plain,
( ~ theorem(or(X3,or(X1,or(X2,X3))))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_41,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(X1,or(not(or(X2,X1)),X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_37]) ).
cnf(c_0_42,plain,
( ~ axiom(or(not(or(X4,X1)),X2))
| theorem(or(not(X1),or(not(not(X2)),X3))) ),
inference(spm,[status(thm)],[c_0_38,c_0_12]) ).
cnf(c_0_43,negated_conjecture,
~ theorem(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r))),
c_0_39 ).
cnf(c_0_44,plain,
( ~ theorem(or(not(X1),or(X3,X2)))
| theorem(or(not(or(X1,X2)),or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
theorem(or(not(X1),or(not(not(or(X1,X2))),X3))),
inference(spm,[status(thm)],[c_0_42,c_0_15]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL249-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 00:15:36 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.32 Running first-order theorem proving
% 0.07/0.32 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
% 18.90/3.14 % Version: 3.5.1
% 18.90/3.14 % Preprocessing class: FSMSSMSSSSSNFFN.
% 18.90/3.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.90/3.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.90/3.14 % Starting new_bool_3 with 300s (1) cores
% 18.90/3.14 % Starting new_bool_1 with 300s (1) cores
% 18.90/3.14 % Starting sh5l with 300s (1) cores
% 18.90/3.14 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1209931 completed with status 0
% 18.90/3.14 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 18.90/3.14 % Preprocessing class: FSMSSMSSSSSNFFN.
% 18.90/3.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.90/3.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.90/3.14 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.90/3.14 % No SInE strategy applied
% 18.90/3.14 % Search class: FHUNM-FFSF21-DFFFFFNN
% 18.90/3.14 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 18.90/3.14 % Starting SubtermCWHack with 136s (1) cores
% 18.90/3.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.90/3.14 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 300s (1) cores
% 18.90/3.14 % Starting new_bool_3 with 296s (1) cores
% 18.90/3.14 % Starting new_bool_1 with 291s (1) cores
% 18.90/3.14 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1209936 completed with status 0
% 18.90/3.14 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 18.90/3.14 % Preprocessing class: FSMSSMSSSSSNFFN.
% 18.90/3.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.90/3.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.90/3.14 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.90/3.14 % No SInE strategy applied
% 18.90/3.14 % Search class: FHUNM-FFSF21-DFFFFFNN
% 18.90/3.14 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 18.90/3.14 % Starting SubtermCWHack with 136s (1) cores
% 18.90/3.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.90/3.14 % Preprocessing time : 0.001 s
% 18.90/3.14 % Presaturation interreduction done
% 18.90/3.14
% 18.90/3.14 % Proof found!
% 18.90/3.14 % SZS status Unsatisfiable
% 18.90/3.14 % SZS output start CNFRefutation
% See solution above
% 18.90/3.14 % Parsed axioms : 9
% 18.90/3.14 % Removed by relevancy pruning/SinE : 0
% 18.90/3.14 % Initial clauses : 9
% 18.90/3.14 % Removed in clause preprocessing : 0
% 18.90/3.14 % Initial clauses in saturation : 9
% 18.90/3.14 % Processed clauses : 14687
% 18.90/3.14 % ...of these trivial : 1677
% 18.90/3.14 % ...subsumed : 9360
% 18.90/3.14 % ...remaining for further processing : 3650
% 18.90/3.14 % Other redundant clauses eliminated : 0
% 18.90/3.14 % Clauses deleted for lack of memory : 0
% 18.90/3.14 % Backward-subsumed : 7
% 18.90/3.14 % Backward-rewritten : 5
% 18.90/3.14 % Generated clauses : 144144
% 18.90/3.14 % ...of the previous two non-redundant : 124074
% 18.90/3.14 % ...aggressively subsumed : 0
% 18.90/3.14 % Contextual simplify-reflections : 0
% 18.90/3.14 % Paramodulations : 144144
% 18.90/3.14 % Factorizations : 0
% 18.90/3.14 % NegExts : 0
% 18.90/3.14 % Equation resolutions : 0
% 18.90/3.14 % Disequality decompositions : 0
% 18.90/3.14 % Total rewrite steps : 21727
% 18.90/3.14 % ...of those cached : 15691
% 18.90/3.14 % Propositional unsat checks : 0
% 18.90/3.14 % Propositional check models : 0
% 18.90/3.14 % Propositional check unsatisfiable : 0
% 18.90/3.14 % Propositional clauses : 0
% 18.90/3.14 % Propositional clauses after purity: 0
% 18.90/3.14 % Propositional unsat core size : 0
% 18.90/3.14 % Propositional preprocessing time : 0.000
% 18.90/3.14 % Propositional encoding time : 0.000
% 18.90/3.14 % Propositional solver time : 0.000
% 18.90/3.14 % Success case prop preproc time : 0.000
% 18.90/3.14 % Success case prop encoding time : 0.000
% 18.90/3.14 % Success case prop solver time : 0.000
% 18.90/3.14 % Current number of processed clauses : 3629
% 18.90/3.14 % Positive orientable unit clauses : 1203
% 18.90/3.14 % Positive unorientable unit clauses: 0
% 18.90/3.14 % Negative unit clauses : 57
% 18.90/3.14 % Non-unit-clauses : 2369
% 18.90/3.14 % Current number of unprocessed clauses: 109355
% 18.90/3.14 % ...number of literals in the above : 174724
% 18.90/3.14 % Current number of archived formulas : 0
% 18.90/3.14 % Current number of archived clauses : 21
% 18.90/3.14 % Clause-clause subsumption calls (NU) : 1731975
% 18.90/3.14 % Rec. Clause-clause subsumption calls : 1731737
% 18.90/3.14 % Non-unit clause-clause subsumptions : 9306
% 18.90/3.14 % Unit Clause-clause subsumption calls : 49698
% 18.90/3.14 % Rewrite failures with RHS unbound : 0
% 18.90/3.14 % BW rewrite match attempts : 344645
% 18.90/3.14 % BW rewrite match successes : 3
% 18.90/3.14 % Condensation attempts : 0
% 18.90/3.14 % Condensation successes : 0
% 18.90/3.14 % Termbank termtop insertions : 2155378
% 18.90/3.14 % Search garbage collected termcells : 17
% 18.90/3.14
% 18.90/3.14 % -------------------------------------------------
% 18.90/3.14 % User time : 2.633 s
% 18.90/3.14 % System time : 0.101 s
% 18.90/3.14 % Total time : 2.734 s
% 18.90/3.14 % Maximum resident set size: 3644 pages
% 18.90/3.14
% 18.90/3.14 % -------------------------------------------------
% 18.90/3.14 % User time : 13.321 s
% 18.90/3.14 % System time : 0.437 s
% 18.90/3.14 % Total time : 13.759 s
% 18.90/3.14 % Maximum resident set size: 4608 pages
% 18.90/3.14 % E exiting
%------------------------------------------------------------------------------