%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL236-3 : 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 : n016.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:13 PM UTC 2026
% Result : Unsatisfiable 0.02s 0.43s
% Output : CNFRefutation 0.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of clauses : 43 ( 23 unt; 0 nHn; 19 RR)
% Number of literals : 70 ( 4 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 77 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_9,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_10,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_9 ).
cnf(c_0_11,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_12,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_13,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_12 ).
cnf(c_0_15,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_16,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_17,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_19,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_20,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_22,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( ~ theorem(X3)
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_24,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_25,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_26,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_27,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_28,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_29,plain,
( ~ theorem(or(X3,X2))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_31,plain,
( ~ theorem(or(X3,X1))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_32,plain,
( ~ theorem(or(X2,or(X1,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_34,negated_conjecture,
~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_35,plain,
( ~ axiom(or(X1,or(X2,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
c_0_34 ).
cnf(c_0_37,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_38,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_39,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_40,negated_conjecture,
~ theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_11]),c_0_37]) ).
cnf(c_0_41,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL236-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 00:18:37 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/0.40 Running first-order theorem proving
% 0.02/0.40 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
% 0.02/0.43 % Version: 3.5.1
% 0.02/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.02/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.02/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.02/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.02/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.02/0.43 % Starting sh5l with 300s (1) cores
% 0.02/0.43 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1167582 completed with status 0
% 0.02/0.43 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.02/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.02/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.02/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.02/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.02/0.43 % No SInE strategy applied
% 0.02/0.43 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.02/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.02/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.02/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.02/0.43 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.02/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.02/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.02/0.43 % SubtermCWHack with pid 1167587 completed with status 0
% 0.02/0.43 % Result found by SubtermCWHack
% 0.02/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.02/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.02/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.02/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.02/0.43 % No SInE strategy applied
% 0.02/0.43 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.02/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.02/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.02/0.43 % Preprocessing time : 0.001 s
% 0.02/0.43
% 0.02/0.43 % Proof found!
% 0.02/0.43 % SZS status Unsatisfiable
% 0.02/0.43 % SZS output start CNFRefutation
% See solution above
% 0.02/0.43 % Parsed axioms : 10
% 0.02/0.43 % Removed by relevancy pruning/SinE : 0
% 0.02/0.43 % Initial clauses : 10
% 0.02/0.43 % Removed in clause preprocessing : 2
% 0.02/0.43 % Initial clauses in saturation : 8
% 0.02/0.43 % Processed clauses : 141
% 0.02/0.43 % ...of these trivial : 0
% 0.02/0.43 % ...subsumed : 81
% 0.02/0.43 % ...remaining for further processing : 60
% 0.02/0.43 % Other redundant clauses eliminated : 0
% 0.02/0.43 % Clauses deleted for lack of memory : 0
% 0.02/0.43 % Backward-subsumed : 0
% 0.02/0.43 % Backward-rewritten : 1
% 0.02/0.43 % Generated clauses : 218
% 0.02/0.43 % ...of the previous two non-redundant : 207
% 0.02/0.43 % ...aggressively subsumed : 0
% 0.02/0.43 % Contextual simplify-reflections : 0
% 0.02/0.43 % Paramodulations : 218
% 0.02/0.43 % Factorizations : 0
% 0.02/0.43 % NegExts : 0
% 0.02/0.43 % Equation resolutions : 0
% 0.02/0.43 % Disequality decompositions : 0
% 0.02/0.43 % Total rewrite steps : 1
% 0.02/0.43 % ...of those cached : 0
% 0.02/0.43 % Propositional unsat checks : 0
% 0.02/0.43 % Propositional check models : 0
% 0.02/0.43 % Propositional check unsatisfiable : 0
% 0.02/0.43 % Propositional clauses : 0
% 0.02/0.43 % Propositional clauses after purity: 0
% 0.02/0.43 % Propositional unsat core size : 0
% 0.02/0.43 % Propositional preprocessing time : 0.000
% 0.02/0.43 % Propositional encoding time : 0.000
% 0.02/0.43 % Propositional solver time : 0.000
% 0.02/0.43 % Success case prop preproc time : 0.000
% 0.02/0.43 % Success case prop encoding time : 0.000
% 0.02/0.43 % Success case prop solver time : 0.000
% 0.02/0.43 % Current number of processed clauses : 59
% 0.02/0.43 % Positive orientable unit clauses : 7
% 0.02/0.43 % Positive unorientable unit clauses: 0
% 0.02/0.43 % Negative unit clauses : 6
% 0.02/0.43 % Non-unit-clauses : 46
% 0.02/0.43 % Current number of unprocessed clauses: 74
% 0.02/0.43 % ...number of literals in the above : 176
% 0.02/0.43 % Current number of archived formulas : 0
% 0.02/0.43 % Current number of archived clauses : 3
% 0.02/0.43 % Clause-clause subsumption calls (NU) : 785
% 0.02/0.43 % Rec. Clause-clause subsumption calls : 785
% 0.02/0.43 % Non-unit clause-clause subsumptions : 81
% 0.02/0.43 % Unit Clause-clause subsumption calls : 11
% 0.02/0.43 % Rewrite failures with RHS unbound : 0
% 0.02/0.43 % BW rewrite match attempts : 16
% 0.02/0.43 % BW rewrite match successes : 1
% 0.02/0.43 % Condensation attempts : 0
% 0.02/0.43 % Condensation successes : 0
% 0.02/0.43 % Termbank termtop insertions : 2698
% 0.02/0.43 % Search garbage collected termcells : 11
% 0.02/0.43
% 0.02/0.43 % -------------------------------------------------
% 0.02/0.43 % User time : 0.006 s
% 0.02/0.43 % System time : 0.004 s
% 0.02/0.43 % Total time : 0.011 s
% 0.02/0.43 % Maximum resident set size: 3644 pages
% 0.02/0.43
% 0.02/0.43 % -------------------------------------------------
% 0.02/0.43 % User time : 0.032 s
% 0.02/0.43 % System time : 0.012 s
% 0.02/0.43 % Total time : 0.044 s
% 0.02/0.43 % Maximum resident set size: 4608 pages
% 0.02/0.43 % E exiting
%------------------------------------------------------------------------------