%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL230-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:12 PM UTC 2026
% Result : Unsatisfiable 0.74s 0.55s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 16 unt; 0 nHn; 17 RR)
% Number of literals : 52 ( 0 equ; 24 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 : 65 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
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_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(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_8,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_9,plain,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
c_0_8 ).
cnf(c_0_10,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_11,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_12,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_13,plain,
( ~ theorem(or(not(or(X3,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_11 ).
cnf(c_0_15,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
c_0_12 ).
cnf(c_0_16,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
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,X1)),X1)),
axiom_1_2 ).
cnf(c_0_19,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_22,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_24,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_9,c_0_16]) ).
cnf(c_0_25,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_26,plain,
theorem(or(not(X1),or(not(or(not(or(X2,X1)),X3)),X3))),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
c_0_23 ).
cnf(c_0_28,plain,
( ~ theorem(or(not(or(X1,X3)),X4))
| theorem(or(not(or(X1,or(X2,X3))),or(X2,X4))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
theorem(or(not(or(not(or(X1,X2)),X3)),or(not(X2),X3))),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL230-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n019.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 00:13:51 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.74/0.55 % Version: 3.5.1
% 0.74/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.74/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.74/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.74/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.74/0.55 % Starting sh5l with 300s (1) cores
% 0.74/0.55 % new_bool_1 with pid 1287170 completed with status 0
% 0.74/0.55 % Result found by new_bool_1
% 0.74/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.74/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.74/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.74/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.74/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.74/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.74/0.55 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.74/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.74/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.74/0.55 % SubtermCWHack with pid 1287176 completed with status 0
% 0.74/0.55 % Result found by SubtermCWHack
% 0.74/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.74/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.74/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.74/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.74/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.74/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.74/0.55 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.74/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.74/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.74/0.55 % Preprocessing time : 0.001 s
% 0.74/0.55
% 0.74/0.55 % Proof found!
% 0.74/0.55 % SZS status Unsatisfiable
% 0.74/0.55 % SZS output start CNFRefutation
% See solution above
% 0.74/0.55 % Parsed axioms : 9
% 0.74/0.55 % Removed by relevancy pruning/SinE : 0
% 0.74/0.55 % Initial clauses : 9
% 0.74/0.55 % Removed in clause preprocessing : 0
% 0.74/0.55 % Initial clauses in saturation : 9
% 0.74/0.55 % Processed clauses : 1490
% 0.74/0.55 % ...of these trivial : 185
% 0.74/0.55 % ...subsumed : 358
% 0.74/0.55 % ...remaining for further processing : 946
% 0.74/0.55 % Other redundant clauses eliminated : 0
% 0.74/0.55 % Clauses deleted for lack of memory : 0
% 0.74/0.55 % Backward-subsumed : 1
% 0.74/0.55 % Backward-rewritten : 0
% 0.74/0.55 % Generated clauses : 8315
% 0.74/0.55 % ...of the previous two non-redundant : 4335
% 0.74/0.55 % ...aggressively subsumed : 0
% 0.74/0.55 % Contextual simplify-reflections : 0
% 0.74/0.55 % Paramodulations : 8315
% 0.74/0.55 % Factorizations : 0
% 0.74/0.55 % NegExts : 0
% 0.74/0.55 % Equation resolutions : 0
% 0.74/0.55 % Disequality decompositions : 0
% 0.74/0.55 % Total rewrite steps : 4156
% 0.74/0.55 % ...of those cached : 2358
% 0.74/0.55 % Propositional unsat checks : 0
% 0.74/0.55 % Propositional check models : 0
% 0.74/0.55 % Propositional check unsatisfiable : 0
% 0.74/0.55 % Propositional clauses : 0
% 0.74/0.55 % Propositional clauses after purity: 0
% 0.74/0.55 % Propositional unsat core size : 0
% 0.74/0.55 % Propositional preprocessing time : 0.000
% 0.74/0.55 % Propositional encoding time : 0.000
% 0.74/0.55 % Propositional solver time : 0.000
% 0.74/0.55 % Success case prop preproc time : 0.000
% 0.74/0.55 % Success case prop encoding time : 0.000
% 0.74/0.55 % Success case prop solver time : 0.000
% 0.74/0.55 % Current number of processed clauses : 945
% 0.74/0.55 % Positive orientable unit clauses : 785
% 0.74/0.55 % Positive unorientable unit clauses: 0
% 0.74/0.55 % Negative unit clauses : 40
% 0.74/0.55 % Non-unit-clauses : 120
% 0.74/0.55 % Current number of unprocessed clauses: 2848
% 0.74/0.55 % ...number of literals in the above : 3307
% 0.74/0.55 % Current number of archived formulas : 0
% 0.74/0.55 % Current number of archived clauses : 1
% 0.74/0.55 % Clause-clause subsumption calls (NU) : 6708
% 0.74/0.55 % Rec. Clause-clause subsumption calls : 6708
% 0.74/0.55 % Non-unit clause-clause subsumptions : 323
% 0.74/0.55 % Unit Clause-clause subsumption calls : 664
% 0.74/0.55 % Rewrite failures with RHS unbound : 0
% 0.74/0.55 % BW rewrite match attempts : 112362
% 0.74/0.55 % BW rewrite match successes : 0
% 0.74/0.55 % Condensation attempts : 0
% 0.74/0.55 % Condensation successes : 0
% 0.74/0.55 % Termbank termtop insertions : 104725
% 0.74/0.55 % Search garbage collected termcells : 17
% 0.74/0.55
% 0.74/0.55 % -------------------------------------------------
% 0.74/0.55 % User time : 0.132 s
% 0.74/0.55 % System time : 0.013 s
% 0.74/0.55 % Total time : 0.146 s
% 0.74/0.55 % Maximum resident set size: 3644 pages
% 0.74/0.55
% 0.74/0.55 % -------------------------------------------------
% 0.74/0.55 % User time : 0.133 s
% 0.74/0.55 % System time : 0.019 s
% 0.74/0.55 % Total time : 0.152 s
% 0.74/0.55 % Maximum resident set size: 4864 pages
% 0.74/0.55 % E exiting
%------------------------------------------------------------------------------