%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL230+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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 : Theorem 0.21s 10.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 30 ( 8 ~; 12 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel5,conjecture,
( ( ( q
| p )
=> ( r
| p ) )
=> ( ( q
=> r )
| p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel5) ).
fof(c_0_1,negated_conjecture,
~ ( ( ( q
| p )
=> ( r
| p ) )
=> ( ( q
=> r )
| p ) ),
inference(assume_negation,[status(cth)],[pel5]) ).
fof(c_0_2,negated_conjecture,
( ~ r
& q
& ~ p
& ( r
| p
| ~ q )
& ( r
| p
| ~ p ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3,negated_conjecture,
( ~ q
| r
| p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
q,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ p,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
~ r,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]),c_0_5]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL230+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/10.47 % Computer : n020.cluster.edu
% 0.16/10.47 % Model : x86_64 x86_64
% 0.16/10.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/10.47 % Memory : 8046.5625MB
% 0.16/10.47 % OS : Linux 6.8.0-71-generic
% 0.16/10.47 % CPULimit : 300
% 0.16/10.47 % WCLimit : 300
% 0.16/10.47 % DateTime : Mon Sep 21 00:14:43 UTC 2026
% 0.16/10.47 % CPUTime :
% 0.16/10.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/10.52 Running first-order theorem proving
% 0.21/10.52 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.21/10.53 % Version: 3.5.1
% 0.21/10.53 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.21/10.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/10.53 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.21/10.53 % Starting new_bool_3 with 300s (1) cores
% 0.21/10.53 % Starting new_bool_1 with 300s (1) cores
% 0.21/10.53 % Starting sh5l with 300s (1) cores
% 0.21/10.53 % SAT001_MinMin_p005000_rr_RG with pid 1579740 completed with status 0
% 0.21/10.53 % Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/10.53 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.21/10.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/10.53 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.21/10.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/10.53 % No SInE strategy applied
% 0.21/10.53 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.21/10.53 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/10.53 % Starting SubtermCWHack with 151s (1) cores
% 0.21/10.53 % Starting SAT001_MinMin_p005000_rr_RG with 901s (1) cores
% 0.21/10.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 151s (1) cores
% 0.21/10.53 % Starting new_bool_3 with 151s (1) cores
% 0.21/10.53 % Starting new_bool_1 with 146s (1) cores
% 0.21/10.53 % SubtermCWHack with pid 1579744 completed with status 0
% 0.21/10.53 % Result found by SubtermCWHack
% 0.21/10.53 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.21/10.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/10.53 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.21/10.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/10.53 % No SInE strategy applied
% 0.21/10.53 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.21/10.53 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/10.53 % Starting SubtermCWHack with 151s (1) cores
% 0.21/10.53 % Preprocessing time : 0.001 s
% 0.21/10.53
% 0.21/10.53 % Proof found!
% 0.21/10.53 % SZS status Theorem
% 0.21/10.53 % SZS output start CNFRefutation
% See solution above
% 0.21/10.53 % Parsed axioms : 1
% 0.21/10.53 % Removed by relevancy pruning/SinE : 0
% 0.21/10.53 % Initial clauses : 5
% 0.21/10.53 % Removed in clause preprocessing : 1
% 0.21/10.53 % Initial clauses in saturation : 4
% 0.21/10.53 % Processed clauses : 4
% 0.21/10.53 % ...of these trivial : 0
% 0.21/10.53 % ...subsumed : 0
% 0.21/10.53 % ...remaining for further processing : 3
% 0.21/10.53 % Other redundant clauses eliminated : 0
% 0.21/10.53 % Clauses deleted for lack of memory : 0
% 0.21/10.53 % Backward-subsumed : 0
% 0.21/10.53 % Backward-rewritten : 0
% 0.21/10.53 % Generated clauses : 0
% 0.21/10.53 % ...of the previous two non-redundant : 0
% 0.21/10.53 % ...aggressively subsumed : 0
% 0.21/10.53 % Contextual simplify-reflections : 0
% 0.21/10.53 % Paramodulations : 0
% 0.21/10.53 % Factorizations : 0
% 0.21/10.53 % NegExts : 0
% 0.21/10.53 % Equation resolutions : 0
% 0.21/10.53 % Disequality decompositions : 0
% 0.21/10.53 % Total rewrite steps : 1
% 0.21/10.53 % ...of those cached : 0
% 0.21/10.53 % Propositional unsat checks : 0
% 0.21/10.53 % Propositional check models : 0
% 0.21/10.53 % Propositional check unsatisfiable : 0
% 0.21/10.53 % Propositional clauses : 0
% 0.21/10.53 % Propositional clauses after purity: 0
% 0.21/10.53 % Propositional unsat core size : 0
% 0.21/10.53 % Propositional preprocessing time : 0.000
% 0.21/10.53 % Propositional encoding time : 0.000
% 0.21/10.53 % Propositional solver time : 0.000
% 0.21/10.53 % Success case prop preproc time : 0.000
% 0.21/10.53 % Success case prop encoding time : 0.000
% 0.21/10.53 % Success case prop solver time : 0.000
% 0.21/10.53 % Current number of processed clauses : 3
% 0.21/10.53 % Positive orientable unit clauses : 1
% 0.21/10.53 % Positive unorientable unit clauses: 0
% 0.21/10.53 % Negative unit clauses : 2
% 0.21/10.53 % Non-unit-clauses : 0
% 0.21/10.53 % Current number of unprocessed clauses: 0
% 0.21/10.53 % ...number of literals in the above : 0
% 0.21/10.53 % Current number of archived formulas : 0
% 0.21/10.53 % Current number of archived clauses : 0
% 0.21/10.53 % Clause-clause subsumption calls (NU) : 0
% 0.21/10.53 % Rec. Clause-clause subsumption calls : 0
% 0.21/10.53 % Non-unit clause-clause subsumptions : 0
% 0.21/10.53 % Unit Clause-clause subsumption calls : 0
% 0.21/10.53 % Rewrite failures with RHS unbound : 0
% 0.21/10.53 % BW rewrite match attempts : 0
% 0.21/10.53 % BW rewrite match successes : 0
% 0.21/10.53 % Condensation attempts : 0
% 0.21/10.53 % Condensation successes : 0
% 0.21/10.53 % Termbank termtop insertions : 193
% 0.21/10.53 % Search garbage collected termcells : 40
% 0.21/10.53
% 0.21/10.53 % -------------------------------------------------
% 0.21/10.53 % User time : 0.002 s
% 0.21/10.53 % System time : 0.002 s
% 0.21/10.53 % Total time : 0.004 s
% 0.21/10.53 % Maximum resident set size: 3364 pages
% 0.21/10.53
% 0.21/10.53 % -------------------------------------------------
% 0.21/10.53 % User time : 0.011 s
% 0.21/10.53 % System time : 0.006 s
% 0.21/10.53 % Total time : 0.017 s
% 0.21/10.53 % Maximum resident set size: 4608 pages
% 0.21/10.53 % E exiting
%------------------------------------------------------------------------------