%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL250-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:18:58 PM UTC 2026
% Result : Unsatisfiable 13.19s 2.57s
% Output : CNFRefutation 13.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of clauses : 47 ( 27 unt; 0 nHn; 22 RR)
% Number of literals : 73 ( 0 equ; 29 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 : 103 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
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(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
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_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
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_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(q),r)),or(not(not(or(not(p),not(q)))),r))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_9,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_10,plain,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
c_0_9 ).
cnf(c_0_11,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_12,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_13,plain,
( ~ theorem(or(not(or(X3,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_12 ).
cnf(c_0_15,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_16,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_17,plain,
( ~ axiom(or(not(or(X3,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_19,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
c_0_15 ).
cnf(c_0_20,plain,
( ~ theorem(or(not(or(X2,X1)),X3))
| theorem(or(not(or(X1,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_21,plain,
theorem(or(not(or(X1,X2)),or(X1,or(X3,X2)))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_23,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_25,plain,
theorem(or(not(or(X1,X2)),or(X2,or(X3,X1)))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_27,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_29,plain,
theorem(or(X1,or(not(or(X2,X1)),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_30,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
theorem(or(or(not(or(X1,X2)),or(X3,X1)),X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_33,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_10,c_0_18]) ).
cnf(c_0_34,plain,
theorem(or(not(or(X1,or(X2,X1))),or(X2,X1))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,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_10,c_0_32]) ).
cnf(c_0_36,plain,
theorem(or(not(or(X1,or(X2,X2))),or(X1,X2))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X2,X1)),X2))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
theorem(or(not(or(X1,not(X2))),or(not(or(X1,X2)),X1))),
inference(spm,[status(thm)],[c_0_20,c_0_37]) ).
cnf(c_0_39,plain,
theorem(or(not(not(X1)),or(not(or(X2,X1)),X2))),
inference(spm,[status(thm)],[c_0_13,c_0_38]) ).
cnf(c_0_40,plain,
theorem(or(not(or(X1,X2)),or(not(not(X2)),X1))),
inference(spm,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_41,plain,
theorem(or(not(or(X1,or(X2,X3))),or(not(not(or(X1,X3))),X2))),
inference(spm,[status(thm)],[c_0_33,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_43,plain,
theorem(or(not(or(X1,X2)),or(not(not(or(X3,X2))),X1))),
inference(spm,[status(thm)],[c_0_13,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
c_0_42 ).
cnf(c_0_45,plain,
theorem(or(not(or(X1,X2)),or(not(not(or(X3,X1))),X2))),
inference(spm,[status(thm)],[c_0_20,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL250-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 % Computer : n009.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8046.5625MB
% 0.15/0.40 % OS : Linux 6.8.0-71-generic
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.40 % DateTime : Mon Sep 21 00:15:28 UTC 2026
% 0.15/0.40 % CPUTime :
% 0.15/0.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.47 Running first-order theorem proving
% 0.04/0.47 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
% 13.19/2.57 % Version: 3.5.1
% 13.19/2.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.19/2.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.19/2.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.19/2.57 % Starting new_bool_3 with 300s (1) cores
% 13.19/2.57 % Starting new_bool_1 with 300s (1) cores
% 13.19/2.57 % Starting sh5l with 300s (1) cores
% 13.19/2.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 436823 completed with status 0
% 13.19/2.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 13.19/2.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.19/2.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.19/2.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.19/2.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.19/2.57 % No SInE strategy applied
% 13.19/2.57 % Search class: FHUNM-FFSF21-DFFFFFNN
% 13.19/2.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.19/2.57 % Starting SubtermCWHack with 136s (1) cores
% 13.19/2.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.19/2.57 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 300s (1) cores
% 13.19/2.57 % Starting new_bool_3 with 296s (1) cores
% 13.19/2.57 % Starting new_bool_1 with 291s (1) cores
% 13.19/2.57 % SubtermCWHack with pid 436827 completed with status 0
% 13.19/2.57 % Result found by SubtermCWHack
% 13.19/2.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.19/2.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.19/2.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.19/2.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.19/2.57 % No SInE strategy applied
% 13.19/2.57 % Search class: FHUNM-FFSF21-DFFFFFNN
% 13.19/2.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.19/2.57 % Starting SubtermCWHack with 136s (1) cores
% 13.19/2.57 % Preprocessing time : 0.001 s
% 13.19/2.57
% 13.19/2.57 % Proof found!
% 13.19/2.57 % SZS status Unsatisfiable
% 13.19/2.57 % SZS output start CNFRefutation
% See solution above
% 13.19/2.57 % Parsed axioms : 9
% 13.19/2.57 % Removed by relevancy pruning/SinE : 0
% 13.19/2.57 % Initial clauses : 9
% 13.19/2.57 % Removed in clause preprocessing : 0
% 13.19/2.57 % Initial clauses in saturation : 9
% 13.19/2.57 % Processed clauses : 11094
% 13.19/2.57 % ...of these trivial : 984
% 13.19/2.57 % ...subsumed : 5214
% 13.19/2.57 % ...remaining for further processing : 4896
% 13.19/2.57 % Other redundant clauses eliminated : 0
% 13.19/2.57 % Clauses deleted for lack of memory : 0
% 13.19/2.57 % Backward-subsumed : 6
% 13.19/2.57 % Backward-rewritten : 7
% 13.19/2.57 % Generated clauses : 101228
% 13.19/2.57 % ...of the previous two non-redundant : 69657
% 13.19/2.57 % ...aggressively subsumed : 0
% 13.19/2.57 % Contextual simplify-reflections : 0
% 13.19/2.57 % Paramodulations : 101228
% 13.19/2.57 % Factorizations : 0
% 13.19/2.57 % NegExts : 0
% 13.19/2.57 % Equation resolutions : 0
% 13.19/2.57 % Disequality decompositions : 0
% 13.19/2.57 % Total rewrite steps : 32509
% 13.19/2.57 % ...of those cached : 22928
% 13.19/2.57 % Propositional unsat checks : 0
% 13.19/2.57 % Propositional check models : 0
% 13.19/2.57 % Propositional check unsatisfiable : 0
% 13.19/2.57 % Propositional clauses : 0
% 13.19/2.57 % Propositional clauses after purity: 0
% 13.19/2.57 % Propositional unsat core size : 0
% 13.19/2.57 % Propositional preprocessing time : 0.000
% 13.19/2.57 % Propositional encoding time : 0.000
% 13.19/2.57 % Propositional solver time : 0.000
% 13.19/2.57 % Success case prop preproc time : 0.000
% 13.19/2.57 % Success case prop encoding time : 0.000
% 13.19/2.57 % Success case prop solver time : 0.000
% 13.19/2.57 % Current number of processed clauses : 4883
% 13.19/2.57 % Positive orientable unit clauses : 3860
% 13.19/2.57 % Positive unorientable unit clauses: 0
% 13.19/2.57 % Negative unit clauses : 35
% 13.19/2.57 % Non-unit-clauses : 988
% 13.19/2.57 % Current number of unprocessed clauses: 58526
% 13.19/2.57 % ...number of literals in the above : 73129
% 13.19/2.57 % Current number of archived formulas : 0
% 13.19/2.57 % Current number of archived clauses : 13
% 13.19/2.57 % Clause-clause subsumption calls (NU) : 491866
% 13.19/2.57 % Rec. Clause-clause subsumption calls : 491866
% 13.19/2.57 % Non-unit clause-clause subsumptions : 5174
% 13.19/2.57 % Unit Clause-clause subsumption calls : 45476
% 13.19/2.57 % Rewrite failures with RHS unbound : 0
% 13.19/2.57 % BW rewrite match attempts : 2602732
% 13.19/2.57 % BW rewrite match successes : 7
% 13.19/2.57 % Condensation attempts : 0
% 13.19/2.57 % Condensation successes : 0
% 13.19/2.57 % Termbank termtop insertions : 1378163
% 13.19/2.57 % Search garbage collected termcells : 17
% 13.19/2.57
% 13.19/2.57 % -------------------------------------------------
% 13.19/2.57 % User time : 1.941 s
% 13.19/2.57 % System time : 0.078 s
% 13.19/2.57 % Total time : 2.019 s
% 13.19/2.57 % Maximum resident set size: 3644 pages
% 13.19/2.57
% 13.19/2.57 % -------------------------------------------------
% 13.19/2.57 % User time : 9.234 s
% 13.19/2.57 % System time : 0.341 s
% 13.19/2.57 % Total time : 9.575 s
% 13.19/2.57 % Maximum resident set size: 4608 pages
% 13.19/2.57 % E exiting
%------------------------------------------------------------------------------