%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO090^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 : Wed Sep 30 08:42:21 AM UTC 2026
% Result : Theorem 0.09s 0.23s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 167 ( 0 equ; 0 cnn)
% Maximal formula atoms : 62 ( 12 avg)
% Number of connectives : 279 ( 125 ~; 96 |; 55 &; 0 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
t: $o ).
thf(decl_24,type,
s: $o ).
thf(decl_25,type,
q: $o ).
thf(decl_26,type,
p: $o ).
thf(cDMG8,conjecture,
( ( ~ ( ~ ( ( ~ ( ( ~ ( p
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
| ~ q
| ~ s
| ~ t )
=> ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6ZhYXQfIb4/E---3.1_2710635.p',cDMG8) ).
thf(c_0_1,negated_conjecture,
~ ( ( ~ ( ~ ( ( ~ ( ( ~ ( p
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
| ~ q
| ~ s
| ~ t )
=> ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) ) ),
inference(assume_negation,[status(cth)],[cDMG8]) ).
thf(c_0_2,negated_conjecture,
~ ( ( ~ ( ~ ( ( ~ ( ( ~ ( p
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
| ~ q
| ~ s
| ~ t )
=> ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
( ( p
| ~ q
| ~ s
| ~ t
| ~ q
| ~ s
| ~ t )
& ( q
| ~ q
| ~ s
| ~ t
| ~ q
| ~ s
| ~ t )
& ( s
| ~ q
| ~ s
| ~ t
| ~ q
| ~ s
| ~ t )
& ( t
| ~ q
| ~ s
| ~ t
| ~ q
| ~ s
| ~ t )
& ( q
| ~ q
| ~ s
| ~ t )
& ( s
| ~ q
| ~ s
| ~ t )
& ( t
| ~ q
| ~ s
| ~ t )
& ( ~ p
| ~ q
| ~ s
| ~ t
| ~ q
| ~ s
| ~ t )
& ( q
| ~ q
| ~ s
| ~ t )
& ( s
| ~ q
| ~ s
| ~ t )
& ( t
| ~ q
| ~ s
| ~ t )
& q
& s
& t ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
thf(c_0_4,negated_conjecture,
( p
| ~ q
| ~ s
| ~ t
| ~ q
| ~ s
| ~ t ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ~ p
| ~ q
| ~ s
| ~ t
| ~ q
| ~ s
| ~ t ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( p
| ~ t
| ~ s
| ~ q ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
t,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
s,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
q,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
( ~ t
| ~ s
| ~ q
| ~ p ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_11,negated_conjecture,
p,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7]),c_0_8]),c_0_9]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO090^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.15 % Computer : n003.cluster.edu
% 0.09/0.15 % Model : x86_64 x86_64
% 0.09/0.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.15 % Memory : 8046.5625MB
% 0.09/0.15 % OS : Linux 6.8.0-71-generic
% 0.09/0.15 % CPULimit : 300
% 0.09/0.15 % WCLimit : 300
% 0.09/0.15 % DateTime : Tue Sep 29 16:34:58 UTC 2026
% 0.09/0.16 % CPUTime :
% 0.09/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 Running higher-order theorem proving
% 0.09/0.21 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.6ZhYXQfIb4/E---3.1_2710635.p
% 0.09/0.23 % Version: 3.5.1-ho
% 0.09/0.23 % Preprocessing class: HSMSSLSSSSSNFFN.
% 0.09/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.23 % Starting sh5l with 300s (1) cores
% 0.09/0.23 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.23 % Starting new_bool_2 with 300s (1) cores
% 0.09/0.23 % sh5l with pid 2710649 completed with status 0
% 0.09/0.23 % Result found by sh5l
% 0.09/0.23 % Preprocessing class: HSMSSLSSSSSNFFN.
% 0.09/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.23 % Starting sh5l with 300s (1) cores
% 0.09/0.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.23 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.23 % Search class: HHHNF-FFSS00-SFFFFFNN
% 0.09/0.23 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.23 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.23 % SubtermCWHack with pid 2710655 completed with status 0
% 0.09/0.23 % Result found by SubtermCWHack
% 0.09/0.23 % Preprocessing class: HSMSSLSSSSSNFFN.
% 0.09/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.23 % Starting sh5l with 300s (1) cores
% 0.09/0.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.23 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.23 % Search class: HHHNF-FFSS00-SFFFFFNN
% 0.09/0.23 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.23 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.23 % Preprocessing time : 0.001 s
% 0.09/0.23
% 0.09/0.23 % Proof found!
% 0.09/0.23 % SZS status Theorem
% 0.09/0.23 % SZS output start CNFRefutation
% See solution above
% 0.09/0.23 % Parsed axioms : 5
% 0.09/0.23 % Removed by relevancy pruning/SinE : 4
% 0.09/0.23 % Initial clauses : 14
% 0.09/0.23 % Removed in clause preprocessing : 9
% 0.09/0.23 % Initial clauses in saturation : 5
% 0.09/0.23 % Processed clauses : 5
% 0.09/0.23 % ...of these trivial : 0
% 0.09/0.23 % ...subsumed : 0
% 0.09/0.23 % ...remaining for further processing : 4
% 0.09/0.23 % Other redundant clauses eliminated : 0
% 0.09/0.23 % Clauses deleted for lack of memory : 0
% 0.09/0.23 % Backward-subsumed : 0
% 0.09/0.23 % Backward-rewritten : 0
% 0.09/0.23 % Generated clauses : 0
% 0.09/0.23 % ...of the previous two non-redundant : 0
% 0.09/0.23 % ...aggressively subsumed : 0
% 0.09/0.23 % Contextual simplify-reflections : 0
% 0.09/0.23 % Paramodulations : 0
% 0.09/0.23 % Factorizations : 0
% 0.09/0.23 % NegExts : 0
% 0.09/0.23 % Equation resolutions : 0
% 0.09/0.23 % Disequality decompositions : 0
% 0.09/0.23 % Total rewrite steps : 7
% 0.09/0.23 % ...of those cached : 3
% 0.09/0.23 % Propositional unsat checks : 0
% 0.09/0.23 % Propositional check models : 0
% 0.09/0.23 % Propositional check unsatisfiable : 0
% 0.09/0.23 % Propositional clauses : 0
% 0.09/0.23 % Propositional clauses after purity: 0
% 0.09/0.23 % Propositional unsat core size : 0
% 0.09/0.23 % Propositional preprocessing time : 0.000
% 0.09/0.23 % Propositional encoding time : 0.000
% 0.09/0.23 % Propositional solver time : 0.000
% 0.09/0.23 % Success case prop preproc time : 0.000
% 0.09/0.23 % Success case prop encoding time : 0.000
% 0.09/0.23 % Success case prop solver time : 0.000
% 0.09/0.23 % Current number of processed clauses : 4
% 0.09/0.23 % Positive orientable unit clauses : 4
% 0.09/0.23 % Positive unorientable unit clauses: 0
% 0.09/0.23 % Negative unit clauses : 0
% 0.09/0.23 % Non-unit-clauses : 0
% 0.09/0.23 % Current number of unprocessed clauses: 0
% 0.09/0.23 % ...number of literals in the above : 0
% 0.09/0.23 % Current number of archived formulas : 0
% 0.09/0.23 % Current number of archived clauses : 0
% 0.09/0.23 % Clause-clause subsumption calls (NU) : 0
% 0.09/0.23 % Rec. Clause-clause subsumption calls : 0
% 0.09/0.23 % Non-unit clause-clause subsumptions : 0
% 0.09/0.23 % Unit Clause-clause subsumption calls : 0
% 0.09/0.23 % Rewrite failures with RHS unbound : 0
% 0.09/0.23 % BW rewrite match attempts : 0
% 0.09/0.23 % BW rewrite match successes : 0
% 0.09/0.23 % Condensation attempts : 0
% 0.09/0.23 % Condensation successes : 0
% 0.09/0.23 % Termbank termtop insertions : 1054
% 0.09/0.23 % Search garbage collected termcells : 154
% 0.09/0.23
% 0.09/0.23 % -------------------------------------------------
% 0.09/0.23 % User time : 0.003 s
% 0.09/0.23 % System time : 0.001 s
% 0.09/0.23 % Total time : 0.004 s
% 0.09/0.23 % Maximum resident set size: 3624 pages
% 0.09/0.23
% 0.09/0.23 % -------------------------------------------------
% 0.09/0.23 % User time : 0.004 s
% 0.09/0.23 % System time : 0.006 s
% 0.09/0.23 % Total time : 0.010 s
% 0.09/0.23 % Maximum resident set size: 4864 pages
% 0.09/0.23 % E exiting
%------------------------------------------------------------------------------