%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL204-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 : 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:12:05 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 28 ( 15 unt; 0 nHn; 17 RR)
% Number of literals : 47 ( 0 equ; 22 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 11 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_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_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_7,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_8,plain,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
c_0_7 ).
cnf(c_0_9,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_10,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_11,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( ~ theorem(or(not(or(X3,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_10 ).
cnf(c_0_14,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
c_0_11 ).
cnf(c_0_15,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_16,plain,
( ~ axiom(or(not(or(X3,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_18,plain,
( ~ theorem(or(X2,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(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
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_8,c_0_17]) ).
cnf(c_0_21,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
theorem(or(not(or(X1,X2)),or(not(not(or(X2,X1))),X3))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_24,plain,
theorem(or(not(X1),or(not(not(or(X1,X2))),X3))),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))),
c_0_23 ).
cnf(c_0_26,plain,
theorem(or(not(not(or(X1,X2))),or(not(X1),X3))),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL204-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n009.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 00:11:27 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % new_bool_3 with pid 429065 completed with status 0
% 0.14/0.45 % Result found by new_bool_3
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % SubtermCWHack with pid 429071 completed with status 0
% 0.14/0.45 % Result found by SubtermCWHack
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % Preprocessing time : 0.001 s
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Unsatisfiable
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 9
% 0.14/0.45 % Removed by relevancy pruning/SinE : 0
% 0.14/0.45 % Initial clauses : 9
% 0.14/0.45 % Removed in clause preprocessing : 0
% 0.14/0.45 % Initial clauses in saturation : 9
% 0.14/0.45 % Processed clauses : 575
% 0.14/0.45 % ...of these trivial : 44
% 0.14/0.45 % ...subsumed : 117
% 0.14/0.45 % ...remaining for further processing : 414
% 0.14/0.45 % Other redundant clauses eliminated : 0
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 1
% 0.14/0.45 % Backward-rewritten : 1
% 0.14/0.45 % Generated clauses : 2481
% 0.14/0.45 % ...of the previous two non-redundant : 1331
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 0
% 0.14/0.45 % Paramodulations : 2481
% 0.14/0.45 % Factorizations : 0
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 0
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 1187
% 0.14/0.45 % ...of those cached : 662
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 412
% 0.14/0.45 % Positive orientable unit clauses : 329
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 14
% 0.14/0.45 % Non-unit-clauses : 69
% 0.14/0.45 % Current number of unprocessed clauses: 762
% 0.14/0.45 % ...number of literals in the above : 986
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 2
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 1603
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 1603
% 0.14/0.45 % Non-unit clause-clause subsumptions : 114
% 0.14/0.45 % Unit Clause-clause subsumption calls : 228
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 18856
% 0.14/0.45 % BW rewrite match successes : 1
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 30088
% 0.14/0.45 % Search garbage collected termcells : 17
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.039 s
% 0.14/0.45 % System time : 0.006 s
% 0.14/0.45 % Total time : 0.045 s
% 0.14/0.45 % Maximum resident set size: 3644 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.041 s
% 0.14/0.45 % System time : 0.010 s
% 0.14/0.45 % Total time : 0.051 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------