%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN047+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 : n014.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 03:22:43 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 179 ( 0 equ)
% Maximal formula atoms : 114 ( 10 avg)
% Number of connectives : 246 ( 84 ~; 117 |; 36 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 5 ( 4 usr; 5 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel17,conjecture,
( ( ( ( q
=> r )
& p )
=> s )
<=> ( ( s
| ~ r
| ~ p )
& ( s
| q
| ~ p ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel17) ).
fof(c_0_1,negated_conjecture,
~ ( ( ( ( q
=> r )
& p )
=> s )
<=> ( ( s
| ~ r
| ~ p )
& ( s
| q
| ~ p ) ) ),
inference(assume_negation,[status(cth)],[pel17]) ).
fof(c_0_2,negated_conjecture,
~ ( ( ( ( q
=> r )
& p )
=> s )
<=> ( ( s
| ~ r
| ~ p )
& ( s
| q
| ~ p ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
( ( s
| ~ p
| ~ r
| s
| ~ r
| ~ p )
& ( s
| ~ p
| ~ r
| s
| q
| ~ p )
& ( s
| ~ p
| q
| s
| ~ r
| ~ p )
& ( s
| ~ p
| q
| s
| q
| ~ p )
& ( ~ s
| ~ s
| ~ s )
& ( ~ s
| ~ s
| r )
& ( ~ s
| ~ s
| p )
& ( ~ s
| ~ q
| ~ s )
& ( ~ s
| ~ q
| r )
& ( ~ s
| ~ q
| p )
& ( ~ s
| p
| ~ s )
& ( ~ s
| p
| r )
& ( ~ s
| p
| p )
& ( r
| ~ q
| ~ s
| ~ s )
& ( r
| ~ q
| ~ s
| r )
& ( r
| ~ q
| ~ s
| p )
& ( r
| ~ q
| ~ q
| ~ s )
& ( r
| ~ q
| ~ q
| r )
& ( r
| ~ q
| ~ q
| p )
& ( r
| ~ q
| p
| ~ s )
& ( r
| ~ q
| p
| r )
& ( r
| ~ q
| p
| p )
& ( p
| ~ s
| ~ s )
& ( p
| ~ s
| r )
& ( p
| ~ s
| p )
& ( p
| ~ q
| ~ s )
& ( p
| ~ q
| r )
& ( p
| ~ q
| p )
& ( p
| p
| ~ s )
& ( p
| p
| r )
& ( p
| p
| p ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ p
| ~ p
| s
| q
| s
| q ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( p
| p
| p ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( ~ s
| ~ s
| ~ s ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( ~ q
| ~ q
| r
| r ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( ~ p
| s
| q ),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
p,
inference(cn,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
~ s,
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( ~ p
| ~ r
| ~ r
| ~ p
| s
| s ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( ~ q
| r ),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
q,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( ~ r
| ~ p
| s ),
inference(cn,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
r,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_9]),c_0_15])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN047+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 10:40:19 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % new_bool_1 with pid 3853867 completed with status 0
% 0.10/0.44 % Result found by new_bool_1
% 0.10/0.44 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.10/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 3853869 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.10/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Theorem
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 1
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 31
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 31
% 0.10/0.44 % Processed clauses : 28
% 0.10/0.44 % ...of these trivial : 20
% 0.10/0.44 % ...subsumed : 2
% 0.10/0.44 % ...remaining for further processing : 5
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 0
% 0.10/0.44 % Backward-rewritten : 1
% 0.10/0.44 % Generated clauses : 0
% 0.10/0.44 % ...of the previous two non-redundant : 1
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 0
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 30
% 0.10/0.44 % ...of those cached : 27
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 4
% 0.10/0.44 % Positive orientable unit clauses : 3
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 1
% 0.10/0.44 % Non-unit-clauses : 0
% 0.10/0.44 % Current number of unprocessed clauses: 4
% 0.10/0.44 % ...number of literals in the above : 16
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 1
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.44 % Non-unit clause-clause subsumptions : 0
% 0.10/0.44 % Unit Clause-clause subsumption calls : 0
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 1
% 0.10/0.44 % BW rewrite match successes : 1
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 945
% 0.10/0.44 % Search garbage collected termcells : 150
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.001 s
% 0.10/0.44 % System time : 0.002 s
% 0.10/0.44 % Total time : 0.004 s
% 0.10/0.44 % Maximum resident set size: 3624 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.004 s
% 0.10/0.44 % System time : 0.006 s
% 0.10/0.44 % Total time : 0.010 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------