%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL236-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 : n001.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:55 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.54s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 38 ( 26 unt; 0 nHn; 17 RR)
% Number of literals : 55 ( 4 equ; 21 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 : 61 ( 6 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_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_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(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',prove_this) ).
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_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,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_16,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_18,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_21,plain,
( ~ axiom(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_22,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_23,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_24,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_25,plain,
theorem(or(or(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_23,c_0_11]) ).
cnf(c_0_27,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_28,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_30,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_31,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
c_0_29 ).
cnf(c_0_33,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_34,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,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_32,c_0_11]),c_0_33]) ).
cnf(c_0_36,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_18,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL236-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.17/0.43 % Computer : n001.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 00:19:28 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/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
% 0.25/0.54 % Version: 3.5.1
% 0.25/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.54 % Starting sh5l with 300s (1) cores
% 0.25/0.54 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1795848 completed with status 0
% 0.25/0.54 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.25/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.54 % No SInE strategy applied
% 0.25/0.54 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.25/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/0.54 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.25/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.25/0.54 % Starting new_bool_1 with 136s (1) cores
% 0.25/0.54 % new_bool_3 with pid 1795858 completed with status 0
% 0.25/0.54 % Result found by new_bool_3
% 0.25/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.54 % No SInE strategy applied
% 0.25/0.54 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.25/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/0.54 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.25/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.25/0.54 % Preprocessing time : 0.002 s
% 0.25/0.54 % Presaturation interreduction done
% 0.25/0.54
% 0.25/0.54 % Proof found!
% 0.25/0.54 % SZS status Unsatisfiable
% 0.25/0.54 % SZS output start CNFRefutation
% See solution above
% 0.25/0.54 % Parsed axioms : 10
% 0.25/0.54 % Removed by relevancy pruning/SinE : 0
% 0.25/0.54 % Initial clauses : 10
% 0.25/0.54 % Removed in clause preprocessing : 2
% 0.25/0.54 % Initial clauses in saturation : 8
% 0.25/0.54 % Processed clauses : 52
% 0.25/0.54 % ...of these trivial : 0
% 0.25/0.54 % ...subsumed : 6
% 0.25/0.54 % ...remaining for further processing : 46
% 0.25/0.54 % Other redundant clauses eliminated : 0
% 0.25/0.54 % Clauses deleted for lack of memory : 0
% 0.25/0.54 % Backward-subsumed : 0
% 0.25/0.54 % Backward-rewritten : 1
% 0.25/0.54 % Generated clauses : 85
% 0.25/0.54 % ...of the previous two non-redundant : 71
% 0.25/0.54 % ...aggressively subsumed : 0
% 0.25/0.54 % Contextual simplify-reflections : 0
% 0.25/0.54 % Paramodulations : 85
% 0.25/0.54 % Factorizations : 0
% 0.25/0.54 % NegExts : 0
% 0.25/0.54 % Equation resolutions : 0
% 0.25/0.54 % Disequality decompositions : 0
% 0.25/0.54 % Total rewrite steps : 7
% 0.25/0.54 % ...of those cached : 1
% 0.25/0.54 % Propositional unsat checks : 0
% 0.25/0.54 % Propositional check models : 0
% 0.25/0.54 % Propositional check unsatisfiable : 0
% 0.25/0.54 % Propositional clauses : 0
% 0.25/0.54 % Propositional clauses after purity: 0
% 0.25/0.54 % Propositional unsat core size : 0
% 0.25/0.54 % Propositional preprocessing time : 0.000
% 0.25/0.54 % Propositional encoding time : 0.000
% 0.25/0.54 % Propositional solver time : 0.000
% 0.25/0.54 % Success case prop preproc time : 0.000
% 0.25/0.54 % Success case prop encoding time : 0.000
% 0.25/0.54 % Success case prop solver time : 0.000
% 0.25/0.54 % Current number of processed clauses : 37
% 0.25/0.54 % Positive orientable unit clauses : 12
% 0.25/0.54 % Positive unorientable unit clauses: 0
% 0.25/0.54 % Negative unit clauses : 5
% 0.25/0.54 % Non-unit-clauses : 20
% 0.25/0.54 % Current number of unprocessed clauses: 35
% 0.25/0.54 % ...number of literals in the above : 47
% 0.25/0.54 % Current number of archived formulas : 0
% 0.25/0.54 % Current number of archived clauses : 11
% 0.25/0.54 % Clause-clause subsumption calls (NU) : 68
% 0.25/0.54 % Rec. Clause-clause subsumption calls : 68
% 0.25/0.54 % Non-unit clause-clause subsumptions : 6
% 0.25/0.54 % Unit Clause-clause subsumption calls : 13
% 0.25/0.54 % Rewrite failures with RHS unbound : 0
% 0.25/0.54 % BW rewrite match attempts : 38
% 0.25/0.54 % BW rewrite match successes : 1
% 0.25/0.54 % Condensation attempts : 0
% 0.25/0.54 % Condensation successes : 0
% 0.25/0.54 % Termbank termtop insertions : 1298
% 0.25/0.54 % Search garbage collected termcells : 11
% 0.25/0.54
% 0.25/0.54 % -------------------------------------------------
% 0.25/0.54 % User time : 0.008 s
% 0.25/0.54 % System time : 0.004 s
% 0.25/0.54 % Total time : 0.012 s
% 0.25/0.54 % Maximum resident set size: 3644 pages
% 0.25/0.54
% 0.25/0.54 % -------------------------------------------------
% 0.25/0.54 % User time : 0.033 s
% 0.25/0.54 % System time : 0.025 s
% 0.25/0.54 % Total time : 0.059 s
% 0.25/0.54 % Maximum resident set size: 4864 pages
% 0.25/0.54 % E exiting
%------------------------------------------------------------------------------