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