%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO159^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:28 AM UTC 2026
% Result : Theorem 0.10s 0.27s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 0 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 95 ( 23 ~; 6 |; 9 &; 48 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 0 ^; 8 !; 9 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
cC: $i > $o ).
thf(decl_24,type,
cB: $i > $i > $o ).
thf(decl_25,type,
cA: $i > $o ).
thf(decl_26,type,
esk1_0: $i ).
thf(decl_27,type,
esk2_1: $i > $i ).
thf(cNNF_EXAMPLE,conjecture,
( ~ ! [X1: $i] :
( ( cA @ X1 )
=> ? [X2: $i] :
( ( cB @ X1 @ X2 )
& ( cC @ X2 ) ) )
=> ? [X3: $i] :
( ( cA @ X3 )
& ~ ? [X4: $i] :
~ ( ( cB @ X3 @ X4 )
=> ~ ( cC @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BYhN8V8u7d/E---3.1_2719893.p',cNNF_EXAMPLE) ).
thf(c_0_1,negated_conjecture,
~ ( ~ ! [X1: $i] :
( ( cA @ X1 )
=> ? [X2: $i] :
( ( cB @ X1 @ X2 )
& ( cC @ X2 ) ) )
=> ? [X3: $i] :
( ( cA @ X3 )
& ~ ? [X4: $i] :
~ ( ( cB @ X3 @ X4 )
=> ~ ( cC @ X4 ) ) ) ),
inference(assume_negation,[status(cth)],[cNNF_EXAMPLE]) ).
thf(c_0_2,negated_conjecture,
~ ( ~ ! [X1: $i] :
( ( cA @ X1 )
=> ? [X2: $i] :
( ( cB @ X1 @ X2 )
& ( cC @ X2 ) ) )
=> ? [X3: $i] :
( ( cA @ X3 )
& ~ ? [X4: $i] :
~ ( ( cB @ X3 @ X4 )
=> ~ ( cC @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X10: $i,X11: $i] :
( ( cA @ esk1_0 )
& ( ~ ( cB @ esk1_0 @ X10 )
| ~ ( cC @ X10 ) )
& ( ( cB @ X11 @ ( esk2_1 @ X11 ) )
| ~ ( cA @ X11 ) )
& ( ( cC @ ( esk2_1 @ X11 ) )
| ~ ( cA @ X11 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i] :
( ~ ( cB @ esk1_0 @ X1 )
| ~ ( cC @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i] :
( ( cB @ X1 @ ( esk2_1 @ X1 ) )
| ~ ( cA @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
cA @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
~ ( cC @ ( esk2_1 @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i] :
( ( cC @ ( esk2_1 @ X1 ) )
| ~ ( cA @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYO159^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n003.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 16:37:43 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 Running higher-order theorem proving
% 0.10/0.26 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.BYhN8V8u7d/E---3.1_2719893.p
% 0.10/0.27 % Version: 3.5.1-ho
% 0.10/0.27 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.10/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.27 % Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.27 % Starting sh4l with 300s (1) cores
% 0.10/0.27 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.10/0.27 % sh4l with pid 2719908 completed with status 0
% 0.10/0.27 % Result found by sh4l
% 0.10/0.27 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.10/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.27 % Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.27 % Starting sh4l with 300s (1) cores
% 0.10/0.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.27 % No SInE strategy applied
% 0.10/0.27 % Search class: HHHNF-FFSF11-SFFFFFNN
% 0.10/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.27 % SubtermCWHack with pid 2719910 completed with status 0
% 0.10/0.27 % Result found by SubtermCWHack
% 0.10/0.27 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.10/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.27 % Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.27 % Starting sh4l with 300s (1) cores
% 0.10/0.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.27 % No SInE strategy applied
% 0.10/0.27 % Search class: HHHNF-FFSF11-SFFFFFNN
% 0.10/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.27 % Preprocessing time : 0.001 s
% 0.10/0.27
% 0.10/0.27 % Proof found!
% 0.10/0.27 % SZS status Theorem
% 0.10/0.27 % SZS output start CNFRefutation
% See solution above
% 0.10/0.27 % Parsed axioms : 4
% 0.10/0.27 % Removed by relevancy pruning/SinE : 0
% 0.10/0.27 % Initial clauses : 7
% 0.10/0.27 % Removed in clause preprocessing : 3
% 0.10/0.27 % Initial clauses in saturation : 4
% 0.10/0.27 % Processed clauses : 5
% 0.10/0.27 % ...of these trivial : 0
% 0.10/0.27 % ...subsumed : 0
% 0.10/0.27 % ...remaining for further processing : 5
% 0.10/0.27 % Other redundant clauses eliminated : 0
% 0.10/0.27 % Clauses deleted for lack of memory : 0
% 0.10/0.27 % Backward-subsumed : 0
% 0.10/0.27 % Backward-rewritten : 0
% 0.10/0.27 % Generated clauses : 2
% 0.10/0.27 % ...of the previous two non-redundant : 1
% 0.10/0.27 % ...aggressively subsumed : 0
% 0.10/0.27 % Contextual simplify-reflections : 0
% 0.10/0.27 % Paramodulations : 2
% 0.10/0.27 % Factorizations : 0
% 0.10/0.27 % NegExts : 0
% 0.10/0.27 % Equation resolutions : 0
% 0.10/0.27 % Disequality decompositions : 0
% 0.10/0.27 % Total rewrite steps : 2
% 0.10/0.27 % ...of those cached : 1
% 0.10/0.27 % Propositional unsat checks : 0
% 0.10/0.27 % Propositional check models : 0
% 0.10/0.27 % Propositional check unsatisfiable : 0
% 0.10/0.27 % Propositional clauses : 0
% 0.10/0.27 % Propositional clauses after purity: 0
% 0.10/0.27 % Propositional unsat core size : 0
% 0.10/0.27 % Propositional preprocessing time : 0.000
% 0.10/0.27 % Propositional encoding time : 0.000
% 0.10/0.27 % Propositional solver time : 0.000
% 0.10/0.27 % Success case prop preproc time : 0.000
% 0.10/0.27 % Success case prop encoding time : 0.000
% 0.10/0.27 % Success case prop solver time : 0.000
% 0.10/0.27 % Current number of processed clauses : 5
% 0.10/0.27 % Positive orientable unit clauses : 1
% 0.10/0.27 % Positive unorientable unit clauses: 0
% 0.10/0.27 % Negative unit clauses : 1
% 0.10/0.27 % Non-unit-clauses : 3
% 0.10/0.27 % Current number of unprocessed clauses: 0
% 0.10/0.27 % ...number of literals in the above : 0
% 0.10/0.27 % Current number of archived formulas : 0
% 0.10/0.27 % Current number of archived clauses : 0
% 0.10/0.27 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.27 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.27 % Non-unit clause-clause subsumptions : 0
% 0.10/0.27 % Unit Clause-clause subsumption calls : 1
% 0.10/0.27 % Rewrite failures with RHS unbound : 0
% 0.10/0.27 % BW rewrite match attempts : 0
% 0.10/0.27 % BW rewrite match successes : 0
% 0.10/0.27 % Condensation attempts : 0
% 0.10/0.27 % Condensation successes : 0
% 0.10/0.27 % Termbank termtop insertions : 377
% 0.10/0.27 % Search garbage collected termcells : 120
% 0.10/0.27
% 0.10/0.27 % -------------------------------------------------
% 0.10/0.27 % User time : 0.002 s
% 0.10/0.27 % System time : 0.001 s
% 0.10/0.27 % Total time : 0.004 s
% 0.10/0.27 % Maximum resident set size: 3628 pages
% 0.10/0.27
% 0.10/0.27 % -------------------------------------------------
% 0.10/0.27 % User time : 0.004 s
% 0.10/0.27 % System time : 0.005 s
% 0.10/0.27 % Total time : 0.009 s
% 0.10/0.27 % Maximum resident set size: 4864 pages
% 0.10/0.27 % E exiting
%------------------------------------------------------------------------------